./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 023d838f 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-023d838-m [2024-11-10 15:13:04,602 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 15:13:04,679 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-10 15:13:04,685 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 15:13:04,685 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 15:13:04,714 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 15:13:04,715 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 15:13:04,716 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 15:13:04,717 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 15:13:04,718 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 15:13:04,718 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 15:13:04,719 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 15:13:04,720 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 15:13:04,721 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 15:13:04,722 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 15:13:04,722 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 15:13:04,722 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 15:13:04,723 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 15:13:04,723 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 15:13:04,723 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 15:13:04,725 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-10 15:13:04,725 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-10 15:13:04,726 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-10 15:13:04,726 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 15:13:04,726 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 15:13:04,727 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 15:13:04,727 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 15:13:04,727 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 15:13:04,727 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 15:13:04,728 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 15:13:04,728 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 15:13:04,728 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 15:13:04,729 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 15:13:04,729 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 15:13:04,729 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 15:13:04,730 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 15:13:04,730 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 15:13:04,730 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 15:13:04,731 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 15:13:04,731 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 15:13:04,731 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 15:13:04,732 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 15:13:04,732 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-10 15:13:04,992 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 15:13:05,020 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 15:13:05,024 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 15:13:05,025 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 15:13:05,025 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 15:13:05,026 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-10 15:13:06,400 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 15:13:06,663 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 15:13:06,664 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext2/length_test03-2.i [2024-11-10 15:13:06,676 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/246ad6443/74bad92864714734a9030993377ca98c/FLAG28f883b3b [2024-11-10 15:13:06,979 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/246ad6443/74bad92864714734a9030993377ca98c [2024-11-10 15:13:06,981 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 15:13:06,982 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 15:13:06,984 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 15:13:06,985 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 15:13:06,990 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 15:13:06,991 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:13:06" (1/1) ... [2024-11-10 15:13:06,992 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ab0dd5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:13:06, skipping insertion in model container [2024-11-10 15:13:06,992 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:13:06" (1/1) ... [2024-11-10 15:13:07,037 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 15:13:07,414 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 15:13:07,424 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 15:13:07,493 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 15:13:07,533 INFO L204 MainTranslator]: Completed translation [2024-11-10 15:13:07,534 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:13:07 WrapperNode [2024-11-10 15:13:07,534 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 15:13:07,535 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 15:13:07,536 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 15:13:07,536 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 15:13:07,544 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:13:07" (1/1) ... [2024-11-10 15:13:07,560 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:13:07" (1/1) ... [2024-11-10 15:13:07,582 INFO L138 Inliner]: procedures = 123, calls = 38, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 97 [2024-11-10 15:13:07,582 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 15:13:07,583 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 15:13:07,583 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 15:13:07,583 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 15:13:07,594 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:13:07" (1/1) ... [2024-11-10 15:13:07,594 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:13:07" (1/1) ... [2024-11-10 15:13:07,599 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:13:07" (1/1) ... [2024-11-10 15:13:07,627 INFO L175 MemorySlicer]: Split 25 memory accesses to 3 slices as follows [2, 13, 10]. 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, 7, 6]. [2024-11-10 15:13:07,630 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:13:07" (1/1) ... [2024-11-10 15:13:07,631 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:13:07" (1/1) ... [2024-11-10 15:13:07,641 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:13:07" (1/1) ... [2024-11-10 15:13:07,641 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:13:07" (1/1) ... [2024-11-10 15:13:07,643 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:13:07" (1/1) ... [2024-11-10 15:13:07,644 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:13:07" (1/1) ... [2024-11-10 15:13:07,647 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 15:13:07,648 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 15:13:07,648 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 15:13:07,648 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 15:13:07,652 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:13:07" (1/1) ... [2024-11-10 15:13:07,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 15:13:07,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:13:07,680 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-10 15:13:07,682 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-10 15:13:07,726 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-10 15:13:07,727 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-10 15:13:07,727 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-10 15:13:07,727 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-10 15:13:07,727 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 15:13:07,727 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-10 15:13:07,727 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-10 15:13:07,727 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-10 15:13:07,727 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-10 15:13:07,728 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-10 15:13:07,728 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-10 15:13:07,730 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-10 15:13:07,730 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 15:13:07,730 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-10 15:13:07,730 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-10 15:13:07,730 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 15:13:07,730 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 15:13:07,730 INFO L130 BoogieDeclarations]: Found specification of procedure append [2024-11-10 15:13:07,730 INFO L138 BoogieDeclarations]: Found implementation of procedure append [2024-11-10 15:13:07,824 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 15:13:07,826 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 15:13:08,184 INFO L? ?]: Removed 127 outVars from TransFormulas that were not future-live. [2024-11-10 15:13:08,185 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 15:13:08,206 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 15:13:08,207 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 15:13:08,208 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:13:08 BoogieIcfgContainer [2024-11-10 15:13:08,208 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 15:13:08,212 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 15:13:08,212 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 15:13:08,215 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 15:13:08,216 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 03:13:06" (1/3) ... [2024-11-10 15:13:08,216 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b6b3b36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:13:08, skipping insertion in model container [2024-11-10 15:13:08,217 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:13:07" (2/3) ... [2024-11-10 15:13:08,217 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b6b3b36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:13:08, skipping insertion in model container [2024-11-10 15:13:08,217 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:13:08" (3/3) ... [2024-11-10 15:13:08,218 INFO L112 eAbstractionObserver]: Analyzing ICFG length_test03-2.i [2024-11-10 15:13:08,237 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 15:13:08,237 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 59 error locations. [2024-11-10 15:13:08,292 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 15:13:08,300 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;@26f4c22a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 15:13:08,301 INFO L334 AbstractCegarLoop]: Starting to check reachability of 59 error locations. [2024-11-10 15:13:08,304 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-10 15:13:08,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-10 15:13:08,310 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:13:08,311 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-10 15:13:08,311 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-10 15:13:08,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:13:08,320 INFO L85 PathProgramCache]: Analyzing trace with hash 125085, now seen corresponding path program 1 times [2024-11-10 15:13:08,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:13:08,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601152700] [2024-11-10 15:13:08,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:13:08,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:13:08,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:13:08,535 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-10 15:13:08,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:13:08,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601152700] [2024-11-10 15:13:08,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601152700] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:13:08,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:13:08,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 15:13:08,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137557556] [2024-11-10 15:13:08,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:13:08,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 15:13:08,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:13:08,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 15:13:08,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:13:08,574 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-10 15:13:08,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:13:08,749 INFO L93 Difference]: Finished difference Result 178 states and 187 transitions. [2024-11-10 15:13:08,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 15:13:08,754 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-10 15:13:08,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:13:08,787 INFO L225 Difference]: With dead ends: 178 [2024-11-10 15:13:08,788 INFO L226 Difference]: Without dead ends: 175 [2024-11-10 15:13:08,789 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-10 15:13:08,798 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-10 15:13:08,801 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-10 15:13:08,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2024-11-10 15:13:08,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 131. [2024-11-10 15:13:08,880 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-10 15:13:08,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 137 transitions. [2024-11-10 15:13:08,885 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 137 transitions. Word has length 3 [2024-11-10 15:13:08,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:13:08,885 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 137 transitions. [2024-11-10 15:13:08,885 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-10 15:13:08,886 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 137 transitions. [2024-11-10 15:13:08,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-10 15:13:08,886 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:13:08,886 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-10 15:13:08,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 15:13:08,886 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-10 15:13:08,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:13:08,887 INFO L85 PathProgramCache]: Analyzing trace with hash 125086, now seen corresponding path program 1 times [2024-11-10 15:13:08,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:13:08,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735238673] [2024-11-10 15:13:08,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:13:08,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:13:08,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:13:08,996 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-10 15:13:08,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:13:08,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735238673] [2024-11-10 15:13:08,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735238673] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:13:08,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:13:08,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 15:13:08,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766500172] [2024-11-10 15:13:08,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:13:09,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 15:13:09,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:13:09,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 15:13:09,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:13:09,001 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-10 15:13:09,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:13:09,095 INFO L93 Difference]: Finished difference Result 131 states and 138 transitions. [2024-11-10 15:13:09,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 15:13:09,096 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-10 15:13:09,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:13:09,097 INFO L225 Difference]: With dead ends: 131 [2024-11-10 15:13:09,097 INFO L226 Difference]: Without dead ends: 131 [2024-11-10 15:13:09,098 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-10 15:13:09,099 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-10 15:13:09,100 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-10 15:13:09,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-11-10 15:13:09,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 129. [2024-11-10 15:13:09,109 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-10 15:13:09,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 135 transitions. [2024-11-10 15:13:09,116 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 135 transitions. Word has length 3 [2024-11-10 15:13:09,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:13:09,118 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 135 transitions. [2024-11-10 15:13:09,118 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-10 15:13:09,118 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 135 transitions. [2024-11-10 15:13:09,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-10 15:13:09,119 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:13:09,119 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-10 15:13:09,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 15:13:09,119 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-10 15:13:09,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:13:09,120 INFO L85 PathProgramCache]: Analyzing trace with hash -568501509, now seen corresponding path program 1 times [2024-11-10 15:13:09,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:13:09,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151477758] [2024-11-10 15:13:09,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:13:09,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:13:09,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:13:09,196 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-10 15:13:09,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:13:09,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151477758] [2024-11-10 15:13:09,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151477758] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:13:09,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:13:09,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 15:13:09,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688342936] [2024-11-10 15:13:09,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:13:09,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 15:13:09,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:13:09,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 15:13:09,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:13:09,199 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-10 15:13:09,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:13:09,307 INFO L93 Difference]: Finished difference Result 148 states and 157 transitions. [2024-11-10 15:13:09,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 15:13:09,308 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-10 15:13:09,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:13:09,309 INFO L225 Difference]: With dead ends: 148 [2024-11-10 15:13:09,309 INFO L226 Difference]: Without dead ends: 148 [2024-11-10 15:13:09,309 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-10 15:13:09,310 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-10 15:13:09,311 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-10 15:13:09,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2024-11-10 15:13:09,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 133. [2024-11-10 15:13:09,317 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-10 15:13:09,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 142 transitions. [2024-11-10 15:13:09,320 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 142 transitions. Word has length 6 [2024-11-10 15:13:09,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:13:09,321 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 142 transitions. [2024-11-10 15:13:09,321 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-10 15:13:09,321 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 142 transitions. [2024-11-10 15:13:09,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-10 15:13:09,321 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:13:09,321 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-10 15:13:09,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 15:13:09,322 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-10 15:13:09,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:13:09,322 INFO L85 PathProgramCache]: Analyzing trace with hash -568501508, now seen corresponding path program 1 times [2024-11-10 15:13:09,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:13:09,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347926155] [2024-11-10 15:13:09,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:13:09,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:13:09,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:13:09,464 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-10 15:13:09,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:13:09,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347926155] [2024-11-10 15:13:09,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347926155] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:13:09,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:13:09,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 15:13:09,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225733397] [2024-11-10 15:13:09,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:13:09,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 15:13:09,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:13:09,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 15:13:09,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:13:09,469 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-10 15:13:09,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:13:09,553 INFO L93 Difference]: Finished difference Result 133 states and 143 transitions. [2024-11-10 15:13:09,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 15:13:09,554 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-10 15:13:09,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:13:09,555 INFO L225 Difference]: With dead ends: 133 [2024-11-10 15:13:09,555 INFO L226 Difference]: Without dead ends: 133 [2024-11-10 15:13:09,555 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-10 15:13:09,557 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 4 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-10 15:13:09,559 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-10 15:13:09,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2024-11-10 15:13:09,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 131. [2024-11-10 15:13:09,567 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-10 15:13:09,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 140 transitions. [2024-11-10 15:13:09,573 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 140 transitions. Word has length 6 [2024-11-10 15:13:09,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:13:09,573 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 140 transitions. [2024-11-10 15:13:09,573 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-10 15:13:09,574 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 140 transitions. [2024-11-10 15:13:09,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-10 15:13:09,574 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:13:09,574 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:13:09,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 15:13:09,575 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-10 15:13:09,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:13:09,575 INFO L85 PathProgramCache]: Analyzing trace with hash 1049670910, now seen corresponding path program 1 times [2024-11-10 15:13:09,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:13:09,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220340085] [2024-11-10 15:13:09,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:13:09,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:13:09,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:13:09,713 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-10 15:13:09,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:13:09,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220340085] [2024-11-10 15:13:09,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220340085] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:13:09,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:13:09,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 15:13:09,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36405419] [2024-11-10 15:13:09,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:13:09,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 15:13:09,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:13:09,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 15:13:09,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:13:09,715 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-10 15:13:09,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:13:09,789 INFO L93 Difference]: Finished difference Result 126 states and 135 transitions. [2024-11-10 15:13:09,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 15:13:09,792 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-10 15:13:09,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:13:09,793 INFO L225 Difference]: With dead ends: 126 [2024-11-10 15:13:09,793 INFO L226 Difference]: Without dead ends: 126 [2024-11-10 15:13:09,793 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-10 15:13:09,794 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 35 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:13:09,798 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.1s Time] [2024-11-10 15:13:09,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2024-11-10 15:13:09,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2024-11-10 15:13:09,804 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-10 15:13:09,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 135 transitions. [2024-11-10 15:13:09,805 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 135 transitions. Word has length 12 [2024-11-10 15:13:09,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:13:09,805 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 135 transitions. [2024-11-10 15:13:09,806 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-10 15:13:09,806 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 135 transitions. [2024-11-10 15:13:09,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-10 15:13:09,806 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:13:09,806 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:13:09,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 15:13:09,807 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-10 15:13:09,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:13:09,807 INFO L85 PathProgramCache]: Analyzing trace with hash 1049670909, now seen corresponding path program 1 times [2024-11-10 15:13:09,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:13:09,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73329403] [2024-11-10 15:13:09,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:13:09,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:13:09,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:13:09,945 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-10 15:13:09,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:13:09,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73329403] [2024-11-10 15:13:09,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73329403] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:13:09,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:13:09,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 15:13:09,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180070593] [2024-11-10 15:13:09,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:13:09,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 15:13:09,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:13:09,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 15:13:09,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:13:09,952 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-10 15:13:10,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:13:10,064 INFO L93 Difference]: Finished difference Result 121 states and 130 transitions. [2024-11-10 15:13:10,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 15:13:10,065 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-10 15:13:10,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:13:10,066 INFO L225 Difference]: With dead ends: 121 [2024-11-10 15:13:10,066 INFO L226 Difference]: Without dead ends: 121 [2024-11-10 15:13:10,066 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-10 15:13:10,067 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 35 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-10 15:13:10,067 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-10 15:13:10,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-11-10 15:13:10,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2024-11-10 15:13:10,071 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-10 15:13:10,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 130 transitions. [2024-11-10 15:13:10,072 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 130 transitions. Word has length 12 [2024-11-10 15:13:10,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:13:10,072 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 130 transitions. [2024-11-10 15:13:10,072 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-10 15:13:10,073 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 130 transitions. [2024-11-10 15:13:10,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-10 15:13:10,073 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:13:10,073 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:13:10,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 15:13:10,074 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-10 15:13:10,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:13:10,074 INFO L85 PathProgramCache]: Analyzing trace with hash -1819940080, now seen corresponding path program 1 times [2024-11-10 15:13:10,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:13:10,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729193975] [2024-11-10 15:13:10,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:13:10,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:13:10,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:13:10,291 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-10 15:13:10,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:13:10,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729193975] [2024-11-10 15:13:10,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729193975] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:13:10,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:13:10,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 15:13:10,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637417737] [2024-11-10 15:13:10,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:13:10,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 15:13:10,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:13:10,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 15:13:10,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-10 15:13:10,294 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-10 15:13:10,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:13:10,557 INFO L93 Difference]: Finished difference Result 239 states and 260 transitions. [2024-11-10 15:13:10,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 15:13:10,558 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-10 15:13:10,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:13:10,559 INFO L225 Difference]: With dead ends: 239 [2024-11-10 15:13:10,559 INFO L226 Difference]: Without dead ends: 239 [2024-11-10 15:13:10,560 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-10 15:13:10,561 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-10 15:13:10,561 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-10 15:13:10,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2024-11-10 15:13:10,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 159. [2024-11-10 15:13:10,566 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-10 15:13:10,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 192 transitions. [2024-11-10 15:13:10,567 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 192 transitions. Word has length 13 [2024-11-10 15:13:10,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:13:10,568 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 192 transitions. [2024-11-10 15:13:10,568 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-10 15:13:10,568 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 192 transitions. [2024-11-10 15:13:10,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-10 15:13:10,568 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:13:10,568 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:13:10,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 15:13:10,569 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-10 15:13:10,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:13:10,569 INFO L85 PathProgramCache]: Analyzing trace with hash -1819940079, now seen corresponding path program 1 times [2024-11-10 15:13:10,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:13:10,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350872107] [2024-11-10 15:13:10,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:13:10,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:13:10,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:13:10,896 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-10 15:13:10,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:13:10,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350872107] [2024-11-10 15:13:10,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350872107] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:13:10,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:13:10,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 15:13:10,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105666941] [2024-11-10 15:13:10,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:13:10,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 15:13:10,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:13:10,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 15:13:10,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-10 15:13:10,898 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-10 15:13:11,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:13:11,220 INFO L93 Difference]: Finished difference Result 283 states and 306 transitions. [2024-11-10 15:13:11,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 15:13:11,221 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-10 15:13:11,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:13:11,222 INFO L225 Difference]: With dead ends: 283 [2024-11-10 15:13:11,222 INFO L226 Difference]: Without dead ends: 283 [2024-11-10 15:13:11,222 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-10 15:13:11,223 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.3s IncrementalHoareTripleChecker+Time [2024-11-10 15:13:11,223 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.3s Time] [2024-11-10 15:13:11,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2024-11-10 15:13:11,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 158. [2024-11-10 15:13:11,231 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-10 15:13:11,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 182 transitions. [2024-11-10 15:13:11,234 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 182 transitions. Word has length 13 [2024-11-10 15:13:11,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:13:11,234 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 182 transitions. [2024-11-10 15:13:11,234 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-10 15:13:11,234 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 182 transitions. [2024-11-10 15:13:11,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-10 15:13:11,235 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:13:11,235 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-10 15:13:11,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 15:13:11,236 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-10 15:13:11,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:13:11,238 INFO L85 PathProgramCache]: Analyzing trace with hash -1374621299, now seen corresponding path program 1 times [2024-11-10 15:13:11,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:13:11,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105660027] [2024-11-10 15:13:11,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:13:11,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:13:11,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:13:11,670 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-10 15:13:11,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:13:11,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105660027] [2024-11-10 15:13:11,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105660027] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:13:11,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:13:11,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 15:13:11,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553764025] [2024-11-10 15:13:11,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:13:11,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 15:13:11,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:13:11,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 15:13:11,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-10 15:13:11,674 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-10 15:13:11,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:13:11,841 INFO L93 Difference]: Finished difference Result 179 states and 205 transitions. [2024-11-10 15:13:11,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 15:13:11,842 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-10 15:13:11,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:13:11,843 INFO L225 Difference]: With dead ends: 179 [2024-11-10 15:13:11,843 INFO L226 Difference]: Without dead ends: 179 [2024-11-10 15:13:11,843 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-10 15:13:11,844 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-10 15:13:11,844 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-10 15:13:11,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2024-11-10 15:13:11,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 165. [2024-11-10 15:13:11,850 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-10 15:13:11,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 190 transitions. [2024-11-10 15:13:11,851 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 190 transitions. Word has length 22 [2024-11-10 15:13:11,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:13:11,851 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 190 transitions. [2024-11-10 15:13:11,851 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-10 15:13:11,852 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 190 transitions. [2024-11-10 15:13:11,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-10 15:13:11,853 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:13:11,853 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-10 15:13:11,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 15:13:11,854 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-10 15:13:11,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:13:11,858 INFO L85 PathProgramCache]: Analyzing trace with hash 2079533679, now seen corresponding path program 1 times [2024-11-10 15:13:11,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:13:11,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044537997] [2024-11-10 15:13:11,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:13:11,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:13:11,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:13:12,271 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-10 15:13:12,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:13:12,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044537997] [2024-11-10 15:13:12,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044537997] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:13:12,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:13:12,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-10 15:13:12,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122159932] [2024-11-10 15:13:12,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:13:12,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-10 15:13:12,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:13:12,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-10 15:13:12,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-11-10 15:13:12,274 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-10 15:13:12,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:13:12,592 INFO L93 Difference]: Finished difference Result 211 states and 238 transitions. [2024-11-10 15:13:12,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 15:13:12,592 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-10 15:13:12,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:13:12,593 INFO L225 Difference]: With dead ends: 211 [2024-11-10 15:13:12,594 INFO L226 Difference]: Without dead ends: 211 [2024-11-10 15:13:12,594 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-10 15:13:12,594 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-10 15:13:12,595 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-10 15:13:12,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2024-11-10 15:13:12,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 168. [2024-11-10 15:13:12,598 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-10 15:13:12,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 193 transitions. [2024-11-10 15:13:12,599 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 193 transitions. Word has length 24 [2024-11-10 15:13:12,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:13:12,599 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 193 transitions. [2024-11-10 15:13:12,599 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-10 15:13:12,600 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 193 transitions. [2024-11-10 15:13:12,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-10 15:13:12,600 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:13:12,601 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-10 15:13:12,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 15:13:12,601 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-10 15:13:12,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:13:12,601 INFO L85 PathProgramCache]: Analyzing trace with hash 2118253128, now seen corresponding path program 1 times [2024-11-10 15:13:12,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:13:12,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528688123] [2024-11-10 15:13:12,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:13:12,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:13:12,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:13:12,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-10 15:13:12,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:13:12,709 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-10 15:13:12,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:13:12,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528688123] [2024-11-10 15:13:12,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528688123] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:13:12,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:13:12,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 15:13:12,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496229226] [2024-11-10 15:13:12,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:13:12,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 15:13:12,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:13:12,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 15:13:12,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 15:13:12,712 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-10 15:13:12,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:13:12,805 INFO L93 Difference]: Finished difference Result 157 states and 168 transitions. [2024-11-10 15:13:12,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 15:13:12,806 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-10 15:13:12,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:13:12,807 INFO L225 Difference]: With dead ends: 157 [2024-11-10 15:13:12,807 INFO L226 Difference]: Without dead ends: 157 [2024-11-10 15:13:12,807 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-10 15:13:12,808 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-10 15:13:12,808 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-10 15:13:12,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2024-11-10 15:13:12,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 144. [2024-11-10 15:13:12,811 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-10 15:13:12,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 154 transitions. [2024-11-10 15:13:12,812 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 154 transitions. Word has length 32 [2024-11-10 15:13:12,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:13:12,812 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 154 transitions. [2024-11-10 15:13:12,813 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-10 15:13:12,813 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 154 transitions. [2024-11-10 15:13:12,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-10 15:13:12,813 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:13:12,814 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-10 15:13:12,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-10 15:13:12,814 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-10 15:13:12,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:13:12,814 INFO L85 PathProgramCache]: Analyzing trace with hash 1245769459, now seen corresponding path program 1 times [2024-11-10 15:13:12,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:13:12,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374454562] [2024-11-10 15:13:12,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:13:12,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:13:12,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:13:13,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-10 15:13:13,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:13:13,144 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-10 15:13:13,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:13:13,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374454562] [2024-11-10 15:13:13,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374454562] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:13:13,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1208510460] [2024-11-10 15:13:13,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:13:13,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:13:13,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:13:13,150 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-10 15:13:13,151 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-10 15:13:13,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:13:13,310 INFO L255 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-10 15:13:13,328 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:13:13,375 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-10 15:13:13,418 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-10 15:13:13,481 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-10 15:13:13,481 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-10 15:13:13,511 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-10 15:13:13,512 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-10 15:13:13,525 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-10 15:13:13,525 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:13:13,725 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-10 15:13:13,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1208510460] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 15:13:13,726 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 15:13:13,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 5] total 11 [2024-11-10 15:13:13,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982628008] [2024-11-10 15:13:13,727 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 15:13:13,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-10 15:13:13,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:13:13,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-10 15:13:13,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=83, Unknown=1, NotChecked=18, Total=132 [2024-11-10 15:13:13,728 INFO L87 Difference]: Start difference. First operand 144 states and 154 transitions. Second operand has 12 states, 11 states have (on average 5.454545454545454) internal successors, (60), 9 states have internal predecessors, (60), 1 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 15:13:14,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:13:14,233 INFO L93 Difference]: Finished difference Result 184 states and 198 transitions. [2024-11-10 15:13:14,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-10 15:13:14,234 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.454545454545454) internal successors, (60), 9 states have internal predecessors, (60), 1 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 33 [2024-11-10 15:13:14,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:13:14,235 INFO L225 Difference]: With dead ends: 184 [2024-11-10 15:13:14,235 INFO L226 Difference]: Without dead ends: 184 [2024-11-10 15:13:14,235 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 58 SyntacticMatches, 5 SemanticMatches, 21 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=125, Invalid=340, Unknown=1, NotChecked=40, Total=506 [2024-11-10 15:13:14,236 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 130 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 406 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 574 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 159 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 15:13:14,236 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 393 Invalid, 574 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 406 Invalid, 0 Unknown, 159 Unchecked, 0.3s Time] [2024-11-10 15:13:14,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2024-11-10 15:13:14,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 153. [2024-11-10 15:13:14,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 114 states have (on average 1.394736842105263) internal successors, (159), 147 states have internal predecessors, (159), 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-10 15:13:14,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 166 transitions. [2024-11-10 15:13:14,240 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 166 transitions. Word has length 33 [2024-11-10 15:13:14,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:13:14,241 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 166 transitions. [2024-11-10 15:13:14,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.454545454545454) internal successors, (60), 9 states have internal predecessors, (60), 1 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 15:13:14,241 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 166 transitions. [2024-11-10 15:13:14,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-10 15:13:14,242 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:13:14,242 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-10 15:13:14,260 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-10 15:13:14,446 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-10 15:13:14,447 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-10 15:13:14,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:13:14,447 INFO L85 PathProgramCache]: Analyzing trace with hash 1245769460, now seen corresponding path program 1 times [2024-11-10 15:13:14,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:13:14,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022956341] [2024-11-10 15:13:14,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:13:14,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:13:14,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:13:14,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-10 15:13:14,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:13:14,885 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-10 15:13:14,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:13:14,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022956341] [2024-11-10 15:13:14,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022956341] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:13:14,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [644768956] [2024-11-10 15:13:14,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:13:14,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:13:14,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:13:14,888 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-10 15:13:14,892 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-10 15:13:15,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:13:15,034 INFO L255 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-10 15:13:15,037 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:13:15,052 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-10 15:13:15,058 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-10 15:13:15,119 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-10 15:13:15,243 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-10 15:13:15,244 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-10 15:13:15,252 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-10 15:13:15,411 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:13:15,413 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-10 15:13:15,427 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-11-10 15:13:15,427 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-10 15:13:15,437 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-10 15:13:15,437 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:13:15,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [644768956] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:13:15,735 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 15:13:15,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2024-11-10 15:13:15,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051816033] [2024-11-10 15:13:15,736 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 15:13:15,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-10 15:13:15,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:13:15,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-10 15:13:15,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=197, Unknown=1, NotChecked=28, Total=272 [2024-11-10 15:13:15,737 INFO L87 Difference]: Start difference. First operand 153 states and 166 transitions. Second operand has 13 states, 12 states have (on average 4.25) internal successors, (51), 9 states have internal predecessors, (51), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 15:13:21,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:13:21,273 INFO L93 Difference]: Finished difference Result 342 states and 377 transitions. [2024-11-10 15:13:21,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-10 15:13:21,273 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 4.25) internal successors, (51), 9 states have internal predecessors, (51), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 33 [2024-11-10 15:13:21,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:13:21,276 INFO L225 Difference]: With dead ends: 342 [2024-11-10 15:13:21,276 INFO L226 Difference]: Without dead ends: 342 [2024-11-10 15:13:21,276 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=200, Invalid=794, Unknown=2, NotChecked=60, Total=1056 [2024-11-10 15:13:21,278 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 266 mSDsluCounter, 426 mSDsCounter, 0 mSdLazyCounter, 614 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 266 SdHoareTripleChecker+Valid, 504 SdHoareTripleChecker+Invalid, 927 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 614 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 281 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-10 15:13:21,278 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [266 Valid, 504 Invalid, 927 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 614 Invalid, 0 Unknown, 281 Unchecked, 0.7s Time] [2024-11-10 15:13:21,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2024-11-10 15:13:21,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 219. [2024-11-10 15:13:21,284 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-10 15:13:21,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 261 transitions. [2024-11-10 15:13:21,285 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 261 transitions. Word has length 33 [2024-11-10 15:13:21,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:13:21,285 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 261 transitions. [2024-11-10 15:13:21,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.25) internal successors, (51), 9 states have internal predecessors, (51), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 15:13:21,286 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 261 transitions. [2024-11-10 15:13:21,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-10 15:13:21,287 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:13:21,287 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-10 15:13:21,306 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-10 15:13:21,487 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-10 15:13:21,488 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-10 15:13:21,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:13:21,489 INFO L85 PathProgramCache]: Analyzing trace with hash 195993863, now seen corresponding path program 1 times [2024-11-10 15:13:21,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:13:21,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605181438] [2024-11-10 15:13:21,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:13:21,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:13:21,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:13:22,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-10 15:13:22,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:13:22,270 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-10 15:13:22,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:13:22,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605181438] [2024-11-10 15:13:22,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605181438] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:13:22,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2112682460] [2024-11-10 15:13:22,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:13:22,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:13:22,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:13:22,273 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-10 15:13:22,275 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-10 15:13:22,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:13:22,432 INFO L255 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-10 15:13:22,436 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:13:22,447 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-10 15:13:22,537 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-10 15:13:22,630 INFO L349 Elim1Store]: treesize reduction 38, result has 36.7 percent of original size [2024-11-10 15:13:22,630 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-10 15:13:22,681 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-10 15:13:22,684 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-10 15:13:22,684 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:13:22,915 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 34 [2024-11-10 15:13:23,569 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-10 15:13:23,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2112682460] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 15:13:23,569 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 15:13:23,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 6, 6] total 19 [2024-11-10 15:13:23,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172754092] [2024-11-10 15:13:23,569 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 15:13:23,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-10 15:13:23,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:13:23,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-10 15:13:23,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=327, Unknown=0, NotChecked=0, Total=380 [2024-11-10 15:13:23,571 INFO L87 Difference]: Start difference. First operand 219 states and 261 transitions. Second operand has 20 states, 19 states have (on average 4.684210526315789) internal successors, (89), 18 states have internal predecessors, (89), 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-10 15:13:24,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:13:24,397 INFO L93 Difference]: Finished difference Result 228 states and 269 transitions. [2024-11-10 15:13:24,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-10 15:13:24,398 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 4.684210526315789) internal successors, (89), 18 states have internal predecessors, (89), 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-10 15:13:24,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:13:24,399 INFO L225 Difference]: With dead ends: 228 [2024-11-10 15:13:24,399 INFO L226 Difference]: Without dead ends: 228 [2024-11-10 15:13:24,400 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=102, Invalid=498, Unknown=0, NotChecked=0, Total=600 [2024-11-10 15:13:24,400 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 179 mSDsluCounter, 672 mSDsCounter, 0 mSdLazyCounter, 778 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 762 SdHoareTripleChecker+Invalid, 801 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 778 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-10 15:13:24,400 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 762 Invalid, 801 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 778 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-10 15:13:24,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2024-11-10 15:13:24,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 225. [2024-11-10 15:13:24,405 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-10 15:13:24,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 265 transitions. [2024-11-10 15:13:24,406 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 265 transitions. Word has length 40 [2024-11-10 15:13:24,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:13:24,406 INFO L471 AbstractCegarLoop]: Abstraction has 225 states and 265 transitions. [2024-11-10 15:13:24,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 4.684210526315789) internal successors, (89), 18 states have internal predecessors, (89), 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-10 15:13:24,407 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 265 transitions. [2024-11-10 15:13:24,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-10 15:13:24,410 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:13:24,410 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-10 15:13:24,427 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-10 15:13:24,611 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-10 15:13:24,611 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-10 15:13:24,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:13:24,612 INFO L85 PathProgramCache]: Analyzing trace with hash 195993864, now seen corresponding path program 1 times [2024-11-10 15:13:24,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:13:24,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837509551] [2024-11-10 15:13:24,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:13:24,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:13:24,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:13:25,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-10 15:13:25,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:13:25,889 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-10 15:13:25,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:13:25,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837509551] [2024-11-10 15:13:25,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837509551] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:13:25,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [748965375] [2024-11-10 15:13:25,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:13:25,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:13:25,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:13:25,892 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-10 15:13:25,893 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-10 15:13:26,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:13:26,035 INFO L255 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-11-10 15:13:26,038 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:13:26,052 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-10 15:13:26,083 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-10 15:13:26,251 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-10 15:13:26,258 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-10 15:13:26,429 INFO L349 Elim1Store]: treesize reduction 4, result has 71.4 percent of original size [2024-11-10 15:13:26,430 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-10 15:13:26,435 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-10 15:13:26,492 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-10 15:13:26,499 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-10 15:13:26,500 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:13:27,047 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-10 15:13:27,054 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-10 15:13:27,089 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-10 15:13:27,437 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-10 15:13:27,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [748965375] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 15:13:27,437 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 15:13:27,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 6, 6] total 24 [2024-11-10 15:13:27,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293514026] [2024-11-10 15:13:27,438 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 15:13:27,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-10 15:13:27,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:13:27,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-10 15:13:27,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=531, Unknown=0, NotChecked=0, Total=600 [2024-11-10 15:13:27,439 INFO L87 Difference]: Start difference. First operand 225 states and 265 transitions. Second operand has 25 states, 24 states have (on average 3.75) internal successors, (90), 23 states have internal predecessors, (90), 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-10 15:13:28,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:13:28,722 INFO L93 Difference]: Finished difference Result 274 states and 326 transitions. [2024-11-10 15:13:28,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-10 15:13:28,722 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 3.75) internal successors, (90), 23 states have internal predecessors, (90), 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-10 15:13:28,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:13:28,724 INFO L225 Difference]: With dead ends: 274 [2024-11-10 15:13:28,724 INFO L226 Difference]: Without dead ends: 274 [2024-11-10 15:13:28,724 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 260 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=164, Invalid=1096, Unknown=0, NotChecked=0, Total=1260 [2024-11-10 15:13:28,725 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 217 mSDsluCounter, 765 mSDsCounter, 0 mSdLazyCounter, 1069 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 837 SdHoareTripleChecker+Invalid, 1095 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1069 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-10 15:13:28,725 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 837 Invalid, 1095 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1069 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-10 15:13:28,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2024-11-10 15:13:28,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 225. [2024-11-10 15:13:28,730 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-10 15:13:28,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 264 transitions. [2024-11-10 15:13:28,731 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 264 transitions. Word has length 40 [2024-11-10 15:13:28,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:13:28,731 INFO L471 AbstractCegarLoop]: Abstraction has 225 states and 264 transitions. [2024-11-10 15:13:28,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 3.75) internal successors, (90), 23 states have internal predecessors, (90), 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-10 15:13:28,732 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 264 transitions. [2024-11-10 15:13:28,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-10 15:13:28,732 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:13:28,732 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-10 15:13:28,749 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-10 15:13:28,933 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-10 15:13:28,933 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-10 15:13:28,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:13:28,934 INFO L85 PathProgramCache]: Analyzing trace with hash -752313078, now seen corresponding path program 1 times [2024-11-10 15:13:28,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:13:28,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751778476] [2024-11-10 15:13:28,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:13:28,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:13:28,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:13:29,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-10 15:13:29,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:13:29,685 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-10 15:13:29,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:13:29,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751778476] [2024-11-10 15:13:29,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751778476] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:13:29,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2101246503] [2024-11-10 15:13:29,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:13:29,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:13:29,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:13:29,688 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-10 15:13:29,690 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-10 15:13:29,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:13:29,846 INFO L255 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-11-10 15:13:29,848 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:13:29,852 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-10 15:13:29,862 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-10 15:13:29,862 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-10 15:13:29,873 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-10 15:13:29,879 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-10 15:13:29,889 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2024-11-10 15:13:29,899 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2024-11-10 15:13:30,386 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-10 15:13:30,386 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:13:30,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2101246503] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:13:30,537 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 15:13:30,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 19 [2024-11-10 15:13:30,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41568026] [2024-11-10 15:13:30,537 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 15:13:30,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-10 15:13:30,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:13:30,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-10 15:13:30,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=315, Unknown=9, NotChecked=0, Total=380 [2024-11-10 15:13:30,538 INFO L87 Difference]: Start difference. First operand 225 states and 264 transitions. Second operand has 19 states, 19 states have (on average 2.789473684210526) internal successors, (53), 15 states have internal predecessors, (53), 4 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 15:13:31,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:13:31,268 INFO L93 Difference]: Finished difference Result 316 states and 372 transitions. [2024-11-10 15:13:31,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-10 15:13:31,269 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.789473684210526) internal successors, (53), 15 states have internal predecessors, (53), 4 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 42 [2024-11-10 15:13:31,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:13:31,271 INFO L225 Difference]: With dead ends: 316 [2024-11-10 15:13:31,271 INFO L226 Difference]: Without dead ends: 316 [2024-11-10 15:13:31,271 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=130, Invalid=617, Unknown=9, NotChecked=0, Total=756 [2024-11-10 15:13:31,272 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 253 mSDsluCounter, 673 mSDsCounter, 0 mSdLazyCounter, 690 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 748 SdHoareTripleChecker+Invalid, 700 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 690 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 15:13:31,272 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 748 Invalid, 700 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 690 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-10 15:13:31,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2024-11-10 15:13:31,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 237. [2024-11-10 15:13:31,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 192 states have (on average 1.3697916666666667) internal successors, (263), 225 states have internal predecessors, (263), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (9), 5 states have call predecessors, (9), 7 states have call successors, (9) [2024-11-10 15:13:31,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 279 transitions. [2024-11-10 15:13:31,278 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 279 transitions. Word has length 42 [2024-11-10 15:13:31,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:13:31,279 INFO L471 AbstractCegarLoop]: Abstraction has 237 states and 279 transitions. [2024-11-10 15:13:31,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.789473684210526) internal successors, (53), 15 states have internal predecessors, (53), 4 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 15:13:31,279 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 279 transitions. [2024-11-10 15:13:31,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-10 15:13:31,279 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:13:31,280 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-10 15:13:31,298 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-10 15:13:31,480 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-10 15:13:31,481 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-10 15:13:31,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:13:31,482 INFO L85 PathProgramCache]: Analyzing trace with hash -1177687380, now seen corresponding path program 1 times [2024-11-10 15:13:31,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:13:31,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086115734] [2024-11-10 15:13:31,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:13:31,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:13:31,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:13:32,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-10 15:13:32,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:13:32,634 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-10 15:13:32,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:13:32,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086115734] [2024-11-10 15:13:32,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086115734] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:13:32,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [895418968] [2024-11-10 15:13:32,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:13:32,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:13:32,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:13:32,637 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-10 15:13:32,639 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-10 15:13:32,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:13:32,817 INFO L255 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-11-10 15:13:32,820 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:13:32,829 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-10 15:13:32,868 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-10 15:13:32,869 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-10 15:13:32,900 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 13 treesize of output 9 [2024-11-10 15:13:32,905 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 13 treesize of output 9 [2024-11-10 15:13:37,205 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~list2~0#1.offset| 4))) (and (or (exists ((|v_#memory_$Pointer$#1.base_BEFORE_CALL_7| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_#memory_$Pointer$#1.base_BEFORE_CALL_7| |c_#memory_$Pointer$#1.base|))) (and (= (select (select |v_#memory_$Pointer$#1.base_BEFORE_CALL_7| |c_ULTIMATE.start_main_~list2~0#1.base|) .cse0) 0) (not (= |c_ULTIMATE.start_main_~list2~0#1.base| .cse1)) (= (store |v_#memory_$Pointer$#1.base_BEFORE_CALL_7| .cse1 (select |c_#memory_$Pointer$#1.base| .cse1)) |c_#memory_$Pointer$#1.base|)))) (= (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~list2~0#1.base|) .cse0) 0)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~list2~0#1.base|) .cse0) 0))) is different from false [2024-11-10 15:13:37,215 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~list2~0#1.offset| 4))) (and (or (exists ((|v_#memory_$Pointer$#1.base_BEFORE_CALL_7| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_#memory_$Pointer$#1.base_BEFORE_CALL_7| |c_#memory_$Pointer$#1.base|))) (and (= (select (select |v_#memory_$Pointer$#1.base_BEFORE_CALL_7| |c_ULTIMATE.start_main_~list2~0#1.base|) .cse0) 0) (not (= |c_ULTIMATE.start_main_~list2~0#1.base| .cse1)) (= (store |v_#memory_$Pointer$#1.base_BEFORE_CALL_7| .cse1 (select |c_#memory_$Pointer$#1.base| .cse1)) |c_#memory_$Pointer$#1.base|)))) (= (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~list2~0#1.base|) .cse0) 0)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~list2~0#1.base|) .cse0) 0))) is different from true [2024-11-10 15:13:37,378 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-10 15:13:37,378 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:13:37,478 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~list2~0#1.offset| 4))) (and (forall ((v_ArrVal_1521 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_1521) |c_ULTIMATE.start_main_~list2~0#1.base|) .cse0) 0)) (forall ((v_ArrVal_1520 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_1520) |c_ULTIMATE.start_main_~list2~0#1.base|) .cse0) 0)))) is different from false [2024-11-10 15:13:37,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [895418968] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:13:37,479 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 15:13:37,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 25 [2024-11-10 15:13:37,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550475237] [2024-11-10 15:13:37,480 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 15:13:37,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-10 15:13:37,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:13:37,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-10 15:13:37,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=484, Unknown=3, NotChecked=90, Total=650 [2024-11-10 15:13:37,481 INFO L87 Difference]: Start difference. First operand 237 states and 279 transitions. Second operand has 25 states, 25 states have (on average 2.52) internal successors, (63), 20 states have internal predecessors, (63), 4 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 15:13:41,670 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~list2~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_main_~list2~0#1.offset| 4)) (.cse3 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~list2~0#1.base|))) (and (= (select .cse0 4) 0) (= |c_ULTIMATE.start_main_~list~0#1.offset| 0) (or (exists ((|v_#memory_$Pointer$#1.base_BEFORE_CALL_7| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_#memory_$Pointer$#1.base_BEFORE_CALL_7| |c_#memory_$Pointer$#1.base|))) (and (= (select (select |v_#memory_$Pointer$#1.base_BEFORE_CALL_7| |c_ULTIMATE.start_main_~list2~0#1.base|) .cse1) 0) (not (= |c_ULTIMATE.start_main_~list2~0#1.base| .cse2)) (= (store |v_#memory_$Pointer$#1.base_BEFORE_CALL_7| .cse2 (select |c_#memory_$Pointer$#1.base| .cse2)) |c_#memory_$Pointer$#1.base|)))) (= (select .cse0 .cse1) 0)) (= |c_ULTIMATE.start_main_~list2~0#1.offset| 0) (= (select .cse3 .cse1) 0) (= (select .cse3 4) 0) (not (= |c_ULTIMATE.start_main_~list~0#1.base| |c_ULTIMATE.start_main_~list2~0#1.base|)))) is different from false [2024-11-10 15:13:41,674 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~list2~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_main_~list2~0#1.offset| 4)) (.cse3 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~list2~0#1.base|))) (and (= (select .cse0 4) 0) (= |c_ULTIMATE.start_main_~list~0#1.offset| 0) (or (exists ((|v_#memory_$Pointer$#1.base_BEFORE_CALL_7| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_#memory_$Pointer$#1.base_BEFORE_CALL_7| |c_#memory_$Pointer$#1.base|))) (and (= (select (select |v_#memory_$Pointer$#1.base_BEFORE_CALL_7| |c_ULTIMATE.start_main_~list2~0#1.base|) .cse1) 0) (not (= |c_ULTIMATE.start_main_~list2~0#1.base| .cse2)) (= (store |v_#memory_$Pointer$#1.base_BEFORE_CALL_7| .cse2 (select |c_#memory_$Pointer$#1.base| .cse2)) |c_#memory_$Pointer$#1.base|)))) (= (select .cse0 .cse1) 0)) (= |c_ULTIMATE.start_main_~list2~0#1.offset| 0) (= (select .cse3 .cse1) 0) (= (select .cse3 4) 0) (not (= |c_ULTIMATE.start_main_~list~0#1.base| |c_ULTIMATE.start_main_~list2~0#1.base|)))) is different from true [2024-11-10 15:13:42,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:13:42,240 INFO L93 Difference]: Finished difference Result 302 states and 359 transitions. [2024-11-10 15:13:42,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-10 15:13:42,241 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.52) internal successors, (63), 20 states have internal predecessors, (63), 4 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 44 [2024-11-10 15:13:42,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:13:42,242 INFO L225 Difference]: With dead ends: 302 [2024-11-10 15:13:42,242 INFO L226 Difference]: Without dead ends: 302 [2024-11-10 15:13:42,242 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=148, Invalid=789, Unknown=5, NotChecked=180, Total=1122 [2024-11-10 15:13:42,243 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 91 mSDsluCounter, 1105 mSDsCounter, 0 mSdLazyCounter, 888 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 1184 SdHoareTripleChecker+Invalid, 1092 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 888 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 191 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-10 15:13:42,243 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 1184 Invalid, 1092 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 888 Invalid, 0 Unknown, 191 Unchecked, 0.6s Time] [2024-11-10 15:13:42,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2024-11-10 15:13:42,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 251. [2024-11-10 15:13:42,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 205 states have (on average 1.351219512195122) internal successors, (277), 237 states have internal predecessors, (277), 8 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (10), 6 states have call predecessors, (10), 8 states have call successors, (10) [2024-11-10 15:13:42,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 295 transitions. [2024-11-10 15:13:42,253 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 295 transitions. Word has length 44 [2024-11-10 15:13:42,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:13:42,253 INFO L471 AbstractCegarLoop]: Abstraction has 251 states and 295 transitions. [2024-11-10 15:13:42,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.52) internal successors, (63), 20 states have internal predecessors, (63), 4 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 15:13:42,254 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 295 transitions. [2024-11-10 15:13:42,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-10 15:13:42,254 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:13:42,254 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-10 15:13:42,274 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-10 15:13:42,454 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-10 15:13:42,455 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-10 15:13:42,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:13:42,455 INFO L85 PathProgramCache]: Analyzing trace with hash 811368240, now seen corresponding path program 1 times [2024-11-10 15:13:42,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:13:42,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193178309] [2024-11-10 15:13:42,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:13:42,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:13:42,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:13:42,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-10 15:13:42,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:13:42,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-10 15:13:42,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:13:42,590 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-10 15:13:42,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:13:42,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193178309] [2024-11-10 15:13:42,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193178309] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:13:42,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1287212463] [2024-11-10 15:13:42,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:13:42,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:13:42,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:13:42,594 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-10 15:13:42,595 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-10 15:13:42,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:13:42,813 INFO L255 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 15:13:42,815 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:13:42,844 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-10 15:13:42,844 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:13:42,885 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-10 15:13:42,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1287212463] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 15:13:42,886 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 15:13:42,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8 [2024-11-10 15:13:42,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930823620] [2024-11-10 15:13:42,886 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 15:13:42,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 15:13:42,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:13:42,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 15:13:42,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-11-10 15:13:42,889 INFO L87 Difference]: Start difference. First operand 251 states and 295 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-10 15:13:43,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:13:43,058 INFO L93 Difference]: Finished difference Result 315 states and 373 transitions. [2024-11-10 15:13:43,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 15:13:43,059 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-10 15:13:43,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:13:43,060 INFO L225 Difference]: With dead ends: 315 [2024-11-10 15:13:43,061 INFO L226 Difference]: Without dead ends: 315 [2024-11-10 15:13:43,061 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-11-10 15:13:43,061 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 76 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 15:13:43,062 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 282 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 15:13:43,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2024-11-10 15:13:43,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 305. [2024-11-10 15:13:43,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 255 states have (on average 1.3607843137254902) internal successors, (347), 285 states have internal predecessors, (347), 12 states have call successors, (12), 7 states have call predecessors, (12), 5 states have return successors, (14), 12 states have call predecessors, (14), 12 states have call successors, (14) [2024-11-10 15:13:43,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 373 transitions. [2024-11-10 15:13:43,072 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 373 transitions. Word has length 48 [2024-11-10 15:13:43,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:13:43,072 INFO L471 AbstractCegarLoop]: Abstraction has 305 states and 373 transitions. [2024-11-10 15:13:43,072 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-10 15:13:43,072 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 373 transitions. [2024-11-10 15:13:43,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-10 15:13:43,073 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:13:43,073 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-10 15:13:43,097 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-10 15:13:43,277 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-10 15:13:43,278 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 56 more)] === [2024-11-10 15:13:43,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:13:43,279 INFO L85 PathProgramCache]: Analyzing trace with hash 1317601199, now seen corresponding path program 1 times [2024-11-10 15:13:43,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:13:43,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397516527] [2024-11-10 15:13:43,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:13:43,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:13:43,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:13:43,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-10 15:13:43,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:13:43,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-10 15:13:43,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:13:44,033 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-10 15:13:44,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:13:44,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397516527] [2024-11-10 15:13:44,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397516527] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:13:44,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [826526153] [2024-11-10 15:13:44,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:13:44,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:13:44,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:13:44,035 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-10 15:13:44,036 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-10 15:13:44,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:13:44,241 INFO L255 TraceCheckSpWp]: Trace formula consists of 526 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-10 15:13:44,244 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:13:44,253 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-10 15:13:44,343 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-10 15:13:44,417 INFO L349 Elim1Store]: treesize reduction 33, result has 25.0 percent of original size [2024-11-10 15:13:44,418 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 20 [2024-11-10 15:13:44,523 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-10 15:13:44,533 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-10 15:13:44,533 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:13:44,640 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-10 15:13:44,807 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-10 15:13:44,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [826526153] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 15:13:44,808 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 15:13:44,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 7, 6] total 21 [2024-11-10 15:13:44,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047451301] [2024-11-10 15:13:44,808 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 15:13:44,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-10 15:13:44,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:13:44,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-10 15:13:44,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2024-11-10 15:13:44,809 INFO L87 Difference]: Start difference. First operand 305 states and 373 transitions. Second operand has 22 states, 21 states have (on average 5.571428571428571) internal successors, (117), 20 states have internal predecessors, (117), 5 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-10 15:13:45,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:13:45,802 INFO L93 Difference]: Finished difference Result 392 states and 472 transitions. [2024-11-10 15:13:45,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-10 15:13:45,803 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 5.571428571428571) internal successors, (117), 20 states have internal predecessors, (117), 5 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 60 [2024-11-10 15:13:45,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:13:45,805 INFO L225 Difference]: With dead ends: 392 [2024-11-10 15:13:45,806 INFO L226 Difference]: Without dead ends: 392 [2024-11-10 15:13:45,806 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 115 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=128, Invalid=684, Unknown=0, NotChecked=0, Total=812 [2024-11-10 15:13:45,807 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 323 mSDsluCounter, 660 mSDsCounter, 0 mSdLazyCounter, 966 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 325 SdHoareTripleChecker+Valid, 734 SdHoareTripleChecker+Invalid, 978 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 966 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-10 15:13:45,807 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [325 Valid, 734 Invalid, 978 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 966 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-10 15:13:45,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2024-11-10 15:13:45,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 307. [2024-11-10 15:13:45,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 256 states have (on average 1.32421875) internal successors, (339), 287 states have internal predecessors, (339), 12 states have call successors, (12), 7 states have call predecessors, (12), 7 states have return successors, (14), 12 states have call predecessors, (14), 12 states have call successors, (14) [2024-11-10 15:13:45,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 365 transitions. [2024-11-10 15:13:45,814 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 365 transitions. Word has length 60 [2024-11-10 15:13:45,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:13:45,814 INFO L471 AbstractCegarLoop]: Abstraction has 307 states and 365 transitions. [2024-11-10 15:13:45,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 5.571428571428571) internal successors, (117), 20 states have internal predecessors, (117), 5 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-10 15:13:45,815 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 365 transitions. [2024-11-10 15:13:45,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-10 15:13:45,815 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:13:45,816 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-10 15:13:45,834 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-10 15:13:46,019 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-10 15:13:46,020 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting appendErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 56 more)] === [2024-11-10 15:13:46,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:13:46,020 INFO L85 PathProgramCache]: Analyzing trace with hash 1317601200, now seen corresponding path program 1 times [2024-11-10 15:13:46,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:13:46,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16310854] [2024-11-10 15:13:46,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:13:46,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:13:46,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:13:47,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-10 15:13:47,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:13:47,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-10 15:13:47,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:13:47,829 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 3 proven. 25 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-10 15:13:47,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:13:47,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16310854] [2024-11-10 15:13:47,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16310854] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:13:47,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2058968907] [2024-11-10 15:13:47,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:13:47,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:13:47,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:13:47,831 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-10 15:13:47,832 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-10 15:13:48,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:13:48,054 INFO L255 TraceCheckSpWp]: Trace formula consists of 526 conjuncts, 47 conjuncts are in the unsatisfiable core [2024-11-10 15:13:48,057 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:13:48,072 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-10 15:13:48,080 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-10 15:13:48,218 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-10 15:13:48,222 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-10 15:13:48,340 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:13:48,341 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-10 15:13:48,352 INFO L349 Elim1Store]: treesize reduction 4, result has 71.4 percent of original size [2024-11-10 15:13:48,352 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-10 15:13:48,452 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-10 15:13:48,457 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-10 15:13:48,457 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:13:48,978 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-10 15:13:48,984 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-10 15:13:49,027 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-10 15:13:49,308 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-10 15:13:49,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2058968907] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 15:13:49,309 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 15:13:49,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 7, 6] total 29 [2024-11-10 15:13:49,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444794336] [2024-11-10 15:13:49,309 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 15:13:49,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-11-10 15:13:49,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:13:49,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-10 15:13:49,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=786, Unknown=0, NotChecked=0, Total=870 [2024-11-10 15:13:49,311 INFO L87 Difference]: Start difference. First operand 307 states and 365 transitions. Second operand has 30 states, 29 states have (on average 4.689655172413793) internal successors, (136), 28 states have internal predecessors, (136), 6 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-10 15:13:50,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:13:50,767 INFO L93 Difference]: Finished difference Result 350 states and 403 transitions. [2024-11-10 15:13:50,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-10 15:13:50,767 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 4.689655172413793) internal successors, (136), 28 states have internal predecessors, (136), 6 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 60 [2024-11-10 15:13:50,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:13:50,769 INFO L225 Difference]: With dead ends: 350 [2024-11-10 15:13:50,769 INFO L226 Difference]: Without dead ends: 350 [2024-11-10 15:13:50,770 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 444 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=292, Invalid=1964, Unknown=0, NotChecked=0, Total=2256 [2024-11-10 15:13:50,770 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 625 mSDsluCounter, 631 mSDsCounter, 0 mSdLazyCounter, 1039 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 625 SdHoareTripleChecker+Valid, 699 SdHoareTripleChecker+Invalid, 1064 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1039 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-10 15:13:50,770 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [625 Valid, 699 Invalid, 1064 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1039 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-10 15:13:50,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2024-11-10 15:13:50,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 307. [2024-11-10 15:13:50,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 256 states have (on average 1.31640625) internal successors, (337), 287 states have internal predecessors, (337), 12 states have call successors, (12), 7 states have call predecessors, (12), 7 states have return successors, (14), 12 states have call predecessors, (14), 12 states have call successors, (14) [2024-11-10 15:13:50,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 363 transitions. [2024-11-10 15:13:50,778 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 363 transitions. Word has length 60 [2024-11-10 15:13:50,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:13:50,778 INFO L471 AbstractCegarLoop]: Abstraction has 307 states and 363 transitions. [2024-11-10 15:13:50,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 4.689655172413793) internal successors, (136), 28 states have internal predecessors, (136), 6 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-10 15:13:50,779 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 363 transitions. [2024-11-10 15:13:50,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-10 15:13:50,780 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:13:50,780 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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, 1, 1] [2024-11-10 15:13:50,798 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-10 15:13:50,980 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-10 15:13:50,981 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 56 more)] === [2024-11-10 15:13:50,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:13:50,981 INFO L85 PathProgramCache]: Analyzing trace with hash 436479300, now seen corresponding path program 1 times [2024-11-10 15:13:50,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:13:50,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615207959] [2024-11-10 15:13:50,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:13:50,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:13:51,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:13:51,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-10 15:13:51,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:13:51,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 15:13:51,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:13:51,078 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-10 15:13:51,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:13:51,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615207959] [2024-11-10 15:13:51,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615207959] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:13:51,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:13:51,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 15:13:51,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024452141] [2024-11-10 15:13:51,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:13:51,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 15:13:51,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:13:51,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 15:13:51,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 15:13:51,079 INFO L87 Difference]: Start difference. First operand 307 states and 363 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 3 states have internal predecessors, (50), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 15:13:51,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:13:51,188 INFO L93 Difference]: Finished difference Result 305 states and 360 transitions. [2024-11-10 15:13:51,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 15:13:51,188 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 3 states have internal predecessors, (50), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 60 [2024-11-10 15:13:51,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:13:51,190 INFO L225 Difference]: With dead ends: 305 [2024-11-10 15:13:51,190 INFO L226 Difference]: Without dead ends: 305 [2024-11-10 15:13:51,190 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 6 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-10 15:13:51,190 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 0 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:13:51,191 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 263 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:13:51,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2024-11-10 15:13:51,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 305. [2024-11-10 15:13:51,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 254 states have (on average 1.31496062992126) internal successors, (334), 285 states have internal predecessors, (334), 12 states have call successors, (12), 7 states have call predecessors, (12), 7 states have return successors, (14), 12 states have call predecessors, (14), 12 states have call successors, (14) [2024-11-10 15:13:51,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 360 transitions. [2024-11-10 15:13:51,202 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 360 transitions. Word has length 60 [2024-11-10 15:13:51,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:13:51,202 INFO L471 AbstractCegarLoop]: Abstraction has 305 states and 360 transitions. [2024-11-10 15:13:51,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 3 states have internal predecessors, (50), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 15:13:51,202 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 360 transitions. [2024-11-10 15:13:51,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-10 15:13:51,203 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:13:51,203 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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] [2024-11-10 15:13:51,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-10 15:13:51,203 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 56 more)] === [2024-11-10 15:13:51,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:13:51,204 INFO L85 PathProgramCache]: Analyzing trace with hash -1760468314, now seen corresponding path program 1 times [2024-11-10 15:13:51,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:13:51,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303274652] [2024-11-10 15:13:51,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:13:51,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:13:51,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:13:51,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-10 15:13:51,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:13:51,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 15:13:51,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:13:51,769 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 20 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-10 15:13:51,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:13:51,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303274652] [2024-11-10 15:13:51,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303274652] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:13:51,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [52109249] [2024-11-10 15:13:51,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:13:51,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:13:51,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:13:51,771 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-10 15:13:51,773 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-10 15:13:52,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:13:52,018 INFO L255 TraceCheckSpWp]: Trace formula consists of 534 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-11-10 15:13:52,021 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:13:52,024 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-10 15:13:52,046 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-10 15:13:52,046 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-10 15:13:52,063 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 13 treesize of output 9 [2024-11-10 15:13:52,067 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 13 treesize of output 9 [2024-11-10 15:13:52,253 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-10 15:13:52,258 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 18 treesize of output 13 [2024-11-10 15:13:52,361 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 18 treesize of output 13 [2024-11-10 15:13:52,365 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 18 treesize of output 13 [2024-11-10 15:13:52,575 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-10 15:13:52,576 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:13:53,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [52109249] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:13:53,662 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 15:13:53,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 25 [2024-11-10 15:13:53,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498798821] [2024-11-10 15:13:53,662 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 15:13:53,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-10 15:13:53,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:13:53,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-10 15:13:53,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=569, Unknown=15, NotChecked=0, Total=650 [2024-11-10 15:13:53,663 INFO L87 Difference]: Start difference. First operand 305 states and 360 transitions. Second operand has 25 states, 25 states have (on average 3.72) internal successors, (93), 22 states have internal predecessors, (93), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-10 15:13:55,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:13:55,118 INFO L93 Difference]: Finished difference Result 343 states and 395 transitions. [2024-11-10 15:13:55,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-11-10 15:13:55,119 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 3.72) internal successors, (93), 22 states have internal predecessors, (93), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 62 [2024-11-10 15:13:55,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:13:55,120 INFO L225 Difference]: With dead ends: 343 [2024-11-10 15:13:55,120 INFO L226 Difference]: Without dead ends: 343 [2024-11-10 15:13:55,121 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 603 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=389, Invalid=2673, Unknown=18, NotChecked=0, Total=3080 [2024-11-10 15:13:55,122 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 402 mSDsluCounter, 789 mSDsCounter, 0 mSdLazyCounter, 1246 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 402 SdHoareTripleChecker+Valid, 848 SdHoareTripleChecker+Invalid, 1266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 1246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-10 15:13:55,122 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [402 Valid, 848 Invalid, 1266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 1246 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-10 15:13:55,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2024-11-10 15:13:55,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 264. [2024-11-10 15:13:55,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 217 states have (on average 1.3133640552995391) internal successors, (285), 246 states have internal predecessors, (285), 11 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-10 15:13:55,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 307 transitions. [2024-11-10 15:13:55,129 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 307 transitions. Word has length 62 [2024-11-10 15:13:55,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:13:55,129 INFO L471 AbstractCegarLoop]: Abstraction has 264 states and 307 transitions. [2024-11-10 15:13:55,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 3.72) internal successors, (93), 22 states have internal predecessors, (93), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-10 15:13:55,129 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 307 transitions. [2024-11-10 15:13:55,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-10 15:13:55,130 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:13:55,130 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-10 15:13:55,148 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-11-10 15:13:55,330 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,SelfDestructingSolverStorable21 [2024-11-10 15:13:55,331 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting appendErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 56 more)] === [2024-11-10 15:13:55,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:13:55,331 INFO L85 PathProgramCache]: Analyzing trace with hash -647590898, now seen corresponding path program 1 times [2024-11-10 15:13:55,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:13:55,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766798283] [2024-11-10 15:13:55,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:13:55,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:13:55,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:13:55,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-10 15:13:55,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:13:55,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 15:13:55,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:13:56,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-10 15:13:56,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:13:56,164 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 41 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 15:13:56,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:13:56,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766798283] [2024-11-10 15:13:56,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766798283] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:13:56,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1164993199] [2024-11-10 15:13:56,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:13:56,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:13:56,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:13:56,167 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-10 15:13:56,169 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-10 15:13:56,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:13:56,472 INFO L255 TraceCheckSpWp]: Trace formula consists of 630 conjuncts, 83 conjuncts are in the unsatisfiable core [2024-11-10 15:13:56,477 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:13:56,484 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-10 15:13:56,490 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-10 15:13:56,682 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-10 15:13:56,717 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 59 treesize of output 38 [2024-11-10 15:13:56,785 INFO L349 Elim1Store]: treesize reduction 32, result has 30.4 percent of original size [2024-11-10 15:13:56,785 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 31 treesize of output 20 [2024-11-10 15:13:56,792 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 22 treesize of output 9 [2024-11-10 15:13:57,118 INFO L349 Elim1Store]: treesize reduction 30, result has 34.8 percent of original size [2024-11-10 15:13:57,118 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 29 treesize of output 33 [2024-11-10 15:13:57,128 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 15 [2024-11-10 15:13:57,136 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 26 treesize of output 9 [2024-11-10 15:13:57,253 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-10 15:13:57,303 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:13:57,303 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 30 treesize of output 14 [2024-11-10 15:13:57,308 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:13:57,308 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-10 15:13:57,323 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-11-10 15:13:57,323 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-10 15:13:57,388 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-10 15:13:57,389 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-10 15:13:57,440 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 11 proven. 23 refuted. 0 times theorem prover too weak. 1 trivial. 18 not checked. [2024-11-10 15:13:57,440 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:13:57,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1164993199] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:13:57,852 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 15:13:57,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 16] total 26 [2024-11-10 15:13:57,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042797818] [2024-11-10 15:13:57,852 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 15:13:57,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-11-10 15:13:57,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:13:57,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-10 15:13:57,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=751, Unknown=1, NotChecked=56, Total=930 [2024-11-10 15:13:57,855 INFO L87 Difference]: Start difference. First operand 264 states and 307 transitions. Second operand has 27 states, 26 states have (on average 4.6923076923076925) internal successors, (122), 22 states have internal predecessors, (122), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-10 15:13:59,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:13:59,088 INFO L93 Difference]: Finished difference Result 286 states and 329 transitions. [2024-11-10 15:13:59,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-10 15:13:59,089 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 4.6923076923076925) internal successors, (122), 22 states have internal predecessors, (122), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 73 [2024-11-10 15:13:59,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:13:59,090 INFO L225 Difference]: With dead ends: 286 [2024-11-10 15:13:59,090 INFO L226 Difference]: Without dead ends: 286 [2024-11-10 15:13:59,090 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 70 SyntacticMatches, 3 SemanticMatches, 38 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 443 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=211, Invalid=1274, Unknown=1, NotChecked=74, Total=1560 [2024-11-10 15:13:59,091 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 182 mSDsluCounter, 1006 mSDsCounter, 0 mSdLazyCounter, 1187 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 1088 SdHoareTripleChecker+Invalid, 1354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 1187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 148 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-10 15:13:59,091 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 1088 Invalid, 1354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 1187 Invalid, 0 Unknown, 148 Unchecked, 0.9s Time] [2024-11-10 15:13:59,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2024-11-10 15:13:59,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 178. [2024-11-10 15:13:59,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 146 states have (on average 1.2602739726027397) internal successors, (184), 168 states have internal predecessors, (184), 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-10 15:13:59,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 196 transitions. [2024-11-10 15:13:59,101 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 196 transitions. Word has length 73 [2024-11-10 15:13:59,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:13:59,101 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 196 transitions. [2024-11-10 15:13:59,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 4.6923076923076925) internal successors, (122), 22 states have internal predecessors, (122), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-10 15:13:59,102 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 196 transitions. [2024-11-10 15:13:59,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-10 15:13:59,102 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:13:59,102 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:13:59,117 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-11-10 15:13:59,303 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,SelfDestructingSolverStorable22 [2024-11-10 15:13:59,303 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-10 15:13:59,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:13:59,303 INFO L85 PathProgramCache]: Analyzing trace with hash -37889505, now seen corresponding path program 2 times [2024-11-10 15:13:59,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:13:59,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696788007] [2024-11-10 15:13:59,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:13:59,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:13:59,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:13:59,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-10 15:13:59,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:13:59,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-10 15:13:59,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:13:59,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-10 15:13:59,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:13:59,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-10 15:13:59,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:13:59,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 15:13:59,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:14:00,003 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 48 proven. 65 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2024-11-10 15:14:00,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:14:00,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696788007] [2024-11-10 15:14:00,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696788007] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:14:00,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [488948448] [2024-11-10 15:14:00,004 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-10 15:14:00,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:14:00,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:14:00,006 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-10 15:14:00,008 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-10 15:14:00,565 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-10 15:14:00,566 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 15:14:00,568 INFO L255 TraceCheckSpWp]: Trace formula consists of 852 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-10 15:14:00,570 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:14:00,659 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2024-11-10 15:14:00,659 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:14:00,766 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2024-11-10 15:14:00,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [488948448] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 15:14:00,767 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 15:14:00,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 7, 7] total 19 [2024-11-10 15:14:00,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460860152] [2024-11-10 15:14:00,767 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 15:14:00,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-10 15:14:00,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:14:00,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-10 15:14:00,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=285, Unknown=0, NotChecked=0, Total=342 [2024-11-10 15:14:00,768 INFO L87 Difference]: Start difference. First operand 178 states and 196 transitions. Second operand has 19 states, 19 states have (on average 4.315789473684211) internal successors, (82), 18 states have internal predecessors, (82), 8 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2024-11-10 15:14:01,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:14:01,466 INFO L93 Difference]: Finished difference Result 215 states and 223 transitions. [2024-11-10 15:14:01,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-10 15:14:01,466 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 4.315789473684211) internal successors, (82), 18 states have internal predecessors, (82), 8 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) Word has length 102 [2024-11-10 15:14:01,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:14:01,467 INFO L225 Difference]: With dead ends: 215 [2024-11-10 15:14:01,467 INFO L226 Difference]: Without dead ends: 215 [2024-11-10 15:14:01,467 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 211 SyntacticMatches, 4 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=180, Invalid=1010, Unknown=0, NotChecked=0, Total=1190 [2024-11-10 15:14:01,468 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 255 mSDsluCounter, 798 mSDsCounter, 0 mSdLazyCounter, 549 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 877 SdHoareTripleChecker+Invalid, 572 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 549 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 15:14:01,468 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 877 Invalid, 572 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 549 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 15:14:01,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2024-11-10 15:14:01,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 195. [2024-11-10 15:14:01,471 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-10 15:14:01,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 223 transitions. [2024-11-10 15:14:01,472 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 223 transitions. Word has length 102 [2024-11-10 15:14:01,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:14:01,472 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 223 transitions. [2024-11-10 15:14:01,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 4.315789473684211) internal successors, (82), 18 states have internal predecessors, (82), 8 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2024-11-10 15:14:01,472 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 223 transitions. [2024-11-10 15:14:01,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-10 15:14:01,473 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:14:01,473 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-10 15:14:01,494 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-10 15:14:01,673 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,SelfDestructingSolverStorable23 [2024-11-10 15:14:01,674 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-10 15:14:01,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:14:01,674 INFO L85 PathProgramCache]: Analyzing trace with hash -369420506, now seen corresponding path program 1 times [2024-11-10 15:14:01,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:14:01,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932419964] [2024-11-10 15:14:01,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:14:01,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:14:01,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:14:02,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-10 15:14:02,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:14:02,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-10 15:14:02,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:14:02,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-10 15:14:02,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:14:02,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 15:14:02,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:14:02,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-10 15:14:02,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:14:02,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-10 15:14:02,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:14:02,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-10 15:14:02,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:14:03,042 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-10 15:14:03,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:14:03,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932419964] [2024-11-10 15:14:03,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932419964] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:14:03,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1548147233] [2024-11-10 15:14:03,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:14:03,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:14:03,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:14:03,045 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-10 15:14:03,047 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-10 15:14:03,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:14:03,455 INFO L255 TraceCheckSpWp]: Trace formula consists of 1193 conjuncts, 91 conjuncts are in the unsatisfiable core [2024-11-10 15:14:03,459 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:14:03,569 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-10 15:14:03,608 INFO L349 Elim1Store]: treesize reduction 30, result has 34.8 percent of original size [2024-11-10 15:14:03,608 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 29 treesize of output 33 [2024-11-10 15:14:03,800 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-10 15:14:03,817 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 22 treesize of output 10 [2024-11-10 15:14:03,843 INFO L349 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2024-11-10 15:14:03,844 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 24 treesize of output 28 [2024-11-10 15:14:03,973 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-10 15:14:04,012 INFO L349 Elim1Store]: treesize reduction 48, result has 39.2 percent of original size [2024-11-10 15:14:04,012 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 37 [2024-11-10 15:14:04,299 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 48 treesize of output 30 [2024-11-10 15:14:04,354 INFO L349 Elim1Store]: treesize reduction 32, result has 52.2 percent of original size [2024-11-10 15:14:04,355 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 38 treesize of output 58 [2024-11-10 15:14:04,477 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-10 15:14:04,539 INFO L349 Elim1Store]: treesize reduction 28, result has 28.2 percent of original size [2024-11-10 15:14:04,539 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 22 [2024-11-10 15:14:04,627 INFO L349 Elim1Store]: treesize reduction 28, result has 28.2 percent of original size [2024-11-10 15:14:04,628 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 22 [2024-11-10 15:14:04,678 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 42 proven. 99 refuted. 0 times theorem prover too weak. 53 trivial. 132 not checked. [2024-11-10 15:14:04,678 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:14:05,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1548147233] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:14:05,051 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 15:14:05,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 19] total 23 [2024-11-10 15:14:05,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598535461] [2024-11-10 15:14:05,051 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 15:14:05,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-10 15:14:05,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:14:05,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-10 15:14:05,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=463, Unknown=2, NotChecked=90, Total=650 [2024-11-10 15:14:05,053 INFO L87 Difference]: Start difference. First operand 195 states and 223 transitions. Second operand has 24 states, 23 states have (on average 5.913043478260869) internal successors, (136), 21 states have internal predecessors, (136), 5 states have call successors, (7), 4 states have call predecessors, (7), 7 states have return successors, (7), 4 states have call predecessors, (7), 5 states have call successors, (7) [2024-11-10 15:14:05,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:14:05,760 INFO L93 Difference]: Finished difference Result 223 states and 251 transitions. [2024-11-10 15:14:05,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-10 15:14:05,761 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 5.913043478260869) internal successors, (136), 21 states have internal predecessors, (136), 5 states have call successors, (7), 4 states have call predecessors, (7), 7 states have return successors, (7), 4 states have call predecessors, (7), 5 states have call successors, (7) Word has length 148 [2024-11-10 15:14:05,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:14:05,762 INFO L225 Difference]: With dead ends: 223 [2024-11-10 15:14:05,762 INFO L226 Difference]: Without dead ends: 223 [2024-11-10 15:14:05,763 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 190 SyntacticMatches, 9 SemanticMatches, 34 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 393 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=206, Invalid=922, Unknown=2, NotChecked=130, Total=1260 [2024-11-10 15:14:05,763 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 172 mSDsluCounter, 557 mSDsCounter, 0 mSdLazyCounter, 587 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 624 SdHoareTripleChecker+Invalid, 860 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 587 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 263 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 15:14:05,763 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 624 Invalid, 860 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 587 Invalid, 0 Unknown, 263 Unchecked, 0.4s Time] [2024-11-10 15:14:05,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2024-11-10 15:14:05,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 194. [2024-11-10 15:14:05,767 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-10 15:14:05,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 222 transitions. [2024-11-10 15:14:05,768 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 222 transitions. Word has length 148 [2024-11-10 15:14:05,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:14:05,768 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 222 transitions. [2024-11-10 15:14:05,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 5.913043478260869) internal successors, (136), 21 states have internal predecessors, (136), 5 states have call successors, (7), 4 states have call predecessors, (7), 7 states have return successors, (7), 4 states have call predecessors, (7), 5 states have call successors, (7) [2024-11-10 15:14:05,768 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 222 transitions. [2024-11-10 15:14:05,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-10 15:14:05,769 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:14:05,769 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-10 15:14:05,786 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-10 15:14:05,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2024-11-10 15:14:05,970 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-10 15:14:05,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:14:05,971 INFO L85 PathProgramCache]: Analyzing trace with hash -369420505, now seen corresponding path program 1 times [2024-11-10 15:14:05,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:14:05,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832019758] [2024-11-10 15:14:05,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:14:05,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:14:06,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:14:07,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-10 15:14:07,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:14:07,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-10 15:14:07,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:14:07,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-10 15:14:07,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:14:07,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 15:14:07,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:14:07,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-10 15:14:07,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:14:07,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-10 15:14:07,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:14:07,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-10 15:14:07,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:14:07,718 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 0 proven. 200 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2024-11-10 15:14:07,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:14:07,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832019758] [2024-11-10 15:14:07,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832019758] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:14:07,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [140842249] [2024-11-10 15:14:07,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:14:07,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:14:07,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:14:07,722 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-10 15:14:07,723 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-10 15:14:08,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:14:08,193 INFO L255 TraceCheckSpWp]: Trace formula consists of 1193 conjuncts, 116 conjuncts are in the unsatisfiable core [2024-11-10 15:14:08,198 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:14:08,498 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-10 15:14:08,555 INFO L349 Elim1Store]: treesize reduction 30, result has 34.8 percent of original size [2024-11-10 15:14:08,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 29 treesize of output 33 [2024-11-10 15:14:08,564 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-10 15:14:09,002 INFO L349 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2024-11-10 15:14:09,002 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 19 [2024-11-10 15:14:09,013 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-10 15:14:09,035 INFO L349 Elim1Store]: treesize reduction 61, result has 34.4 percent of original size [2024-11-10 15:14:09,036 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 40 treesize of output 52 [2024-11-10 15:14:09,046 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 20 [2024-11-10 15:14:09,435 INFO L349 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2024-11-10 15:14:09,436 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-10 15:14:09,447 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 51 treesize of output 14 [2024-11-10 15:14:09,474 INFO L349 Elim1Store]: treesize reduction 12, result has 72.1 percent of original size [2024-11-10 15:14:09,474 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 27 treesize of output 43 [2024-11-10 15:14:09,550 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-10 15:14:09,699 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-10 15:14:09,721 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-10 15:14:09,721 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-10 15:14:10,059 INFO L349 Elim1Store]: treesize reduction 32, result has 37.3 percent of original size [2024-11-10 15:14:10,059 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 37 treesize of output 41 [2024-11-10 15:14:10,078 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:14:10,078 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 46 [2024-11-10 15:14:10,551 INFO L349 Elim1Store]: treesize reduction 60, result has 67.7 percent of original size [2024-11-10 15:14:10,551 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 15 case distinctions, treesize of input 60 treesize of output 163