./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety/960521-1-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/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.6.800.v20240513-1750.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/960521-1-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4591ef5e575ce80e216cc4837705a7c6f141a943d9af6ca1eb606ab877abd06b --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 07:34:42,616 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 07:34:42,668 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-04 07:34:42,672 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 07:34:42,672 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 07:34:42,686 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 07:34:42,687 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 07:34:42,687 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 07:34:42,687 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 07:34:42,687 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 07:34:42,687 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 07:34:42,687 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 07:34:42,687 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 07:34:42,687 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 07:34:42,687 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 07:34:42,688 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 07:34:42,688 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 07:34:42,688 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 07:34:42,688 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 07:34:42,688 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 07:34:42,688 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 07:34:42,688 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 07:34:42,688 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-04 07:34:42,688 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 07:34:42,688 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 07:34:42,688 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 07:34:42,688 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 07:34:42,688 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 07:34:42,688 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 07:34:42,688 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 07:34:42,690 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 07:34:42,690 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 07:34:42,690 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 07:34:42,690 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 07:34:42,691 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 07:34:42,691 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 07:34:42,691 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 07:34:42,691 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 07:34:42,691 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 07:34:42,691 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 07:34:42,691 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 07:34:42,691 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 07:34:42,691 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> 4591ef5e575ce80e216cc4837705a7c6f141a943d9af6ca1eb606ab877abd06b [2025-03-04 07:34:42,917 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 07:34:42,927 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 07:34:42,929 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 07:34:42,930 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 07:34:42,930 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 07:34:42,931 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety/960521-1-1.i [2025-03-04 07:34:44,070 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a151dd8e/8fb54133d3504c53978e43865a84db96/FLAG0ffabb810 [2025-03-04 07:34:44,363 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 07:34:44,364 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/960521-1-1.i [2025-03-04 07:34:44,379 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a151dd8e/8fb54133d3504c53978e43865a84db96/FLAG0ffabb810 [2025-03-04 07:34:44,643 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a151dd8e/8fb54133d3504c53978e43865a84db96 [2025-03-04 07:34:44,645 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 07:34:44,647 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 07:34:44,648 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 07:34:44,648 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 07:34:44,652 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 07:34:44,653 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 07:34:44" (1/1) ... [2025-03-04 07:34:44,654 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b4c02a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:34:44, skipping insertion in model container [2025-03-04 07:34:44,654 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 07:34:44" (1/1) ... [2025-03-04 07:34:44,679 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 07:34:44,886 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 07:34:44,894 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 07:34:44,929 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 07:34:44,945 INFO L204 MainTranslator]: Completed translation [2025-03-04 07:34:44,945 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:34:44 WrapperNode [2025-03-04 07:34:44,946 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 07:34:44,946 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 07:34:44,946 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 07:34:44,946 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 07:34:44,950 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:34:44" (1/1) ... [2025-03-04 07:34:44,957 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:34:44" (1/1) ... [2025-03-04 07:34:44,968 INFO L138 Inliner]: procedures = 121, calls = 17, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 58 [2025-03-04 07:34:44,969 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 07:34:44,969 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 07:34:44,969 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 07:34:44,969 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 07:34:44,975 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:34:44" (1/1) ... [2025-03-04 07:34:44,976 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:34:44" (1/1) ... [2025-03-04 07:34:44,977 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:34:44" (1/1) ... [2025-03-04 07:34:44,991 INFO L175 MemorySlicer]: Split 6 memory accesses to 3 slices as follows [2, 1, 3]. 50 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 3 writes are split as follows [0, 1, 2]. [2025-03-04 07:34:44,992 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:34:44" (1/1) ... [2025-03-04 07:34:44,992 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:34:44" (1/1) ... [2025-03-04 07:34:45,000 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:34:44" (1/1) ... [2025-03-04 07:34:45,001 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:34:44" (1/1) ... [2025-03-04 07:34:45,002 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:34:44" (1/1) ... [2025-03-04 07:34:45,003 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:34:44" (1/1) ... [2025-03-04 07:34:45,004 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 07:34:45,009 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 07:34:45,009 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 07:34:45,009 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 07:34:45,010 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:34:44" (1/1) ... [2025-03-04 07:34:45,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 07:34:45,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:34:45,039 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) [2025-03-04 07:34:45,042 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 [2025-03-04 07:34:45,061 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 07:34:45,061 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 07:34:45,061 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 07:34:45,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 07:34:45,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 07:34:45,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 07:34:45,062 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 07:34:45,062 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 07:34:45,062 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 07:34:45,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 07:34:45,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 07:34:45,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 07:34:45,062 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 07:34:45,063 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 07:34:45,153 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 07:34:45,155 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 07:34:45,309 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-03-04 07:34:45,309 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 07:34:45,317 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 07:34:45,317 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 07:34:45,317 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 07:34:45 BoogieIcfgContainer [2025-03-04 07:34:45,318 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 07:34:45,320 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 07:34:45,320 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 07:34:45,323 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 07:34:45,324 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 07:34:44" (1/3) ... [2025-03-04 07:34:45,324 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ca978a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 07:34:45, skipping insertion in model container [2025-03-04 07:34:45,325 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:34:44" (2/3) ... [2025-03-04 07:34:45,325 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ca978a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 07:34:45, skipping insertion in model container [2025-03-04 07:34:45,325 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 07:34:45" (3/3) ... [2025-03-04 07:34:45,326 INFO L128 eAbstractionObserver]: Analyzing ICFG 960521-1-1.i [2025-03-04 07:34:45,338 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 07:34:45,340 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 960521-1-1.i that has 1 procedures, 50 locations, 1 initial locations, 2 loop locations, and 21 error locations. [2025-03-04 07:34:45,373 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 07:34:45,382 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;@5d344345, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 07:34:45,383 INFO L334 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2025-03-04 07:34:45,386 INFO L276 IsEmpty]: Start isEmpty. Operand has 50 states, 28 states have (on average 1.8571428571428572) internal successors, (52), 49 states have internal predecessors, (52), 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) [2025-03-04 07:34:45,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-03-04 07:34:45,389 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:34:45,390 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-03-04 07:34:45,390 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 18 more)] === [2025-03-04 07:34:45,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:34:45,394 INFO L85 PathProgramCache]: Analyzing trace with hash 80400, now seen corresponding path program 1 times [2025-03-04 07:34:45,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:34:45,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436991965] [2025-03-04 07:34:45,399 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:34:45,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:34:45,451 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 07:34:45,466 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 07:34:45,467 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:34:45,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:34:45,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:34:45,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:34:45,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436991965] [2025-03-04 07:34:45,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436991965] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:34:45,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:34:45,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 07:34:45,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833673940] [2025-03-04 07:34:45,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:34:45,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:34:45,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:34:45,602 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:34:45,603 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:34:45,604 INFO L87 Difference]: Start difference. First operand has 50 states, 28 states have (on average 1.8571428571428572) internal successors, (52), 49 states have internal predecessors, (52), 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) 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) [2025-03-04 07:34:45,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:34:45,656 INFO L93 Difference]: Finished difference Result 49 states and 51 transitions. [2025-03-04 07:34:45,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:34:45,658 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 [2025-03-04 07:34:45,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:34:45,662 INFO L225 Difference]: With dead ends: 49 [2025-03-04 07:34:45,662 INFO L226 Difference]: Without dead ends: 47 [2025-03-04 07:34:45,664 INFO L434 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 [2025-03-04 07:34:45,667 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 0 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:34:45,669 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 79 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:34:45,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2025-03-04 07:34:45,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2025-03-04 07:34:45,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 27 states have (on average 1.8148148148148149) internal successors, (49), 46 states have internal predecessors, (49), 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) [2025-03-04 07:34:45,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 49 transitions. [2025-03-04 07:34:45,692 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 49 transitions. Word has length 3 [2025-03-04 07:34:45,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:34:45,692 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 49 transitions. [2025-03-04 07:34:45,692 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) [2025-03-04 07:34:45,692 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2025-03-04 07:34:45,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-03-04 07:34:45,693 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:34:45,693 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-03-04 07:34:45,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 07:34:45,693 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 18 more)] === [2025-03-04 07:34:45,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:34:45,694 INFO L85 PathProgramCache]: Analyzing trace with hash 80401, now seen corresponding path program 1 times [2025-03-04 07:34:45,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:34:45,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634523421] [2025-03-04 07:34:45,694 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:34:45,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:34:45,706 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 07:34:45,718 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 07:34:45,718 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:34:45,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:34:45,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:34:45,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:34:45,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634523421] [2025-03-04 07:34:45,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634523421] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:34:45,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:34:45,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 07:34:45,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346388707] [2025-03-04 07:34:45,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:34:45,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:34:45,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:34:45,819 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:34:45,819 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:34:45,819 INFO L87 Difference]: Start difference. First operand 47 states and 49 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) [2025-03-04 07:34:45,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:34:45,847 INFO L93 Difference]: Finished difference Result 46 states and 48 transitions. [2025-03-04 07:34:45,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:34:45,848 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 [2025-03-04 07:34:45,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:34:45,848 INFO L225 Difference]: With dead ends: 46 [2025-03-04 07:34:45,848 INFO L226 Difference]: Without dead ends: 46 [2025-03-04 07:34:45,848 INFO L434 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 [2025-03-04 07:34:45,849 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 0 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:34:45,849 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 85 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:34:45,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2025-03-04 07:34:45,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2025-03-04 07:34:45,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 27 states have (on average 1.7777777777777777) internal successors, (48), 45 states have internal predecessors, (48), 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) [2025-03-04 07:34:45,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 48 transitions. [2025-03-04 07:34:45,856 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 48 transitions. Word has length 3 [2025-03-04 07:34:45,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:34:45,856 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 48 transitions. [2025-03-04 07:34:45,856 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) [2025-03-04 07:34:45,856 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 48 transitions. [2025-03-04 07:34:45,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-04 07:34:45,856 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:34:45,856 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-04 07:34:45,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 07:34:45,856 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 18 more)] === [2025-03-04 07:34:45,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:34:45,857 INFO L85 PathProgramCache]: Analyzing trace with hash -1899755043, now seen corresponding path program 1 times [2025-03-04 07:34:45,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:34:45,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040143240] [2025-03-04 07:34:45,857 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:34:45,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:34:45,864 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 07:34:45,870 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 07:34:45,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:34:45,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:34:45,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:34:45,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:34:45,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040143240] [2025-03-04 07:34:45,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040143240] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:34:45,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:34:45,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 07:34:45,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673541215] [2025-03-04 07:34:45,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:34:45,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 07:34:45,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:34:45,979 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 07:34:45,979 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 07:34:45,979 INFO L87 Difference]: Start difference. First operand 46 states and 48 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 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) [2025-03-04 07:34:46,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:34:46,018 INFO L93 Difference]: Finished difference Result 43 states and 45 transitions. [2025-03-04 07:34:46,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:34:46,019 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 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 [2025-03-04 07:34:46,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:34:46,020 INFO L225 Difference]: With dead ends: 43 [2025-03-04 07:34:46,020 INFO L226 Difference]: Without dead ends: 43 [2025-03-04 07:34:46,020 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 07:34:46,020 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 24 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:34:46,020 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 50 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:34:46,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2025-03-04 07:34:46,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2025-03-04 07:34:46,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 27 states have (on average 1.6666666666666667) internal successors, (45), 42 states have internal predecessors, (45), 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) [2025-03-04 07:34:46,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 45 transitions. [2025-03-04 07:34:46,025 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 45 transitions. Word has length 6 [2025-03-04 07:34:46,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:34:46,026 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 45 transitions. [2025-03-04 07:34:46,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 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) [2025-03-04 07:34:46,027 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 45 transitions. [2025-03-04 07:34:46,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-04 07:34:46,028 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:34:46,028 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-04 07:34:46,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 07:34:46,028 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 18 more)] === [2025-03-04 07:34:46,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:34:46,029 INFO L85 PathProgramCache]: Analyzing trace with hash -1899755042, now seen corresponding path program 1 times [2025-03-04 07:34:46,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:34:46,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88502332] [2025-03-04 07:34:46,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:34:46,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:34:46,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 07:34:46,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 07:34:46,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:34:46,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:34:46,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:34:46,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:34:46,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88502332] [2025-03-04 07:34:46,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88502332] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:34:46,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:34:46,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 07:34:46,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200228786] [2025-03-04 07:34:46,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:34:46,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 07:34:46,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:34:46,199 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 07:34:46,199 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 07:34:46,199 INFO L87 Difference]: Start difference. First operand 43 states and 45 transitions. Second operand has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 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) [2025-03-04 07:34:46,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:34:46,285 INFO L93 Difference]: Finished difference Result 48 states and 52 transitions. [2025-03-04 07:34:46,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 07:34:46,286 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 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 [2025-03-04 07:34:46,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:34:46,286 INFO L225 Difference]: With dead ends: 48 [2025-03-04 07:34:46,287 INFO L226 Difference]: Without dead ends: 48 [2025-03-04 07:34:46,287 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:34:46,288 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 51 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:34:46,288 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 61 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:34:46,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-03-04 07:34:46,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 44. [2025-03-04 07:34:46,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 30 states have (on average 1.5666666666666667) internal successors, (47), 43 states have internal predecessors, (47), 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) [2025-03-04 07:34:46,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 47 transitions. [2025-03-04 07:34:46,298 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 47 transitions. Word has length 6 [2025-03-04 07:34:46,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:34:46,298 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 47 transitions. [2025-03-04 07:34:46,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 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) [2025-03-04 07:34:46,299 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 47 transitions. [2025-03-04 07:34:46,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-04 07:34:46,299 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:34:46,299 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:34:46,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 07:34:46,299 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 18 more)] === [2025-03-04 07:34:46,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:34:46,300 INFO L85 PathProgramCache]: Analyzing trace with hash 1237130887, now seen corresponding path program 1 times [2025-03-04 07:34:46,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:34:46,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91110344] [2025-03-04 07:34:46,300 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:34:46,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:34:46,306 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 07:34:46,310 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 07:34:46,310 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:34:46,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:34:46,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:34:46,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:34:46,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91110344] [2025-03-04 07:34:46,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91110344] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:34:46,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:34:46,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 07:34:46,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057650571] [2025-03-04 07:34:46,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:34:46,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 07:34:46,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:34:46,349 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 07:34:46,349 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 07:34:46,349 INFO L87 Difference]: Start difference. First operand 44 states and 47 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 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) [2025-03-04 07:34:46,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:34:46,374 INFO L93 Difference]: Finished difference Result 48 states and 51 transitions. [2025-03-04 07:34:46,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 07:34:46,375 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 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 7 [2025-03-04 07:34:46,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:34:46,376 INFO L225 Difference]: With dead ends: 48 [2025-03-04 07:34:46,376 INFO L226 Difference]: Without dead ends: 48 [2025-03-04 07:34:46,376 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 07:34:46,377 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 52 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:34:46,377 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 64 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:34:46,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-03-04 07:34:46,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 44. [2025-03-04 07:34:46,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 30 states have (on average 1.5333333333333334) internal successors, (46), 43 states have internal predecessors, (46), 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) [2025-03-04 07:34:46,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 46 transitions. [2025-03-04 07:34:46,379 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 46 transitions. Word has length 7 [2025-03-04 07:34:46,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:34:46,379 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 46 transitions. [2025-03-04 07:34:46,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 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) [2025-03-04 07:34:46,379 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2025-03-04 07:34:46,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-04 07:34:46,381 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:34:46,381 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:34:46,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 07:34:46,382 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 18 more)] === [2025-03-04 07:34:46,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:34:46,383 INFO L85 PathProgramCache]: Analyzing trace with hash -818415572, now seen corresponding path program 1 times [2025-03-04 07:34:46,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:34:46,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648459792] [2025-03-04 07:34:46,383 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:34:46,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:34:46,389 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 07:34:46,397 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 07:34:46,401 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:34:46,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:34:46,678 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:34:46,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:34:46,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648459792] [2025-03-04 07:34:46,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648459792] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:34:46,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1591343850] [2025-03-04 07:34:46,678 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:34:46,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:34:46,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:34:46,682 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) [2025-03-04 07:34:46,683 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 07:34:46,719 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 07:34:46,728 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 07:34:46,729 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:34:46,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:34:46,730 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-04 07:34:46,734 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:34:46,790 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-03-04 07:34:46,791 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 1 case distinctions, treesize of input 9 treesize of output 11 [2025-03-04 07:34:46,919 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:34:46,920 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:34:47,027 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:34:47,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1591343850] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:34:47,028 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:34:47,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 14 [2025-03-04 07:34:47,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066350408] [2025-03-04 07:34:47,028 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:34:47,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-04 07:34:47,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:34:47,029 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-04 07:34:47,029 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2025-03-04 07:34:47,029 INFO L87 Difference]: Start difference. First operand 44 states and 46 transitions. Second operand has 15 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 15 states have internal predecessors, (25), 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) [2025-03-04 07:34:47,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:34:47,326 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2025-03-04 07:34:47,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 07:34:47,326 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 15 states have internal predecessors, (25), 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 9 [2025-03-04 07:34:47,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:34:47,327 INFO L225 Difference]: With dead ends: 61 [2025-03-04 07:34:47,327 INFO L226 Difference]: Without dead ends: 61 [2025-03-04 07:34:47,327 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=124, Invalid=296, Unknown=0, NotChecked=0, Total=420 [2025-03-04 07:34:47,327 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 198 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:34:47,328 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 101 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:34:47,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2025-03-04 07:34:47,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59. [2025-03-04 07:34:47,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 45 states have (on average 1.4444444444444444) internal successors, (65), 58 states have internal predecessors, (65), 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) [2025-03-04 07:34:47,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 65 transitions. [2025-03-04 07:34:47,332 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 65 transitions. Word has length 9 [2025-03-04 07:34:47,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:34:47,333 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 65 transitions. [2025-03-04 07:34:47,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 15 states have internal predecessors, (25), 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) [2025-03-04 07:34:47,333 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 65 transitions. [2025-03-04 07:34:47,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-04 07:34:47,333 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:34:47,333 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1] [2025-03-04 07:34:47,341 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 07:34:47,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-04 07:34:47,534 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 18 more)] === [2025-03-04 07:34:47,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:34:47,534 INFO L85 PathProgramCache]: Analyzing trace with hash -1876917154, now seen corresponding path program 2 times [2025-03-04 07:34:47,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:34:47,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61125007] [2025-03-04 07:34:47,534 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 07:34:47,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:34:47,542 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-03-04 07:34:47,549 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 07:34:47,549 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 07:34:47,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:34:47,923 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:34:47,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:34:47,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61125007] [2025-03-04 07:34:47,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61125007] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:34:47,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1481730834] [2025-03-04 07:34:47,924 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 07:34:47,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:34:47,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:34:47,926 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) [2025-03-04 07:34:47,928 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 07:34:47,959 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-03-04 07:34:47,972 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 07:34:47,972 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 07:34:47,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:34:47,973 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-04 07:34:47,974 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:34:47,990 INFO L349 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2025-03-04 07:34:47,991 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 1 case distinctions, treesize of input 17 treesize of output 19 [2025-03-04 07:34:48,434 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 22 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:34:48,434 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:34:48,821 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 18 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:34:48,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1481730834] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:34:48,821 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:34:48,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 23 [2025-03-04 07:34:48,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362125929] [2025-03-04 07:34:48,822 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:34:48,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-04 07:34:48,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:34:48,823 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-04 07:34:48,823 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=402, Unknown=0, NotChecked=0, Total=552 [2025-03-04 07:34:48,824 INFO L87 Difference]: Start difference. First operand 59 states and 65 transitions. Second operand has 24 states, 23 states have (on average 2.260869565217391) internal successors, (52), 24 states have internal predecessors, (52), 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) [2025-03-04 07:34:49,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:34:49,326 INFO L93 Difference]: Finished difference Result 77 states and 85 transitions. [2025-03-04 07:34:49,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 07:34:49,327 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.260869565217391) internal successors, (52), 24 states have internal predecessors, (52), 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 18 [2025-03-04 07:34:49,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:34:49,329 INFO L225 Difference]: With dead ends: 77 [2025-03-04 07:34:49,329 INFO L226 Difference]: Without dead ends: 77 [2025-03-04 07:34:49,330 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=282, Invalid=710, Unknown=0, NotChecked=0, Total=992 [2025-03-04 07:34:49,330 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 301 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 301 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:34:49,330 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [301 Valid, 141 Invalid, 391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 347 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 07:34:49,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-03-04 07:34:49,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 69. [2025-03-04 07:34:49,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 56 states have (on average 1.4107142857142858) internal successors, (79), 68 states have internal predecessors, (79), 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) [2025-03-04 07:34:49,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 79 transitions. [2025-03-04 07:34:49,336 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 79 transitions. Word has length 18 [2025-03-04 07:34:49,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:34:49,336 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 79 transitions. [2025-03-04 07:34:49,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.260869565217391) internal successors, (52), 24 states have internal predecessors, (52), 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) [2025-03-04 07:34:49,337 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 79 transitions. [2025-03-04 07:34:49,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-04 07:34:49,337 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:34:49,337 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:34:49,343 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 07:34:49,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2025-03-04 07:34:49,540 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 18 more)] === [2025-03-04 07:34:49,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:34:49,541 INFO L85 PathProgramCache]: Analyzing trace with hash 1140573895, now seen corresponding path program 1 times [2025-03-04 07:34:49,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:34:49,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704161878] [2025-03-04 07:34:49,541 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:34:49,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:34:49,553 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 07:34:49,561 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 07:34:49,563 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:34:49,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:34:49,607 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-03-04 07:34:49,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:34:49,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704161878] [2025-03-04 07:34:49,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704161878] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:34:49,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:34:49,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 07:34:49,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224979969] [2025-03-04 07:34:49,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:34:49,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 07:34:49,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:34:49,610 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 07:34:49,610 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 07:34:49,610 INFO L87 Difference]: Start difference. First operand 69 states and 79 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 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) [2025-03-04 07:34:49,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:34:49,648 INFO L93 Difference]: Finished difference Result 67 states and 73 transitions. [2025-03-04 07:34:49,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 07:34:49,649 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 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 25 [2025-03-04 07:34:49,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:34:49,649 INFO L225 Difference]: With dead ends: 67 [2025-03-04 07:34:49,649 INFO L226 Difference]: Without dead ends: 67 [2025-03-04 07:34:49,650 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 07:34:49,650 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 15 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:34:49,650 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 57 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:34:49,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-03-04 07:34:49,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2025-03-04 07:34:49,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 56 states have (on average 1.3035714285714286) internal successors, (73), 66 states have internal predecessors, (73), 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) [2025-03-04 07:34:49,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 73 transitions. [2025-03-04 07:34:49,656 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 73 transitions. Word has length 25 [2025-03-04 07:34:49,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:34:49,656 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 73 transitions. [2025-03-04 07:34:49,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 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) [2025-03-04 07:34:49,656 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 73 transitions. [2025-03-04 07:34:49,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-04 07:34:49,657 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:34:49,657 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:34:49,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 07:34:49,657 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 18 more)] === [2025-03-04 07:34:49,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:34:49,658 INFO L85 PathProgramCache]: Analyzing trace with hash 1140573896, now seen corresponding path program 1 times [2025-03-04 07:34:49,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:34:49,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873577804] [2025-03-04 07:34:49,658 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:34:49,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:34:49,665 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 07:34:49,670 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 07:34:49,670 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:34:49,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:34:49,777 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:34:49,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:34:49,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873577804] [2025-03-04 07:34:49,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873577804] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:34:49,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [835241356] [2025-03-04 07:34:49,778 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:34:49,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:34:49,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:34:49,780 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) [2025-03-04 07:34:49,780 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 07:34:49,813 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 07:34:49,825 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 07:34:49,825 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:34:49,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:34:49,826 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 07:34:49,827 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:34:49,922 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:34:49,922 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:34:50,018 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:34:50,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [835241356] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:34:50,019 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:34:50,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 25 [2025-03-04 07:34:50,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576803922] [2025-03-04 07:34:50,019 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:34:50,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-04 07:34:50,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:34:50,020 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-04 07:34:50,020 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=259, Invalid=341, Unknown=0, NotChecked=0, Total=600 [2025-03-04 07:34:50,020 INFO L87 Difference]: Start difference. First operand 67 states and 73 transitions. Second operand has 25 states, 25 states have (on average 2.68) internal successors, (67), 25 states have internal predecessors, (67), 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) [2025-03-04 07:34:50,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:34:50,211 INFO L93 Difference]: Finished difference Result 115 states and 135 transitions. [2025-03-04 07:34:50,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-04 07:34:50,212 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.68) internal successors, (67), 25 states have internal predecessors, (67), 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 25 [2025-03-04 07:34:50,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:34:50,212 INFO L225 Difference]: With dead ends: 115 [2025-03-04 07:34:50,212 INFO L226 Difference]: Without dead ends: 115 [2025-03-04 07:34:50,213 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 305 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=392, Invalid=600, Unknown=0, NotChecked=0, Total=992 [2025-03-04 07:34:50,213 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 252 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:34:50,213 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [252 Valid, 112 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:34:50,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2025-03-04 07:34:50,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 97. [2025-03-04 07:34:50,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 86 states have (on average 1.2209302325581395) internal successors, (105), 96 states have internal predecessors, (105), 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) [2025-03-04 07:34:50,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 105 transitions. [2025-03-04 07:34:50,217 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 105 transitions. Word has length 25 [2025-03-04 07:34:50,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:34:50,217 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 105 transitions. [2025-03-04 07:34:50,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.68) internal successors, (67), 25 states have internal predecessors, (67), 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) [2025-03-04 07:34:50,218 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 105 transitions. [2025-03-04 07:34:50,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-04 07:34:50,218 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:34:50,218 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:34:50,225 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 07:34:50,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:34:50,419 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 18 more)] === [2025-03-04 07:34:50,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:34:50,419 INFO L85 PathProgramCache]: Analyzing trace with hash -2014809656, now seen corresponding path program 2 times [2025-03-04 07:34:50,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:34:50,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140277487] [2025-03-04 07:34:50,420 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 07:34:50,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:34:50,430 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 49 statements into 2 equivalence classes. [2025-03-04 07:34:50,434 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 7 of 49 statements. [2025-03-04 07:34:50,434 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 07:34:50,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:34:50,537 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 287 trivial. 0 not checked. [2025-03-04 07:34:50,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:34:50,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140277487] [2025-03-04 07:34:50,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140277487] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:34:50,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:34:50,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 07:34:50,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304652212] [2025-03-04 07:34:50,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:34:50,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 07:34:50,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:34:50,538 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 07:34:50,538 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 07:34:50,539 INFO L87 Difference]: Start difference. First operand 97 states and 105 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 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) [2025-03-04 07:34:50,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:34:50,600 INFO L93 Difference]: Finished difference Result 85 states and 91 transitions. [2025-03-04 07:34:50,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 07:34:50,600 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 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 49 [2025-03-04 07:34:50,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:34:50,601 INFO L225 Difference]: With dead ends: 85 [2025-03-04 07:34:50,601 INFO L226 Difference]: Without dead ends: 85 [2025-03-04 07:34:50,601 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-04 07:34:50,601 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 26 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:34:50,601 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 37 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:34:50,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2025-03-04 07:34:50,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2025-03-04 07:34:50,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 80 states have (on average 1.1375) internal successors, (91), 84 states have internal predecessors, (91), 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) [2025-03-04 07:34:50,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 91 transitions. [2025-03-04 07:34:50,604 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 91 transitions. Word has length 49 [2025-03-04 07:34:50,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:34:50,605 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 91 transitions. [2025-03-04 07:34:50,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 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) [2025-03-04 07:34:50,605 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 91 transitions. [2025-03-04 07:34:50,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-04 07:34:50,605 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:34:50,605 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:34:50,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 07:34:50,605 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 18 more)] === [2025-03-04 07:34:50,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:34:50,606 INFO L85 PathProgramCache]: Analyzing trace with hash -1026525989, now seen corresponding path program 1 times [2025-03-04 07:34:50,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:34:50,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810582011] [2025-03-04 07:34:50,606 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:34:50,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:34:50,617 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-04 07:34:50,626 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-04 07:34:50,627 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:34:50,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:34:50,907 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 0 proven. 287 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 07:34:50,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:34:50,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810582011] [2025-03-04 07:34:50,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810582011] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:34:50,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [646025656] [2025-03-04 07:34:50,909 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:34:50,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:34:50,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:34:50,911 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) [2025-03-04 07:34:50,912 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 07:34:50,954 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-04 07:34:50,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-04 07:34:50,992 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:34:50,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:34:50,994 INFO L256 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-04 07:34:50,995 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:34:51,259 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 0 proven. 287 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 07:34:51,259 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:34:51,590 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 0 proven. 287 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 07:34:51,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [646025656] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:34:51,590 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:34:51,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 49 [2025-03-04 07:34:51,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602624296] [2025-03-04 07:34:51,590 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:34:51,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2025-03-04 07:34:51,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:34:51,592 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2025-03-04 07:34:51,593 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1027, Invalid=1325, Unknown=0, NotChecked=0, Total=2352 [2025-03-04 07:34:51,593 INFO L87 Difference]: Start difference. First operand 85 states and 91 transitions. Second operand has 49 states, 49 states have (on average 2.877551020408163) internal successors, (141), 49 states have internal predecessors, (141), 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) [2025-03-04 07:34:52,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:34:52,123 INFO L93 Difference]: Finished difference Result 199 states and 241 transitions. [2025-03-04 07:34:52,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-03-04 07:34:52,124 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 2.877551020408163) internal successors, (141), 49 states have internal predecessors, (141), 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 52 [2025-03-04 07:34:52,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:34:52,125 INFO L225 Difference]: With dead ends: 199 [2025-03-04 07:34:52,125 INFO L226 Difference]: Without dead ends: 199 [2025-03-04 07:34:52,126 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1377 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1552, Invalid=2480, Unknown=0, NotChecked=0, Total=4032 [2025-03-04 07:34:52,127 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 332 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 332 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:34:52,127 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [332 Valid, 88 Invalid, 368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 07:34:52,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2025-03-04 07:34:52,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 157. [2025-03-04 07:34:52,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 152 states have (on average 1.125) internal successors, (171), 156 states have internal predecessors, (171), 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) [2025-03-04 07:34:52,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 171 transitions. [2025-03-04 07:34:52,136 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 171 transitions. Word has length 52 [2025-03-04 07:34:52,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:34:52,136 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 171 transitions. [2025-03-04 07:34:52,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 2.877551020408163) internal successors, (141), 49 states have internal predecessors, (141), 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) [2025-03-04 07:34:52,136 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 171 transitions. [2025-03-04 07:34:52,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-04 07:34:52,138 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:34:52,138 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:34:52,145 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-04 07:34:52,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:34:52,339 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 18 more)] === [2025-03-04 07:34:52,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:34:52,339 INFO L85 PathProgramCache]: Analyzing trace with hash -419275045, now seen corresponding path program 2 times [2025-03-04 07:34:52,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:34:52,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082014205] [2025-03-04 07:34:52,339 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 07:34:52,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:34:52,358 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 100 statements into 2 equivalence classes. [2025-03-04 07:34:52,379 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 100 of 100 statements. [2025-03-04 07:34:52,379 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 07:34:52,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:34:52,823 INFO L134 CoverageAnalysis]: Checked inductivity of 1337 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1335 trivial. 0 not checked. [2025-03-04 07:34:52,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:34:52,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082014205] [2025-03-04 07:34:52,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082014205] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:34:52,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [246815234] [2025-03-04 07:34:52,823 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 07:34:52,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:34:52,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:34:52,827 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) [2025-03-04 07:34:52,828 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 07:34:52,881 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 100 statements into 2 equivalence classes. [2025-03-04 07:34:52,922 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 100 of 100 statements. [2025-03-04 07:34:52,923 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 07:34:52,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:34:52,925 INFO L256 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-04 07:34:52,927 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:34:53,745 INFO L134 CoverageAnalysis]: Checked inductivity of 1337 backedges. 0 proven. 1335 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 07:34:53,746 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:34:54,786 INFO L134 CoverageAnalysis]: Checked inductivity of 1337 backedges. 0 proven. 1335 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 07:34:54,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [246815234] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:34:54,786 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:34:54,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 34, 34] total 71 [2025-03-04 07:34:54,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939835297] [2025-03-04 07:34:54,787 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:34:54,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 71 states [2025-03-04 07:34:54,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:34:54,788 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2025-03-04 07:34:54,791 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=2100, Invalid=2870, Unknown=0, NotChecked=0, Total=4970 [2025-03-04 07:34:54,792 INFO L87 Difference]: Start difference. First operand 157 states and 171 transitions. Second operand has 71 states, 71 states have (on average 2.887323943661972) internal successors, (205), 71 states have internal predecessors, (205), 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) [2025-03-04 07:35:00,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:35:00,029 INFO L93 Difference]: Finished difference Result 390 states and 421 transitions. [2025-03-04 07:35:00,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2025-03-04 07:35:00,029 INFO L78 Accepts]: Start accepts. Automaton has has 71 states, 71 states have (on average 2.887323943661972) internal successors, (205), 71 states have internal predecessors, (205), 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 100 [2025-03-04 07:35:00,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:35:00,030 INFO L225 Difference]: With dead ends: 390 [2025-03-04 07:35:00,030 INFO L226 Difference]: Without dead ends: 390 [2025-03-04 07:35:00,035 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6458 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=8917, Invalid=17815, Unknown=0, NotChecked=0, Total=26732 [2025-03-04 07:35:00,036 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 932 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 450 mSolverCounterSat, 401 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 932 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 851 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 401 IncrementalHoareTripleChecker+Valid, 450 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 07:35:00,037 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [932 Valid, 85 Invalid, 851 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [401 Valid, 450 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 07:35:00,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2025-03-04 07:35:00,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 300. [2025-03-04 07:35:00,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 296 states have (on average 1.0168918918918919) internal successors, (301), 299 states have internal predecessors, (301), 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) [2025-03-04 07:35:00,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 301 transitions. [2025-03-04 07:35:00,049 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 301 transitions. Word has length 100 [2025-03-04 07:35:00,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:35:00,050 INFO L471 AbstractCegarLoop]: Abstraction has 300 states and 301 transitions. [2025-03-04 07:35:00,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 71 states, 71 states have (on average 2.887323943661972) internal successors, (205), 71 states have internal predecessors, (205), 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) [2025-03-04 07:35:00,051 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 301 transitions. [2025-03-04 07:35:00,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2025-03-04 07:35:00,053 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:35:00,053 INFO L218 NwaCegarLoop]: trace histogram [62, 62, 62, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:35:00,061 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-04 07:35:00,259 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,SelfDestructingSolverStorable11 [2025-03-04 07:35:00,259 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 18 more)] === [2025-03-04 07:35:00,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:35:00,260 INFO L85 PathProgramCache]: Analyzing trace with hash 1046795783, now seen corresponding path program 1 times [2025-03-04 07:35:00,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:35:00,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470340311] [2025-03-04 07:35:00,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:35:00,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:35:00,295 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 290 statements into 1 equivalence classes. [2025-03-04 07:35:00,317 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 290 of 290 statements. [2025-03-04 07:35:00,317 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:35:00,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:35:00,450 INFO L134 CoverageAnalysis]: Checked inductivity of 7161 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7161 trivial. 0 not checked. [2025-03-04 07:35:00,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:35:00,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470340311] [2025-03-04 07:35:00,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470340311] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:35:00,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:35:00,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 07:35:00,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498063342] [2025-03-04 07:35:00,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:35:00,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:35:00,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:35:00,451 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:35:00,451 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:35:00,451 INFO L87 Difference]: Start difference. First operand 300 states and 301 transitions. Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 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) [2025-03-04 07:35:00,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:35:00,463 INFO L93 Difference]: Finished difference Result 298 states and 299 transitions. [2025-03-04 07:35:00,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:35:00,463 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 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 290 [2025-03-04 07:35:00,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:35:00,464 INFO L225 Difference]: With dead ends: 298 [2025-03-04 07:35:00,464 INFO L226 Difference]: Without dead ends: 298 [2025-03-04 07:35:00,464 INFO L434 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 [2025-03-04 07:35:00,465 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 8 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:35:00,465 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 18 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:35:00,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2025-03-04 07:35:00,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 298. [2025-03-04 07:35:00,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 296 states have (on average 1.010135135135135) internal successors, (299), 297 states have internal predecessors, (299), 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) [2025-03-04 07:35:00,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 299 transitions. [2025-03-04 07:35:00,472 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 299 transitions. Word has length 290 [2025-03-04 07:35:00,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:35:00,473 INFO L471 AbstractCegarLoop]: Abstraction has 298 states and 299 transitions. [2025-03-04 07:35:00,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 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) [2025-03-04 07:35:00,473 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 299 transitions. [2025-03-04 07:35:00,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2025-03-04 07:35:00,476 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:35:00,476 INFO L218 NwaCegarLoop]: trace histogram [62, 62, 62, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:35:00,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 07:35:00,476 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 18 more)] === [2025-03-04 07:35:00,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:35:00,476 INFO L85 PathProgramCache]: Analyzing trace with hash 948399557, now seen corresponding path program 1 times [2025-03-04 07:35:00,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:35:00,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926592560] [2025-03-04 07:35:00,480 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:35:00,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:35:00,506 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 292 statements into 1 equivalence classes. [2025-03-04 07:35:00,571 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 292 of 292 statements. [2025-03-04 07:35:00,571 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:35:00,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:35:03,634 INFO L134 CoverageAnalysis]: Checked inductivity of 7161 backedges. 0 proven. 5735 refuted. 0 times theorem prover too weak. 1426 trivial. 0 not checked. [2025-03-04 07:35:03,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:35:03,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926592560] [2025-03-04 07:35:03,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926592560] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:35:03,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2087493681] [2025-03-04 07:35:03,634 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:35:03,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:35:03,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:35:03,636 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) [2025-03-04 07:35:03,637 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 07:35:03,760 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 292 statements into 1 equivalence classes. [2025-03-04 07:35:03,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 292 of 292 statements. [2025-03-04 07:35:03,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:35:03,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:35:03,874 INFO L256 TraceCheckSpWp]: Trace formula consists of 1109 conjuncts, 65 conjuncts are in the unsatisfiable core [2025-03-04 07:35:03,882 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:35:05,619 INFO L134 CoverageAnalysis]: Checked inductivity of 7161 backedges. 0 proven. 5735 refuted. 0 times theorem prover too weak. 1426 trivial. 0 not checked. [2025-03-04 07:35:05,620 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:35:09,307 INFO L134 CoverageAnalysis]: Checked inductivity of 7161 backedges. 0 proven. 5735 refuted. 0 times theorem prover too weak. 1426 trivial. 0 not checked. [2025-03-04 07:35:09,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2087493681] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:35:09,308 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:35:09,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66, 66] total 193 [2025-03-04 07:35:09,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951006660] [2025-03-04 07:35:09,308 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:35:09,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 193 states [2025-03-04 07:35:09,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:35:09,311 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 193 interpolants. [2025-03-04 07:35:09,315 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16387, Invalid=20669, Unknown=0, NotChecked=0, Total=37056 [2025-03-04 07:35:09,316 INFO L87 Difference]: Start difference. First operand 298 states and 299 transitions. Second operand has 193 states, 193 states have (on average 3.005181347150259) internal successors, (580), 193 states have internal predecessors, (580), 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) [2025-03-04 07:35:16,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:35:16,579 INFO L93 Difference]: Finished difference Result 772 states and 835 transitions. [2025-03-04 07:35:16,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2025-03-04 07:35:16,580 INFO L78 Accepts]: Start accepts. Automaton has has 193 states, 193 states have (on average 3.005181347150259) internal successors, (580), 193 states have internal predecessors, (580), 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 292 [2025-03-04 07:35:16,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:35:16,582 INFO L225 Difference]: With dead ends: 772 [2025-03-04 07:35:16,582 INFO L226 Difference]: Without dead ends: 772 [2025-03-04 07:35:16,585 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 711 GetRequests, 457 SyntacticMatches, 0 SemanticMatches, 254 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23937 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=24640, Invalid=40640, Unknown=0, NotChecked=0, Total=65280 [2025-03-04 07:35:16,585 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 1431 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 1049 mSolverCounterSat, 514 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1431 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 1563 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 514 IncrementalHoareTripleChecker+Valid, 1049 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:35:16,586 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1431 Valid, 112 Invalid, 1563 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [514 Valid, 1049 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-04 07:35:16,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 772 states. [2025-03-04 07:35:16,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 772 to 586. [2025-03-04 07:35:16,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 586 states, 584 states have (on average 1.00513698630137) internal successors, (587), 585 states have internal predecessors, (587), 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) [2025-03-04 07:35:16,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 586 states and 587 transitions. [2025-03-04 07:35:16,594 INFO L78 Accepts]: Start accepts. Automaton has 586 states and 587 transitions. Word has length 292 [2025-03-04 07:35:16,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:35:16,594 INFO L471 AbstractCegarLoop]: Abstraction has 586 states and 587 transitions. [2025-03-04 07:35:16,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 193 states, 193 states have (on average 3.005181347150259) internal successors, (580), 193 states have internal predecessors, (580), 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) [2025-03-04 07:35:16,595 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 587 transitions. [2025-03-04 07:35:16,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 581 [2025-03-04 07:35:16,600 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:35:16,600 INFO L218 NwaCegarLoop]: trace histogram [126, 126, 126, 63, 63, 63, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:35:16,608 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-04 07:35:16,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:35:16,801 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 18 more)] === [2025-03-04 07:35:16,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:35:16,801 INFO L85 PathProgramCache]: Analyzing trace with hash -469572667, now seen corresponding path program 2 times [2025-03-04 07:35:16,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:35:16,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449746738] [2025-03-04 07:35:16,802 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 07:35:16,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:35:16,848 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 580 statements into 2 equivalence classes. [2025-03-04 07:35:16,955 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 580 of 580 statements. [2025-03-04 07:35:16,955 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 07:35:16,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:35:20,760 INFO L134 CoverageAnalysis]: Checked inductivity of 29673 backedges. 0 proven. 5922 refuted. 0 times theorem prover too weak. 23751 trivial. 0 not checked. [2025-03-04 07:35:20,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:35:20,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449746738] [2025-03-04 07:35:20,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449746738] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:35:20,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [666768054] [2025-03-04 07:35:20,761 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 07:35:20,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:35:20,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:35:20,763 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) [2025-03-04 07:35:20,777 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 07:35:20,924 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 580 statements into 2 equivalence classes. [2025-03-04 07:35:21,092 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 580 of 580 statements. [2025-03-04 07:35:21,092 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 07:35:21,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:35:21,102 INFO L256 TraceCheckSpWp]: Trace formula consists of 2165 conjuncts, 129 conjuncts are in the unsatisfiable core [2025-03-04 07:35:21,111 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:35:26,755 INFO L134 CoverageAnalysis]: Checked inductivity of 29673 backedges. 0 proven. 23751 refuted. 0 times theorem prover too weak. 5922 trivial. 0 not checked. [2025-03-04 07:35:26,756 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:35:34,504 INFO L134 CoverageAnalysis]: Checked inductivity of 29673 backedges. 0 proven. 23751 refuted. 0 times theorem prover too weak. 5922 trivial. 0 not checked. [2025-03-04 07:35:34,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [666768054] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:35:34,505 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:35:34,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 130, 130] total 322 [2025-03-04 07:35:34,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2829525] [2025-03-04 07:35:34,505 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:35:34,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 322 states [2025-03-04 07:35:34,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:35:34,512 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 322 interpolants. [2025-03-04 07:35:34,516 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29247, Invalid=74115, Unknown=0, NotChecked=0, Total=103362 [2025-03-04 07:35:34,518 INFO L87 Difference]: Start difference. First operand 586 states and 587 transitions. Second operand has 322 states, 322 states have (on average 3.0217391304347827) internal successors, (973), 322 states have internal predecessors, (973), 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) [2025-03-04 07:35:44,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:35:44,049 INFO L93 Difference]: Finished difference Result 784 states and 785 transitions. [2025-03-04 07:35:44,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 131 states. [2025-03-04 07:35:44,051 INFO L78 Accepts]: Start accepts. Automaton has has 322 states, 322 states have (on average 3.0217391304347827) internal successors, (973), 322 states have internal predecessors, (973), 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 580 [2025-03-04 07:35:44,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:35:44,053 INFO L225 Difference]: With dead ends: 784 [2025-03-04 07:35:44,053 INFO L226 Difference]: Without dead ends: 784 [2025-03-04 07:35:44,056 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1228 GetRequests, 906 SyntacticMatches, 0 SemanticMatches, 322 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56640 ImplicationChecksByTransitivity, 13.5s TimeCoverageRelationStatistics Valid=29702, Invalid=74950, Unknown=0, NotChecked=0, Total=104652 [2025-03-04 07:35:44,056 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 2047 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 1462 mSolverCounterSat, 1070 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2047 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 2532 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1070 IncrementalHoareTripleChecker+Valid, 1462 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:35:44,057 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2047 Valid, 170 Invalid, 2532 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1070 Valid, 1462 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-04 07:35:44,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 784 states. [2025-03-04 07:35:44,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 784 to 784. [2025-03-04 07:35:44,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 784 states, 782 states have (on average 1.0038363171355498) internal successors, (785), 783 states have internal predecessors, (785), 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) [2025-03-04 07:35:44,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 785 transitions. [2025-03-04 07:35:44,066 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 785 transitions. Word has length 580 [2025-03-04 07:35:44,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:35:44,066 INFO L471 AbstractCegarLoop]: Abstraction has 784 states and 785 transitions. [2025-03-04 07:35:44,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 322 states, 322 states have (on average 3.0217391304347827) internal successors, (973), 322 states have internal predecessors, (973), 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) [2025-03-04 07:35:44,067 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 785 transitions. [2025-03-04 07:35:44,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 779 [2025-03-04 07:35:44,075 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:35:44,075 INFO L218 NwaCegarLoop]: trace histogram [128, 128, 128, 127, 127, 127, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:35:44,084 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-04 07:35:44,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:35:44,276 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 18 more)] === [2025-03-04 07:35:44,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:35:44,276 INFO L85 PathProgramCache]: Analyzing trace with hash 525042949, now seen corresponding path program 3 times [2025-03-04 07:35:44,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:35:44,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502280101] [2025-03-04 07:35:44,277 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 07:35:44,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:35:44,343 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 778 statements into 129 equivalence classes. [2025-03-04 07:35:46,088 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 128 check-sat command(s) and asserted 775 of 778 statements. [2025-03-04 07:35:46,089 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 128 check-sat command(s) [2025-03-04 07:35:46,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat