./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety-ext2/length_test03-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety-ext2/length_test03-2.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 8d477dcc38abb71f88978d460e8393ef9ba09f24c134f3de362c4df2a3599c9a --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-17 00:30:20,504 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-17 00:30:20,562 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-17 00:30:20,566 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-17 00:30:20,567 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-17 00:30:20,591 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-17 00:30:20,592 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-17 00:30:20,592 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-17 00:30:20,593 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-17 00:30:20,594 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-17 00:30:20,594 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-17 00:30:20,595 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-17 00:30:20,595 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-17 00:30:20,597 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-17 00:30:20,597 INFO L153 SettingsManager]: * Use SBE=true [2024-11-17 00:30:20,597 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-17 00:30:20,597 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-17 00:30:20,598 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-17 00:30:20,598 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-17 00:30:20,598 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-17 00:30:20,598 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-17 00:30:20,600 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-17 00:30:20,601 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-17 00:30:20,601 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-17 00:30:20,601 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-17 00:30:20,601 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-17 00:30:20,602 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-17 00:30:20,602 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-17 00:30:20,602 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-17 00:30:20,602 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-17 00:30:20,602 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-17 00:30:20,603 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-17 00:30:20,603 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-17 00:30:20,603 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 00:30:20,604 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-17 00:30:20,604 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-17 00:30:20,604 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-17 00:30:20,604 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-17 00:30:20,605 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-17 00:30:20,605 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-17 00:30:20,605 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-17 00:30:20,606 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-17 00:30:20,606 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 -> 8d477dcc38abb71f88978d460e8393ef9ba09f24c134f3de362c4df2a3599c9a [2024-11-17 00:30:20,795 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-17 00:30:20,814 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-17 00:30:20,817 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-17 00:30:20,818 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-17 00:30:20,818 INFO L274 PluginConnector]: CDTParser initialized [2024-11-17 00:30:20,819 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-ext2/length_test03-2.i [2024-11-17 00:30:22,034 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-17 00:30:22,218 INFO L384 CDTParser]: Found 1 translation units. [2024-11-17 00:30:22,219 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext2/length_test03-2.i [2024-11-17 00:30:22,228 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/61081b4b7/587f2019eddb485ca9d2c6fa37e1d62e/FLAG8af1370e4 [2024-11-17 00:30:22,237 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/61081b4b7/587f2019eddb485ca9d2c6fa37e1d62e [2024-11-17 00:30:22,239 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-17 00:30:22,240 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-17 00:30:22,242 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-17 00:30:22,242 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-17 00:30:22,246 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-17 00:30:22,247 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 12:30:22" (1/1) ... [2024-11-17 00:30:22,247 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1818fcf9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:30:22, skipping insertion in model container [2024-11-17 00:30:22,247 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 12:30:22" (1/1) ... [2024-11-17 00:30:22,281 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-17 00:30:22,582 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 00:30:22,591 INFO L200 MainTranslator]: Completed pre-run [2024-11-17 00:30:22,635 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 00:30:22,659 INFO L204 MainTranslator]: Completed translation [2024-11-17 00:30:22,660 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:30:22 WrapperNode [2024-11-17 00:30:22,660 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-17 00:30:22,661 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-17 00:30:22,661 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-17 00:30:22,661 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-17 00:30:22,667 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:30:22" (1/1) ... [2024-11-17 00:30:22,681 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:30:22" (1/1) ... [2024-11-17 00:30:22,700 INFO L138 Inliner]: procedures = 123, calls = 38, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 97 [2024-11-17 00:30:22,700 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-17 00:30:22,701 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-17 00:30:22,701 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-17 00:30:22,701 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-17 00:30:22,709 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:30:22" (1/1) ... [2024-11-17 00:30:22,709 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:30:22" (1/1) ... [2024-11-17 00:30:22,717 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:30:22" (1/1) ... [2024-11-17 00:30:22,734 INFO L175 MemorySlicer]: Split 25 memory accesses to 3 slices as follows [2, 10, 13]. 52 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 13 writes are split as follows [0, 6, 7]. [2024-11-17 00:30:22,735 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:30:22" (1/1) ... [2024-11-17 00:30:22,735 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:30:22" (1/1) ... [2024-11-17 00:30:22,741 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:30:22" (1/1) ... [2024-11-17 00:30:22,741 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:30:22" (1/1) ... [2024-11-17 00:30:22,743 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:30:22" (1/1) ... [2024-11-17 00:30:22,745 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:30:22" (1/1) ... [2024-11-17 00:30:22,750 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-17 00:30:22,751 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-17 00:30:22,751 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-17 00:30:22,751 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-17 00:30:22,751 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:30:22" (1/1) ... [2024-11-17 00:30:22,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 00:30:22,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:30:22,784 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-17 00:30:22,786 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-17 00:30:22,820 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-17 00:30:22,820 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-17 00:30:22,820 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-17 00:30:22,821 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-17 00:30:22,821 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-17 00:30:22,821 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-17 00:30:22,821 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-17 00:30:22,821 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-17 00:30:22,821 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-17 00:30:22,821 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-17 00:30:22,822 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-17 00:30:22,822 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-17 00:30:22,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-17 00:30:22,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-17 00:30:22,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-17 00:30:22,822 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-17 00:30:22,822 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-17 00:30:22,823 INFO L130 BoogieDeclarations]: Found specification of procedure append [2024-11-17 00:30:22,823 INFO L138 BoogieDeclarations]: Found implementation of procedure append [2024-11-17 00:30:22,908 INFO L256 CfgBuilder]: Building ICFG [2024-11-17 00:30:22,910 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-17 00:30:23,255 INFO L? ?]: Removed 127 outVars from TransFormulas that were not future-live. [2024-11-17 00:30:23,255 INFO L307 CfgBuilder]: Performing block encoding [2024-11-17 00:30:23,268 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-17 00:30:23,268 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-17 00:30:23,268 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 12:30:23 BoogieIcfgContainer [2024-11-17 00:30:23,269 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-17 00:30:23,270 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-17 00:30:23,270 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-17 00:30:23,273 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-17 00:30:23,273 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 12:30:22" (1/3) ... [2024-11-17 00:30:23,273 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65fb51fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 12:30:23, skipping insertion in model container [2024-11-17 00:30:23,273 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:30:22" (2/3) ... [2024-11-17 00:30:23,274 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65fb51fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 12:30:23, skipping insertion in model container [2024-11-17 00:30:23,274 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 12:30:23" (3/3) ... [2024-11-17 00:30:23,274 INFO L112 eAbstractionObserver]: Analyzing ICFG length_test03-2.i [2024-11-17 00:30:23,286 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-17 00:30:23,286 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 59 error locations. [2024-11-17 00:30:23,317 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-17 00:30:23,322 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;@62b7b09e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-17 00:30:23,323 INFO L334 AbstractCegarLoop]: Starting to check reachability of 59 error locations. [2024-11-17 00:30:23,326 INFO L276 IsEmpty]: Start isEmpty. Operand has 136 states, 73 states have (on average 1.9452054794520548) internal successors, (142), 132 states have internal predecessors, (142), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 00:30:23,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-17 00:30:23,331 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:30:23,332 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-17 00:30:23,333 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 56 more)] === [2024-11-17 00:30:23,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:30:23,341 INFO L85 PathProgramCache]: Analyzing trace with hash 125085, now seen corresponding path program 1 times [2024-11-17 00:30:23,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:30:23,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600894454] [2024-11-17 00:30:23,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:30:23,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:30:23,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:30:23,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:30:23,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:30:23,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600894454] [2024-11-17 00:30:23,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600894454] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:30:23,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:30:23,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 00:30:23,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586755984] [2024-11-17 00:30:23,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:30:23,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:30:23,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:30:23,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:30:23,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:30:23,554 INFO L87 Difference]: Start difference. First operand has 136 states, 73 states have (on average 1.9452054794520548) internal successors, (142), 132 states have internal predecessors, (142), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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-11-17 00:30:23,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:30:23,725 INFO L93 Difference]: Finished difference Result 178 states and 187 transitions. [2024-11-17 00:30:23,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:30:23,730 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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 3 [2024-11-17 00:30:23,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:30:23,736 INFO L225 Difference]: With dead ends: 178 [2024-11-17 00:30:23,736 INFO L226 Difference]: Without dead ends: 175 [2024-11-17 00:30:23,738 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:30:23,740 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 56 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:30:23,741 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 176 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:30:23,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2024-11-17 00:30:23,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 131. [2024-11-17 00:30:23,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 71 states have (on average 1.8732394366197183) internal successors, (133), 127 states have internal predecessors, (133), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 00:30:23,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 137 transitions. [2024-11-17 00:30:23,771 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 137 transitions. Word has length 3 [2024-11-17 00:30:23,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:30:23,772 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 137 transitions. [2024-11-17 00:30:23,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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-11-17 00:30:23,772 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 137 transitions. [2024-11-17 00:30:23,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-17 00:30:23,772 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:30:23,772 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-17 00:30:23,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-17 00:30:23,773 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 56 more)] === [2024-11-17 00:30:23,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:30:23,773 INFO L85 PathProgramCache]: Analyzing trace with hash 125086, now seen corresponding path program 1 times [2024-11-17 00:30:23,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:30:23,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424534800] [2024-11-17 00:30:23,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:30:23,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:30:23,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:30:23,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:30:23,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:30:23,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424534800] [2024-11-17 00:30:23,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424534800] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:30:23,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:30:23,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 00:30:23,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547048072] [2024-11-17 00:30:23,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:30:23,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:30:23,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:30:23,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:30:23,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:30:23,832 INFO L87 Difference]: Start difference. First operand 131 states and 137 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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-11-17 00:30:23,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:30:23,926 INFO L93 Difference]: Finished difference Result 131 states and 138 transitions. [2024-11-17 00:30:23,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:30:23,926 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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 3 [2024-11-17 00:30:23,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:30:23,927 INFO L225 Difference]: With dead ends: 131 [2024-11-17 00:30:23,927 INFO L226 Difference]: Without dead ends: 131 [2024-11-17 00:30:23,927 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:30:23,928 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 10 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:30:23,928 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 202 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:30:23,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-11-17 00:30:23,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 129. [2024-11-17 00:30:23,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 71 states have (on average 1.8450704225352113) internal successors, (131), 125 states have internal predecessors, (131), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 00:30:23,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 135 transitions. [2024-11-17 00:30:23,940 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 135 transitions. Word has length 3 [2024-11-17 00:30:23,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:30:23,940 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 135 transitions. [2024-11-17 00:30:23,940 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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-11-17 00:30:23,940 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 135 transitions. [2024-11-17 00:30:23,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-17 00:30:23,941 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:30:23,941 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-17 00:30:23,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-17 00:30:23,941 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 56 more)] === [2024-11-17 00:30:23,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:30:23,941 INFO L85 PathProgramCache]: Analyzing trace with hash -568501509, now seen corresponding path program 1 times [2024-11-17 00:30:23,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:30:23,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718803647] [2024-11-17 00:30:23,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:30:23,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:30:23,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:30:23,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:30:23,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:30:23,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718803647] [2024-11-17 00:30:23,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718803647] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:30:23,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:30:23,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 00:30:23,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850183087] [2024-11-17 00:30:23,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:30:23,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:30:23,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:30:23,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:30:23,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:30:23,997 INFO L87 Difference]: Start difference. First operand 129 states and 135 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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-11-17 00:30:24,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:30:24,083 INFO L93 Difference]: Finished difference Result 148 states and 157 transitions. [2024-11-17 00:30:24,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:30:24,083 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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 6 [2024-11-17 00:30:24,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:30:24,084 INFO L225 Difference]: With dead ends: 148 [2024-11-17 00:30:24,084 INFO L226 Difference]: Without dead ends: 148 [2024-11-17 00:30:24,084 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:30:24,085 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 27 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:30:24,085 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 181 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:30:24,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2024-11-17 00:30:24,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 133. [2024-11-17 00:30:24,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 77 states have (on average 1.7922077922077921) internal successors, (138), 129 states have internal predecessors, (138), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 00:30:24,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 142 transitions. [2024-11-17 00:30:24,099 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 142 transitions. Word has length 6 [2024-11-17 00:30:24,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:30:24,099 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 142 transitions. [2024-11-17 00:30:24,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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-11-17 00:30:24,100 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 142 transitions. [2024-11-17 00:30:24,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-17 00:30:24,100 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:30:24,100 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-17 00:30:24,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-17 00:30:24,100 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 56 more)] === [2024-11-17 00:30:24,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:30:24,101 INFO L85 PathProgramCache]: Analyzing trace with hash -568501508, now seen corresponding path program 1 times [2024-11-17 00:30:24,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:30:24,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484212885] [2024-11-17 00:30:24,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:30:24,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:30:24,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:30:24,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:30:24,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:30:24,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484212885] [2024-11-17 00:30:24,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484212885] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:30:24,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:30:24,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 00:30:24,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786189785] [2024-11-17 00:30:24,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:30:24,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:30:24,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:30:24,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:30:24,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:30:24,200 INFO L87 Difference]: Start difference. First operand 133 states and 142 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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-11-17 00:30:24,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:30:24,264 INFO L93 Difference]: Finished difference Result 133 states and 143 transitions. [2024-11-17 00:30:24,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:30:24,265 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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 6 [2024-11-17 00:30:24,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:30:24,266 INFO L225 Difference]: With dead ends: 133 [2024-11-17 00:30:24,266 INFO L226 Difference]: Without dead ends: 133 [2024-11-17 00:30:24,266 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:30:24,267 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 4 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:30:24,268 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 203 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:30:24,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2024-11-17 00:30:24,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 131. [2024-11-17 00:30:24,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 77 states have (on average 1.7662337662337662) internal successors, (136), 127 states have internal predecessors, (136), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 00:30:24,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 140 transitions. [2024-11-17 00:30:24,278 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 140 transitions. Word has length 6 [2024-11-17 00:30:24,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:30:24,278 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 140 transitions. [2024-11-17 00:30:24,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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-11-17 00:30:24,279 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 140 transitions. [2024-11-17 00:30:24,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-17 00:30:24,279 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:30:24,279 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:30:24,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-17 00:30:24,279 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting appendErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 56 more)] === [2024-11-17 00:30:24,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:30:24,280 INFO L85 PathProgramCache]: Analyzing trace with hash 1049670910, now seen corresponding path program 1 times [2024-11-17 00:30:24,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:30:24,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995753326] [2024-11-17 00:30:24,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:30:24,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:30:24,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:30:24,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:30:24,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:30:24,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995753326] [2024-11-17 00:30:24,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995753326] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:30:24,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:30:24,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 00:30:24,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424326578] [2024-11-17 00:30:24,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:30:24,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:30:24,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:30:24,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:30:24,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:30:24,412 INFO L87 Difference]: Start difference. First operand 131 states and 140 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:30:24,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:30:24,464 INFO L93 Difference]: Finished difference Result 126 states and 135 transitions. [2024-11-17 00:30:24,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:30:24,464 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 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 12 [2024-11-17 00:30:24,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:30:24,465 INFO L225 Difference]: With dead ends: 126 [2024-11-17 00:30:24,465 INFO L226 Difference]: Without dead ends: 126 [2024-11-17 00:30:24,465 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:30:24,466 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 35 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:30:24,469 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 164 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:30:24,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2024-11-17 00:30:24,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2024-11-17 00:30:24,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 77 states have (on average 1.7012987012987013) internal successors, (131), 122 states have internal predecessors, (131), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 00:30:24,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 135 transitions. [2024-11-17 00:30:24,474 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 135 transitions. Word has length 12 [2024-11-17 00:30:24,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:30:24,474 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 135 transitions. [2024-11-17 00:30:24,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:30:24,474 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 135 transitions. [2024-11-17 00:30:24,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-17 00:30:24,475 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:30:24,475 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:30:24,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-17 00:30:24,475 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting appendErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 56 more)] === [2024-11-17 00:30:24,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:30:24,476 INFO L85 PathProgramCache]: Analyzing trace with hash 1049670909, now seen corresponding path program 1 times [2024-11-17 00:30:24,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:30:24,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327538382] [2024-11-17 00:30:24,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:30:24,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:30:24,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:30:24,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:30:24,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:30:24,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327538382] [2024-11-17 00:30:24,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327538382] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:30:24,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:30:24,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 00:30:24,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409494111] [2024-11-17 00:30:24,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:30:24,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:30:24,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:30:24,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:30:24,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:30:24,541 INFO L87 Difference]: Start difference. First operand 126 states and 135 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:30:24,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:30:24,600 INFO L93 Difference]: Finished difference Result 121 states and 130 transitions. [2024-11-17 00:30:24,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:30:24,600 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 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 12 [2024-11-17 00:30:24,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:30:24,601 INFO L225 Difference]: With dead ends: 121 [2024-11-17 00:30:24,601 INFO L226 Difference]: Without dead ends: 121 [2024-11-17 00:30:24,601 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:30:24,602 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 35 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:30:24,602 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 151 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:30:24,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-11-17 00:30:24,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2024-11-17 00:30:24,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 77 states have (on average 1.6363636363636365) internal successors, (126), 117 states have internal predecessors, (126), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 00:30:24,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 130 transitions. [2024-11-17 00:30:24,606 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 130 transitions. Word has length 12 [2024-11-17 00:30:24,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:30:24,606 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 130 transitions. [2024-11-17 00:30:24,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:30:24,607 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 130 transitions. [2024-11-17 00:30:24,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-17 00:30:24,607 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:30:24,607 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:30:24,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-17 00:30:24,607 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting appendErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 56 more)] === [2024-11-17 00:30:24,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:30:24,608 INFO L85 PathProgramCache]: Analyzing trace with hash -1819940080, now seen corresponding path program 1 times [2024-11-17 00:30:24,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:30:24,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772535091] [2024-11-17 00:30:24,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:30:24,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:30:24,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:30:24,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:30:24,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:30:24,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772535091] [2024-11-17 00:30:24,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772535091] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:30:24,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:30:24,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-17 00:30:24,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709160838] [2024-11-17 00:30:24,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:30:24,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-17 00:30:24,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:30:24,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-17 00:30:24,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-17 00:30:24,752 INFO L87 Difference]: Start difference. First operand 121 states and 130 transitions. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:30:24,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:30:24,951 INFO L93 Difference]: Finished difference Result 239 states and 260 transitions. [2024-11-17 00:30:24,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-17 00:30:24,952 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 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 13 [2024-11-17 00:30:24,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:30:24,953 INFO L225 Difference]: With dead ends: 239 [2024-11-17 00:30:24,953 INFO L226 Difference]: Without dead ends: 239 [2024-11-17 00:30:24,953 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-17 00:30:24,953 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 221 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 305 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-17 00:30:24,954 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 269 Invalid, 327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 305 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-17 00:30:24,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2024-11-17 00:30:24,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 159. [2024-11-17 00:30:24,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 120 states have (on average 1.5666666666666667) internal successors, (188), 154 states have internal predecessors, (188), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 00:30:24,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 192 transitions. [2024-11-17 00:30:24,965 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 192 transitions. Word has length 13 [2024-11-17 00:30:24,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:30:24,965 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 192 transitions. [2024-11-17 00:30:24,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:30:24,966 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 192 transitions. [2024-11-17 00:30:24,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-17 00:30:24,967 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:30:24,967 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:30:24,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-17 00:30:24,967 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting appendErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 56 more)] === [2024-11-17 00:30:24,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:30:24,968 INFO L85 PathProgramCache]: Analyzing trace with hash -1819940079, now seen corresponding path program 1 times [2024-11-17 00:30:24,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:30:24,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992926702] [2024-11-17 00:30:24,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:30:24,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:30:24,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:30:25,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:30:25,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:30:25,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992926702] [2024-11-17 00:30:25,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992926702] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:30:25,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:30:25,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-17 00:30:25,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134029857] [2024-11-17 00:30:25,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:30:25,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-17 00:30:25,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:30:25,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-17 00:30:25,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-17 00:30:25,176 INFO L87 Difference]: Start difference. First operand 159 states and 192 transitions. Second operand has 9 states, 8 states have (on average 1.5) internal successors, (12), 8 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:30:25,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:30:25,417 INFO L93 Difference]: Finished difference Result 283 states and 306 transitions. [2024-11-17 00:30:25,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-17 00:30:25,417 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.5) internal successors, (12), 8 states have internal predecessors, (12), 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 13 [2024-11-17 00:30:25,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:30:25,419 INFO L225 Difference]: With dead ends: 283 [2024-11-17 00:30:25,419 INFO L226 Difference]: Without dead ends: 283 [2024-11-17 00:30:25,419 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-17 00:30:25,420 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 388 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 357 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 389 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-17 00:30:25,421 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [389 Valid, 349 Invalid, 378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 357 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-17 00:30:25,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2024-11-17 00:30:25,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 158. [2024-11-17 00:30:25,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 120 states have (on average 1.4833333333333334) internal successors, (178), 153 states have internal predecessors, (178), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 00:30:25,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 182 transitions. [2024-11-17 00:30:25,432 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 182 transitions. Word has length 13 [2024-11-17 00:30:25,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:30:25,432 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 182 transitions. [2024-11-17 00:30:25,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.5) internal successors, (12), 8 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:30:25,432 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 182 transitions. [2024-11-17 00:30:25,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-17 00:30:25,432 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:30:25,433 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:30:25,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-17 00:30:25,433 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 56 more)] === [2024-11-17 00:30:25,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:30:25,433 INFO L85 PathProgramCache]: Analyzing trace with hash -1374621299, now seen corresponding path program 1 times [2024-11-17 00:30:25,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:30:25,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126659159] [2024-11-17 00:30:25,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:30:25,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:30:25,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:30:25,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:30:25,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:30:25,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126659159] [2024-11-17 00:30:25,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126659159] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:30:25,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:30:25,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-17 00:30:25,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097910387] [2024-11-17 00:30:25,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:30:25,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-17 00:30:25,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:30:25,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-17 00:30:25,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-17 00:30:25,812 INFO L87 Difference]: Start difference. First operand 158 states and 182 transitions. Second operand has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:30:25,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:30:25,931 INFO L93 Difference]: Finished difference Result 179 states and 205 transitions. [2024-11-17 00:30:25,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-17 00:30:25,931 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 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 22 [2024-11-17 00:30:25,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:30:25,932 INFO L225 Difference]: With dead ends: 179 [2024-11-17 00:30:25,932 INFO L226 Difference]: Without dead ends: 179 [2024-11-17 00:30:25,932 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2024-11-17 00:30:25,933 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 38 mSDsluCounter, 468 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 569 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:30:25,934 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 569 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:30:25,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2024-11-17 00:30:25,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 165. [2024-11-17 00:30:25,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 126 states have (on average 1.4603174603174602) internal successors, (184), 159 states have internal predecessors, (184), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-17 00:30:25,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 190 transitions. [2024-11-17 00:30:25,939 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 190 transitions. Word has length 22 [2024-11-17 00:30:25,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:30:25,940 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 190 transitions. [2024-11-17 00:30:25,940 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:30:25,941 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 190 transitions. [2024-11-17 00:30:25,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-17 00:30:25,941 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:30:25,941 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:30:25,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-17 00:30:25,941 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 56 more)] === [2024-11-17 00:30:25,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:30:25,942 INFO L85 PathProgramCache]: Analyzing trace with hash 2079533679, now seen corresponding path program 1 times [2024-11-17 00:30:25,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:30:25,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763368102] [2024-11-17 00:30:25,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:30:25,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:30:25,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:30:26,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:30:26,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:30:26,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763368102] [2024-11-17 00:30:26,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763368102] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:30:26,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:30:26,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-17 00:30:26,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027776502] [2024-11-17 00:30:26,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:30:26,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-17 00:30:26,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:30:26,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-17 00:30:26,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-11-17 00:30:26,296 INFO L87 Difference]: Start difference. First operand 165 states and 190 transitions. Second operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 10 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:30:26,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:30:26,562 INFO L93 Difference]: Finished difference Result 211 states and 238 transitions. [2024-11-17 00:30:26,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-17 00:30:26,563 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 10 states have internal predecessors, (23), 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 24 [2024-11-17 00:30:26,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:30:26,564 INFO L225 Difference]: With dead ends: 211 [2024-11-17 00:30:26,564 INFO L226 Difference]: Without dead ends: 211 [2024-11-17 00:30:26,564 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2024-11-17 00:30:26,564 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 163 mSDsluCounter, 517 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 598 SdHoareTripleChecker+Invalid, 365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-17 00:30:26,564 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 598 Invalid, 365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-17 00:30:26,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2024-11-17 00:30:26,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 168. [2024-11-17 00:30:26,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 129 states have (on average 1.449612403100775) internal successors, (187), 162 states have internal predecessors, (187), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-17 00:30:26,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 193 transitions. [2024-11-17 00:30:26,569 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 193 transitions. Word has length 24 [2024-11-17 00:30:26,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:30:26,569 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 193 transitions. [2024-11-17 00:30:26,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 10 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:30:26,569 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 193 transitions. [2024-11-17 00:30:26,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-17 00:30:26,570 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:30:26,570 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:30:26,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-17 00:30:26,571 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 56 more)] === [2024-11-17 00:30:26,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:30:26,571 INFO L85 PathProgramCache]: Analyzing trace with hash 2118253128, now seen corresponding path program 1 times [2024-11-17 00:30:26,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:30:26,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347231742] [2024-11-17 00:30:26,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:30:26,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:30:26,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:30:26,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-17 00:30:26,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:30:26,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:30:26,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:30:26,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347231742] [2024-11-17 00:30:26,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347231742] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:30:26,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:30:26,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 00:30:26,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186132933] [2024-11-17 00:30:26,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:30:26,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 00:30:26,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:30:26,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 00:30:26,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 00:30:26,655 INFO L87 Difference]: Start difference. First operand 168 states and 193 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 00:30:26,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:30:26,736 INFO L93 Difference]: Finished difference Result 157 states and 168 transitions. [2024-11-17 00:30:26,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 00:30:26,736 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2024-11-17 00:30:26,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:30:26,737 INFO L225 Difference]: With dead ends: 157 [2024-11-17 00:30:26,737 INFO L226 Difference]: Without dead ends: 157 [2024-11-17 00:30:26,738 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 00:30:26,738 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 13 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:30:26,738 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 260 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:30:26,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2024-11-17 00:30:26,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 144. [2024-11-17 00:30:26,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 105 states have (on average 1.4095238095238096) internal successors, (148), 138 states have internal predecessors, (148), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-17 00:30:26,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 154 transitions. [2024-11-17 00:30:26,741 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 154 transitions. Word has length 32 [2024-11-17 00:30:26,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:30:26,742 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 154 transitions. [2024-11-17 00:30:26,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 00:30:26,742 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 154 transitions. [2024-11-17 00:30:26,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-17 00:30:26,742 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:30:26,742 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:30:26,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-17 00:30:26,743 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting appendErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 56 more)] === [2024-11-17 00:30:26,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:30:26,743 INFO L85 PathProgramCache]: Analyzing trace with hash 1245769459, now seen corresponding path program 1 times [2024-11-17 00:30:26,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:30:26,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239477113] [2024-11-17 00:30:26,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:30:26,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:30:26,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:30:26,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-17 00:30:26,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:30:26,963 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:30:26,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:30:26,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239477113] [2024-11-17 00:30:26,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239477113] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:30:26,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1934201626] [2024-11-17 00:30:26,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:30:26,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:30:26,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:30:26,966 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 00:30:26,968 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-17 00:30:27,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:30:27,075 INFO L255 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-17 00:30:27,080 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:30:27,111 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-17 00:30:27,160 WARN L873 $PredicateComparison]: unable to prove that (exists ((append_~node~0.base Int)) (and (= (select |c_old(#valid)| append_~node~0.base) 0) (= |c_#valid| (store |c_old(#valid)| append_~node~0.base (select |c_#valid| append_~node~0.base))))) is different from true [2024-11-17 00:30:27,264 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-17 00:30:27,265 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-11-17 00:30:27,294 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-17 00:30:27,294 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2024-11-17 00:30:27,307 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-11-17 00:30:27,308 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:30:27,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1934201626] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:30:27,385 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 00:30:27,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 10 [2024-11-17 00:30:27,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90514738] [2024-11-17 00:30:27,385 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 00:30:27,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-17 00:30:27,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:30:27,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-17 00:30:27,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=86, Unknown=1, NotChecked=18, Total=132 [2024-11-17 00:30:27,387 INFO L87 Difference]: Start difference. First operand 144 states and 154 transitions. Second operand has 11 states, 10 states have (on average 4.7) internal successors, (47), 8 states have internal predecessors, (47), 1 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-17 00:30:27,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:30:27,746 INFO L93 Difference]: Finished difference Result 180 states and 194 transitions. [2024-11-17 00:30:27,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-17 00:30:27,746 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.7) internal successors, (47), 8 states have internal predecessors, (47), 1 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 33 [2024-11-17 00:30:27,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:30:27,748 INFO L225 Difference]: With dead ends: 180 [2024-11-17 00:30:27,748 INFO L226 Difference]: Without dead ends: 180 [2024-11-17 00:30:27,749 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 39 SyntacticMatches, 4 SemanticMatches, 19 ConstructedPredicates, 1 IntricatePredicates, 2 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=283, Unknown=1, NotChecked=36, Total=420 [2024-11-17 00:30:27,749 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 127 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 156 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-17 00:30:27,749 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 334 Invalid, 507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 341 Invalid, 0 Unknown, 156 Unchecked, 0.2s Time] [2024-11-17 00:30:27,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2024-11-17 00:30:27,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 148. [2024-11-17 00:30:27,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 109 states have (on average 1.4036697247706422) internal successors, (153), 142 states have internal predecessors, (153), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-17 00:30:27,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 160 transitions. [2024-11-17 00:30:27,752 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 160 transitions. Word has length 33 [2024-11-17 00:30:27,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:30:27,753 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 160 transitions. [2024-11-17 00:30:27,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.7) internal successors, (47), 8 states have internal predecessors, (47), 1 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-17 00:30:27,753 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 160 transitions. [2024-11-17 00:30:27,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-17 00:30:27,756 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:30:27,757 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:30:27,782 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-17 00:30:27,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-11-17 00:30:27,958 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting appendErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 56 more)] === [2024-11-17 00:30:27,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:30:27,958 INFO L85 PathProgramCache]: Analyzing trace with hash 1245769460, now seen corresponding path program 1 times [2024-11-17 00:30:27,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:30:27,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178103714] [2024-11-17 00:30:27,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:30:27,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:30:27,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:30:28,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-17 00:30:28,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:30:28,262 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:30:28,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:30:28,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178103714] [2024-11-17 00:30:28,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178103714] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:30:28,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2032630435] [2024-11-17 00:30:28,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:30:28,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:30:28,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:30:28,264 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 00:30:28,265 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-17 00:30:28,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:30:28,381 INFO L255 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-17 00:30:28,384 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:30:28,402 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-17 00:30:28,409 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-17 00:30:28,461 WARN L873 $PredicateComparison]: unable to prove that (exists ((append_~node~0.base Int)) (and (= (store |c_old(#length)| append_~node~0.base (select |c_#length| append_~node~0.base)) |c_#length|) (= (select |c_old(#valid)| append_~node~0.base) 0) (= |c_#valid| (store |c_old(#valid)| append_~node~0.base 1)))) is different from true [2024-11-17 00:30:28,555 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-17 00:30:28,555 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-17 00:30:28,559 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-17 00:30:28,672 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 00:30:28,673 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-17 00:30:28,685 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-11-17 00:30:28,685 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2024-11-17 00:30:28,702 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-11-17 00:30:28,702 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:30:28,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2032630435] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:30:28,925 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 00:30:28,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2024-11-17 00:30:28,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258726728] [2024-11-17 00:30:28,925 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 00:30:28,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-17 00:30:28,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:30:28,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-17 00:30:28,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=225, Unknown=1, NotChecked=30, Total=306 [2024-11-17 00:30:28,926 INFO L87 Difference]: Start difference. First operand 148 states and 160 transitions. Second operand has 14 states, 13 states have (on average 4.076923076923077) internal successors, (53), 10 states have internal predecessors, (53), 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-11-17 00:30:34,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:30:34,093 INFO L93 Difference]: Finished difference Result 344 states and 381 transitions. [2024-11-17 00:30:34,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-17 00:30:34,093 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.076923076923077) internal successors, (53), 10 states have internal predecessors, (53), 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 33 [2024-11-17 00:30:34,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:30:34,095 INFO L225 Difference]: With dead ends: 344 [2024-11-17 00:30:34,095 INFO L226 Difference]: Without dead ends: 344 [2024-11-17 00:30:34,095 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=208, Invalid=847, Unknown=5, NotChecked=62, Total=1122 [2024-11-17 00:30:34,096 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 332 mSDsluCounter, 505 mSDsCounter, 0 mSdLazyCounter, 670 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 332 SdHoareTripleChecker+Valid, 583 SdHoareTripleChecker+Invalid, 980 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 670 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 281 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-17 00:30:34,096 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [332 Valid, 583 Invalid, 980 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 670 Invalid, 0 Unknown, 281 Unchecked, 0.5s Time] [2024-11-17 00:30:34,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2024-11-17 00:30:34,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 219. [2024-11-17 00:30:34,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 177 states have (on average 1.4067796610169492) internal successors, (249), 209 states have internal predecessors, (249), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2024-11-17 00:30:34,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 261 transitions. [2024-11-17 00:30:34,104 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 261 transitions. Word has length 33 [2024-11-17 00:30:34,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:30:34,104 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 261 transitions. [2024-11-17 00:30:34,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.076923076923077) internal successors, (53), 10 states have internal predecessors, (53), 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-11-17 00:30:34,104 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 261 transitions. [2024-11-17 00:30:34,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-17 00:30:34,105 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:30:34,105 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:30:34,118 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-17 00:30:34,305 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,SelfDestructingSolverStorable12 [2024-11-17 00:30:34,306 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 56 more)] === [2024-11-17 00:30:34,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:30:34,306 INFO L85 PathProgramCache]: Analyzing trace with hash 195993863, now seen corresponding path program 1 times [2024-11-17 00:30:34,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:30:34,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606947236] [2024-11-17 00:30:34,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:30:34,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:30:34,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:30:34,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-17 00:30:34,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:30:34,841 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:30:34,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:30:34,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606947236] [2024-11-17 00:30:34,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606947236] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:30:34,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1967503075] [2024-11-17 00:30:34,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:30:34,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:30:34,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:30:34,843 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 00:30:34,844 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-17 00:30:34,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:30:34,955 INFO L255 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-17 00:30:34,958 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:30:34,964 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-17 00:30:35,025 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-11-17 00:30:35,085 INFO L349 Elim1Store]: treesize reduction 38, result has 36.7 percent of original size [2024-11-17 00:30:35,085 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-11-17 00:30:35,135 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-11-17 00:30:35,137 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:30:35,137 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:30:35,308 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-11-17 00:30:35,753 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:30:35,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1967503075] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:30:35,753 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 00:30:35,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7, 6] total 20 [2024-11-17 00:30:35,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232079882] [2024-11-17 00:30:35,755 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 00:30:35,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-17 00:30:35,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:30:35,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-17 00:30:35,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=364, Unknown=0, NotChecked=0, Total=420 [2024-11-17 00:30:35,757 INFO L87 Difference]: Start difference. First operand 219 states and 261 transitions. Second operand has 21 states, 20 states have (on average 4.55) internal successors, (91), 19 states have internal predecessors, (91), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-17 00:30:36,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:30:36,413 INFO L93 Difference]: Finished difference Result 228 states and 269 transitions. [2024-11-17 00:30:36,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-17 00:30:36,415 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 4.55) internal successors, (91), 19 states have internal predecessors, (91), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 40 [2024-11-17 00:30:36,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:30:36,416 INFO L225 Difference]: With dead ends: 228 [2024-11-17 00:30:36,417 INFO L226 Difference]: Without dead ends: 228 [2024-11-17 00:30:36,417 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=120, Invalid=582, Unknown=0, NotChecked=0, Total=702 [2024-11-17 00:30:36,418 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 175 mSDsluCounter, 597 mSDsCounter, 0 mSdLazyCounter, 707 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 687 SdHoareTripleChecker+Invalid, 723 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 707 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-17 00:30:36,418 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 687 Invalid, 723 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 707 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-17 00:30:36,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2024-11-17 00:30:36,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 225. [2024-11-17 00:30:36,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 182 states have (on average 1.39010989010989) internal successors, (253), 215 states have internal predecessors, (253), 5 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2024-11-17 00:30:36,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 265 transitions. [2024-11-17 00:30:36,425 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 265 transitions. Word has length 40 [2024-11-17 00:30:36,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:30:36,425 INFO L471 AbstractCegarLoop]: Abstraction has 225 states and 265 transitions. [2024-11-17 00:30:36,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 4.55) internal successors, (91), 19 states have internal predecessors, (91), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-17 00:30:36,426 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 265 transitions. [2024-11-17 00:30:36,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-17 00:30:36,427 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:30:36,427 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:30:36,443 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-17 00:30:36,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:30:36,632 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting appendErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 56 more)] === [2024-11-17 00:30:36,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:30:36,632 INFO L85 PathProgramCache]: Analyzing trace with hash 195993864, now seen corresponding path program 1 times [2024-11-17 00:30:36,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:30:36,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778353368] [2024-11-17 00:30:36,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:30:36,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:30:36,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:30:37,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-17 00:30:37,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:30:37,537 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:30:37,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:30:37,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778353368] [2024-11-17 00:30:37,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778353368] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:30:37,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1837163195] [2024-11-17 00:30:37,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:30:37,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:30:37,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:30:37,540 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 00:30:37,541 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-17 00:30:37,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:30:37,655 INFO L255 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 45 conjuncts are in the unsatisfiable core [2024-11-17 00:30:37,658 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:30:37,666 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-17 00:30:37,674 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-17 00:30:37,788 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-11-17 00:30:37,792 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-17 00:30:37,912 INFO L349 Elim1Store]: treesize reduction 4, result has 71.4 percent of original size [2024-11-17 00:30:37,913 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 17 treesize of output 17 [2024-11-17 00:30:37,916 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-11-17 00:30:37,968 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-11-17 00:30:37,972 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:30:37,972 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:30:38,312 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 34 treesize of output 28 [2024-11-17 00:30:38,326 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 76 treesize of output 70 [2024-11-17 00:30:38,329 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 106 treesize of output 94 [2024-11-17 00:30:38,551 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:30:38,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1837163195] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:30:38,551 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 00:30:38,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 6, 6] total 24 [2024-11-17 00:30:38,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833620835] [2024-11-17 00:30:38,552 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 00:30:38,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-17 00:30:38,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:30:38,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-17 00:30:38,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=527, Unknown=0, NotChecked=0, Total=600 [2024-11-17 00:30:38,553 INFO L87 Difference]: Start difference. First operand 225 states and 265 transitions. Second operand has 25 states, 24 states have (on average 4.166666666666667) internal successors, (100), 23 states have internal predecessors, (100), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-17 00:30:39,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:30:39,394 INFO L93 Difference]: Finished difference Result 274 states and 326 transitions. [2024-11-17 00:30:39,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-17 00:30:39,396 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 4.166666666666667) internal successors, (100), 23 states have internal predecessors, (100), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 40 [2024-11-17 00:30:39,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:30:39,397 INFO L225 Difference]: With dead ends: 274 [2024-11-17 00:30:39,397 INFO L226 Difference]: Without dead ends: 274 [2024-11-17 00:30:39,398 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=138, Invalid=854, Unknown=0, NotChecked=0, Total=992 [2024-11-17 00:30:39,398 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 201 mSDsluCounter, 832 mSDsCounter, 0 mSdLazyCounter, 1073 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 904 SdHoareTripleChecker+Invalid, 1098 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1073 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-17 00:30:39,398 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 904 Invalid, 1098 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1073 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-17 00:30:39,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2024-11-17 00:30:39,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 225. [2024-11-17 00:30:39,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 182 states have (on average 1.3846153846153846) internal successors, (252), 215 states have internal predecessors, (252), 5 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2024-11-17 00:30:39,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 264 transitions. [2024-11-17 00:30:39,405 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 264 transitions. Word has length 40 [2024-11-17 00:30:39,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:30:39,406 INFO L471 AbstractCegarLoop]: Abstraction has 225 states and 264 transitions. [2024-11-17 00:30:39,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 4.166666666666667) internal successors, (100), 23 states have internal predecessors, (100), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-17 00:30:39,406 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 264 transitions. [2024-11-17 00:30:39,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-17 00:30:39,406 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:30:39,407 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:30:39,420 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-17 00:30:39,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-17 00:30:39,608 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 56 more)] === [2024-11-17 00:30:39,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:30:39,609 INFO L85 PathProgramCache]: Analyzing trace with hash -752313078, now seen corresponding path program 1 times [2024-11-17 00:30:39,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:30:39,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408410011] [2024-11-17 00:30:39,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:30:39,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:30:39,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:30:39,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-17 00:30:39,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:30:40,112 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:30:40,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:30:40,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408410011] [2024-11-17 00:30:40,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408410011] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:30:40,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [754411860] [2024-11-17 00:30:40,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:30:40,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:30:40,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:30:40,115 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 00:30:40,116 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-17 00:30:40,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:30:40,240 INFO L255 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 58 conjuncts are in the unsatisfiable core [2024-11-17 00:30:40,243 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:30:40,276 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-11-17 00:30:40,281 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-11-17 00:30:40,309 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 19 treesize of output 18 [2024-11-17 00:30:40,315 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-17 00:30:40,382 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-17 00:30:40,491 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 20 [2024-11-17 00:30:40,633 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-17 00:30:40,634 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 23 treesize of output 20 [2024-11-17 00:30:40,644 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-17 00:30:40,644 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2024-11-17 00:30:40,886 INFO L349 Elim1Store]: treesize reduction 56, result has 51.3 percent of original size [2024-11-17 00:30:40,886 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 55 treesize of output 91 [2024-11-17 00:30:41,030 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 41 [2024-11-17 00:30:41,206 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-17 00:30:41,229 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:30:41,229 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:30:41,579 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:30:41,580 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 52 treesize of output 50 [2024-11-17 00:30:41,588 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:30:41,588 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 124 treesize of output 128 [2024-11-17 00:30:41,620 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~list2~0#1.offset| 4)) (.cse2 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4))) (and (forall ((v_append_~head.base_52 Int) (v_arrayElimArr_2 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_$Pointer$#2.base| v_append_~head.base_52 v_arrayElimArr_2) |c_ULTIMATE.start_main_~list2~0#1.base|))) (or (= (select .cse0 |c_ULTIMATE.start_main_~list2~0#1.offset|) 0) (= (select .cse0 .cse1) (select v_arrayElimArr_2 .cse2))))) (forall ((v_append_~head.base_52 Int) (v_arrayElimArr_2 (Array Int Int))) (or (= (select (select (store |c_#memory_$Pointer$#2.base| v_append_~head.base_52 v_arrayElimArr_2) |c_ULTIMATE.start_main_~list2~0#1.base|) .cse1) (select v_arrayElimArr_2 .cse2)) (forall ((v_ArrVal_1322 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#2.offset| v_append_~head.base_52 v_ArrVal_1322) |c_ULTIMATE.start_main_~list2~0#1.base|) |c_ULTIMATE.start_main_~list2~0#1.offset|) 0)))))) is different from false [2024-11-17 00:30:41,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [754411860] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:30:41,622 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 00:30:41,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16] total 29 [2024-11-17 00:30:41,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14436051] [2024-11-17 00:30:41,622 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 00:30:41,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-11-17 00:30:41,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:30:41,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-17 00:30:41,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=1081, Unknown=3, NotChecked=66, Total=1260 [2024-11-17 00:30:41,623 INFO L87 Difference]: Start difference. First operand 225 states and 264 transitions. Second operand has 29 states, 29 states have (on average 2.6551724137931036) internal successors, (77), 25 states have internal predecessors, (77), 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-11-17 00:30:49,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:30:49,816 INFO L93 Difference]: Finished difference Result 597 states and 733 transitions. [2024-11-17 00:30:49,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2024-11-17 00:30:49,816 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.6551724137931036) internal successors, (77), 25 states have internal predecessors, (77), 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 42 [2024-11-17 00:30:49,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:30:49,819 INFO L225 Difference]: With dead ends: 597 [2024-11-17 00:30:49,820 INFO L226 Difference]: Without dead ends: 597 [2024-11-17 00:30:49,821 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 991 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=624, Invalid=4345, Unknown=5, NotChecked=138, Total=5112 [2024-11-17 00:30:49,821 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 743 mSDsluCounter, 1694 mSDsCounter, 0 mSdLazyCounter, 2541 mSolverCounterSat, 50 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 743 SdHoareTripleChecker+Valid, 1791 SdHoareTripleChecker+Invalid, 2596 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 2541 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-11-17 00:30:49,821 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [743 Valid, 1791 Invalid, 2596 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 2541 Invalid, 5 Unknown, 0 Unchecked, 2.8s Time] [2024-11-17 00:30:49,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2024-11-17 00:30:49,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 321. [2024-11-17 00:30:49,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 321 states, 269 states have (on average 1.3605947955390334) internal successors, (366), 303 states have internal predecessors, (366), 11 states have call successors, (11), 8 states have call predecessors, (11), 9 states have return successors, (19), 9 states have call predecessors, (19), 11 states have call successors, (19) [2024-11-17 00:30:49,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 396 transitions. [2024-11-17 00:30:49,832 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 396 transitions. Word has length 42 [2024-11-17 00:30:49,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:30:49,832 INFO L471 AbstractCegarLoop]: Abstraction has 321 states and 396 transitions. [2024-11-17 00:30:49,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 2.6551724137931036) internal successors, (77), 25 states have internal predecessors, (77), 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-11-17 00:30:49,832 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 396 transitions. [2024-11-17 00:30:49,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-17 00:30:49,833 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:30:49,833 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:30:49,847 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-17 00:30:50,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-17 00:30:50,034 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 56 more)] === [2024-11-17 00:30:50,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:30:50,034 INFO L85 PathProgramCache]: Analyzing trace with hash -1177687380, now seen corresponding path program 1 times [2024-11-17 00:30:50,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:30:50,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296195531] [2024-11-17 00:30:50,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:30:50,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:30:50,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:30:50,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-17 00:30:50,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:30:50,844 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:30:50,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:30:50,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296195531] [2024-11-17 00:30:50,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296195531] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:30:50,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [754932957] [2024-11-17 00:30:50,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:30:50,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:30:50,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:30:50,847 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 00:30:50,848 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-17 00:30:50,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:30:50,986 INFO L255 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 52 conjuncts are in the unsatisfiable core [2024-11-17 00:30:50,988 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:30:51,018 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-11-17 00:30:51,023 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-11-17 00:30:51,087 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-17 00:30:51,190 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-11-17 00:30:51,346 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-17 00:30:51,346 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2024-11-17 00:30:51,358 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-17 00:30:51,359 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2024-11-17 00:30:51,578 INFO L349 Elim1Store]: treesize reduction 36, result has 58.6 percent of original size [2024-11-17 00:30:51,578 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 41 treesize of output 78 [2024-11-17 00:30:51,805 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 102 treesize of output 94 [2024-11-17 00:30:52,229 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:30:52,229 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 60 treesize of output 84 [2024-11-17 00:30:52,300 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:30:52,300 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:30:52,663 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:30:52,663 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 56 treesize of output 54 [2024-11-17 00:30:52,666 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 76 treesize of output 65 [2024-11-17 00:30:52,678 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4)) (.cse2 (+ |c_ULTIMATE.start_main_~list2~0#1.offset| 4))) (and (forall ((v_arrayElimArr_4 (Array Int Int)) (v_append_~head.base_59 Int)) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#2.base| v_append_~head.base_59 v_arrayElimArr_4) |c_ULTIMATE.start_main_~list2~0#1.base|) .cse2))) (or (= (select v_arrayElimArr_4 .cse0) .cse1) (= .cse1 0)))) (forall ((v_arrayElimArr_4 (Array Int Int)) (v_append_~head.base_59 Int)) (or (forall ((v_ArrVal_1533 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#2.offset| v_append_~head.base_59 v_ArrVal_1533) |c_ULTIMATE.start_main_~list2~0#1.base|) .cse2) 0)) (= (select v_arrayElimArr_4 .cse0) (select (select (store |c_#memory_$Pointer$#2.base| v_append_~head.base_59 v_arrayElimArr_4) |c_ULTIMATE.start_main_~list2~0#1.base|) .cse2)))))) is different from false [2024-11-17 00:30:52,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [754932957] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:30:52,680 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 00:30:52,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 28 [2024-11-17 00:30:52,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472660918] [2024-11-17 00:30:52,680 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 00:30:52,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-17 00:30:52,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:30:52,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-17 00:30:52,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=1077, Unknown=4, NotChecked=66, Total=1260 [2024-11-17 00:30:52,681 INFO L87 Difference]: Start difference. First operand 321 states and 396 transitions. Second operand has 28 states, 28 states have (on average 2.857142857142857) internal successors, (80), 24 states have internal predecessors, (80), 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-11-17 00:30:58,247 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-17 00:31:00,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:31:00,126 INFO L93 Difference]: Finished difference Result 360 states and 427 transitions. [2024-11-17 00:31:00,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2024-11-17 00:31:00,126 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.857142857142857) internal successors, (80), 24 states have internal predecessors, (80), 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 44 [2024-11-17 00:31:00,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:31:00,128 INFO L225 Difference]: With dead ends: 360 [2024-11-17 00:31:00,128 INFO L226 Difference]: Without dead ends: 360 [2024-11-17 00:31:00,128 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 849 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=518, Invalid=3385, Unknown=7, NotChecked=122, Total=4032 [2024-11-17 00:31:00,129 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 417 mSDsluCounter, 1153 mSDsCounter, 0 mSdLazyCounter, 1732 mSolverCounterSat, 32 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 417 SdHoareTripleChecker+Valid, 1229 SdHoareTripleChecker+Invalid, 1769 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1732 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2024-11-17 00:31:00,129 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [417 Valid, 1229 Invalid, 1769 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1732 Invalid, 5 Unknown, 0 Unchecked, 5.6s Time] [2024-11-17 00:31:00,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2024-11-17 00:31:00,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 295. [2024-11-17 00:31:00,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 247 states have (on average 1.3481781376518218) internal successors, (333), 279 states have internal predecessors, (333), 9 states have call successors, (9), 8 states have call predecessors, (9), 7 states have return successors, (13), 7 states have call predecessors, (13), 9 states have call successors, (13) [2024-11-17 00:31:00,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 355 transitions. [2024-11-17 00:31:00,135 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 355 transitions. Word has length 44 [2024-11-17 00:31:00,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:31:00,136 INFO L471 AbstractCegarLoop]: Abstraction has 295 states and 355 transitions. [2024-11-17 00:31:00,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 2.857142857142857) internal successors, (80), 24 states have internal predecessors, (80), 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-11-17 00:31:00,136 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 355 transitions. [2024-11-17 00:31:00,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-17 00:31:00,137 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:31:00,137 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:31:00,150 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-17 00:31:00,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-17 00:31:00,341 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 56 more)] === [2024-11-17 00:31:00,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:31:00,341 INFO L85 PathProgramCache]: Analyzing trace with hash 811368240, now seen corresponding path program 1 times [2024-11-17 00:31:00,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:31:00,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634055326] [2024-11-17 00:31:00,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:31:00,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:31:00,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:31:00,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-17 00:31:00,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:31:00,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-17 00:31:00,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:31:00,427 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-17 00:31:00,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:31:00,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634055326] [2024-11-17 00:31:00,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634055326] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:31:00,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1343981212] [2024-11-17 00:31:00,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:31:00,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:31:00,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:31:00,429 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 00:31:00,430 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-17 00:31:00,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:31:00,571 INFO L255 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-17 00:31:00,572 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:31:00,589 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-17 00:31:00,589 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:31:00,614 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-17 00:31:00,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1343981212] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:31:00,614 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 00:31:00,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8 [2024-11-17 00:31:00,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181966560] [2024-11-17 00:31:00,615 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 00:31:00,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-17 00:31:00,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:31:00,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-17 00:31:00,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-11-17 00:31:00,616 INFO L87 Difference]: Start difference. First operand 295 states and 355 transitions. Second operand has 8 states, 8 states have (on average 5.25) internal successors, (42), 7 states have internal predecessors, (42), 4 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-17 00:31:00,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:31:00,716 INFO L93 Difference]: Finished difference Result 357 states and 427 transitions. [2024-11-17 00:31:00,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-17 00:31:00,716 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 7 states have internal predecessors, (42), 4 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 48 [2024-11-17 00:31:00,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:31:00,717 INFO L225 Difference]: With dead ends: 357 [2024-11-17 00:31:00,717 INFO L226 Difference]: Without dead ends: 357 [2024-11-17 00:31:00,718 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-11-17 00:31:00,718 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 88 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:31:00,718 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 279 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:31:00,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2024-11-17 00:31:00,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 347. [2024-11-17 00:31:00,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 347 states, 293 states have (on average 1.3276450511945392) internal successors, (389), 321 states have internal predecessors, (389), 15 states have call successors, (15), 8 states have call predecessors, (15), 7 states have return successors, (23), 17 states have call predecessors, (23), 15 states have call successors, (23) [2024-11-17 00:31:00,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 427 transitions. [2024-11-17 00:31:00,725 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 427 transitions. Word has length 48 [2024-11-17 00:31:00,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:31:00,725 INFO L471 AbstractCegarLoop]: Abstraction has 347 states and 427 transitions. [2024-11-17 00:31:00,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 7 states have internal predecessors, (42), 4 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-17 00:31:00,725 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 427 transitions. [2024-11-17 00:31:00,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-17 00:31:00,726 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:31:00,726 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:31:00,740 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-17 00:31:00,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:31:00,927 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting appendErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 56 more)] === [2024-11-17 00:31:00,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:31:00,927 INFO L85 PathProgramCache]: Analyzing trace with hash 1317601200, now seen corresponding path program 1 times [2024-11-17 00:31:00,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:31:00,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846797746] [2024-11-17 00:31:00,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:31:00,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:31:00,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:31:01,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-17 00:31:01,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:31:01,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-17 00:31:01,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:31:01,667 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 21 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-17 00:31:01,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:31:01,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846797746] [2024-11-17 00:31:01,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846797746] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:31:01,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2135288684] [2024-11-17 00:31:01,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:31:01,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:31:01,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:31:01,670 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 00:31:01,671 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-17 00:31:01,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:31:01,835 INFO L255 TraceCheckSpWp]: Trace formula consists of 526 conjuncts, 45 conjuncts are in the unsatisfiable core [2024-11-17 00:31:01,837 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:31:01,845 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-17 00:31:01,850 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-17 00:31:01,940 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-11-17 00:31:01,943 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-17 00:31:02,024 INFO L349 Elim1Store]: treesize reduction 4, result has 71.4 percent of original size [2024-11-17 00:31:02,024 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 17 treesize of output 17 [2024-11-17 00:31:02,028 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-11-17 00:31:02,077 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-11-17 00:31:02,100 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 23 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-17 00:31:02,100 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:31:02,409 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 34 treesize of output 28 [2024-11-17 00:31:02,420 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 76 treesize of output 70 [2024-11-17 00:31:02,422 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 106 treesize of output 94 [2024-11-17 00:31:02,616 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 23 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-17 00:31:02,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2135288684] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:31:02,616 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 00:31:02,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 6, 6] total 23 [2024-11-17 00:31:02,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539759103] [2024-11-17 00:31:02,617 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 00:31:02,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-17 00:31:02,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:31:02,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-17 00:31:02,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=488, Unknown=0, NotChecked=0, Total=552 [2024-11-17 00:31:02,618 INFO L87 Difference]: Start difference. First operand 347 states and 427 transitions. Second operand has 24 states, 23 states have (on average 5.434782608695652) internal successors, (125), 22 states have internal predecessors, (125), 6 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-17 00:31:03,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:31:03,436 INFO L93 Difference]: Finished difference Result 397 states and 473 transitions. [2024-11-17 00:31:03,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-17 00:31:03,437 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 5.434782608695652) internal successors, (125), 22 states have internal predecessors, (125), 6 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 60 [2024-11-17 00:31:03,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:31:03,438 INFO L225 Difference]: With dead ends: 397 [2024-11-17 00:31:03,438 INFO L226 Difference]: Without dead ends: 397 [2024-11-17 00:31:03,439 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=142, Invalid=850, Unknown=0, NotChecked=0, Total=992 [2024-11-17 00:31:03,439 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 286 mSDsluCounter, 722 mSDsCounter, 0 mSdLazyCounter, 1050 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 792 SdHoareTripleChecker+Invalid, 1063 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1050 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-17 00:31:03,439 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [288 Valid, 792 Invalid, 1063 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1050 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-17 00:31:03,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2024-11-17 00:31:03,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 358. [2024-11-17 00:31:03,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 358 states, 303 states have (on average 1.3036303630363035) internal successors, (395), 332 states have internal predecessors, (395), 15 states have call successors, (15), 8 states have call predecessors, (15), 9 states have return successors, (23), 17 states have call predecessors, (23), 15 states have call successors, (23) [2024-11-17 00:31:03,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 433 transitions. [2024-11-17 00:31:03,445 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 433 transitions. Word has length 60 [2024-11-17 00:31:03,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:31:03,446 INFO L471 AbstractCegarLoop]: Abstraction has 358 states and 433 transitions. [2024-11-17 00:31:03,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 5.434782608695652) internal successors, (125), 22 states have internal predecessors, (125), 6 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-17 00:31:03,446 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 433 transitions. [2024-11-17 00:31:03,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-17 00:31:03,446 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:31:03,446 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:31:03,461 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-17 00:31:03,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:31:03,647 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting appendErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 56 more)] === [2024-11-17 00:31:03,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:31:03,647 INFO L85 PathProgramCache]: Analyzing trace with hash 1889798084, now seen corresponding path program 1 times [2024-11-17 00:31:03,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:31:03,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672216421] [2024-11-17 00:31:03,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:31:03,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:31:03,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:31:03,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-17 00:31:03,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:31:03,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-17 00:31:03,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:31:03,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-17 00:31:03,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:31:03,734 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 24 proven. 7 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-17 00:31:03,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:31:03,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672216421] [2024-11-17 00:31:03,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672216421] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:31:03,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1799654035] [2024-11-17 00:31:03,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:31:03,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:31:03,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:31:03,736 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 00:31:03,737 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-17 00:31:03,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:31:03,932 INFO L255 TraceCheckSpWp]: Trace formula consists of 594 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-17 00:31:03,933 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:31:03,937 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-17 00:31:03,937 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 00:31:03,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1799654035] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:31:03,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-17 00:31:03,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 4 [2024-11-17 00:31:03,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257130019] [2024-11-17 00:31:03,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:31:03,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:31:03,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:31:03,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:31:03,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 00:31:03,938 INFO L87 Difference]: Start difference. First operand 358 states and 433 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-17 00:31:03,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:31:03,952 INFO L93 Difference]: Finished difference Result 346 states and 414 transitions. [2024-11-17 00:31:03,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:31:03,952 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 65 [2024-11-17 00:31:03,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:31:03,953 INFO L225 Difference]: With dead ends: 346 [2024-11-17 00:31:03,953 INFO L226 Difference]: Without dead ends: 346 [2024-11-17 00:31:03,953 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 00:31:03,954 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 0 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:31:03,954 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 215 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:31:03,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2024-11-17 00:31:03,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 346. [2024-11-17 00:31:03,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 291 states have (on average 1.2920962199312716) internal successors, (376), 320 states have internal predecessors, (376), 15 states have call successors, (15), 8 states have call predecessors, (15), 9 states have return successors, (23), 17 states have call predecessors, (23), 15 states have call successors, (23) [2024-11-17 00:31:03,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 414 transitions. [2024-11-17 00:31:03,963 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 414 transitions. Word has length 65 [2024-11-17 00:31:03,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:31:03,964 INFO L471 AbstractCegarLoop]: Abstraction has 346 states and 414 transitions. [2024-11-17 00:31:03,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-17 00:31:03,964 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 414 transitions. [2024-11-17 00:31:03,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-17 00:31:03,964 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:31:03,964 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:31:03,978 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-11-17 00:31:04,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:31:04,165 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting appendErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 56 more)] === [2024-11-17 00:31:04,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:31:04,166 INFO L85 PathProgramCache]: Analyzing trace with hash -171214649, now seen corresponding path program 1 times [2024-11-17 00:31:04,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:31:04,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065791190] [2024-11-17 00:31:04,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:31:04,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:31:04,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:31:04,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-17 00:31:04,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:31:04,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-17 00:31:04,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:31:04,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-17 00:31:04,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:31:04,892 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 17 proven. 31 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-17 00:31:04,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:31:04,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065791190] [2024-11-17 00:31:04,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065791190] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:31:04,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [34213040] [2024-11-17 00:31:04,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:31:04,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:31:04,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:31:04,894 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 00:31:04,895 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-17 00:31:05,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:31:05,073 INFO L255 TraceCheckSpWp]: Trace formula consists of 621 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-17 00:31:05,075 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:31:05,145 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-11-17 00:31:05,285 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 41 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-17 00:31:05,285 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:31:05,471 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-11-17 00:31:05,538 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 41 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-17 00:31:05,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [34213040] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:31:05,539 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 00:31:05,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 10, 10] total 29 [2024-11-17 00:31:05,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98638956] [2024-11-17 00:31:05,539 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 00:31:05,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-11-17 00:31:05,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:31:05,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-17 00:31:05,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=729, Unknown=0, NotChecked=0, Total=812 [2024-11-17 00:31:05,540 INFO L87 Difference]: Start difference. First operand 346 states and 414 transitions. Second operand has 29 states, 29 states have (on average 4.0) internal successors, (116), 26 states have internal predecessors, (116), 5 states have call successors, (7), 5 states have call predecessors, (7), 6 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-17 00:31:06,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:31:06,616 INFO L93 Difference]: Finished difference Result 372 states and 446 transitions. [2024-11-17 00:31:06,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-11-17 00:31:06,616 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 4.0) internal successors, (116), 26 states have internal predecessors, (116), 5 states have call successors, (7), 5 states have call predecessors, (7), 6 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) Word has length 71 [2024-11-17 00:31:06,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:31:06,618 INFO L225 Difference]: With dead ends: 372 [2024-11-17 00:31:06,618 INFO L226 Difference]: Without dead ends: 372 [2024-11-17 00:31:06,619 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 713 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=550, Invalid=3110, Unknown=0, NotChecked=0, Total=3660 [2024-11-17 00:31:06,619 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 225 mSDsluCounter, 1519 mSDsCounter, 0 mSdLazyCounter, 871 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 1604 SdHoareTripleChecker+Invalid, 901 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 871 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-17 00:31:06,619 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 1604 Invalid, 901 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 871 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-17 00:31:06,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2024-11-17 00:31:06,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 341. [2024-11-17 00:31:06,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 285 states have (on average 1.2912280701754386) internal successors, (368), 315 states have internal predecessors, (368), 15 states have call successors, (15), 8 states have call predecessors, (15), 10 states have return successors, (25), 17 states have call predecessors, (25), 15 states have call successors, (25) [2024-11-17 00:31:06,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 408 transitions. [2024-11-17 00:31:06,629 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 408 transitions. Word has length 71 [2024-11-17 00:31:06,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:31:06,630 INFO L471 AbstractCegarLoop]: Abstraction has 341 states and 408 transitions. [2024-11-17 00:31:06,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 4.0) internal successors, (116), 26 states have internal predecessors, (116), 5 states have call successors, (7), 5 states have call predecessors, (7), 6 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-17 00:31:06,630 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 408 transitions. [2024-11-17 00:31:06,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-17 00:31:06,631 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:31:06,631 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:31:06,646 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-17 00:31:06,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2024-11-17 00:31:06,831 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting appendErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 56 more)] === [2024-11-17 00:31:06,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:31:06,832 INFO L85 PathProgramCache]: Analyzing trace with hash -647590898, now seen corresponding path program 2 times [2024-11-17 00:31:06,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:31:06,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655490444] [2024-11-17 00:31:06,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:31:06,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:31:06,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:31:07,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-17 00:31:07,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:31:07,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-17 00:31:07,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:31:07,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-17 00:31:07,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:31:07,480 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-11-17 00:31:07,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:31:07,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655490444] [2024-11-17 00:31:07,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655490444] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:31:07,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1694165192] [2024-11-17 00:31:07,481 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-17 00:31:07,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:31:07,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:31:07,483 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 00:31:07,484 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-17 00:31:07,712 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-17 00:31:07,712 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 00:31:07,714 INFO L255 TraceCheckSpWp]: Trace formula consists of 630 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-17 00:31:07,716 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:31:07,720 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-17 00:31:07,724 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-17 00:31:07,765 WARN L873 $PredicateComparison]: unable to prove that (exists ((append_~node~0.base Int)) (and (= (store |c_old(#length)| append_~node~0.base (select |c_#length| append_~node~0.base)) |c_#length|) (= (select |c_old(#valid)| append_~node~0.base) 0))) is different from true [2024-11-17 00:31:07,802 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 00:31:07,803 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-17 00:31:07,808 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-17 00:31:07,808 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-17 00:31:07,894 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-17 00:31:07,894 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2024-11-17 00:31:07,995 INFO L349 Elim1Store]: treesize reduction 24, result has 52.9 percent of original size [2024-11-17 00:31:07,996 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 19 treesize of output 33 [2024-11-17 00:31:08,086 INFO L349 Elim1Store]: treesize reduction 24, result has 52.9 percent of original size [2024-11-17 00:31:08,087 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 19 treesize of output 33 [2024-11-17 00:31:08,142 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 6 proven. 13 refuted. 0 times theorem prover too weak. 18 trivial. 16 not checked. [2024-11-17 00:31:08,142 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:31:08,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1694165192] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:31:08,412 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 00:31:08,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 17 [2024-11-17 00:31:08,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039590312] [2024-11-17 00:31:08,413 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 00:31:08,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-17 00:31:08,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:31:08,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-17 00:31:08,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=323, Unknown=1, NotChecked=36, Total=420 [2024-11-17 00:31:08,416 INFO L87 Difference]: Start difference. First operand 341 states and 408 transitions. Second operand has 18 states, 17 states have (on average 5.294117647058823) internal successors, (90), 13 states have internal predecessors, (90), 5 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-17 00:31:12,481 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-17 00:31:13,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:31:13,332 INFO L93 Difference]: Finished difference Result 373 states and 428 transitions. [2024-11-17 00:31:13,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-17 00:31:13,333 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 5.294117647058823) internal successors, (90), 13 states have internal predecessors, (90), 5 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) Word has length 73 [2024-11-17 00:31:13,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:31:13,334 INFO L225 Difference]: With dead ends: 373 [2024-11-17 00:31:13,334 INFO L226 Difference]: Without dead ends: 373 [2024-11-17 00:31:13,334 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 79 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=160, Invalid=773, Unknown=1, NotChecked=58, Total=992 [2024-11-17 00:31:13,335 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 263 mSDsluCounter, 650 mSDsCounter, 0 mSdLazyCounter, 806 mSolverCounterSat, 18 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 263 SdHoareTripleChecker+Valid, 721 SdHoareTripleChecker+Invalid, 977 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 806 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 152 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2024-11-17 00:31:13,335 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [263 Valid, 721 Invalid, 977 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 806 Invalid, 1 Unknown, 152 Unchecked, 4.5s Time] [2024-11-17 00:31:13,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2024-11-17 00:31:13,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 217. [2024-11-17 00:31:13,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 180 states have (on average 1.2333333333333334) internal successors, (222), 203 states have internal predecessors, (222), 8 states have call successors, (8), 5 states have call predecessors, (8), 6 states have return successors, (13), 8 states have call predecessors, (13), 8 states have call successors, (13) [2024-11-17 00:31:13,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 243 transitions. [2024-11-17 00:31:13,341 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 243 transitions. Word has length 73 [2024-11-17 00:31:13,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:31:13,341 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 243 transitions. [2024-11-17 00:31:13,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 5.294117647058823) internal successors, (90), 13 states have internal predecessors, (90), 5 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-17 00:31:13,341 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 243 transitions. [2024-11-17 00:31:13,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-17 00:31:13,341 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:31:13,341 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:31:13,357 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-17 00:31:13,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-11-17 00:31:13,542 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 56 more)] === [2024-11-17 00:31:13,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:31:13,544 INFO L85 PathProgramCache]: Analyzing trace with hash 2049303316, now seen corresponding path program 1 times [2024-11-17 00:31:13,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:31:13,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926484178] [2024-11-17 00:31:13,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:31:13,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:31:13,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:31:13,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-17 00:31:13,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:31:13,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-17 00:31:13,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:31:13,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-17 00:31:13,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:31:13,988 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 54 proven. 13 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-17 00:31:13,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:31:13,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926484178] [2024-11-17 00:31:13,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926484178] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:31:13,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1540611405] [2024-11-17 00:31:13,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:31:13,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:31:13,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:31:13,990 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 00:31:13,991 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-17 00:31:14,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:31:14,230 INFO L255 TraceCheckSpWp]: Trace formula consists of 674 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-17 00:31:14,232 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:31:14,238 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-17 00:31:14,293 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-11-17 00:31:14,337 INFO L349 Elim1Store]: treesize reduction 38, result has 36.7 percent of original size [2024-11-17 00:31:14,337 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-11-17 00:31:14,366 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-11-17 00:31:14,379 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 46 proven. 5 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-17 00:31:14,380 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:31:14,500 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-11-17 00:31:14,853 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 46 proven. 5 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-17 00:31:14,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1540611405] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:31:14,854 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 00:31:14,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 6, 6] total 21 [2024-11-17 00:31:14,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178126947] [2024-11-17 00:31:14,854 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 00:31:14,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-17 00:31:14,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:31:14,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-17 00:31:14,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=371, Unknown=0, NotChecked=0, Total=420 [2024-11-17 00:31:14,855 INFO L87 Difference]: Start difference. First operand 217 states and 243 transitions. Second operand has 21 states, 21 states have (on average 5.619047619047619) internal successors, (118), 20 states have internal predecessors, (118), 5 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (6), 5 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-17 00:31:15,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:31:15,484 INFO L93 Difference]: Finished difference Result 200 states and 216 transitions. [2024-11-17 00:31:15,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-17 00:31:15,485 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 5.619047619047619) internal successors, (118), 20 states have internal predecessors, (118), 5 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (6), 5 states have call predecessors, (6), 2 states have call successors, (6) Word has length 78 [2024-11-17 00:31:15,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:31:15,485 INFO L225 Difference]: With dead ends: 200 [2024-11-17 00:31:15,485 INFO L226 Difference]: Without dead ends: 200 [2024-11-17 00:31:15,486 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=176, Invalid=946, Unknown=0, NotChecked=0, Total=1122 [2024-11-17 00:31:15,486 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 226 mSDsluCounter, 716 mSDsCounter, 0 mSdLazyCounter, 777 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 784 SdHoareTripleChecker+Invalid, 785 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 777 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-17 00:31:15,486 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 784 Invalid, 785 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 777 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-17 00:31:15,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2024-11-17 00:31:15,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 171. [2024-11-17 00:31:15,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 139 states have (on average 1.2589928057553956) internal successors, (175), 161 states have internal predecessors, (175), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-17 00:31:15,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 187 transitions. [2024-11-17 00:31:15,489 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 187 transitions. Word has length 78 [2024-11-17 00:31:15,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:31:15,489 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 187 transitions. [2024-11-17 00:31:15,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 5.619047619047619) internal successors, (118), 20 states have internal predecessors, (118), 5 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (6), 5 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-17 00:31:15,490 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 187 transitions. [2024-11-17 00:31:15,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-17 00:31:15,490 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:31:15,490 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:31:15,505 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-11-17 00:31:15,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2024-11-17 00:31:15,695 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 56 more)] === [2024-11-17 00:31:15,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:31:15,695 INFO L85 PathProgramCache]: Analyzing trace with hash 215541802, now seen corresponding path program 1 times [2024-11-17 00:31:15,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:31:15,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415303250] [2024-11-17 00:31:15,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:31:15,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:31:15,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:31:15,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-17 00:31:15,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:31:15,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-17 00:31:15,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:31:15,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-17 00:31:15,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:31:15,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-17 00:31:15,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:31:15,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-17 00:31:15,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:31:15,879 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2024-11-17 00:31:15,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:31:15,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415303250] [2024-11-17 00:31:15,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415303250] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:31:15,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [457005466] [2024-11-17 00:31:15,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:31:15,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:31:15,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:31:15,882 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 00:31:15,882 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-17 00:31:16,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:31:16,161 INFO L255 TraceCheckSpWp]: Trace formula consists of 879 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-17 00:31:16,163 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:31:16,207 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2024-11-17 00:31:16,207 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:31:16,264 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2024-11-17 00:31:16,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [457005466] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:31:16,264 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 00:31:16,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 10 [2024-11-17 00:31:16,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539272937] [2024-11-17 00:31:16,264 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 00:31:16,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-17 00:31:16,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:31:16,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-17 00:31:16,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2024-11-17 00:31:16,265 INFO L87 Difference]: Start difference. First operand 171 states and 187 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 9 states have internal predecessors, (60), 7 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-17 00:31:16,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:31:16,351 INFO L93 Difference]: Finished difference Result 215 states and 223 transitions. [2024-11-17 00:31:16,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-17 00:31:16,352 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 9 states have internal predecessors, (60), 7 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Word has length 108 [2024-11-17 00:31:16,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:31:16,352 INFO L225 Difference]: With dead ends: 215 [2024-11-17 00:31:16,352 INFO L226 Difference]: Without dead ends: 215 [2024-11-17 00:31:16,353 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 219 SyntacticMatches, 4 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2024-11-17 00:31:16,353 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 122 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:31:16,353 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 441 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:31:16,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2024-11-17 00:31:16,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 195. [2024-11-17 00:31:16,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 161 states have (on average 1.2857142857142858) internal successors, (207), 183 states have internal predecessors, (207), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-17 00:31:16,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 223 transitions. [2024-11-17 00:31:16,356 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 223 transitions. Word has length 108 [2024-11-17 00:31:16,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:31:16,356 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 223 transitions. [2024-11-17 00:31:16,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 9 states have internal predecessors, (60), 7 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-17 00:31:16,356 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 223 transitions. [2024-11-17 00:31:16,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-17 00:31:16,357 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:31:16,357 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:31:16,372 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-11-17 00:31:16,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2024-11-17 00:31:16,557 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 56 more)] === [2024-11-17 00:31:16,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:31:16,558 INFO L85 PathProgramCache]: Analyzing trace with hash -369420506, now seen corresponding path program 2 times [2024-11-17 00:31:16,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:31:16,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191773086] [2024-11-17 00:31:16,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:31:16,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:31:16,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:31:17,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-17 00:31:17,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:31:17,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-17 00:31:17,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:31:17,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-17 00:31:17,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:31:17,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-17 00:31:17,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:31:17,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-17 00:31:17,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:31:17,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-17 00:31:17,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:31:17,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-17 00:31:17,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:31:17,495 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 278 trivial. 0 not checked. [2024-11-17 00:31:17,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:31:17,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191773086] [2024-11-17 00:31:17,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191773086] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:31:17,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [593785349] [2024-11-17 00:31:17,496 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-17 00:31:17,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:31:17,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:31:17,499 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 00:31:17,500 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-17 00:31:18,112 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-17 00:31:18,112 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 00:31:18,116 INFO L255 TraceCheckSpWp]: Trace formula consists of 1193 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-11-17 00:31:18,121 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:31:18,152 WARN L873 $PredicateComparison]: unable to prove that (exists ((append_~node~0.base Int)) (and (= (select |c_old(#valid)| append_~node~0.base) 0) (= |c_#valid| (store |c_old(#valid)| append_~node~0.base (select |c_#valid| append_~node~0.base))))) is different from true [2024-11-17 00:31:18,196 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-17 00:31:18,196 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-11-17 00:31:18,204 WARN L873 $PredicateComparison]: unable to prove that (exists ((append_~node~0.base Int)) (= |c_#valid| (store |c_old(#valid)| append_~node~0.base 1))) is different from true [2024-11-17 00:31:18,226 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-17 00:31:18,226 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2024-11-17 00:31:18,261 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-17 00:31:18,261 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2024-11-17 00:31:18,292 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-17 00:31:18,293 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2024-11-17 00:31:18,324 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-17 00:31:18,324 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2024-11-17 00:31:18,357 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-17 00:31:18,358 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2024-11-17 00:31:18,365 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 237 trivial. 83 not checked. [2024-11-17 00:31:18,365 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:31:18,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [593785349] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:31:18,807 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 00:31:18,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 11 [2024-11-17 00:31:18,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17953847] [2024-11-17 00:31:18,807 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 00:31:18,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-17 00:31:18,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:31:18,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-17 00:31:18,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=102, Unknown=2, NotChecked=42, Total=182 [2024-11-17 00:31:18,808 INFO L87 Difference]: Start difference. First operand 195 states and 223 transitions. Second operand has 12 states, 11 states have (on average 8.181818181818182) internal successors, (90), 10 states have internal predecessors, (90), 2 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-17 00:31:19,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:31:19,082 INFO L93 Difference]: Finished difference Result 223 states and 251 transitions. [2024-11-17 00:31:19,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-17 00:31:19,082 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 8.181818181818182) internal successors, (90), 10 states have internal predecessors, (90), 2 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 148 [2024-11-17 00:31:19,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:31:19,083 INFO L225 Difference]: With dead ends: 223 [2024-11-17 00:31:19,083 INFO L226 Difference]: Without dead ends: 223 [2024-11-17 00:31:19,083 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 252 SyntacticMatches, 20 SemanticMatches, 19 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=90, Invalid=258, Unknown=2, NotChecked=70, Total=420 [2024-11-17 00:31:19,084 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 65 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 246 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-17 00:31:19,084 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 337 Invalid, 534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 283 Invalid, 0 Unknown, 246 Unchecked, 0.2s Time] [2024-11-17 00:31:19,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2024-11-17 00:31:19,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 194. [2024-11-17 00:31:19,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 161 states have (on average 1.279503105590062) internal successors, (206), 182 states have internal predecessors, (206), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-17 00:31:19,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 222 transitions. [2024-11-17 00:31:19,087 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 222 transitions. Word has length 148 [2024-11-17 00:31:19,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:31:19,087 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 222 transitions. [2024-11-17 00:31:19,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 8.181818181818182) internal successors, (90), 10 states have internal predecessors, (90), 2 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-17 00:31:19,088 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 222 transitions. [2024-11-17 00:31:19,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-17 00:31:19,088 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:31:19,089 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:31:19,108 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2024-11-17 00:31:19,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:31:19,289 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 56 more)] === [2024-11-17 00:31:19,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:31:19,290 INFO L85 PathProgramCache]: Analyzing trace with hash -369420505, now seen corresponding path program 1 times [2024-11-17 00:31:19,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:31:19,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870847700] [2024-11-17 00:31:19,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:31:19,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:31:19,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:31:20,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-17 00:31:20,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:31:20,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-17 00:31:20,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:31:20,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-17 00:31:20,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:31:20,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-17 00:31:20,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:31:20,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-17 00:31:20,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:31:20,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-17 00:31:20,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:31:20,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-17 00:31:20,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:31:20,584 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 0 proven. 221 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2024-11-17 00:31:20,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:31:20,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870847700] [2024-11-17 00:31:20,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870847700] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:31:20,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [708856491] [2024-11-17 00:31:20,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:31:20,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:31:20,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:31:20,586 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 00:31:20,586 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-11-17 00:31:20,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:31:20,934 INFO L255 TraceCheckSpWp]: Trace formula consists of 1193 conjuncts, 106 conjuncts are in the unsatisfiable core [2024-11-17 00:31:20,939 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:31:21,072 WARN L873 $PredicateComparison]: unable to prove that (exists ((append_~node~0.base Int)) (and (= (store |c_old(#length)| append_~node~0.base (select |c_#length| append_~node~0.base)) |c_#length|) (= (select |c_old(#valid)| append_~node~0.base) 0) (= |c_#valid| (store |c_old(#valid)| append_~node~0.base (select |c_#valid| append_~node~0.base))))) is different from true [2024-11-17 00:31:21,142 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 00:31:21,143 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-17 00:31:21,156 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-17 00:31:21,156 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-11-17 00:31:21,291 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-11-17 00:31:21,326 INFO L349 Elim1Store]: treesize reduction 38, result has 29.6 percent of original size [2024-11-17 00:31:21,326 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 37 treesize of output 22 [2024-11-17 00:31:21,332 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 9 [2024-11-17 00:31:21,492 WARN L873 $PredicateComparison]: unable to prove that (exists ((append_~node~0.base Int)) (and (= (store |c_old(#length)| append_~node~0.base (select |c_#length| append_~node~0.base)) |c_#length|) (= (select |c_old(#valid)| append_~node~0.base) 0))) is different from true [2024-11-17 00:31:21,505 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-11-17 00:31:21,508 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 00:31:21,508 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-17 00:31:21,513 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-17 00:31:21,513 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-17 00:31:21,629 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-11-17 00:31:21,633 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-11-17 00:31:21,664 INFO L349 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2024-11-17 00:31:21,665 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 19 [2024-11-17 00:31:21,952 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 23 [2024-11-17 00:31:21,956 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-17 00:31:21,968 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-17 00:31:21,969 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 17 [2024-11-17 00:31:22,152 INFO L349 Elim1Store]: treesize reduction 36, result has 59.1 percent of original size [2024-11-17 00:31:22,152 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 31 treesize of output 66 [2024-11-17 00:31:22,463 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 31 proven. 217 refuted. 0 times theorem prover too weak. 8 trivial. 70 not checked. [2024-11-17 00:31:22,464 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:31:22,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [708856491] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:31:22,564 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 00:31:22,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 25] total 37 [2024-11-17 00:31:22,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014723106] [2024-11-17 00:31:22,564 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 00:31:22,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-11-17 00:31:22,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:31:22,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-11-17 00:31:22,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=1259, Unknown=2, NotChecked=146, Total=1560 [2024-11-17 00:31:22,566 INFO L87 Difference]: Start difference. First operand 194 states and 222 transitions. Second operand has 38 states, 37 states have (on average 5.4324324324324325) internal successors, (201), 33 states have internal predecessors, (201), 7 states have call successors, (10), 6 states have call predecessors, (10), 11 states have return successors, (13), 6 states have call predecessors, (13), 7 states have call successors, (13) [2024-11-17 00:31:26,595 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-17 00:31:30,613 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-17 00:31:34,654 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-17 00:31:35,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:31:35,965 INFO L93 Difference]: Finished difference Result 222 states and 250 transitions. [2024-11-17 00:31:35,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-17 00:31:35,966 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 5.4324324324324325) internal successors, (201), 33 states have internal predecessors, (201), 7 states have call successors, (10), 6 states have call predecessors, (10), 11 states have return successors, (13), 6 states have call predecessors, (13), 7 states have call successors, (13) Word has length 148 [2024-11-17 00:31:35,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:31:35,967 INFO L225 Difference]: With dead ends: 222 [2024-11-17 00:31:35,967 INFO L226 Difference]: Without dead ends: 222 [2024-11-17 00:31:35,968 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 145 SyntacticMatches, 3 SemanticMatches, 56 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 965 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=427, Invalid=2656, Unknown=5, NotChecked=218, Total=3306 [2024-11-17 00:31:35,968 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 416 mSDsluCounter, 718 mSDsCounter, 0 mSdLazyCounter, 802 mSolverCounterSat, 23 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 416 SdHoareTripleChecker+Valid, 780 SdHoareTripleChecker+Invalid, 1106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 802 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 278 IncrementalHoareTripleChecker+Unchecked, 12.6s IncrementalHoareTripleChecker+Time [2024-11-17 00:31:35,968 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [416 Valid, 780 Invalid, 1106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 802 Invalid, 3 Unknown, 278 Unchecked, 12.6s Time] [2024-11-17 00:31:35,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2024-11-17 00:31:35,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 193. [2024-11-17 00:31:35,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 161 states have (on average 1.2732919254658386) internal successors, (205), 181 states have internal predecessors, (205), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-17 00:31:35,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 221 transitions. [2024-11-17 00:31:35,971 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 221 transitions. Word has length 148 [2024-11-17 00:31:35,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:31:35,972 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 221 transitions. [2024-11-17 00:31:35,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 5.4324324324324325) internal successors, (201), 33 states have internal predecessors, (201), 7 states have call successors, (10), 6 states have call predecessors, (10), 11 states have return successors, (13), 6 states have call predecessors, (13), 7 states have call successors, (13) [2024-11-17 00:31:35,972 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 221 transitions. [2024-11-17 00:31:35,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-17 00:31:35,973 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:31:35,978 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:31:35,995 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2024-11-17 00:31:36,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2024-11-17 00:31:36,179 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 56 more)] === [2024-11-17 00:31:36,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:31:36,179 INFO L85 PathProgramCache]: Analyzing trace with hash 1469180323, now seen corresponding path program 1 times [2024-11-17 00:31:36,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:31:36,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801082381] [2024-11-17 00:31:36,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:31:36,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:31:36,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:31:37,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-17 00:31:37,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:31:37,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-17 00:31:37,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:31:37,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-17 00:31:37,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:31:37,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-17 00:31:37,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:31:37,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-17 00:31:37,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:31:37,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-17 00:31:37,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:31:37,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-17 00:31:37,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:31:37,850 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 0 proven. 65 refuted. 0 times theorem prover too weak. 261 trivial. 0 not checked. [2024-11-17 00:31:37,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:31:37,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801082381] [2024-11-17 00:31:37,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801082381] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:31:37,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1488153959] [2024-11-17 00:31:37,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:31:37,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:31:37,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:31:37,851 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 00:31:37,852 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-11-17 00:31:38,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:31:38,221 INFO L255 TraceCheckSpWp]: Trace formula consists of 1205 conjuncts, 133 conjuncts are in the unsatisfiable core [2024-11-17 00:31:38,226 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:31:38,228 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-17 00:31:38,236 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-17 00:31:38,236 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-17 00:31:38,244 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-17 00:31:38,275 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-11-17 00:31:38,281 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 27 treesize of output 22 [2024-11-17 00:31:38,507 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 24 [2024-11-17 00:31:38,522 INFO L349 Elim1Store]: treesize reduction 38, result has 36.7 percent of original size [2024-11-17 00:31:38,522 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-11-17 00:31:38,673 INFO L349 Elim1Store]: treesize reduction 37, result has 42.2 percent of original size [2024-11-17 00:31:38,673 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 31 [2024-11-17 00:31:38,677 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:31:38,677 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 35 [2024-11-17 00:31:38,917 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 41 [2024-11-17 00:31:38,921 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 31 treesize of output 23 [2024-11-17 00:31:38,935 INFO L349 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2024-11-17 00:31:38,935 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 34 [2024-11-17 00:31:39,091 INFO L349 Elim1Store]: treesize reduction 37, result has 42.2 percent of original size [2024-11-17 00:31:39,091 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 31 [2024-11-17 00:31:39,095 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:31:39,095 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 35 [2024-11-17 00:31:39,313 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:31:39,313 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 34 [2024-11-17 00:31:39,328 INFO L349 Elim1Store]: treesize reduction 37, result has 42.2 percent of original size [2024-11-17 00:31:39,328 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-17 00:31:39,506 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 45 [2024-11-17 00:31:39,511 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 35 treesize of output 27 [2024-11-17 00:31:39,533 INFO L349 Elim1Store]: treesize reduction 36, result has 53.2 percent of original size [2024-11-17 00:31:39,533 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 33 treesize of output 62 [2024-11-17 00:31:39,631 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:31:39,631 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 12 [2024-11-17 00:31:39,645 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 28 proven. 219 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2024-11-17 00:31:39,645 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:31:39,704 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_append_~node~0.base_143 Int) (v_ArrVal_6339 (Array Int Int))) (let ((.cse0 (store |c_#valid| v_append_~node~0.base_143 1))) (or (not (= 1 (select .cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~list2~0#1.base|) (+ |c_ULTIMATE.start_main_~list2~0#1.offset| 4))))) (= (select .cse0 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~list2~0#1.base| v_ArrVal_6339) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|)) 1)))) is different from false [2024-11-17 00:31:39,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1488153959] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:31:39,705 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 00:31:39,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 25] total 35 [2024-11-17 00:31:39,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612999063] [2024-11-17 00:31:39,705 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 00:31:39,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-11-17 00:31:39,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:31:39,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-11-17 00:31:39,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=1142, Unknown=1, NotChecked=68, Total=1332 [2024-11-17 00:31:39,706 INFO L87 Difference]: Start difference. First operand 193 states and 221 transitions. Second operand has 36 states, 35 states have (on average 3.6857142857142855) internal successors, (129), 34 states have internal predecessors, (129), 5 states have call successors, (6), 3 states have call predecessors, (6), 7 states have return successors, (9), 6 states have call predecessors, (9), 5 states have call successors, (9) [2024-11-17 00:31:41,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:31:41,082 INFO L93 Difference]: Finished difference Result 293 states and 326 transitions. [2024-11-17 00:31:41,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-17 00:31:41,083 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 3.6857142857142855) internal successors, (129), 34 states have internal predecessors, (129), 5 states have call successors, (6), 3 states have call predecessors, (6), 7 states have return successors, (9), 6 states have call predecessors, (9), 5 states have call successors, (9) Word has length 150 [2024-11-17 00:31:41,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:31:41,084 INFO L225 Difference]: With dead ends: 293 [2024-11-17 00:31:41,084 INFO L226 Difference]: Without dead ends: 293 [2024-11-17 00:31:41,085 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 156 SyntacticMatches, 3 SemanticMatches, 58 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 893 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=410, Invalid=3015, Unknown=1, NotChecked=114, Total=3540 [2024-11-17 00:31:41,085 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 348 mSDsluCounter, 878 mSDsCounter, 0 mSdLazyCounter, 1347 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 348 SdHoareTripleChecker+Valid, 931 SdHoareTripleChecker+Invalid, 1380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-17 00:31:41,085 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [348 Valid, 931 Invalid, 1380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1347 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-17 00:31:41,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2024-11-17 00:31:41,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 191. [2024-11-17 00:31:41,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 162 states have (on average 1.228395061728395) internal successors, (199), 179 states have internal predecessors, (199), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-17 00:31:41,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 215 transitions. [2024-11-17 00:31:41,088 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 215 transitions. Word has length 150 [2024-11-17 00:31:41,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:31:41,088 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 215 transitions. [2024-11-17 00:31:41,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 3.6857142857142855) internal successors, (129), 34 states have internal predecessors, (129), 5 states have call successors, (6), 3 states have call predecessors, (6), 7 states have return successors, (9), 6 states have call predecessors, (9), 5 states have call successors, (9) [2024-11-17 00:31:41,089 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 215 transitions. [2024-11-17 00:31:41,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-17 00:31:41,089 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:31:41,089 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:31:41,107 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2024-11-17 00:31:41,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2024-11-17 00:31:41,295 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 56 more)] === [2024-11-17 00:31:41,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:31:41,295 INFO L85 PathProgramCache]: Analyzing trace with hash 1469180324, now seen corresponding path program 1 times [2024-11-17 00:31:41,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:31:41,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085333637] [2024-11-17 00:31:41,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:31:41,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:31:41,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:31:42,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-17 00:31:42,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:31:43,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-17 00:31:43,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:31:43,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-17 00:31:43,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:31:43,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-17 00:31:43,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:31:43,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-17 00:31:43,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:31:43,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-17 00:31:43,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:31:43,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-17 00:31:43,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:31:44,024 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 0 proven. 245 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2024-11-17 00:31:44,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:31:44,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085333637] [2024-11-17 00:31:44,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085333637] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:31:44,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [182046642] [2024-11-17 00:31:44,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:31:44,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:31:44,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:31:44,026 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 00:31:44,026 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-11-17 00:31:44,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:31:44,417 INFO L255 TraceCheckSpWp]: Trace formula consists of 1205 conjuncts, 175 conjuncts are in the unsatisfiable core [2024-11-17 00:31:44,426 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:31:44,429 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-17 00:31:44,445 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-17 00:31:44,445 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-17 00:31:44,459 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-17 00:31:44,463 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-17 00:31:44,543 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-11-17 00:31:44,551 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-11-17 00:31:44,585 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 27 treesize of output 11 [2024-11-17 00:31:44,589 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 27 [2024-11-17 00:31:45,019 INFO L349 Elim1Store]: treesize reduction 48, result has 36.8 percent of original size [2024-11-17 00:31:45,019 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 35 treesize of output 45 [2024-11-17 00:31:45,027 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:31:45,027 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 1 case distinctions, treesize of input 80 treesize of output 53 [2024-11-17 00:31:45,030 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 15 [2024-11-17 00:31:45,048 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-17 00:31:45,426 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-17 00:31:45,433 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:31:45,433 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 95 treesize of output 49 [2024-11-17 00:31:45,460 INFO L349 Elim1Store]: treesize reduction 70, result has 35.8 percent of original size [2024-11-17 00:31:45,460 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 34 treesize of output 48 [2024-11-17 00:31:45,464 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-11-17 00:31:45,793 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:31:45,794 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 78 treesize of output 46 [2024-11-17 00:31:45,815 INFO L349 Elim1Store]: treesize reduction 8, result has 70.4 percent of original size [2024-11-17 00:31:45,816 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 28 [2024-11-17 00:31:45,819 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-11-17 00:31:45,824 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-17 00:31:46,126 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:31:46,126 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 36 [2024-11-17 00:31:46,140 INFO L349 Elim1Store]: treesize reduction 37, result has 42.2 percent of original size [2024-11-17 00:31:46,140 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 31 [2024-11-17 00:31:46,149 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-11-17 00:31:46,625 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 63 [2024-11-17 00:31:46,630 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 55 treesize of output 45 [2024-11-17 00:31:46,633 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 29 [2024-11-17 00:31:46,647 INFO L349 Elim1Store]: treesize reduction 25, result has 45.7 percent of original size [2024-11-17 00:31:46,647 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 35 [2024-11-17 00:31:46,650 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 19 treesize of output 11 [2024-11-17 00:31:46,946 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 24 [2024-11-17 00:31:46,948 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-17 00:31:46,996 INFO L349 Elim1Store]: treesize reduction 48, result has 61.3 percent of original size [2024-11-17 00:31:46,996 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 30 treesize of output 85 [2024-11-17 00:31:47,148 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 32 treesize of output 12 [2024-11-17 00:31:47,234 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 12 proven. 308 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-17 00:31:47,234 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:31:47,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [182046642] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:31:47,564 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 00:31:47,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 32] total 52 [2024-11-17 00:31:47,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531275588] [2024-11-17 00:31:47,564 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 00:31:47,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2024-11-17 00:31:47,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:31:47,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2024-11-17 00:31:47,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=2940, Unknown=16, NotChecked=0, Total=3192 [2024-11-17 00:31:47,566 INFO L87 Difference]: Start difference. First operand 191 states and 215 transitions. Second operand has 53 states, 52 states have (on average 4.25) internal successors, (221), 50 states have internal predecessors, (221), 10 states have call successors, (11), 4 states have call predecessors, (11), 11 states have return successors, (13), 11 states have call predecessors, (13), 10 states have call successors, (13) [2024-11-17 00:31:50,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:31:50,918 INFO L93 Difference]: Finished difference Result 361 states and 411 transitions. [2024-11-17 00:31:50,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2024-11-17 00:31:50,919 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 52 states have (on average 4.25) internal successors, (221), 50 states have internal predecessors, (221), 10 states have call successors, (11), 4 states have call predecessors, (11), 11 states have return successors, (13), 11 states have call predecessors, (13), 10 states have call successors, (13) Word has length 150 [2024-11-17 00:31:50,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:31:50,920 INFO L225 Difference]: With dead ends: 361 [2024-11-17 00:31:50,920 INFO L226 Difference]: Without dead ends: 361 [2024-11-17 00:31:50,921 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1954 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=763, Invalid=6703, Unknown=16, NotChecked=0, Total=7482 [2024-11-17 00:31:50,922 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 709 mSDsluCounter, 1228 mSDsCounter, 0 mSdLazyCounter, 1682 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 709 SdHoareTripleChecker+Valid, 1288 SdHoareTripleChecker+Invalid, 1720 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 1682 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-17 00:31:50,922 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [709 Valid, 1288 Invalid, 1720 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 1682 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-17 00:31:50,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2024-11-17 00:31:50,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 192. [2024-11-17 00:31:50,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 164 states have (on average 1.2134146341463414) internal successors, (199), 180 states have internal predecessors, (199), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-17 00:31:50,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 215 transitions. [2024-11-17 00:31:50,925 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 215 transitions. Word has length 150 [2024-11-17 00:31:50,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:31:50,926 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 215 transitions. [2024-11-17 00:31:50,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 52 states have (on average 4.25) internal successors, (221), 50 states have internal predecessors, (221), 10 states have call successors, (11), 4 states have call predecessors, (11), 11 states have return successors, (13), 11 states have call predecessors, (13), 10 states have call successors, (13) [2024-11-17 00:31:50,926 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 215 transitions. [2024-11-17 00:31:50,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-17 00:31:50,927 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:31:50,927 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:31:50,945 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2024-11-17 00:31:51,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2024-11-17 00:31:51,128 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 56 more)] === [2024-11-17 00:31:51,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:31:51,128 INFO L85 PathProgramCache]: Analyzing trace with hash 311953264, now seen corresponding path program 1 times [2024-11-17 00:31:51,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:31:51,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094018901] [2024-11-17 00:31:51,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:31:51,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:31:51,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:31:51,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-17 00:31:51,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:31:51,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-17 00:31:51,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:31:51,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-17 00:31:51,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:31:51,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-17 00:31:51,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:31:51,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-17 00:31:51,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:31:51,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-17 00:31:51,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:31:51,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-17 00:31:51,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:31:51,585 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 74 proven. 17 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2024-11-17 00:31:51,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:31:51,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094018901] [2024-11-17 00:31:51,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094018901] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:31:51,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [73809100] [2024-11-17 00:31:51,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:31:51,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:31:51,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:31:51,587 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 00:31:51,588 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2024-11-17 00:31:51,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:31:51,987 INFO L255 TraceCheckSpWp]: Trace formula consists of 1234 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-11-17 00:31:51,993 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:31:52,017 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-17 00:31:52,024 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-17 00:31:52,046 WARN L873 $PredicateComparison]: unable to prove that (exists ((append_~node~0.base Int)) (and (not (= append_~node~0.base 0)) (= |c_#valid| (store |c_old(#valid)| append_~node~0.base (select |c_#valid| append_~node~0.base))))) is different from true [2024-11-17 00:31:52,085 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-17 00:31:52,138 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-17 00:31:52,196 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-17 00:31:52,248 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9