./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.4.ufo.BOUNDED-6.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed 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/seq-mthreaded/pals_floodmax.3.4.ufo.BOUNDED-6.pals.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 904bd1313458c4f9af8d5bf1208ba922a2079eb77883d7ecd1ca28ceda09c9f6 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 05:57:29,505 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 05:57:29,563 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 05:57:29,567 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 05:57:29,567 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 05:57:29,580 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 05:57:29,581 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 05:57:29,581 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 05:57:29,581 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 05:57:29,581 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 05:57:29,581 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 05:57:29,581 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 05:57:29,581 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 05:57:29,582 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 05:57:29,582 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 05:57:29,582 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 05:57:29,582 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 05:57:29,582 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 05:57:29,582 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 05:57:29,582 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 05:57:29,582 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 05:57:29,582 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 05:57:29,582 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 05:57:29,583 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 05:57:29,583 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 05:57:29,583 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 05:57:29,583 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 05:57:29,583 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 05:57:29,583 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 05:57:29,583 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 05:57:29,583 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 05:57:29,583 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 05:57:29,583 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 05:57:29,583 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 05:57:29,583 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 05:57:29,584 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 05:57:29,584 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 05:57:29,584 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 05:57:29,584 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 05:57:29,584 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 05:57:29,584 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 05:57:29,584 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 05:57:29,584 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 05:57:29,584 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 -> 904bd1313458c4f9af8d5bf1208ba922a2079eb77883d7ecd1ca28ceda09c9f6 [2025-03-08 05:57:29,773 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 05:57:29,778 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 05:57:29,779 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 05:57:29,780 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 05:57:29,780 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 05:57:29,781 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.4.ufo.BOUNDED-6.pals.c [2025-03-08 05:57:30,899 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d473f787/f696b38563c24fd8961a75dbf2351f58/FLAGac3826ef0 [2025-03-08 05:57:31,192 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 05:57:31,194 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.4.ufo.BOUNDED-6.pals.c [2025-03-08 05:57:31,206 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d473f787/f696b38563c24fd8961a75dbf2351f58/FLAGac3826ef0 [2025-03-08 05:57:31,221 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d473f787/f696b38563c24fd8961a75dbf2351f58 [2025-03-08 05:57:31,223 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 05:57:31,225 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 05:57:31,227 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 05:57:31,227 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 05:57:31,230 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 05:57:31,231 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:57:31" (1/1) ... [2025-03-08 05:57:31,232 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13dfa00a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:57:31, skipping insertion in model container [2025-03-08 05:57:31,232 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:57:31" (1/1) ... [2025-03-08 05:57:31,254 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 05:57:31,412 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/seq-mthreaded/pals_floodmax.3.4.ufo.BOUNDED-6.pals.c[12764,12777] [2025-03-08 05:57:31,415 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 05:57:31,422 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 05:57:31,456 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/seq-mthreaded/pals_floodmax.3.4.ufo.BOUNDED-6.pals.c[12764,12777] [2025-03-08 05:57:31,457 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 05:57:31,470 INFO L204 MainTranslator]: Completed translation [2025-03-08 05:57:31,471 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:57:31 WrapperNode [2025-03-08 05:57:31,471 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 05:57:31,472 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 05:57:31,472 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 05:57:31,472 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 05:57:31,477 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:57:31" (1/1) ... [2025-03-08 05:57:31,486 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:57:31" (1/1) ... [2025-03-08 05:57:31,506 INFO L138 Inliner]: procedures = 21, calls = 13, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 449 [2025-03-08 05:57:31,507 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 05:57:31,507 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 05:57:31,507 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 05:57:31,507 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 05:57:31,513 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:57:31" (1/1) ... [2025-03-08 05:57:31,513 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:57:31" (1/1) ... [2025-03-08 05:57:31,515 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:57:31" (1/1) ... [2025-03-08 05:57:31,530 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-08 05:57:31,530 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:57:31" (1/1) ... [2025-03-08 05:57:31,530 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:57:31" (1/1) ... [2025-03-08 05:57:31,535 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:57:31" (1/1) ... [2025-03-08 05:57:31,539 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:57:31" (1/1) ... [2025-03-08 05:57:31,540 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:57:31" (1/1) ... [2025-03-08 05:57:31,544 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:57:31" (1/1) ... [2025-03-08 05:57:31,547 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 05:57:31,547 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 05:57:31,547 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 05:57:31,547 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 05:57:31,548 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:57:31" (1/1) ... [2025-03-08 05:57:31,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 05:57:31,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:57:31,575 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-08 05:57:31,580 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-08 05:57:31,596 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 05:57:31,596 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 05:57:31,596 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 05:57:31,597 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 05:57:31,679 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 05:57:31,681 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 05:57:32,063 INFO L? ?]: Removed 43 outVars from TransFormulas that were not future-live. [2025-03-08 05:57:32,063 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 05:57:32,073 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 05:57:32,073 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 05:57:32,074 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:57:32 BoogieIcfgContainer [2025-03-08 05:57:32,074 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 05:57:32,076 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 05:57:32,076 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 05:57:32,080 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 05:57:32,080 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 05:57:31" (1/3) ... [2025-03-08 05:57:32,080 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56dba0fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:57:32, skipping insertion in model container [2025-03-08 05:57:32,080 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:57:31" (2/3) ... [2025-03-08 05:57:32,080 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56dba0fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:57:32, skipping insertion in model container [2025-03-08 05:57:32,080 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:57:32" (3/3) ... [2025-03-08 05:57:32,081 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_floodmax.3.4.ufo.BOUNDED-6.pals.c [2025-03-08 05:57:32,092 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 05:57:32,093 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_floodmax.3.4.ufo.BOUNDED-6.pals.c that has 1 procedures, 118 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 05:57:32,139 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 05:57:32,148 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;@47f40d58, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 05:57:32,148 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 05:57:32,151 INFO L276 IsEmpty]: Start isEmpty. Operand has 118 states, 116 states have (on average 1.7844827586206897) internal successors, (207), 117 states have internal predecessors, (207), 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-08 05:57:32,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-08 05:57:32,156 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:57:32,156 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:57:32,157 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:57:32,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:57:32,160 INFO L85 PathProgramCache]: Analyzing trace with hash -287906574, now seen corresponding path program 1 times [2025-03-08 05:57:32,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:57:32,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708352860] [2025-03-08 05:57:32,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:57:32,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:57:32,236 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-08 05:57:32,292 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-08 05:57:32,292 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:57:32,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:57:32,412 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-08 05:57:32,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:57:32,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708352860] [2025-03-08 05:57:32,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708352860] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:57:32,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:57:32,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 05:57:32,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515606297] [2025-03-08 05:57:32,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:57:32,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 05:57:32,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:57:32,437 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 05:57:32,437 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 05:57:32,440 INFO L87 Difference]: Start difference. First operand has 118 states, 116 states have (on average 1.7844827586206897) internal successors, (207), 117 states have internal predecessors, (207), 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 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 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-08 05:57:32,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:57:32,454 INFO L93 Difference]: Finished difference Result 180 states and 312 transitions. [2025-03-08 05:57:32,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 05:57:32,456 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 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 37 [2025-03-08 05:57:32,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:57:32,461 INFO L225 Difference]: With dead ends: 180 [2025-03-08 05:57:32,461 INFO L226 Difference]: Without dead ends: 115 [2025-03-08 05:57:32,463 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 05:57:32,464 INFO L435 NwaCegarLoop]: 205 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:57:32,465 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:57:32,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2025-03-08 05:57:32,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2025-03-08 05:57:32,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 114 states have (on average 1.7719298245614035) internal successors, (202), 114 states have internal predecessors, (202), 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-08 05:57:32,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 202 transitions. [2025-03-08 05:57:32,507 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 202 transitions. Word has length 37 [2025-03-08 05:57:32,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:57:32,508 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 202 transitions. [2025-03-08 05:57:32,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 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-08 05:57:32,508 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 202 transitions. [2025-03-08 05:57:32,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-08 05:57:32,509 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:57:32,509 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:57:32,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 05:57:32,509 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:57:32,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:57:32,510 INFO L85 PathProgramCache]: Analyzing trace with hash -696730799, now seen corresponding path program 1 times [2025-03-08 05:57:32,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:57:32,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580509314] [2025-03-08 05:57:32,510 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:57:32,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:57:32,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-08 05:57:32,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-08 05:57:32,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:57:32,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:57:32,733 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-08 05:57:32,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:57:32,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580509314] [2025-03-08 05:57:32,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580509314] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:57:32,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:57:32,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:57:32,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238257082] [2025-03-08 05:57:32,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:57:32,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:57:32,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:57:32,735 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:57:32,735 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:57:32,735 INFO L87 Difference]: Start difference. First operand 115 states and 202 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 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-08 05:57:32,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:57:32,809 INFO L93 Difference]: Finished difference Result 235 states and 406 transitions. [2025-03-08 05:57:32,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:57:32,810 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 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 37 [2025-03-08 05:57:32,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:57:32,811 INFO L225 Difference]: With dead ends: 235 [2025-03-08 05:57:32,811 INFO L226 Difference]: Without dead ends: 173 [2025-03-08 05:57:32,811 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:57:32,812 INFO L435 NwaCegarLoop]: 198 mSDtfsCounter, 99 mSDsluCounter, 561 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 759 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:57:32,812 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 759 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:57:32,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2025-03-08 05:57:32,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 115. [2025-03-08 05:57:32,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 114 states have (on average 1.5350877192982457) internal successors, (175), 114 states have internal predecessors, (175), 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-08 05:57:32,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 175 transitions. [2025-03-08 05:57:32,824 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 175 transitions. Word has length 37 [2025-03-08 05:57:32,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:57:32,824 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 175 transitions. [2025-03-08 05:57:32,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 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-08 05:57:32,824 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 175 transitions. [2025-03-08 05:57:32,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-08 05:57:32,825 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:57:32,826 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:57:32,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 05:57:32,826 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:57:32,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:57:32,826 INFO L85 PathProgramCache]: Analyzing trace with hash -327600201, now seen corresponding path program 1 times [2025-03-08 05:57:32,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:57:32,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960364951] [2025-03-08 05:57:32,827 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:57:32,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:57:32,843 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-08 05:57:32,863 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-08 05:57:32,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:57:32,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:57:32,934 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-08 05:57:32,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:57:32,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960364951] [2025-03-08 05:57:32,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960364951] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:57:32,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:57:32,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:57:32,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101173952] [2025-03-08 05:57:32,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:57:32,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:57:32,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:57:32,936 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:57:32,936 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:57:32,936 INFO L87 Difference]: Start difference. First operand 115 states and 175 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 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-08 05:57:32,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:57:32,968 INFO L93 Difference]: Finished difference Result 220 states and 354 transitions. [2025-03-08 05:57:32,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:57:32,968 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 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) Word has length 63 [2025-03-08 05:57:32,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:57:32,969 INFO L225 Difference]: With dead ends: 220 [2025-03-08 05:57:32,969 INFO L226 Difference]: Without dead ends: 162 [2025-03-08 05:57:32,970 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:57:32,970 INFO L435 NwaCegarLoop]: 238 mSDtfsCounter, 75 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:57:32,970 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 369 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:57:32,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2025-03-08 05:57:32,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 160. [2025-03-08 05:57:32,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 159 states have (on average 1.559748427672956) internal successors, (248), 159 states have internal predecessors, (248), 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-08 05:57:32,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 248 transitions. [2025-03-08 05:57:32,981 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 248 transitions. Word has length 63 [2025-03-08 05:57:32,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:57:32,982 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 248 transitions. [2025-03-08 05:57:32,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 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-08 05:57:32,982 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 248 transitions. [2025-03-08 05:57:32,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-08 05:57:32,984 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:57:32,984 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:57:32,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 05:57:32,984 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:57:32,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:57:32,985 INFO L85 PathProgramCache]: Analyzing trace with hash 926887085, now seen corresponding path program 1 times [2025-03-08 05:57:32,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:57:32,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388213965] [2025-03-08 05:57:32,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:57:32,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:57:32,998 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-08 05:57:33,033 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-08 05:57:33,034 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:57:33,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:57:33,095 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-08 05:57:33,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:57:33,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388213965] [2025-03-08 05:57:33,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388213965] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:57:33,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:57:33,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:57:33,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115130839] [2025-03-08 05:57:33,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:57:33,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:57:33,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:57:33,097 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:57:33,097 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:57:33,097 INFO L87 Difference]: Start difference. First operand 160 states and 248 transitions. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 05:57:33,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:57:33,116 INFO L93 Difference]: Finished difference Result 312 states and 504 transitions. [2025-03-08 05:57:33,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:57:33,116 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2025-03-08 05:57:33,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:57:33,117 INFO L225 Difference]: With dead ends: 312 [2025-03-08 05:57:33,117 INFO L226 Difference]: Without dead ends: 209 [2025-03-08 05:57:33,118 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:57:33,118 INFO L435 NwaCegarLoop]: 243 mSDtfsCounter, 84 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:57:33,118 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 399 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:57:33,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2025-03-08 05:57:33,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 207. [2025-03-08 05:57:33,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 206 states have (on average 1.5922330097087378) internal successors, (328), 206 states have internal predecessors, (328), 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-08 05:57:33,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 328 transitions. [2025-03-08 05:57:33,129 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 328 transitions. Word has length 65 [2025-03-08 05:57:33,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:57:33,129 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 328 transitions. [2025-03-08 05:57:33,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 05:57:33,129 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 328 transitions. [2025-03-08 05:57:33,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-08 05:57:33,130 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:57:33,130 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:57:33,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 05:57:33,131 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:57:33,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:57:33,131 INFO L85 PathProgramCache]: Analyzing trace with hash 1976340410, now seen corresponding path program 1 times [2025-03-08 05:57:33,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:57:33,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326925984] [2025-03-08 05:57:33,131 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:57:33,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:57:33,141 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-08 05:57:33,157 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-08 05:57:33,157 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:57:33,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:57:33,227 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-08 05:57:33,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:57:33,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326925984] [2025-03-08 05:57:33,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326925984] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:57:33,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:57:33,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:57:33,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435457247] [2025-03-08 05:57:33,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:57:33,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:57:33,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:57:33,229 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:57:33,229 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:57:33,230 INFO L87 Difference]: Start difference. First operand 207 states and 328 transitions. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 05:57:33,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:57:33,250 INFO L93 Difference]: Finished difference Result 482 states and 791 transitions. [2025-03-08 05:57:33,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:57:33,251 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2025-03-08 05:57:33,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:57:33,253 INFO L225 Difference]: With dead ends: 482 [2025-03-08 05:57:33,254 INFO L226 Difference]: Without dead ends: 334 [2025-03-08 05:57:33,254 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:57:33,256 INFO L435 NwaCegarLoop]: 182 mSDtfsCounter, 77 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:57:33,256 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 326 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:57:33,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2025-03-08 05:57:33,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 332. [2025-03-08 05:57:33,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 331 states have (on average 1.6193353474320242) internal successors, (536), 331 states have internal predecessors, (536), 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-08 05:57:33,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 536 transitions. [2025-03-08 05:57:33,276 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 536 transitions. Word has length 65 [2025-03-08 05:57:33,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:57:33,279 INFO L471 AbstractCegarLoop]: Abstraction has 332 states and 536 transitions. [2025-03-08 05:57:33,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 05:57:33,279 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 536 transitions. [2025-03-08 05:57:33,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-08 05:57:33,282 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:57:33,282 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:57:33,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 05:57:33,282 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:57:33,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:57:33,283 INFO L85 PathProgramCache]: Analyzing trace with hash 1502635164, now seen corresponding path program 1 times [2025-03-08 05:57:33,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:57:33,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141282132] [2025-03-08 05:57:33,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:57:33,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:57:33,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-08 05:57:33,308 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-08 05:57:33,308 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:57:33,309 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:57:33,380 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-08 05:57:33,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:57:33,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141282132] [2025-03-08 05:57:33,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141282132] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:57:33,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:57:33,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:57:33,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503034255] [2025-03-08 05:57:33,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:57:33,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:57:33,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:57:33,385 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:57:33,385 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:57:33,385 INFO L87 Difference]: Start difference. First operand 332 states and 536 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 05:57:33,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:57:33,408 INFO L93 Difference]: Finished difference Result 836 states and 1376 transitions. [2025-03-08 05:57:33,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:57:33,408 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2025-03-08 05:57:33,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:57:33,410 INFO L225 Difference]: With dead ends: 836 [2025-03-08 05:57:33,411 INFO L226 Difference]: Without dead ends: 563 [2025-03-08 05:57:33,411 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:57:33,414 INFO L435 NwaCegarLoop]: 220 mSDtfsCounter, 71 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:57:33,414 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 365 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:57:33,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2025-03-08 05:57:33,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 561. [2025-03-08 05:57:33,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 561 states, 560 states have (on average 1.625) internal successors, (910), 560 states have internal predecessors, (910), 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-08 05:57:33,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 910 transitions. [2025-03-08 05:57:33,437 INFO L78 Accepts]: Start accepts. Automaton has 561 states and 910 transitions. Word has length 67 [2025-03-08 05:57:33,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:57:33,437 INFO L471 AbstractCegarLoop]: Abstraction has 561 states and 910 transitions. [2025-03-08 05:57:33,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 05:57:33,437 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 910 transitions. [2025-03-08 05:57:33,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-08 05:57:33,437 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:57:33,438 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:57:33,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 05:57:33,438 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:57:33,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:57:33,438 INFO L85 PathProgramCache]: Analyzing trace with hash -399372334, now seen corresponding path program 1 times [2025-03-08 05:57:33,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:57:33,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949215757] [2025-03-08 05:57:33,438 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:57:33,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:57:33,465 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-08 05:57:33,479 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-08 05:57:33,481 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:57:33,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:57:33,534 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-08 05:57:33,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:57:33,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949215757] [2025-03-08 05:57:33,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949215757] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:57:33,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:57:33,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:57:33,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657663708] [2025-03-08 05:57:33,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:57:33,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:57:33,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:57:33,537 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:57:33,537 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:57:33,537 INFO L87 Difference]: Start difference. First operand 561 states and 910 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 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-08 05:57:33,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:57:33,558 INFO L93 Difference]: Finished difference Result 1062 states and 1742 transitions. [2025-03-08 05:57:33,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:57:33,559 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 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 69 [2025-03-08 05:57:33,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:57:33,562 INFO L225 Difference]: With dead ends: 1062 [2025-03-08 05:57:33,562 INFO L226 Difference]: Without dead ends: 789 [2025-03-08 05:57:33,563 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:57:33,565 INFO L435 NwaCegarLoop]: 212 mSDtfsCounter, 72 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:57:33,566 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 370 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:57:33,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 789 states. [2025-03-08 05:57:33,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 789 to 787. [2025-03-08 05:57:33,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 787 states, 786 states have (on average 1.6208651399491094) internal successors, (1274), 786 states have internal predecessors, (1274), 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-08 05:57:33,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 1274 transitions. [2025-03-08 05:57:33,597 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 1274 transitions. Word has length 69 [2025-03-08 05:57:33,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:57:33,598 INFO L471 AbstractCegarLoop]: Abstraction has 787 states and 1274 transitions. [2025-03-08 05:57:33,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 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-08 05:57:33,598 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 1274 transitions. [2025-03-08 05:57:33,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-08 05:57:33,599 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:57:33,599 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:57:33,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 05:57:33,599 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:57:33,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:57:33,600 INFO L85 PathProgramCache]: Analyzing trace with hash -821702689, now seen corresponding path program 1 times [2025-03-08 05:57:33,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:57:33,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788956700] [2025-03-08 05:57:33,600 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:57:33,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:57:33,612 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-08 05:57:33,623 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-08 05:57:33,623 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:57:33,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:57:33,707 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-08 05:57:33,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:57:33,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788956700] [2025-03-08 05:57:33,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788956700] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:57:33,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:57:33,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:57:33,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343942888] [2025-03-08 05:57:33,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:57:33,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:57:33,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:57:33,708 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:57:33,708 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:57:33,709 INFO L87 Difference]: Start difference. First operand 787 states and 1274 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 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-08 05:57:33,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:57:33,862 INFO L93 Difference]: Finished difference Result 4109 states and 6790 transitions. [2025-03-08 05:57:33,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 05:57:33,862 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 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 69 [2025-03-08 05:57:33,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:57:33,890 INFO L225 Difference]: With dead ends: 4109 [2025-03-08 05:57:33,891 INFO L226 Difference]: Without dead ends: 3402 [2025-03-08 05:57:33,892 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-08 05:57:33,892 INFO L435 NwaCegarLoop]: 188 mSDtfsCounter, 618 mSDsluCounter, 697 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 618 SdHoareTripleChecker+Valid, 885 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:57:33,892 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [618 Valid, 885 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:57:33,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3402 states. [2025-03-08 05:57:33,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3402 to 1471. [2025-03-08 05:57:33,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1471 states, 1470 states have (on average 1.6197278911564625) internal successors, (2381), 1470 states have internal predecessors, (2381), 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-08 05:57:33,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1471 states to 1471 states and 2381 transitions. [2025-03-08 05:57:33,940 INFO L78 Accepts]: Start accepts. Automaton has 1471 states and 2381 transitions. Word has length 69 [2025-03-08 05:57:33,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:57:33,941 INFO L471 AbstractCegarLoop]: Abstraction has 1471 states and 2381 transitions. [2025-03-08 05:57:33,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 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-08 05:57:33,941 INFO L276 IsEmpty]: Start isEmpty. Operand 1471 states and 2381 transitions. [2025-03-08 05:57:33,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-08 05:57:33,941 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:57:33,942 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:57:33,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 05:57:33,942 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:57:33,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:57:33,942 INFO L85 PathProgramCache]: Analyzing trace with hash 347875612, now seen corresponding path program 1 times [2025-03-08 05:57:33,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:57:33,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015304855] [2025-03-08 05:57:33,943 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:57:33,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:57:33,957 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-08 05:57:33,969 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-08 05:57:33,970 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:57:33,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:57:34,040 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-08 05:57:34,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:57:34,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015304855] [2025-03-08 05:57:34,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015304855] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:57:34,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:57:34,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:57:34,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537953905] [2025-03-08 05:57:34,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:57:34,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:57:34,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:57:34,043 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:57:34,043 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:57:34,043 INFO L87 Difference]: Start difference. First operand 1471 states and 2381 transitions. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 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-08 05:57:34,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:57:34,139 INFO L93 Difference]: Finished difference Result 5435 states and 8866 transitions. [2025-03-08 05:57:34,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 05:57:34,139 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 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 70 [2025-03-08 05:57:34,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:57:34,151 INFO L225 Difference]: With dead ends: 5435 [2025-03-08 05:57:34,151 INFO L226 Difference]: Without dead ends: 4047 [2025-03-08 05:57:34,154 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-08 05:57:34,156 INFO L435 NwaCegarLoop]: 164 mSDtfsCounter, 284 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 549 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:57:34,156 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [284 Valid, 549 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:57:34,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4047 states. [2025-03-08 05:57:34,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4047 to 2746. [2025-03-08 05:57:34,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2746 states, 2745 states have (on average 1.614936247723133) internal successors, (4433), 2745 states have internal predecessors, (4433), 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-08 05:57:34,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2746 states to 2746 states and 4433 transitions. [2025-03-08 05:57:34,242 INFO L78 Accepts]: Start accepts. Automaton has 2746 states and 4433 transitions. Word has length 70 [2025-03-08 05:57:34,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:57:34,242 INFO L471 AbstractCegarLoop]: Abstraction has 2746 states and 4433 transitions. [2025-03-08 05:57:34,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 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-08 05:57:34,243 INFO L276 IsEmpty]: Start isEmpty. Operand 2746 states and 4433 transitions. [2025-03-08 05:57:34,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-08 05:57:34,243 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:57:34,244 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:57:34,244 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 05:57:34,244 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:57:34,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:57:34,245 INFO L85 PathProgramCache]: Analyzing trace with hash -1666033767, now seen corresponding path program 1 times [2025-03-08 05:57:34,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:57:34,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279471436] [2025-03-08 05:57:34,245 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:57:34,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:57:34,256 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-08 05:57:34,266 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-08 05:57:34,266 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:57:34,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:57:34,308 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-08 05:57:34,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:57:34,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279471436] [2025-03-08 05:57:34,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279471436] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:57:34,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:57:34,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:57:34,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706497750] [2025-03-08 05:57:34,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:57:34,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:57:34,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:57:34,309 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:57:34,309 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:57:34,310 INFO L87 Difference]: Start difference. First operand 2746 states and 4433 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 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-08 05:57:34,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:57:34,385 INFO L93 Difference]: Finished difference Result 5366 states and 8695 transitions. [2025-03-08 05:57:34,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:57:34,385 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 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 70 [2025-03-08 05:57:34,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:57:34,397 INFO L225 Difference]: With dead ends: 5366 [2025-03-08 05:57:34,398 INFO L226 Difference]: Without dead ends: 3846 [2025-03-08 05:57:34,401 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:57:34,401 INFO L435 NwaCegarLoop]: 243 mSDtfsCounter, 78 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:57:34,402 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 400 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:57:34,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3846 states. [2025-03-08 05:57:34,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3846 to 3844. [2025-03-08 05:57:34,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3844 states, 3843 states have (on average 1.599791829300026) internal successors, (6148), 3843 states have internal predecessors, (6148), 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-08 05:57:34,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3844 states to 3844 states and 6148 transitions. [2025-03-08 05:57:34,508 INFO L78 Accepts]: Start accepts. Automaton has 3844 states and 6148 transitions. Word has length 70 [2025-03-08 05:57:34,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:57:34,508 INFO L471 AbstractCegarLoop]: Abstraction has 3844 states and 6148 transitions. [2025-03-08 05:57:34,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 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-08 05:57:34,508 INFO L276 IsEmpty]: Start isEmpty. Operand 3844 states and 6148 transitions. [2025-03-08 05:57:34,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-08 05:57:34,510 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:57:34,510 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:57:34,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 05:57:34,510 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:57:34,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:57:34,511 INFO L85 PathProgramCache]: Analyzing trace with hash -2051749763, now seen corresponding path program 1 times [2025-03-08 05:57:34,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:57:34,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649529661] [2025-03-08 05:57:34,511 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:57:34,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:57:34,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-08 05:57:34,532 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-08 05:57:34,533 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:57:34,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:57:34,601 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-08 05:57:34,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:57:34,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649529661] [2025-03-08 05:57:34,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649529661] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:57:34,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:57:34,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:57:34,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201222913] [2025-03-08 05:57:34,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:57:34,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:57:34,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:57:34,602 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:57:34,603 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:57:34,603 INFO L87 Difference]: Start difference. First operand 3844 states and 6148 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 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-08 05:57:34,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:57:34,778 INFO L93 Difference]: Finished difference Result 12439 states and 19987 transitions. [2025-03-08 05:57:34,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 05:57:34,779 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 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 71 [2025-03-08 05:57:34,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:57:34,807 INFO L225 Difference]: With dead ends: 12439 [2025-03-08 05:57:34,808 INFO L226 Difference]: Without dead ends: 8666 [2025-03-08 05:57:34,817 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-08 05:57:34,817 INFO L435 NwaCegarLoop]: 164 mSDtfsCounter, 282 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 551 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:57:34,817 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [282 Valid, 551 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:57:34,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8666 states. [2025-03-08 05:57:34,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8666 to 6220. [2025-03-08 05:57:35,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6220 states, 6219 states have (on average 1.5877150667309856) internal successors, (9874), 6219 states have internal predecessors, (9874), 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-08 05:57:35,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6220 states to 6220 states and 9874 transitions. [2025-03-08 05:57:35,019 INFO L78 Accepts]: Start accepts. Automaton has 6220 states and 9874 transitions. Word has length 71 [2025-03-08 05:57:35,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:57:35,019 INFO L471 AbstractCegarLoop]: Abstraction has 6220 states and 9874 transitions. [2025-03-08 05:57:35,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 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-08 05:57:35,019 INFO L276 IsEmpty]: Start isEmpty. Operand 6220 states and 9874 transitions. [2025-03-08 05:57:35,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-08 05:57:35,020 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:57:35,020 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:57:35,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 05:57:35,020 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:57:35,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:57:35,020 INFO L85 PathProgramCache]: Analyzing trace with hash 867427898, now seen corresponding path program 1 times [2025-03-08 05:57:35,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:57:35,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703416713] [2025-03-08 05:57:35,021 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:57:35,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:57:35,029 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-08 05:57:35,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-08 05:57:35,039 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:57:35,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:57:35,099 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-08 05:57:35,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:57:35,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703416713] [2025-03-08 05:57:35,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703416713] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:57:35,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:57:35,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:57:35,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702621845] [2025-03-08 05:57:35,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:57:35,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:57:35,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:57:35,100 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:57:35,101 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:57:35,101 INFO L87 Difference]: Start difference. First operand 6220 states and 9874 transitions. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 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-08 05:57:35,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:57:35,279 INFO L93 Difference]: Finished difference Result 19827 states and 31587 transitions. [2025-03-08 05:57:35,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 05:57:35,280 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 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 72 [2025-03-08 05:57:35,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:57:35,318 INFO L225 Difference]: With dead ends: 19827 [2025-03-08 05:57:35,319 INFO L226 Difference]: Without dead ends: 13678 [2025-03-08 05:57:35,329 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-08 05:57:35,330 INFO L435 NwaCegarLoop]: 164 mSDtfsCounter, 280 mSDsluCounter, 389 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 553 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:57:35,330 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [280 Valid, 553 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:57:35,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13678 states. [2025-03-08 05:57:35,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13678 to 9896. [2025-03-08 05:57:35,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9896 states, 9895 states have (on average 1.5749368367862557) internal successors, (15584), 9895 states have internal predecessors, (15584), 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-08 05:57:35,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9896 states to 9896 states and 15584 transitions. [2025-03-08 05:57:35,587 INFO L78 Accepts]: Start accepts. Automaton has 9896 states and 15584 transitions. Word has length 72 [2025-03-08 05:57:35,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:57:35,587 INFO L471 AbstractCegarLoop]: Abstraction has 9896 states and 15584 transitions. [2025-03-08 05:57:35,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 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-08 05:57:35,587 INFO L276 IsEmpty]: Start isEmpty. Operand 9896 states and 15584 transitions. [2025-03-08 05:57:35,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-08 05:57:35,587 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:57:35,588 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:57:35,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 05:57:35,588 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:57:35,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:57:35,588 INFO L85 PathProgramCache]: Analyzing trace with hash 1822757720, now seen corresponding path program 1 times [2025-03-08 05:57:35,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:57:35,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679179456] [2025-03-08 05:57:35,588 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:57:35,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:57:35,596 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-08 05:57:35,605 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-08 05:57:35,605 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:57:35,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:57:35,745 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-08 05:57:35,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:57:35,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679179456] [2025-03-08 05:57:35,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679179456] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:57:35,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:57:35,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:57:35,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615633351] [2025-03-08 05:57:35,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:57:35,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:57:35,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:57:35,746 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:57:35,746 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:57:35,747 INFO L87 Difference]: Start difference. First operand 9896 states and 15584 transitions. Second operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 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-08 05:57:35,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:57:35,947 INFO L93 Difference]: Finished difference Result 19723 states and 31076 transitions. [2025-03-08 05:57:35,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:57:35,948 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 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-08 05:57:35,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:57:35,965 INFO L225 Difference]: With dead ends: 19723 [2025-03-08 05:57:35,966 INFO L226 Difference]: Without dead ends: 9898 [2025-03-08 05:57:35,977 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:57:35,978 INFO L435 NwaCegarLoop]: 170 mSDtfsCounter, 211 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:57:35,978 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 460 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:57:35,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9898 states. [2025-03-08 05:57:36,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9898 to 9896. [2025-03-08 05:57:36,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9896 states, 9895 states have (on average 1.55977766548762) internal successors, (15434), 9895 states have internal predecessors, (15434), 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-08 05:57:36,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9896 states to 9896 states and 15434 transitions. [2025-03-08 05:57:36,182 INFO L78 Accepts]: Start accepts. Automaton has 9896 states and 15434 transitions. Word has length 74 [2025-03-08 05:57:36,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:57:36,182 INFO L471 AbstractCegarLoop]: Abstraction has 9896 states and 15434 transitions. [2025-03-08 05:57:36,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 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-08 05:57:36,183 INFO L276 IsEmpty]: Start isEmpty. Operand 9896 states and 15434 transitions. [2025-03-08 05:57:36,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-08 05:57:36,183 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:57:36,184 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:57:36,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 05:57:36,184 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:57:36,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:57:36,184 INFO L85 PathProgramCache]: Analyzing trace with hash -2124876074, now seen corresponding path program 1 times [2025-03-08 05:57:36,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:57:36,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180233831] [2025-03-08 05:57:36,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:57:36,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:57:36,226 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-08 05:57:36,237 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-08 05:57:36,238 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:57:36,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:57:36,404 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-08 05:57:36,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:57:36,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180233831] [2025-03-08 05:57:36,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180233831] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:57:36,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:57:36,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:57:36,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735881938] [2025-03-08 05:57:36,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:57:36,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:57:36,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:57:36,405 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:57:36,405 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:57:36,406 INFO L87 Difference]: Start difference. First operand 9896 states and 15434 transitions. Second operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 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-08 05:57:36,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:57:36,702 INFO L93 Difference]: Finished difference Result 28542 states and 44662 transitions. [2025-03-08 05:57:36,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:57:36,702 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 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 77 [2025-03-08 05:57:36,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:57:36,738 INFO L225 Difference]: With dead ends: 28542 [2025-03-08 05:57:36,739 INFO L226 Difference]: Without dead ends: 18717 [2025-03-08 05:57:36,755 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:57:36,756 INFO L435 NwaCegarLoop]: 165 mSDtfsCounter, 205 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 465 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:57:36,756 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 465 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:57:36,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18717 states. [2025-03-08 05:57:37,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18717 to 18715. [2025-03-08 05:57:37,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18715 states, 18714 states have (on average 1.5446190018168215) internal successors, (28906), 18714 states have internal predecessors, (28906), 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-08 05:57:37,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18715 states to 18715 states and 28906 transitions. [2025-03-08 05:57:37,166 INFO L78 Accepts]: Start accepts. Automaton has 18715 states and 28906 transitions. Word has length 77 [2025-03-08 05:57:37,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:57:37,166 INFO L471 AbstractCegarLoop]: Abstraction has 18715 states and 28906 transitions. [2025-03-08 05:57:37,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 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-08 05:57:37,166 INFO L276 IsEmpty]: Start isEmpty. Operand 18715 states and 28906 transitions. [2025-03-08 05:57:37,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-08 05:57:37,167 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:57:37,167 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:57:37,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 05:57:37,167 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:57:37,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:57:37,167 INFO L85 PathProgramCache]: Analyzing trace with hash -1414264079, now seen corresponding path program 1 times [2025-03-08 05:57:37,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:57:37,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558854075] [2025-03-08 05:57:37,168 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:57:37,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:57:37,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-08 05:57:37,201 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-08 05:57:37,202 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:57:37,202 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:57:37,369 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-08 05:57:37,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:57:37,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558854075] [2025-03-08 05:57:37,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558854075] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:57:37,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:57:37,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:57:37,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461985588] [2025-03-08 05:57:37,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:57:37,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:57:37,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:57:37,371 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:57:37,371 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:57:37,371 INFO L87 Difference]: Start difference. First operand 18715 states and 28906 transitions. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 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-08 05:57:37,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:57:37,588 INFO L93 Difference]: Finished difference Result 19878 states and 30455 transitions. [2025-03-08 05:57:37,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:57:37,588 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 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 78 [2025-03-08 05:57:37,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:57:37,624 INFO L225 Difference]: With dead ends: 19878 [2025-03-08 05:57:37,624 INFO L226 Difference]: Without dead ends: 19876 [2025-03-08 05:57:37,630 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:57:37,630 INFO L435 NwaCegarLoop]: 172 mSDtfsCounter, 0 mSDsluCounter, 502 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 674 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:57:37,630 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 674 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:57:37,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19876 states. [2025-03-08 05:57:37,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19876 to 19876. [2025-03-08 05:57:37,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19876 states, 19875 states have (on average 1.5123522012578616) internal successors, (30058), 19875 states have internal predecessors, (30058), 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-08 05:57:37,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19876 states to 19876 states and 30058 transitions. [2025-03-08 05:57:37,914 INFO L78 Accepts]: Start accepts. Automaton has 19876 states and 30058 transitions. Word has length 78 [2025-03-08 05:57:37,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:57:37,914 INFO L471 AbstractCegarLoop]: Abstraction has 19876 states and 30058 transitions. [2025-03-08 05:57:37,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 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-08 05:57:37,914 INFO L276 IsEmpty]: Start isEmpty. Operand 19876 states and 30058 transitions. [2025-03-08 05:57:37,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-08 05:57:37,916 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:57:37,916 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:57:37,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 05:57:37,916 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:57:37,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:57:37,917 INFO L85 PathProgramCache]: Analyzing trace with hash 324582942, now seen corresponding path program 1 times [2025-03-08 05:57:37,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:57:37,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603744127] [2025-03-08 05:57:37,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:57:37,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:57:37,926 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-08 05:57:37,938 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-08 05:57:37,939 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:57:37,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:57:37,983 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:57:37,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:57:37,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603744127] [2025-03-08 05:57:37,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603744127] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:57:37,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:57:37,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:57:37,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741658860] [2025-03-08 05:57:37,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:57:37,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:57:37,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:57:37,985 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:57:37,985 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:57:37,985 INFO L87 Difference]: Start difference. First operand 19876 states and 30058 transitions. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 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-08 05:57:38,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:57:38,316 INFO L93 Difference]: Finished difference Result 59367 states and 89704 transitions. [2025-03-08 05:57:38,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:57:38,317 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 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 103 [2025-03-08 05:57:38,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:57:38,391 INFO L225 Difference]: With dead ends: 59367 [2025-03-08 05:57:38,391 INFO L226 Difference]: Without dead ends: 39558 [2025-03-08 05:57:38,415 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:57:38,416 INFO L435 NwaCegarLoop]: 235 mSDtfsCounter, 111 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:57:38,417 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 400 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:57:38,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39558 states. [2025-03-08 05:57:39,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39558 to 39556. [2025-03-08 05:57:39,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39556 states, 39555 states have (on average 1.4979901403109595) internal successors, (59253), 39555 states have internal predecessors, (59253), 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-08 05:57:39,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39556 states to 39556 states and 59253 transitions. [2025-03-08 05:57:39,240 INFO L78 Accepts]: Start accepts. Automaton has 39556 states and 59253 transitions. Word has length 103 [2025-03-08 05:57:39,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:57:39,240 INFO L471 AbstractCegarLoop]: Abstraction has 39556 states and 59253 transitions. [2025-03-08 05:57:39,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 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-08 05:57:39,240 INFO L276 IsEmpty]: Start isEmpty. Operand 39556 states and 59253 transitions. [2025-03-08 05:57:39,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-08 05:57:39,244 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:57:39,244 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:57:39,244 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 05:57:39,245 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:57:39,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:57:39,246 INFO L85 PathProgramCache]: Analyzing trace with hash 2104417837, now seen corresponding path program 1 times [2025-03-08 05:57:39,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:57:39,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756044426] [2025-03-08 05:57:39,246 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:57:39,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:57:39,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-08 05:57:39,273 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-08 05:57:39,273 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:57:39,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:57:39,329 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-08 05:57:39,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:57:39,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756044426] [2025-03-08 05:57:39,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756044426] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:57:39,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:57:39,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:57:39,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725277115] [2025-03-08 05:57:39,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:57:39,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:57:39,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:57:39,331 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:57:39,331 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:57:39,331 INFO L87 Difference]: Start difference. First operand 39556 states and 59253 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 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-08 05:57:40,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:57:40,048 INFO L93 Difference]: Finished difference Result 118122 states and 176750 transitions. [2025-03-08 05:57:40,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:57:40,049 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 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 103 [2025-03-08 05:57:40,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:57:40,230 INFO L225 Difference]: With dead ends: 118122 [2025-03-08 05:57:40,230 INFO L226 Difference]: Without dead ends: 78669 [2025-03-08 05:57:40,266 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:57:40,267 INFO L435 NwaCegarLoop]: 236 mSDtfsCounter, 110 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 401 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:57:40,267 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 401 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:57:40,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78669 states. [2025-03-08 05:57:41,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78669 to 78667. [2025-03-08 05:57:41,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78667 states, 78666 states have (on average 1.4853939440164747) internal successors, (116850), 78666 states have internal predecessors, (116850), 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-08 05:57:41,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78667 states to 78667 states and 116850 transitions. [2025-03-08 05:57:41,515 INFO L78 Accepts]: Start accepts. Automaton has 78667 states and 116850 transitions. Word has length 103 [2025-03-08 05:57:41,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:57:41,515 INFO L471 AbstractCegarLoop]: Abstraction has 78667 states and 116850 transitions. [2025-03-08 05:57:41,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 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-08 05:57:41,516 INFO L276 IsEmpty]: Start isEmpty. Operand 78667 states and 116850 transitions. [2025-03-08 05:57:41,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-08 05:57:41,521 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:57:41,521 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:57:41,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 05:57:41,521 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:57:41,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:57:41,522 INFO L85 PathProgramCache]: Analyzing trace with hash -1177611716, now seen corresponding path program 1 times [2025-03-08 05:57:41,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:57:41,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736612973] [2025-03-08 05:57:41,522 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:57:41,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:57:41,530 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-08 05:57:41,541 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-08 05:57:41,542 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:57:41,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:57:41,587 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 05:57:41,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:57:41,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736612973] [2025-03-08 05:57:41,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736612973] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:57:41,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:57:41,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:57:41,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218369774] [2025-03-08 05:57:41,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:57:41,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:57:41,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:57:41,589 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:57:41,589 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:57:41,589 INFO L87 Difference]: Start difference. First operand 78667 states and 116850 transitions. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 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-08 05:57:43,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:57:43,506 INFO L93 Difference]: Finished difference Result 234923 states and 348556 transitions. [2025-03-08 05:57:43,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:57:43,506 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 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 103 [2025-03-08 05:57:43,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:57:43,781 INFO L225 Difference]: With dead ends: 234923 [2025-03-08 05:57:43,782 INFO L226 Difference]: Without dead ends: 156441 [2025-03-08 05:57:43,815 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:57:43,816 INFO L435 NwaCegarLoop]: 221 mSDtfsCounter, 96 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 386 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:57:43,816 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 386 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:57:43,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156441 states. [2025-03-08 05:57:46,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156441 to 156439. [2025-03-08 05:57:46,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156439 states, 156438 states have (on average 1.4726345261381506) internal successors, (230376), 156438 states have internal predecessors, (230376), 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-08 05:57:46,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156439 states to 156439 states and 230376 transitions. [2025-03-08 05:57:46,867 INFO L78 Accepts]: Start accepts. Automaton has 156439 states and 230376 transitions. Word has length 103 [2025-03-08 05:57:46,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:57:46,868 INFO L471 AbstractCegarLoop]: Abstraction has 156439 states and 230376 transitions. [2025-03-08 05:57:46,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 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-08 05:57:46,868 INFO L276 IsEmpty]: Start isEmpty. Operand 156439 states and 230376 transitions. [2025-03-08 05:57:46,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-08 05:57:46,889 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:57:46,890 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:57:46,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 05:57:46,890 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:57:46,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:57:46,890 INFO L85 PathProgramCache]: Analyzing trace with hash -105506772, now seen corresponding path program 1 times [2025-03-08 05:57:46,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:57:46,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724921554] [2025-03-08 05:57:46,890 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:57:46,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:57:46,904 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-08 05:57:46,918 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-08 05:57:46,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:57:46,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:57:46,955 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:57:46,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:57:46,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724921554] [2025-03-08 05:57:46,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724921554] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:57:46,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:57:46,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:57:46,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593243431] [2025-03-08 05:57:46,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:57:46,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:57:46,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:57:46,957 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:57:46,957 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:57:46,957 INFO L87 Difference]: Start difference. First operand 156439 states and 230376 transitions. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 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-08 05:57:49,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:57:49,942 INFO L93 Difference]: Finished difference Result 467511 states and 687879 transitions. [2025-03-08 05:57:49,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:57:49,943 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 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 103 [2025-03-08 05:57:49,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:57:50,524 INFO L225 Difference]: With dead ends: 467511 [2025-03-08 05:57:50,524 INFO L226 Difference]: Without dead ends: 311481 [2025-03-08 05:57:50,650 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:57:50,651 INFO L435 NwaCegarLoop]: 252 mSDtfsCounter, 130 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:57:50,651 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 417 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:57:50,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311481 states. [2025-03-08 05:57:55,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311481 to 311479. [2025-03-08 05:57:56,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 311479 states, 311478 states have (on average 1.4579809810002633) internal successors, (454129), 311478 states have internal predecessors, (454129), 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-08 05:57:56,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311479 states to 311479 states and 454129 transitions. [2025-03-08 05:57:56,784 INFO L78 Accepts]: Start accepts. Automaton has 311479 states and 454129 transitions. Word has length 103 [2025-03-08 05:57:56,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:57:56,785 INFO L471 AbstractCegarLoop]: Abstraction has 311479 states and 454129 transitions. [2025-03-08 05:57:56,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 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-08 05:57:56,785 INFO L276 IsEmpty]: Start isEmpty. Operand 311479 states and 454129 transitions. [2025-03-08 05:57:56,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-08 05:57:56,802 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:57:56,802 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:57:56,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 05:57:56,803 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:57:56,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:57:56,803 INFO L85 PathProgramCache]: Analyzing trace with hash -554203411, now seen corresponding path program 1 times [2025-03-08 05:57:56,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:57:56,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534479270] [2025-03-08 05:57:56,803 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:57:56,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:57:56,813 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-08 05:57:56,822 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-08 05:57:56,822 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:57:56,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:57:57,141 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:57:57,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:57:57,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534479270] [2025-03-08 05:57:57,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534479270] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:57:57,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:57:57,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:57:57,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68323352] [2025-03-08 05:57:57,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:57:57,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:57:57,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:57:57,143 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:57:57,143 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:57:57,143 INFO L87 Difference]: Start difference. First operand 311479 states and 454129 transitions. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 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-08 05:58:00,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:58:00,295 INFO L93 Difference]: Finished difference Result 467895 states and 680635 transitions. [2025-03-08 05:58:00,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:58:00,510 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 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 103 [2025-03-08 05:58:00,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:58:01,012 INFO L225 Difference]: With dead ends: 467895 [2025-03-08 05:58:01,012 INFO L226 Difference]: Without dead ends: 311833 [2025-03-08 05:58:01,115 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:58:01,115 INFO L435 NwaCegarLoop]: 281 mSDtfsCounter, 101 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:58:01,115 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 448 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:58:01,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311833 states. [2025-03-08 05:58:05,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311833 to 311831. [2025-03-08 05:58:06,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 311831 states, 311830 states have (on average 1.4452393932591476) internal successors, (450669), 311830 states have internal predecessors, (450669), 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-08 05:58:06,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311831 states to 311831 states and 450669 transitions. [2025-03-08 05:58:06,751 INFO L78 Accepts]: Start accepts. Automaton has 311831 states and 450669 transitions. Word has length 103 [2025-03-08 05:58:06,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:58:06,751 INFO L471 AbstractCegarLoop]: Abstraction has 311831 states and 450669 transitions. [2025-03-08 05:58:06,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 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-08 05:58:06,752 INFO L276 IsEmpty]: Start isEmpty. Operand 311831 states and 450669 transitions. [2025-03-08 05:58:06,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-08 05:58:06,767 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:58:06,767 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:58:06,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-08 05:58:06,769 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:58:06,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:58:06,769 INFO L85 PathProgramCache]: Analyzing trace with hash 953348398, now seen corresponding path program 1 times [2025-03-08 05:58:06,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:58:06,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603640377] [2025-03-08 05:58:06,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:58:06,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:58:06,784 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-08 05:58:06,800 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-08 05:58:06,801 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:58:06,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:58:06,837 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:58:06,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:58:06,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603640377] [2025-03-08 05:58:06,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603640377] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:58:06,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:58:06,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:58:06,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189174495] [2025-03-08 05:58:06,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:58:06,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:58:06,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:58:06,840 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:58:06,840 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:58:06,840 INFO L87 Difference]: Start difference. First operand 311831 states and 450669 transitions. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 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)