./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-simple/deep-nested.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability 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/AutomizerReach.xml -i ../sv-benchmarks/c/loop-simple/deep-nested.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-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 ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f4fa4f6a03e1cc5362361e8e2a443a39504511936859bef102e6d3337f038be8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 13:40:11,989 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 13:40:12,042 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 13:40:12,046 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 13:40:12,046 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 13:40:12,070 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 13:40:12,070 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 13:40:12,073 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 13:40:12,073 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 13:40:12,073 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 13:40:12,074 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 13:40:12,074 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 13:40:12,074 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 13:40:12,074 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 13:40:12,074 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 13:40:12,075 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 13:40:12,075 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 13:40:12,075 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 13:40:12,075 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 13:40:12,075 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 13:40:12,075 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 13:40:12,075 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 13:40:12,075 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 13:40:12,075 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 13:40:12,075 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 13:40:12,075 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 13:40:12,075 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 13:40:12,075 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 13:40:12,075 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 13:40:12,075 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 13:40:12,076 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 13:40:12,076 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 13:40:12,076 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 13:40:12,076 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 13:40:12,076 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 13:40:12,076 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 13:40:12,076 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 13:40:12,076 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 13:40:12,076 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 13:40:12,076 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 13:40:12,076 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 13:40:12,076 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 13:40:12,076 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 13:40:12,076 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 ! call(reach_error())) ) 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 -> f4fa4f6a03e1cc5362361e8e2a443a39504511936859bef102e6d3337f038be8 [2025-03-03 13:40:12,278 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 13:40:12,286 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 13:40:12,288 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 13:40:12,288 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 13:40:12,289 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 13:40:12,290 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-simple/deep-nested.c [2025-03-03 13:40:13,376 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c5951ed95/0f938d91db214aabb569491c24b4fb2c/FLAG00c01a2e1 [2025-03-03 13:40:13,599 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 13:40:13,600 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-simple/deep-nested.c [2025-03-03 13:40:13,605 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c5951ed95/0f938d91db214aabb569491c24b4fb2c/FLAG00c01a2e1 [2025-03-03 13:40:13,950 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c5951ed95/0f938d91db214aabb569491c24b4fb2c [2025-03-03 13:40:13,952 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 13:40:13,953 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 13:40:13,954 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 13:40:13,954 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 13:40:13,958 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 13:40:13,958 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 01:40:13" (1/1) ... [2025-03-03 13:40:13,959 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2fed0f3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:40:13, skipping insertion in model container [2025-03-03 13:40:13,959 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 01:40:13" (1/1) ... [2025-03-03 13:40:13,967 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 13:40:14,064 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-simple/deep-nested.c[863,876] [2025-03-03 13:40:14,070 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 13:40:14,077 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 13:40:14,088 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-simple/deep-nested.c[863,876] [2025-03-03 13:40:14,089 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 13:40:14,097 INFO L204 MainTranslator]: Completed translation [2025-03-03 13:40:14,098 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:40:14 WrapperNode [2025-03-03 13:40:14,098 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 13:40:14,099 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 13:40:14,099 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 13:40:14,099 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 13:40:14,103 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:40:14" (1/1) ... [2025-03-03 13:40:14,109 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:40:14" (1/1) ... [2025-03-03 13:40:14,118 INFO L138 Inliner]: procedures = 10, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 45 [2025-03-03 13:40:14,118 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 13:40:14,119 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 13:40:14,119 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 13:40:14,119 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 13:40:14,124 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:40:14" (1/1) ... [2025-03-03 13:40:14,125 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:40:14" (1/1) ... [2025-03-03 13:40:14,129 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:40:14" (1/1) ... [2025-03-03 13:40:14,139 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 13:40:14,140 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:40:14" (1/1) ... [2025-03-03 13:40:14,140 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:40:14" (1/1) ... [2025-03-03 13:40:14,141 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:40:14" (1/1) ... [2025-03-03 13:40:14,142 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:40:14" (1/1) ... [2025-03-03 13:40:14,143 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:40:14" (1/1) ... [2025-03-03 13:40:14,143 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:40:14" (1/1) ... [2025-03-03 13:40:14,144 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 13:40:14,145 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 13:40:14,146 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 13:40:14,146 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 13:40:14,146 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:40:14" (1/1) ... [2025-03-03 13:40:14,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 13:40:14,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:40:14,174 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-03 13:40:14,179 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-03 13:40:14,193 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 13:40:14,193 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 13:40:14,193 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 13:40:14,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 13:40:14,230 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 13:40:14,231 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 13:40:14,359 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-03-03 13:40:14,360 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 13:40:14,369 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 13:40:14,369 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 13:40:14,369 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 01:40:14 BoogieIcfgContainer [2025-03-03 13:40:14,369 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 13:40:14,373 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 13:40:14,373 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 13:40:14,377 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 13:40:14,377 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 01:40:13" (1/3) ... [2025-03-03 13:40:14,378 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50d62eae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 01:40:14, skipping insertion in model container [2025-03-03 13:40:14,378 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:40:14" (2/3) ... [2025-03-03 13:40:14,378 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50d62eae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 01:40:14, skipping insertion in model container [2025-03-03 13:40:14,378 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 01:40:14" (3/3) ... [2025-03-03 13:40:14,380 INFO L128 eAbstractionObserver]: Analyzing ICFG deep-nested.c [2025-03-03 13:40:14,392 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 13:40:14,393 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG deep-nested.c that has 1 procedures, 14 locations, 1 initial locations, 5 loop locations, and 1 error locations. [2025-03-03 13:40:14,437 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 13:40:14,449 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=LoopHeads, 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;@456b0024, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 13:40:14,449 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 13:40:14,452 INFO L276 IsEmpty]: Start isEmpty. Operand has 14 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 13 states have internal predecessors, (19), 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-03 13:40:14,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-03 13:40:14,455 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:40:14,456 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:40:14,456 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:40:14,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:40:14,462 INFO L85 PathProgramCache]: Analyzing trace with hash -1344995443, now seen corresponding path program 1 times [2025-03-03 13:40:14,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:40:14,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473355995] [2025-03-03 13:40:14,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:40:14,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:40:14,526 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-03 13:40:14,548 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-03 13:40:14,549 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:40:14,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:40:14,726 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-03 13:40:14,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:40:14,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473355995] [2025-03-03 13:40:14,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473355995] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:40:14,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 13:40:14,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 13:40:14,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048811381] [2025-03-03 13:40:14,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:40:14,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 13:40:14,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:40:14,745 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 13:40:14,746 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 13:40:14,747 INFO L87 Difference]: Start difference. First operand has 14 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 13 states have internal predecessors, (19), 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 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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-03 13:40:14,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:40:14,821 INFO L93 Difference]: Finished difference Result 29 states and 41 transitions. [2025-03-03 13:40:14,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 13:40:14,823 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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-03 13:40:14,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:40:14,827 INFO L225 Difference]: With dead ends: 29 [2025-03-03 13:40:14,827 INFO L226 Difference]: Without dead ends: 14 [2025-03-03 13:40:14,829 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-03 13:40:14,831 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 14 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:40:14,833 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 10 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:40:14,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2025-03-03 13:40:14,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2025-03-03 13:40:14,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 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-03 13:40:14,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. [2025-03-03 13:40:14,855 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 17 transitions. Word has length 9 [2025-03-03 13:40:14,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:40:14,855 INFO L471 AbstractCegarLoop]: Abstraction has 13 states and 17 transitions. [2025-03-03 13:40:14,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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-03 13:40:14,856 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 17 transitions. [2025-03-03 13:40:14,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-03 13:40:14,857 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:40:14,858 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:40:14,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 13:40:14,859 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:40:14,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:40:14,859 INFO L85 PathProgramCache]: Analyzing trace with hash -1008462239, now seen corresponding path program 1 times [2025-03-03 13:40:14,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:40:14,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665125680] [2025-03-03 13:40:14,859 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:40:14,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:40:14,864 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-03 13:40:14,874 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-03 13:40:14,874 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:40:14,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:40:15,110 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-03 13:40:15,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:40:15,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665125680] [2025-03-03 13:40:15,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665125680] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:40:15,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [328932044] [2025-03-03 13:40:15,114 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:40:15,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:40:15,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:40:15,116 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-03 13:40:15,117 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-03 13:40:15,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-03 13:40:15,154 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-03 13:40:15,154 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:40:15,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:40:15,157 INFO L256 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-03 13:40:15,160 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:40:15,333 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-03 13:40:15,333 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:40:15,534 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-03 13:40:15,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [328932044] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:40:15,535 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:40:15,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-03-03 13:40:15,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932879879] [2025-03-03 13:40:15,535 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:40:15,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 13:40:15,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:40:15,536 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 13:40:15,536 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2025-03-03 13:40:15,537 INFO L87 Difference]: Start difference. First operand 13 states and 17 transitions. Second operand has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 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-03 13:40:15,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:40:15,864 INFO L93 Difference]: Finished difference Result 45 states and 64 transitions. [2025-03-03 13:40:15,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 13:40:15,864 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 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 12 [2025-03-03 13:40:15,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:40:15,865 INFO L225 Difference]: With dead ends: 45 [2025-03-03 13:40:15,865 INFO L226 Difference]: Without dead ends: 43 [2025-03-03 13:40:15,866 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2025-03-03 13:40:15,866 INFO L435 NwaCegarLoop]: 3 mSDtfsCounter, 57 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 13:40:15,866 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 13 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 13:40:15,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2025-03-03 13:40:15,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 29. [2025-03-03 13:40:15,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.4285714285714286) internal successors, (40), 28 states have internal predecessors, (40), 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-03 13:40:15,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 40 transitions. [2025-03-03 13:40:15,874 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 40 transitions. Word has length 12 [2025-03-03 13:40:15,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:40:15,874 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 40 transitions. [2025-03-03 13:40:15,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 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-03 13:40:15,874 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 40 transitions. [2025-03-03 13:40:15,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-03 13:40:15,875 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:40:15,875 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:40:15,881 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-03 13:40:16,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:40:16,079 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:40:16,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:40:16,080 INFO L85 PathProgramCache]: Analyzing trace with hash 1145942957, now seen corresponding path program 1 times [2025-03-03 13:40:16,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:40:16,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691312297] [2025-03-03 13:40:16,080 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:40:16,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:40:16,084 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-03 13:40:16,094 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-03 13:40:16,095 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:40:16,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:40:16,230 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-03 13:40:16,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:40:16,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691312297] [2025-03-03 13:40:16,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691312297] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:40:16,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [857171491] [2025-03-03 13:40:16,231 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:40:16,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:40:16,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:40:16,233 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-03 13:40:16,234 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-03 13:40:16,256 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-03 13:40:16,268 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-03 13:40:16,268 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:40:16,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:40:16,268 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 13:40:16,269 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:40:16,291 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-03 13:40:16,291 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 13:40:16,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [857171491] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:40:16,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 13:40:16,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2025-03-03 13:40:16,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474576714] [2025-03-03 13:40:16,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:40:16,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 13:40:16,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:40:16,292 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 13:40:16,292 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-03 13:40:16,292 INFO L87 Difference]: Start difference. First operand 29 states and 40 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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-03 13:40:16,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:40:16,353 INFO L93 Difference]: Finished difference Result 73 states and 102 transitions. [2025-03-03 13:40:16,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 13:40:16,354 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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 22 [2025-03-03 13:40:16,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:40:16,354 INFO L225 Difference]: With dead ends: 73 [2025-03-03 13:40:16,354 INFO L226 Difference]: Without dead ends: 54 [2025-03-03 13:40:16,354 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-03 13:40:16,355 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 37 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:40:16,355 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 10 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:40:16,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-03-03 13:40:16,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 31. [2025-03-03 13:40:16,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.4) internal successors, (42), 30 states have internal predecessors, (42), 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-03 13:40:16,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 42 transitions. [2025-03-03 13:40:16,366 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 42 transitions. Word has length 22 [2025-03-03 13:40:16,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:40:16,366 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 42 transitions. [2025-03-03 13:40:16,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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-03 13:40:16,366 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 42 transitions. [2025-03-03 13:40:16,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-03 13:40:16,367 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:40:16,367 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:40:16,373 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-03 13:40:16,567 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,SelfDestructingSolverStorable2 [2025-03-03 13:40:16,567 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:40:16,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:40:16,568 INFO L85 PathProgramCache]: Analyzing trace with hash 568341432, now seen corresponding path program 1 times [2025-03-03 13:40:16,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:40:16,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186079874] [2025-03-03 13:40:16,568 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:40:16,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:40:16,572 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-03 13:40:16,591 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-03 13:40:16,591 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:40:16,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:40:16,725 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-03 13:40:16,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:40:16,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186079874] [2025-03-03 13:40:16,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186079874] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:40:16,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1164489221] [2025-03-03 13:40:16,725 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:40:16,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:40:16,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:40:16,728 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-03 13:40:16,729 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-03 13:40:16,750 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-03 13:40:16,763 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-03 13:40:16,763 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:40:16,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:40:16,763 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 13:40:16,764 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:40:16,796 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-03 13:40:16,796 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 13:40:16,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1164489221] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:40:16,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 13:40:16,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2025-03-03 13:40:16,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179726522] [2025-03-03 13:40:16,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:40:16,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 13:40:16,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:40:16,797 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 13:40:16,797 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-03 13:40:16,797 INFO L87 Difference]: Start difference. First operand 31 states and 42 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 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-03 13:40:16,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:40:16,866 INFO L93 Difference]: Finished difference Result 81 states and 112 transitions. [2025-03-03 13:40:16,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 13:40:16,866 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 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 24 [2025-03-03 13:40:16,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:40:16,867 INFO L225 Difference]: With dead ends: 81 [2025-03-03 13:40:16,867 INFO L226 Difference]: Without dead ends: 54 [2025-03-03 13:40:16,867 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2025-03-03 13:40:16,867 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 54 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:40:16,868 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 11 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:40:16,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-03-03 13:40:16,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 33. [2025-03-03 13:40:16,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.375) internal successors, (44), 32 states have internal predecessors, (44), 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-03 13:40:16,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 44 transitions. [2025-03-03 13:40:16,879 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 44 transitions. Word has length 24 [2025-03-03 13:40:16,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:40:16,879 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 44 transitions. [2025-03-03 13:40:16,879 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 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-03 13:40:16,879 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 44 transitions. [2025-03-03 13:40:16,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-03 13:40:16,880 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:40:16,880 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:40:16,885 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-03 13:40:17,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:40:17,081 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:40:17,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:40:17,081 INFO L85 PathProgramCache]: Analyzing trace with hash -1475178449, now seen corresponding path program 1 times [2025-03-03 13:40:17,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:40:17,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180088269] [2025-03-03 13:40:17,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:40:17,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:40:17,085 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-03 13:40:17,093 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-03 13:40:17,093 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:40:17,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:40:17,238 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-03 13:40:17,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:40:17,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180088269] [2025-03-03 13:40:17,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180088269] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:40:17,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1658002346] [2025-03-03 13:40:17,240 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:40:17,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:40:17,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:40:17,243 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-03 13:40:17,245 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-03 13:40:17,270 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-03 13:40:17,281 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-03 13:40:17,281 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:40:17,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:40:17,283 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 13:40:17,284 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:40:17,315 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-03 13:40:17,316 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 13:40:17,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1658002346] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:40:17,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 13:40:17,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2025-03-03 13:40:17,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370313471] [2025-03-03 13:40:17,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:40:17,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 13:40:17,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:40:17,317 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 13:40:17,318 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-03 13:40:17,318 INFO L87 Difference]: Start difference. First operand 33 states and 44 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 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-03 13:40:17,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:40:17,381 INFO L93 Difference]: Finished difference Result 67 states and 91 transitions. [2025-03-03 13:40:17,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 13:40:17,383 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 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 26 [2025-03-03 13:40:17,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:40:17,383 INFO L225 Difference]: With dead ends: 67 [2025-03-03 13:40:17,383 INFO L226 Difference]: Without dead ends: 38 [2025-03-03 13:40:17,383 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2025-03-03 13:40:17,385 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 44 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:40:17,385 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 11 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:40:17,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2025-03-03 13:40:17,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 34. [2025-03-03 13:40:17,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 33 states have (on average 1.3333333333333333) internal successors, (44), 33 states have internal predecessors, (44), 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-03 13:40:17,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 44 transitions. [2025-03-03 13:40:17,396 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 44 transitions. Word has length 26 [2025-03-03 13:40:17,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:40:17,396 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 44 transitions. [2025-03-03 13:40:17,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 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-03 13:40:17,396 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 44 transitions. [2025-03-03 13:40:17,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-03 13:40:17,397 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:40:17,397 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:40:17,405 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-03 13:40:17,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:40:17,598 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:40:17,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:40:17,598 INFO L85 PathProgramCache]: Analyzing trace with hash 1048662178, now seen corresponding path program 2 times [2025-03-03 13:40:17,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:40:17,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046019721] [2025-03-03 13:40:17,599 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 13:40:17,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:40:17,604 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-03-03 13:40:17,608 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 9 of 31 statements. [2025-03-03 13:40:17,608 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-03 13:40:17,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:40:17,708 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-03 13:40:17,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:40:17,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046019721] [2025-03-03 13:40:17,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046019721] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:40:17,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [429836669] [2025-03-03 13:40:17,708 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 13:40:17,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:40:17,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:40:17,711 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-03 13:40:17,712 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-03 13:40:17,733 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-03-03 13:40:17,739 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 9 of 31 statements. [2025-03-03 13:40:17,739 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-03 13:40:17,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:40:17,739 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-03 13:40:17,740 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:40:17,807 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-03 13:40:17,807 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 13:40:17,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [429836669] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:40:17,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 13:40:17,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2025-03-03 13:40:17,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162249656] [2025-03-03 13:40:17,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:40:17,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 13:40:17,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:40:17,808 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 13:40:17,808 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-03 13:40:17,808 INFO L87 Difference]: Start difference. First operand 34 states and 44 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 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-03 13:40:17,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:40:17,852 INFO L93 Difference]: Finished difference Result 60 states and 78 transitions. [2025-03-03 13:40:17,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 13:40:17,852 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 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 31 [2025-03-03 13:40:17,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:40:17,853 INFO L225 Difference]: With dead ends: 60 [2025-03-03 13:40:17,853 INFO L226 Difference]: Without dead ends: 58 [2025-03-03 13:40:17,853 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-03 13:40:17,854 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 3 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 8 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-03 13:40:17,854 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 8 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:40:17,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2025-03-03 13:40:17,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 42. [2025-03-03 13:40:17,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.3414634146341464) internal successors, (55), 41 states have internal predecessors, (55), 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-03 13:40:17,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 55 transitions. [2025-03-03 13:40:17,866 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 55 transitions. Word has length 31 [2025-03-03 13:40:17,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:40:17,866 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 55 transitions. [2025-03-03 13:40:17,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 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-03 13:40:17,867 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 55 transitions. [2025-03-03 13:40:17,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-03 13:40:17,867 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:40:17,868 INFO L218 NwaCegarLoop]: trace histogram [6, 5, 5, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1] [2025-03-03 13:40:17,874 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-03 13:40:18,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:40:18,071 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:40:18,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:40:18,071 INFO L85 PathProgramCache]: Analyzing trace with hash 643498887, now seen corresponding path program 3 times [2025-03-03 13:40:18,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:40:18,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743330064] [2025-03-03 13:40:18,071 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 13:40:18,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:40:18,076 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 40 statements into 6 equivalence classes. [2025-03-03 13:40:18,080 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 9 of 40 statements. [2025-03-03 13:40:18,080 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-03 13:40:18,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:40:18,120 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2025-03-03 13:40:18,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:40:18,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743330064] [2025-03-03 13:40:18,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743330064] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:40:18,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [775113497] [2025-03-03 13:40:18,121 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 13:40:18,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:40:18,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:40:18,123 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-03 13:40:18,125 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-03 13:40:18,146 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 40 statements into 6 equivalence classes. [2025-03-03 13:40:18,151 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 9 of 40 statements. [2025-03-03 13:40:18,151 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-03 13:40:18,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:40:18,152 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-03 13:40:18,153 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:40:18,215 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2025-03-03 13:40:18,215 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 13:40:18,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [775113497] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:40:18,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 13:40:18,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2025-03-03 13:40:18,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676459754] [2025-03-03 13:40:18,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:40:18,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 13:40:18,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:40:18,216 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 13:40:18,216 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 13:40:18,216 INFO L87 Difference]: Start difference. First operand 42 states and 55 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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-03 13:40:18,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:40:18,251 INFO L93 Difference]: Finished difference Result 70 states and 91 transitions. [2025-03-03 13:40:18,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 13:40:18,252 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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 40 [2025-03-03 13:40:18,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:40:18,252 INFO L225 Difference]: With dead ends: 70 [2025-03-03 13:40:18,252 INFO L226 Difference]: Without dead ends: 68 [2025-03-03 13:40:18,252 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 40 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-03 13:40:18,252 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 2 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 7 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-03 13:40:18,253 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 7 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:40:18,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2025-03-03 13:40:18,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 48. [2025-03-03 13:40:18,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 47 states have (on average 1.3404255319148937) internal successors, (63), 47 states have internal predecessors, (63), 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-03 13:40:18,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 63 transitions. [2025-03-03 13:40:18,262 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 63 transitions. Word has length 40 [2025-03-03 13:40:18,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:40:18,263 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 63 transitions. [2025-03-03 13:40:18,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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-03 13:40:18,263 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 63 transitions. [2025-03-03 13:40:18,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-03 13:40:18,263 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:40:18,263 INFO L218 NwaCegarLoop]: trace histogram [7, 6, 6, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1] [2025-03-03 13:40:18,269 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-03 13:40:18,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:40:18,468 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:40:18,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:40:18,468 INFO L85 PathProgramCache]: Analyzing trace with hash -1523231049, now seen corresponding path program 4 times [2025-03-03 13:40:18,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:40:18,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154836204] [2025-03-03 13:40:18,468 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 13:40:18,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:40:18,473 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 47 statements into 2 equivalence classes. [2025-03-03 13:40:18,490 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 47 of 47 statements. [2025-03-03 13:40:18,491 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-03 13:40:18,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:40:18,690 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 16 proven. 35 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2025-03-03 13:40:18,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:40:18,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154836204] [2025-03-03 13:40:18,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1154836204] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:40:18,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [964739252] [2025-03-03 13:40:18,690 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 13:40:18,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:40:18,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:40:18,692 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-03 13:40:18,694 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-03 13:40:18,718 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 47 statements into 2 equivalence classes. [2025-03-03 13:40:18,737 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 47 of 47 statements. [2025-03-03 13:40:18,737 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-03 13:40:18,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:40:18,738 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-03 13:40:18,739 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:40:18,826 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 92 proven. 16 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-03 13:40:18,827 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:40:18,959 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 76 proven. 32 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-03 13:40:18,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [964739252] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:40:18,959 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:40:18,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2025-03-03 13:40:18,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169742949] [2025-03-03 13:40:18,959 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:40:18,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-03 13:40:18,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:40:18,960 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-03 13:40:18,961 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2025-03-03 13:40:18,961 INFO L87 Difference]: Start difference. First operand 48 states and 63 transitions. Second operand has 16 states, 16 states have (on average 4.3125) internal successors, (69), 16 states have internal predecessors, (69), 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-03 13:40:19,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:40:19,117 INFO L93 Difference]: Finished difference Result 138 states and 187 transitions. [2025-03-03 13:40:19,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 13:40:19,117 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.3125) internal successors, (69), 16 states have internal predecessors, (69), 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 47 [2025-03-03 13:40:19,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:40:19,118 INFO L225 Difference]: With dead ends: 138 [2025-03-03 13:40:19,118 INFO L226 Difference]: Without dead ends: 84 [2025-03-03 13:40:19,118 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 85 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=304, Unknown=0, NotChecked=0, Total=380 [2025-03-03 13:40:19,118 INFO L435 NwaCegarLoop]: 3 mSDtfsCounter, 30 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 13:40:19,118 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 18 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 13:40:19,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2025-03-03 13:40:19,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 75. [2025-03-03 13:40:19,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 74 states have (on average 1.2027027027027026) internal successors, (89), 74 states have internal predecessors, (89), 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-03 13:40:19,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 89 transitions. [2025-03-03 13:40:19,134 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 89 transitions. Word has length 47 [2025-03-03 13:40:19,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:40:19,134 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 89 transitions. [2025-03-03 13:40:19,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.3125) internal successors, (69), 16 states have internal predecessors, (69), 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-03 13:40:19,134 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 89 transitions. [2025-03-03 13:40:19,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-03 13:40:19,135 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:40:19,135 INFO L218 NwaCegarLoop]: trace histogram [16, 15, 15, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1] [2025-03-03 13:40:19,141 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-03 13:40:19,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:40:19,335 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:40:19,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:40:19,336 INFO L85 PathProgramCache]: Analyzing trace with hash 998576375, now seen corresponding path program 5 times [2025-03-03 13:40:19,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:40:19,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898786005] [2025-03-03 13:40:19,336 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-03 13:40:19,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:40:19,341 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 74 statements into 8 equivalence classes. [2025-03-03 13:40:19,372 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) and asserted 42 of 74 statements. [2025-03-03 13:40:19,372 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2025-03-03 13:40:19,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:40:20,107 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 160 proven. 13 refuted. 0 times theorem prover too weak. 292 trivial. 0 not checked. [2025-03-03 13:40:20,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:40:20,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898786005] [2025-03-03 13:40:20,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898786005] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:40:20,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [404734014] [2025-03-03 13:40:20,108 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-03 13:40:20,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:40:20,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:40:20,110 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:40:20,111 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-03 13:40:20,138 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 74 statements into 8 equivalence classes. [2025-03-03 13:40:20,172 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) and asserted 42 of 74 statements. [2025-03-03 13:40:20,173 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2025-03-03 13:40:20,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:40:20,173 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-03 13:40:20,175 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:40:20,260 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 208 proven. 18 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked. [2025-03-03 13:40:20,260 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:40:20,407 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 208 proven. 18 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked. [2025-03-03 13:40:20,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [404734014] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:40:20,407 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:40:20,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 18 [2025-03-03 13:40:20,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836983384] [2025-03-03 13:40:20,407 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:40:20,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-03 13:40:20,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:40:20,408 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-03 13:40:20,408 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2025-03-03 13:40:20,408 INFO L87 Difference]: Start difference. First operand 75 states and 89 transitions. Second operand has 18 states, 18 states have (on average 3.2222222222222223) internal successors, (58), 18 states have internal predecessors, (58), 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-03 13:40:21,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:40:21,071 INFO L93 Difference]: Finished difference Result 310 states and 367 transitions. [2025-03-03 13:40:21,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-03 13:40:21,071 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.2222222222222223) internal successors, (58), 18 states have internal predecessors, (58), 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 74 [2025-03-03 13:40:21,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:40:21,072 INFO L225 Difference]: With dead ends: 310 [2025-03-03 13:40:21,072 INFO L226 Difference]: Without dead ends: 209 [2025-03-03 13:40:21,073 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 141 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=183, Invalid=939, Unknown=0, NotChecked=0, Total=1122 [2025-03-03 13:40:21,073 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 48 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 301 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 13:40:21,073 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 32 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 301 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 13:40:21,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2025-03-03 13:40:21,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 123. [2025-03-03 13:40:21,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 122 states have (on average 1.1639344262295082) internal successors, (142), 122 states have internal predecessors, (142), 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-03 13:40:21,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 142 transitions. [2025-03-03 13:40:21,113 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 142 transitions. Word has length 74 [2025-03-03 13:40:21,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:40:21,114 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 142 transitions. [2025-03-03 13:40:21,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.2222222222222223) internal successors, (58), 18 states have internal predecessors, (58), 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-03 13:40:21,114 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 142 transitions. [2025-03-03 13:40:21,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-03 13:40:21,114 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:40:21,114 INFO L218 NwaCegarLoop]: trace histogram [26, 25, 25, 8, 7, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1] [2025-03-03 13:40:21,120 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-03 13:40:21,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2025-03-03 13:40:21,315 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:40:21,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:40:21,316 INFO L85 PathProgramCache]: Analyzing trace with hash 782735222, now seen corresponding path program 6 times [2025-03-03 13:40:21,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:40:21,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020713276] [2025-03-03 13:40:21,316 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-03 13:40:21,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:40:21,322 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 110 statements into 11 equivalence classes. [2025-03-03 13:40:21,329 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 25 of 110 statements. [2025-03-03 13:40:21,329 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-03-03 13:40:21,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:40:21,386 INFO L134 CoverageAnalysis]: Checked inductivity of 1230 backedges. 273 proven. 280 refuted. 0 times theorem prover too weak. 677 trivial. 0 not checked. [2025-03-03 13:40:21,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:40:21,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020713276] [2025-03-03 13:40:21,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020713276] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:40:21,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1445916775] [2025-03-03 13:40:21,387 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-03 13:40:21,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:40:21,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:40:21,388 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:40:21,390 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-03 13:40:21,415 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 110 statements into 11 equivalence classes. [2025-03-03 13:40:21,426 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 25 of 110 statements. [2025-03-03 13:40:21,426 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-03-03 13:40:21,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:40:21,427 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-03 13:40:21,428 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:40:21,578 INFO L134 CoverageAnalysis]: Checked inductivity of 1230 backedges. 504 proven. 49 refuted. 0 times theorem prover too weak. 677 trivial. 0 not checked. [2025-03-03 13:40:21,578 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:40:21,808 INFO L134 CoverageAnalysis]: Checked inductivity of 1230 backedges. 0 proven. 553 refuted. 0 times theorem prover too weak. 677 trivial. 0 not checked. [2025-03-03 13:40:21,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1445916775] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:40:21,808 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:40:21,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-03-03 13:40:21,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319132055] [2025-03-03 13:40:21,809 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:40:21,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 13:40:21,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:40:21,810 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 13:40:21,810 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-03-03 13:40:21,810 INFO L87 Difference]: Start difference. First operand 123 states and 142 transitions. Second operand has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 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-03 13:40:21,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:40:21,921 INFO L93 Difference]: Finished difference Result 256 states and 297 transitions. [2025-03-03 13:40:21,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 13:40:21,921 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 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 110 [2025-03-03 13:40:21,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:40:21,923 INFO L225 Difference]: With dead ends: 256 [2025-03-03 13:40:21,923 INFO L226 Difference]: Without dead ends: 254 [2025-03-03 13:40:21,924 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 216 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2025-03-03 13:40:21,924 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 3 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:40:21,924 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 15 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:40:21,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2025-03-03 13:40:21,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 141. [2025-03-03 13:40:21,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 140 states have (on average 1.1642857142857144) internal successors, (163), 140 states have internal predecessors, (163), 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-03 13:40:21,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 163 transitions. [2025-03-03 13:40:21,950 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 163 transitions. Word has length 110 [2025-03-03 13:40:21,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:40:21,950 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 163 transitions. [2025-03-03 13:40:21,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 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-03 13:40:21,950 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 163 transitions. [2025-03-03 13:40:21,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-03-03 13:40:21,951 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:40:21,951 INFO L218 NwaCegarLoop]: trace histogram [34, 33, 33, 11, 10, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1] [2025-03-03 13:40:21,960 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-03 13:40:22,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-03 13:40:22,152 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:40:22,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:40:22,153 INFO L85 PathProgramCache]: Analyzing trace with hash 351866735, now seen corresponding path program 7 times [2025-03-03 13:40:22,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:40:22,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331277785] [2025-03-03 13:40:22,153 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-03 13:40:22,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:40:22,161 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-03 13:40:22,220 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-03 13:40:22,221 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:40:22,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:40:22,674 INFO L134 CoverageAnalysis]: Checked inductivity of 2148 backedges. 22 proven. 385 refuted. 0 times theorem prover too weak. 1741 trivial. 0 not checked. [2025-03-03 13:40:22,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:40:22,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331277785] [2025-03-03 13:40:22,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331277785] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:40:22,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [850920874] [2025-03-03 13:40:22,675 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-03 13:40:22,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:40:22,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:40:22,677 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:40:22,678 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-03 13:40:22,703 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-03 13:40:22,741 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-03 13:40:22,741 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:40:22,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:40:22,745 INFO L256 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-03 13:40:22,747 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:40:22,887 INFO L134 CoverageAnalysis]: Checked inductivity of 2148 backedges. 660 proven. 49 refuted. 0 times theorem prover too weak. 1439 trivial. 0 not checked. [2025-03-03 13:40:22,887 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:40:23,077 INFO L134 CoverageAnalysis]: Checked inductivity of 2148 backedges. 660 proven. 49 refuted. 0 times theorem prover too weak. 1439 trivial. 0 not checked. [2025-03-03 13:40:23,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [850920874] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:40:23,077 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:40:23,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 23 [2025-03-03 13:40:23,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433000794] [2025-03-03 13:40:23,077 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:40:23,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-03 13:40:23,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:40:23,078 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-03 13:40:23,078 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=435, Unknown=0, NotChecked=0, Total=506 [2025-03-03 13:40:23,078 INFO L87 Difference]: Start difference. First operand 141 states and 163 transitions. Second operand has 23 states, 23 states have (on average 3.5217391304347827) internal successors, (81), 23 states have internal predecessors, (81), 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-03 13:40:37,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:40:37,178 INFO L93 Difference]: Finished difference Result 661 states and 809 transitions. [2025-03-03 13:40:37,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2025-03-03 13:40:37,178 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 3.5217391304347827) internal successors, (81), 23 states have internal predecessors, (81), 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 140 [2025-03-03 13:40:37,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:40:37,180 INFO L225 Difference]: With dead ends: 661 [2025-03-03 13:40:37,180 INFO L226 Difference]: Without dead ends: 524 [2025-03-03 13:40:37,182 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 334 GetRequests, 267 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1360 ImplicationChecksByTransitivity, 13.8s TimeCoverageRelationStatistics Valid=843, Invalid=3849, Unknown=0, NotChecked=0, Total=4692 [2025-03-03 13:40:37,182 INFO L435 NwaCegarLoop]: 3 mSDtfsCounter, 331 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 542 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 331 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 616 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 542 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 13:40:37,182 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [331 Valid, 28 Invalid, 616 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 542 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 13:40:37,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2025-03-03 13:40:37,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 465. [2025-03-03 13:40:37,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 465 states, 464 states have (on average 1.0732758620689655) internal successors, (498), 464 states have internal predecessors, (498), 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-03 13:40:37,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 498 transitions. [2025-03-03 13:40:37,271 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 498 transitions. Word has length 140 [2025-03-03 13:40:37,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:40:37,271 INFO L471 AbstractCegarLoop]: Abstraction has 465 states and 498 transitions. [2025-03-03 13:40:37,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 3.5217391304347827) internal successors, (81), 23 states have internal predecessors, (81), 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-03 13:40:37,271 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 498 transitions. [2025-03-03 13:40:37,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 464 [2025-03-03 13:40:37,275 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:40:37,275 INFO L218 NwaCegarLoop]: trace histogram [133, 132, 132, 24, 23, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1] [2025-03-03 13:40:37,281 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-03 13:40:37,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-03 13:40:37,479 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:40:37,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:40:37,479 INFO L85 PathProgramCache]: Analyzing trace with hash -1688168610, now seen corresponding path program 8 times [2025-03-03 13:40:37,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:40:37,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632446475] [2025-03-03 13:40:37,480 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 13:40:37,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:40:37,498 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 463 statements into 2 equivalence classes. [2025-03-03 13:40:37,719 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 463 of 463 statements. [2025-03-03 13:40:37,719 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 13:40:37,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:40:38,552 INFO L134 CoverageAnalysis]: Checked inductivity of 29887 backedges. 404 proven. 1933 refuted. 0 times theorem prover too weak. 27550 trivial. 0 not checked. [2025-03-03 13:40:38,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:40:38,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632446475] [2025-03-03 13:40:38,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632446475] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:40:38,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2022793332] [2025-03-03 13:40:38,552 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 13:40:38,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:40:38,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:40:38,554 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:40:38,561 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-03 13:40:38,617 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 463 statements into 2 equivalence classes. [2025-03-03 13:40:38,712 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 463 of 463 statements. [2025-03-03 13:40:38,712 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 13:40:38,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:40:38,720 INFO L256 TraceCheckSpWp]: Trace formula consists of 751 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-03 13:40:38,724 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:40:39,052 INFO L134 CoverageAnalysis]: Checked inductivity of 29887 backedges. 8860 proven. 360 refuted. 0 times theorem prover too weak. 20667 trivial. 0 not checked. [2025-03-03 13:40:39,052 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:40:39,467 INFO L134 CoverageAnalysis]: Checked inductivity of 29887 backedges. 8624 proven. 596 refuted. 0 times theorem prover too weak. 20667 trivial. 0 not checked. [2025-03-03 13:40:39,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2022793332] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:40:39,467 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:40:39,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 15, 15] total 34 [2025-03-03 13:40:39,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843677381] [2025-03-03 13:40:39,467 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:40:39,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-03-03 13:40:39,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:40:39,468 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-03-03 13:40:39,469 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=969, Unknown=0, NotChecked=0, Total=1122 [2025-03-03 13:40:39,469 INFO L87 Difference]: Start difference. First operand 465 states and 498 transitions. Second operand has 34 states, 34 states have (on average 3.5588235294117645) internal successors, (121), 34 states have internal predecessors, (121), 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-03 13:40:47,787 WARN L286 SmtUtils]: Spent 8.05s on a formula simplification. DAG size of input: 36 DAG size of output: 22 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-03-03 13:40:51,798 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 13:41:01,322 WARN L286 SmtUtils]: Spent 8.03s on a formula simplification. DAG size of input: 34 DAG size of output: 20 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-03-03 13:41:10,038 WARN L286 SmtUtils]: Spent 8.03s on a formula simplification. DAG size of input: 29 DAG size of output: 17 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-03-03 13:41:32,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:41:32,801 INFO L93 Difference]: Finished difference Result 1393 states and 1621 transitions. [2025-03-03 13:41:32,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-03 13:41:32,802 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 3.5588235294117645) internal successors, (121), 34 states have internal predecessors, (121), 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 463 [2025-03-03 13:41:32,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:41:32,805 INFO L225 Difference]: With dead ends: 1393 [2025-03-03 13:41:32,805 INFO L226 Difference]: Without dead ends: 932 [2025-03-03 13:41:32,806 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 947 GetRequests, 900 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 422 ImplicationChecksByTransitivity, 49.4s TimeCoverageRelationStatistics Valid=366, Invalid=1796, Unknown=0, NotChecked=0, Total=2162 [2025-03-03 13:41:32,806 INFO L435 NwaCegarLoop]: 3 mSDtfsCounter, 51 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 397 mSolverCounterSat, 22 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 397 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2025-03-03 13:41:32,807 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 35 Invalid, 420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 397 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2025-03-03 13:41:32,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 932 states. [2025-03-03 13:41:32,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 932 to 932. [2025-03-03 13:41:32,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 932 states, 931 states have (on average 1.0365198711063373) internal successors, (965), 931 states have internal predecessors, (965), 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-03 13:41:32,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 932 states to 932 states and 965 transitions. [2025-03-03 13:41:32,943 INFO L78 Accepts]: Start accepts. Automaton has 932 states and 965 transitions. Word has length 463 [2025-03-03 13:41:32,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:41:32,943 INFO L471 AbstractCegarLoop]: Abstraction has 932 states and 965 transitions. [2025-03-03 13:41:32,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 3.5588235294117645) internal successors, (121), 34 states have internal predecessors, (121), 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-03 13:41:32,943 INFO L276 IsEmpty]: Start isEmpty. Operand 932 states and 965 transitions. [2025-03-03 13:41:32,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 929 [2025-03-03 13:41:32,956 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:41:32,956 INFO L218 NwaCegarLoop]: trace histogram [288, 287, 287, 24, 23, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1] [2025-03-03 13:41:32,964 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-03 13:41:33,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-03 13:41:33,157 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:41:33,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:41:33,157 INFO L85 PathProgramCache]: Analyzing trace with hash 1756542192, now seen corresponding path program 9 times [2025-03-03 13:41:33,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:41:33,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412467411] [2025-03-03 13:41:33,158 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 13:41:33,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:41:33,192 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 928 statements into 80 equivalence classes. [2025-03-03 13:41:33,197 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 20 of 928 statements. [2025-03-03 13:41:33,197 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-03 13:41:33,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:41:33,371 INFO L134 CoverageAnalysis]: Checked inductivity of 130947 backedges. 16507 proven. 70453 refuted. 0 times theorem prover too weak. 43987 trivial. 0 not checked. [2025-03-03 13:41:33,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:41:33,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412467411] [2025-03-03 13:41:33,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412467411] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:41:33,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1492121750] [2025-03-03 13:41:33,371 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 13:41:33,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:41:33,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:41:33,374 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:41:33,375 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-03 13:41:33,449 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 928 statements into 80 equivalence classes. [2025-03-03 13:41:33,461 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 20 of 928 statements. [2025-03-03 13:41:33,461 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-03 13:41:33,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:41:33,462 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-03 13:41:33,470 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:41:35,212 INFO L134 CoverageAnalysis]: Checked inductivity of 130947 backedges. 49358 proven. 32850 refuted. 0 times theorem prover too weak. 48739 trivial. 0 not checked. [2025-03-03 13:41:35,212 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:41:37,068 INFO L134 CoverageAnalysis]: Checked inductivity of 130947 backedges. 0 proven. 82208 refuted. 0 times theorem prover too weak. 48739 trivial. 0 not checked. [2025-03-03 13:41:37,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1492121750] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:41:37,069 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:41:37,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 11 [2025-03-03 13:41:37,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135661564] [2025-03-03 13:41:37,069 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:41:37,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 13:41:37,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:41:37,070 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 13:41:37,070 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2025-03-03 13:41:37,070 INFO L87 Difference]: Start difference. First operand 932 states and 965 transitions. Second operand has 11 states, 11 states have (on average 7.090909090909091) internal successors, (78), 11 states have internal predecessors, (78), 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-03 13:41:37,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:41:37,617 INFO L93 Difference]: Finished difference Result 3938 states and 4081 transitions. [2025-03-03 13:41:37,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 13:41:37,617 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.090909090909091) internal successors, (78), 11 states have internal predecessors, (78), 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 928 [2025-03-03 13:41:37,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:41:37,627 INFO L225 Difference]: With dead ends: 3938 [2025-03-03 13:41:37,627 INFO L226 Difference]: Without dead ends: 3242 [2025-03-03 13:41:37,628 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1864 GetRequests, 1852 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2025-03-03 13:41:37,629 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 3 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 13:41:37,629 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 20 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 13:41:37,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3242 states. [2025-03-03 13:41:37,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3242 to 1860. [2025-03-03 13:41:37,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1860 states, 1859 states have (on average 1.036578805809575) internal successors, (1927), 1859 states have internal predecessors, (1927), 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-03 13:41:37,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1860 states to 1860 states and 1927 transitions. [2025-03-03 13:41:37,955 INFO L78 Accepts]: Start accepts. Automaton has 1860 states and 1927 transitions. Word has length 928 [2025-03-03 13:41:37,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:41:37,955 INFO L471 AbstractCegarLoop]: Abstraction has 1860 states and 1927 transitions. [2025-03-03 13:41:37,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.090909090909091) internal successors, (78), 11 states have internal predecessors, (78), 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-03 13:41:37,956 INFO L276 IsEmpty]: Start isEmpty. Operand 1860 states and 1927 transitions. [2025-03-03 13:41:37,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1857 [2025-03-03 13:41:37,997 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:41:37,997 INFO L218 NwaCegarLoop]: trace histogram [576, 575, 575, 48, 47, 8, 7, 7, 6, 2, 1, 1, 1, 1, 1] [2025-03-03 13:41:38,003 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-03-03 13:41:38,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-03 13:41:38,198 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:41:38,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:41:38,199 INFO L85 PathProgramCache]: Analyzing trace with hash 67069600, now seen corresponding path program 10 times [2025-03-03 13:41:38,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:41:38,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93699820] [2025-03-03 13:41:38,199 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 13:41:38,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:41:38,300 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 1856 statements into 2 equivalence classes. [2025-03-03 13:41:40,103 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 1856 of 1856 statements. [2025-03-03 13:41:40,104 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-03 13:41:40,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:41:44,074 INFO L134 CoverageAnalysis]: Checked inductivity of 525983 backedges. 0 proven. 198185 refuted. 0 times theorem prover too weak. 327798 trivial. 0 not checked. [2025-03-03 13:41:44,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:41:44,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93699820] [2025-03-03 13:41:44,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93699820] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:41:44,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [245225662] [2025-03-03 13:41:44,074 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 13:41:44,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:41:44,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:41:44,076 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:41:44,077 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-03 13:41:44,209 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 1856 statements into 2 equivalence classes. [2025-03-03 13:41:44,590 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 1856 of 1856 statements. [2025-03-03 13:41:44,590 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-03 13:41:44,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:41:44,604 INFO L256 TraceCheckSpWp]: Trace formula consists of 2715 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-03 13:41:44,618 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:41:45,404 INFO L134 CoverageAnalysis]: Checked inductivity of 525983 backedges. 115371 proven. 7041 refuted. 0 times theorem prover too weak. 403571 trivial. 0 not checked. [2025-03-03 13:41:45,404 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:41:46,195 INFO L134 CoverageAnalysis]: Checked inductivity of 525983 backedges. 115371 proven. 7041 refuted. 0 times theorem prover too weak. 403571 trivial. 0 not checked. [2025-03-03 13:41:46,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [245225662] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:41:46,195 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:41:46,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 17, 17] total 35 [2025-03-03 13:41:46,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149536732] [2025-03-03 13:41:46,196 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:41:46,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-03-03 13:41:46,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:41:46,198 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-03-03 13:41:46,198 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=1047, Unknown=0, NotChecked=0, Total=1190 [2025-03-03 13:41:46,198 INFO L87 Difference]: Start difference. First operand 1860 states and 1927 transitions. Second operand has 35 states, 35 states have (on average 4.085714285714285) internal successors, (143), 35 states have internal predecessors, (143), 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)