./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.6.ufo.UNBOUNDED.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 5692c849f4d89bdffd108b63efd7f8fc3dfb9eaa92d6e9ffe082f62ca54e1100 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 14:50:31,437 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 14:50:31,495 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 14:50:31,500 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 14:50:31,501 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 14:50:31,521 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 14:50:31,522 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 14:50:31,522 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 14:50:31,523 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 14:50:31,523 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 14:50:31,524 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 14:50:31,524 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 14:50:31,524 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 14:50:31,524 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 14:50:31,524 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 14:50:31,525 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 14:50:31,525 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 14:50:31,525 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 14:50:31,525 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 14:50:31,525 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 14:50:31,525 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 14:50:31,525 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 14:50:31,525 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 14:50:31,525 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 14:50:31,525 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 14:50:31,525 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 14:50:31,526 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 14:50:31,526 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 14:50:31,526 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 14:50:31,526 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 14:50:31,526 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 14:50:31,526 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 14:50:31,526 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:50:31,527 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 14:50:31,527 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 14:50:31,527 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 14:50:31,527 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 14:50:31,527 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 14:50:31,527 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 14:50:31,527 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 14:50:31,527 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 14:50:31,527 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 14:50:31,527 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 14:50:31,527 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 -> 5692c849f4d89bdffd108b63efd7f8fc3dfb9eaa92d6e9ffe082f62ca54e1100 [2025-03-03 14:50:31,741 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 14:50:31,746 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 14:50:31,747 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 14:50:31,748 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 14:50:31,748 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 14:50:31,748 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c [2025-03-03 14:50:32,851 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03becc531/70389ce4af934f48846c3c0a16ab433d/FLAGa4600f75f [2025-03-03 14:50:33,113 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 14:50:33,113 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c [2025-03-03 14:50:33,127 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03becc531/70389ce4af934f48846c3c0a16ab433d/FLAGa4600f75f [2025-03-03 14:50:33,426 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03becc531/70389ce4af934f48846c3c0a16ab433d [2025-03-03 14:50:33,429 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 14:50:33,430 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 14:50:33,431 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 14:50:33,431 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 14:50:33,434 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 14:50:33,434 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:50:33" (1/1) ... [2025-03-03 14:50:33,435 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@556ffe32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:50:33, skipping insertion in model container [2025-03-03 14:50:33,435 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:50:33" (1/1) ... [2025-03-03 14:50:33,454 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 14:50:33,649 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_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c[16964,16977] [2025-03-03 14:50:33,653 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:50:33,666 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 14:50:33,731 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_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c[16964,16977] [2025-03-03 14:50:33,732 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:50:33,746 INFO L204 MainTranslator]: Completed translation [2025-03-03 14:50:33,747 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:50:33 WrapperNode [2025-03-03 14:50:33,748 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 14:50:33,748 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 14:50:33,749 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 14:50:33,749 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 14:50:33,754 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:50:33" (1/1) ... [2025-03-03 14:50:33,767 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:50:33" (1/1) ... [2025-03-03 14:50:33,798 INFO L138 Inliner]: procedures = 26, calls = 17, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 450 [2025-03-03 14:50:33,801 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 14:50:33,802 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 14:50:33,802 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 14:50:33,802 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 14:50:33,808 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:50:33" (1/1) ... [2025-03-03 14:50:33,809 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:50:33" (1/1) ... [2025-03-03 14:50:33,811 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:50:33" (1/1) ... [2025-03-03 14:50:33,833 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 14:50:33,833 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:50:33" (1/1) ... [2025-03-03 14:50:33,833 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:50:33" (1/1) ... [2025-03-03 14:50:33,844 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:50:33" (1/1) ... [2025-03-03 14:50:33,847 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:50:33" (1/1) ... [2025-03-03 14:50:33,848 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:50:33" (1/1) ... [2025-03-03 14:50:33,848 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:50:33" (1/1) ... [2025-03-03 14:50:33,854 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 14:50:33,855 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 14:50:33,855 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 14:50:33,855 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 14:50:33,856 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:50:33" (1/1) ... [2025-03-03 14:50:33,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:50:33,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:50:33,881 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 14:50:33,886 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 14:50:33,901 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 14:50:33,902 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 14:50:33,902 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 14:50:33,902 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 14:50:33,979 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 14:50:33,980 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 14:50:34,379 INFO L? ?]: Removed 51 outVars from TransFormulas that were not future-live. [2025-03-03 14:50:34,379 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 14:50:34,390 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 14:50:34,391 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 14:50:34,392 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:50:34 BoogieIcfgContainer [2025-03-03 14:50:34,392 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 14:50:34,394 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 14:50:34,394 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 14:50:34,397 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 14:50:34,397 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 02:50:33" (1/3) ... [2025-03-03 14:50:34,398 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c1c7244 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:50:34, skipping insertion in model container [2025-03-03 14:50:34,398 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:50:33" (2/3) ... [2025-03-03 14:50:34,398 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c1c7244 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:50:34, skipping insertion in model container [2025-03-03 14:50:34,399 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:50:34" (3/3) ... [2025-03-03 14:50:34,399 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c [2025-03-03 14:50:34,410 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 14:50:34,412 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c that has 1 procedures, 122 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 14:50:34,459 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 14:50:34,469 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;@74823024, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 14:50:34,469 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 14:50:34,472 INFO L276 IsEmpty]: Start isEmpty. Operand has 122 states, 120 states have (on average 1.7583333333333333) internal successors, (211), 121 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:50:34,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-03 14:50:34,476 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:50:34,477 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-03 14:50:34,478 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:50:34,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:50:34,482 INFO L85 PathProgramCache]: Analyzing trace with hash 568524732, now seen corresponding path program 1 times [2025-03-03 14:50:34,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:50:34,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086513194] [2025-03-03 14:50:34,490 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:50:34,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:50:34,546 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-03 14:50:34,593 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-03 14:50:34,594 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:50:34,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:50:34,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:50:34,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:50:34,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086513194] [2025-03-03 14:50:34,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086513194] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:50:34,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:50:34,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 14:50:34,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829029504] [2025-03-03 14:50:34,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:50:34,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 14:50:34,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:50:34,727 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 14:50:34,728 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 14:50:34,730 INFO L87 Difference]: Start difference. First operand has 122 states, 120 states have (on average 1.7583333333333333) internal successors, (211), 121 states have internal predecessors, (211), 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-03 14:50:34,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:50:34,748 INFO L93 Difference]: Finished difference Result 195 states and 332 transitions. [2025-03-03 14:50:34,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 14:50:34,749 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-03 14:50:34,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:50:34,753 INFO L225 Difference]: With dead ends: 195 [2025-03-03 14:50:34,754 INFO L226 Difference]: Without dead ends: 119 [2025-03-03 14:50:34,756 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-03 14:50:34,757 INFO L435 NwaCegarLoop]: 206 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, 206 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-03 14:50:34,758 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:50:34,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2025-03-03 14:50:34,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2025-03-03 14:50:34,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 118 states have (on average 1.7457627118644068) internal successors, (206), 118 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:50:34,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 206 transitions. [2025-03-03 14:50:34,789 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 206 transitions. Word has length 37 [2025-03-03 14:50:34,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:50:34,789 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 206 transitions. [2025-03-03 14:50:34,789 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-03 14:50:34,789 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 206 transitions. [2025-03-03 14:50:34,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-03 14:50:34,791 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:50:34,791 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-03 14:50:34,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 14:50:34,791 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:50:34,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:50:34,792 INFO L85 PathProgramCache]: Analyzing trace with hash -1441579109, now seen corresponding path program 1 times [2025-03-03 14:50:34,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:50:34,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66706785] [2025-03-03 14:50:34,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:50:34,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:50:34,814 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-03 14:50:34,844 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-03 14:50:34,844 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:50:34,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:50:35,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:50:35,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:50:35,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66706785] [2025-03-03 14:50:35,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66706785] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:50:35,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:50:35,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:50:35,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501366051] [2025-03-03 14:50:35,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:50:35,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:50:35,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:50:35,048 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:50:35,049 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:50:35,049 INFO L87 Difference]: Start difference. First operand 119 states and 206 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-03 14:50:35,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:50:35,145 INFO L93 Difference]: Finished difference Result 195 states and 328 transitions. [2025-03-03 14:50:35,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:50:35,146 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-03 14:50:35,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:50:35,146 INFO L225 Difference]: With dead ends: 195 [2025-03-03 14:50:35,147 INFO L226 Difference]: Without dead ends: 119 [2025-03-03 14:50:35,147 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-03 14:50:35,147 INFO L435 NwaCegarLoop]: 204 mSDtfsCounter, 0 mSDsluCounter, 566 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 770 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:50:35,148 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 770 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:50:35,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2025-03-03 14:50:35,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2025-03-03 14:50:35,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 118 states have (on average 1.3983050847457628) internal successors, (165), 118 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:50:35,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 165 transitions. [2025-03-03 14:50:35,152 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 165 transitions. Word has length 37 [2025-03-03 14:50:35,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:50:35,152 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 165 transitions. [2025-03-03 14:50:35,152 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-03 14:50:35,152 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 165 transitions. [2025-03-03 14:50:35,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-03 14:50:35,153 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:50:35,153 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-03 14:50:35,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 14:50:35,154 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:50:35,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:50:35,154 INFO L85 PathProgramCache]: Analyzing trace with hash -778545037, now seen corresponding path program 1 times [2025-03-03 14:50:35,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:50:35,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655082755] [2025-03-03 14:50:35,154 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:50:35,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:50:35,168 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-03 14:50:35,181 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-03 14:50:35,181 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:50:35,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:50:35,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:50:35,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:50:35,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655082755] [2025-03-03 14:50:35,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655082755] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:50:35,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:50:35,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:50:35,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940412903] [2025-03-03 14:50:35,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:50:35,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:50:35,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:50:35,241 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:50:35,241 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:50:35,243 INFO L87 Difference]: Start difference. First operand 119 states and 165 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 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-03 14:50:35,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:50:35,269 INFO L93 Difference]: Finished difference Result 255 states and 387 transitions. [2025-03-03 14:50:35,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:50:35,269 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 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-03 14:50:35,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:50:35,270 INFO L225 Difference]: With dead ends: 255 [2025-03-03 14:50:35,272 INFO L226 Difference]: Without dead ends: 183 [2025-03-03 14:50:35,273 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-03 14:50:35,274 INFO L435 NwaCegarLoop]: 245 mSDtfsCounter, 102 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 364 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-03 14:50:35,274 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 364 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:50:35,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2025-03-03 14:50:35,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 181. [2025-03-03 14:50:35,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 180 states have (on average 1.4833333333333334) internal successors, (267), 180 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:50:35,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 267 transitions. [2025-03-03 14:50:35,288 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 267 transitions. Word has length 77 [2025-03-03 14:50:35,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:50:35,288 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 267 transitions. [2025-03-03 14:50:35,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 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-03 14:50:35,288 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 267 transitions. [2025-03-03 14:50:35,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-03 14:50:35,290 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:50:35,291 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-03 14:50:35,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 14:50:35,291 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:50:35,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:50:35,291 INFO L85 PathProgramCache]: Analyzing trace with hash -995176544, now seen corresponding path program 1 times [2025-03-03 14:50:35,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:50:35,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674572935] [2025-03-03 14:50:35,292 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:50:35,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:50:35,309 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-03 14:50:35,322 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-03 14:50:35,322 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:50:35,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:50:35,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:50:35,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:50:35,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674572935] [2025-03-03 14:50:35,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674572935] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:50:35,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:50:35,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:50:35,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978765827] [2025-03-03 14:50:35,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:50:35,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:50:35,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:50:35,394 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:50:35,394 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:50:35,394 INFO L87 Difference]: Start difference. First operand 181 states and 267 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 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-03 14:50:35,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:50:35,416 INFO L93 Difference]: Finished difference Result 433 states and 679 transitions. [2025-03-03 14:50:35,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:50:35,417 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 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-03 14:50:35,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:50:35,421 INFO L225 Difference]: With dead ends: 433 [2025-03-03 14:50:35,421 INFO L226 Difference]: Without dead ends: 299 [2025-03-03 14:50:35,421 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-03 14:50:35,422 INFO L435 NwaCegarLoop]: 238 mSDtfsCounter, 98 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 361 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-03 14:50:35,422 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 361 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:50:35,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2025-03-03 14:50:35,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 297. [2025-03-03 14:50:35,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 296 states have (on average 1.5405405405405406) internal successors, (456), 296 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:50:35,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 456 transitions. [2025-03-03 14:50:35,443 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 456 transitions. Word has length 77 [2025-03-03 14:50:35,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:50:35,444 INFO L471 AbstractCegarLoop]: Abstraction has 297 states and 456 transitions. [2025-03-03 14:50:35,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 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-03 14:50:35,444 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 456 transitions. [2025-03-03 14:50:35,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-03 14:50:35,445 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:50:35,445 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-03 14:50:35,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 14:50:35,445 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:50:35,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:50:35,447 INFO L85 PathProgramCache]: Analyzing trace with hash -808327859, now seen corresponding path program 1 times [2025-03-03 14:50:35,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:50:35,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254277477] [2025-03-03 14:50:35,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:50:35,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:50:35,463 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-03 14:50:35,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-03 14:50:35,511 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:50:35,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:50:35,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:50:35,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:50:35,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254277477] [2025-03-03 14:50:35,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254277477] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:50:35,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:50:35,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:50:35,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114052772] [2025-03-03 14:50:35,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:50:35,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:50:35,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:50:35,582 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:50:35,582 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:50:35,582 INFO L87 Difference]: Start difference. First operand 297 states and 456 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 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-03 14:50:35,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:50:35,606 INFO L93 Difference]: Finished difference Result 765 states and 1218 transitions. [2025-03-03 14:50:35,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:50:35,607 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 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-03 14:50:35,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:50:35,609 INFO L225 Difference]: With dead ends: 765 [2025-03-03 14:50:35,609 INFO L226 Difference]: Without dead ends: 515 [2025-03-03 14:50:35,611 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-03 14:50:35,612 INFO L435 NwaCegarLoop]: 231 mSDtfsCounter, 94 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 358 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-03 14:50:35,612 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 358 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:50:35,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2025-03-03 14:50:35,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 513. [2025-03-03 14:50:35,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 513 states, 512 states have (on average 1.5703125) internal successors, (804), 512 states have internal predecessors, (804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:50:35,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 804 transitions. [2025-03-03 14:50:35,626 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 804 transitions. Word has length 77 [2025-03-03 14:50:35,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:50:35,626 INFO L471 AbstractCegarLoop]: Abstraction has 513 states and 804 transitions. [2025-03-03 14:50:35,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 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-03 14:50:35,626 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 804 transitions. [2025-03-03 14:50:35,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-03 14:50:35,627 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:50:35,627 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-03 14:50:35,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 14:50:35,627 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:50:35,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:50:35,628 INFO L85 PathProgramCache]: Analyzing trace with hash -619390598, now seen corresponding path program 1 times [2025-03-03 14:50:35,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:50:35,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905084951] [2025-03-03 14:50:35,628 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:50:35,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:50:35,645 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-03 14:50:35,658 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-03 14:50:35,659 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:50:35,659 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:50:35,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:50:35,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:50:35,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905084951] [2025-03-03 14:50:35,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905084951] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:50:35,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:50:35,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 14:50:35,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364927895] [2025-03-03 14:50:35,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:50:35,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 14:50:35,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:50:35,837 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 14:50:35,837 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:50:35,837 INFO L87 Difference]: Start difference. First operand 513 states and 804 transitions. Second operand has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 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-03 14:50:36,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:50:36,045 INFO L93 Difference]: Finished difference Result 3775 states and 6103 transitions. [2025-03-03 14:50:36,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 14:50:36,046 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 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-03 14:50:36,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:50:36,060 INFO L225 Difference]: With dead ends: 3775 [2025-03-03 14:50:36,060 INFO L226 Difference]: Without dead ends: 3309 [2025-03-03 14:50:36,060 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2025-03-03 14:50:36,061 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 2135 mSDsluCounter, 1396 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2135 SdHoareTripleChecker+Valid, 1557 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:50:36,061 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2135 Valid, 1557 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:50:36,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3309 states. [2025-03-03 14:50:36,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3309 to 977. [2025-03-03 14:50:36,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 977 states, 976 states have (on average 1.5819672131147542) internal successors, (1544), 976 states have internal predecessors, (1544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:50:36,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 977 states to 977 states and 1544 transitions. [2025-03-03 14:50:36,115 INFO L78 Accepts]: Start accepts. Automaton has 977 states and 1544 transitions. Word has length 77 [2025-03-03 14:50:36,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:50:36,116 INFO L471 AbstractCegarLoop]: Abstraction has 977 states and 1544 transitions. [2025-03-03 14:50:36,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 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-03 14:50:36,116 INFO L276 IsEmpty]: Start isEmpty. Operand 977 states and 1544 transitions. [2025-03-03 14:50:36,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-03 14:50:36,117 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:50:36,117 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-03 14:50:36,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 14:50:36,117 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:50:36,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:50:36,117 INFO L85 PathProgramCache]: Analyzing trace with hash -1991625142, now seen corresponding path program 1 times [2025-03-03 14:50:36,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:50:36,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812512720] [2025-03-03 14:50:36,117 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:50:36,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:50:36,132 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-03 14:50:36,157 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-03 14:50:36,157 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:50:36,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:50:36,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:50:36,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:50:36,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812512720] [2025-03-03 14:50:36,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812512720] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:50:36,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:50:36,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:50:36,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942298019] [2025-03-03 14:50:36,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:50:36,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:50:36,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:50:36,494 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:50:36,494 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:50:36,494 INFO L87 Difference]: Start difference. First operand 977 states and 1544 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-03 14:50:36,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:50:36,524 INFO L93 Difference]: Finished difference Result 1027 states and 1609 transitions. [2025-03-03 14:50:36,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:50:36,524 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-03 14:50:36,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:50:36,528 INFO L225 Difference]: With dead ends: 1027 [2025-03-03 14:50:36,528 INFO L226 Difference]: Without dead ends: 1025 [2025-03-03 14:50:36,528 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 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-03 14:50:36,529 INFO L435 NwaCegarLoop]: 162 mSDtfsCounter, 0 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 640 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:50:36,530 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 640 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:50:36,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1025 states. [2025-03-03 14:50:36,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1025 to 1025. [2025-03-03 14:50:36,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1025 states, 1024 states have (on average 1.5546875) internal successors, (1592), 1024 states have internal predecessors, (1592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:50:36,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1025 states to 1025 states and 1592 transitions. [2025-03-03 14:50:36,558 INFO L78 Accepts]: Start accepts. Automaton has 1025 states and 1592 transitions. Word has length 78 [2025-03-03 14:50:36,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:50:36,559 INFO L471 AbstractCegarLoop]: Abstraction has 1025 states and 1592 transitions. [2025-03-03 14:50:36,559 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-03 14:50:36,559 INFO L276 IsEmpty]: Start isEmpty. Operand 1025 states and 1592 transitions. [2025-03-03 14:50:36,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-03 14:50:36,560 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:50:36,560 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, 1] [2025-03-03 14:50:36,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 14:50:36,560 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:50:36,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:50:36,560 INFO L85 PathProgramCache]: Analyzing trace with hash -1522117702, now seen corresponding path program 1 times [2025-03-03 14:50:36,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:50:36,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133254552] [2025-03-03 14:50:36,561 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:50:36,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:50:36,572 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-03 14:50:36,582 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-03 14:50:36,582 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:50:36,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:50:36,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:50:36,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:50:36,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133254552] [2025-03-03 14:50:36,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133254552] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:50:36,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:50:36,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:50:36,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131320947] [2025-03-03 14:50:36,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:50:36,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:50:36,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:50:36,639 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:50:36,639 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:50:36,639 INFO L87 Difference]: Start difference. First operand 1025 states and 1592 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:50:36,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:50:36,678 INFO L93 Difference]: Finished difference Result 2861 states and 4482 transitions. [2025-03-03 14:50:36,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:50:36,678 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2025-03-03 14:50:36,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:50:36,685 INFO L225 Difference]: With dead ends: 2861 [2025-03-03 14:50:36,685 INFO L226 Difference]: Without dead ends: 1883 [2025-03-03 14:50:36,688 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-03 14:50:36,688 INFO L435 NwaCegarLoop]: 162 mSDtfsCounter, 78 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:50:36,689 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 275 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:50:36,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1883 states. [2025-03-03 14:50:36,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1883 to 1865. [2025-03-03 14:50:36,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1865 states, 1864 states have (on average 1.5493562231759657) internal successors, (2888), 1864 states have internal predecessors, (2888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:50:36,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1865 states to 1865 states and 2888 transitions. [2025-03-03 14:50:36,736 INFO L78 Accepts]: Start accepts. Automaton has 1865 states and 2888 transitions. Word has length 79 [2025-03-03 14:50:36,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:50:36,736 INFO L471 AbstractCegarLoop]: Abstraction has 1865 states and 2888 transitions. [2025-03-03 14:50:36,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:50:36,737 INFO L276 IsEmpty]: Start isEmpty. Operand 1865 states and 2888 transitions. [2025-03-03 14:50:36,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-03 14:50:36,737 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:50:36,737 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, 1, 1] [2025-03-03 14:50:36,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 14:50:36,738 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:50:36,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:50:36,738 INFO L85 PathProgramCache]: Analyzing trace with hash 1094459095, now seen corresponding path program 1 times [2025-03-03 14:50:36,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:50:36,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086787985] [2025-03-03 14:50:36,738 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:50:36,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:50:36,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-03 14:50:36,758 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-03 14:50:36,758 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:50:36,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:50:36,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:50:36,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:50:36,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086787985] [2025-03-03 14:50:36,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086787985] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:50:36,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:50:36,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:50:36,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521232707] [2025-03-03 14:50:36,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:50:36,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:50:36,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:50:36,795 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:50:36,795 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:50:36,795 INFO L87 Difference]: Start difference. First operand 1865 states and 2888 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:50:36,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:50:36,853 INFO L93 Difference]: Finished difference Result 5245 states and 8122 transitions. [2025-03-03 14:50:36,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:50:36,854 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 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 80 [2025-03-03 14:50:36,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:50:36,865 INFO L225 Difference]: With dead ends: 5245 [2025-03-03 14:50:36,865 INFO L226 Difference]: Without dead ends: 3427 [2025-03-03 14:50:36,868 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-03 14:50:36,869 INFO L435 NwaCegarLoop]: 208 mSDtfsCounter, 86 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 343 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-03 14:50:36,870 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 343 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:50:36,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3427 states. [2025-03-03 14:50:36,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3427 to 3425. [2025-03-03 14:50:36,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3425 states, 3424 states have (on average 1.5327102803738317) internal successors, (5248), 3424 states have internal predecessors, (5248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:50:36,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3425 states to 3425 states and 5248 transitions. [2025-03-03 14:50:36,959 INFO L78 Accepts]: Start accepts. Automaton has 3425 states and 5248 transitions. Word has length 80 [2025-03-03 14:50:36,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:50:36,960 INFO L471 AbstractCegarLoop]: Abstraction has 3425 states and 5248 transitions. [2025-03-03 14:50:36,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:50:36,960 INFO L276 IsEmpty]: Start isEmpty. Operand 3425 states and 5248 transitions. [2025-03-03 14:50:36,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-03 14:50:36,961 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:50:36,961 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, 1, 1] [2025-03-03 14:50:36,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 14:50:36,961 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:50:36,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:50:36,964 INFO L85 PathProgramCache]: Analyzing trace with hash -64216795, now seen corresponding path program 1 times [2025-03-03 14:50:36,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:50:36,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105093935] [2025-03-03 14:50:36,964 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:50:36,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:50:36,978 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-03 14:50:36,986 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-03 14:50:36,986 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:50:36,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:50:37,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:50:37,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:50:37,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105093935] [2025-03-03 14:50:37,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105093935] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:50:37,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:50:37,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:50:37,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796830860] [2025-03-03 14:50:37,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:50:37,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:50:37,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:50:37,027 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:50:37,027 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:50:37,028 INFO L87 Difference]: Start difference. First operand 3425 states and 5248 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:50:37,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:50:37,121 INFO L93 Difference]: Finished difference Result 9669 states and 14754 transitions. [2025-03-03 14:50:37,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:50:37,121 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 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 80 [2025-03-03 14:50:37,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:50:37,140 INFO L225 Difference]: With dead ends: 9669 [2025-03-03 14:50:37,140 INFO L226 Difference]: Without dead ends: 6291 [2025-03-03 14:50:37,145 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-03 14:50:37,145 INFO L435 NwaCegarLoop]: 225 mSDtfsCounter, 90 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 356 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-03 14:50:37,146 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 356 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:50:37,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6291 states. [2025-03-03 14:50:37,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6291 to 6289. [2025-03-03 14:50:37,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6289 states, 6288 states have (on average 1.508905852417303) internal successors, (9488), 6288 states have internal predecessors, (9488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:50:37,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6289 states to 6289 states and 9488 transitions. [2025-03-03 14:50:37,315 INFO L78 Accepts]: Start accepts. Automaton has 6289 states and 9488 transitions. Word has length 80 [2025-03-03 14:50:37,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:50:37,316 INFO L471 AbstractCegarLoop]: Abstraction has 6289 states and 9488 transitions. [2025-03-03 14:50:37,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:50:37,316 INFO L276 IsEmpty]: Start isEmpty. Operand 6289 states and 9488 transitions. [2025-03-03 14:50:37,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-03 14:50:37,316 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:50:37,316 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, 1, 1, 1] [2025-03-03 14:50:37,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 14:50:37,317 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:50:37,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:50:37,317 INFO L85 PathProgramCache]: Analyzing trace with hash -744797296, now seen corresponding path program 1 times [2025-03-03 14:50:37,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:50:37,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458415229] [2025-03-03 14:50:37,318 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:50:37,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:50:37,327 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-03 14:50:37,333 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-03 14:50:37,333 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:50:37,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:50:37,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:50:37,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:50:37,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458415229] [2025-03-03 14:50:37,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458415229] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:50:37,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:50:37,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:50:37,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505171124] [2025-03-03 14:50:37,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:50:37,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:50:37,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:50:37,365 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:50:37,365 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:50:37,365 INFO L87 Difference]: Start difference. First operand 6289 states and 9488 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:50:37,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:50:37,476 INFO L93 Difference]: Finished difference Result 12440 states and 18838 transitions. [2025-03-03 14:50:37,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:50:37,480 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2025-03-03 14:50:37,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:50:37,510 INFO L225 Difference]: With dead ends: 12440 [2025-03-03 14:50:37,510 INFO L226 Difference]: Without dead ends: 9045 [2025-03-03 14:50:37,519 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-03 14:50:37,519 INFO L435 NwaCegarLoop]: 259 mSDtfsCounter, 103 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 374 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-03 14:50:37,520 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 374 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:50:37,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9045 states. [2025-03-03 14:50:37,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9045 to 9043. [2025-03-03 14:50:37,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9043 states, 9042 states have (on average 1.4990046449900465) internal successors, (13554), 9042 states have internal predecessors, (13554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:50:37,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9043 states to 9043 states and 13554 transitions. [2025-03-03 14:50:37,742 INFO L78 Accepts]: Start accepts. Automaton has 9043 states and 13554 transitions. Word has length 81 [2025-03-03 14:50:37,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:50:37,742 INFO L471 AbstractCegarLoop]: Abstraction has 9043 states and 13554 transitions. [2025-03-03 14:50:37,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:50:37,742 INFO L276 IsEmpty]: Start isEmpty. Operand 9043 states and 13554 transitions. [2025-03-03 14:50:37,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-03 14:50:37,749 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:50:37,749 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 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, 1, 1, 1, 1] [2025-03-03 14:50:37,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 14:50:37,749 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:50:37,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:50:37,750 INFO L85 PathProgramCache]: Analyzing trace with hash -444117991, now seen corresponding path program 1 times [2025-03-03 14:50:37,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:50:37,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468149965] [2025-03-03 14:50:37,750 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:50:37,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:50:37,766 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-03 14:50:37,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-03 14:50:37,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:50:37,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:50:37,932 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-03 14:50:37,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:50:37,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468149965] [2025-03-03 14:50:37,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468149965] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:50:37,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:50:37,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 14:50:37,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801729890] [2025-03-03 14:50:37,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:50:37,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 14:50:37,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:50:37,934 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 14:50:37,934 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:50:37,934 INFO L87 Difference]: Start difference. First operand 9043 states and 13554 transitions. Second operand has 8 states, 8 states have (on average 13.25) internal successors, (106), 8 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:50:38,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:50:38,404 INFO L93 Difference]: Finished difference Result 34753 states and 52617 transitions. [2025-03-03 14:50:38,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 14:50:38,405 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.25) internal successors, (106), 8 states have internal predecessors, (106), 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 111 [2025-03-03 14:50:38,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:50:38,463 INFO L225 Difference]: With dead ends: 34753 [2025-03-03 14:50:38,464 INFO L226 Difference]: Without dead ends: 30207 [2025-03-03 14:50:38,478 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-03-03 14:50:38,479 INFO L435 NwaCegarLoop]: 282 mSDtfsCounter, 1318 mSDsluCounter, 1410 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1318 SdHoareTripleChecker+Valid, 1692 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:50:38,479 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1318 Valid, 1692 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:50:38,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30207 states. [2025-03-03 14:50:38,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30207 to 13491. [2025-03-03 14:50:38,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13491 states, 13490 states have (on average 1.4993328391401037) internal successors, (20226), 13490 states have internal predecessors, (20226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:50:38,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13491 states to 13491 states and 20226 transitions. [2025-03-03 14:50:38,963 INFO L78 Accepts]: Start accepts. Automaton has 13491 states and 20226 transitions. Word has length 111 [2025-03-03 14:50:38,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:50:38,963 INFO L471 AbstractCegarLoop]: Abstraction has 13491 states and 20226 transitions. [2025-03-03 14:50:38,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.25) internal successors, (106), 8 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:50:38,964 INFO L276 IsEmpty]: Start isEmpty. Operand 13491 states and 20226 transitions. [2025-03-03 14:50:38,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-03 14:50:38,969 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:50:38,969 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 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, 1, 1, 1, 1] [2025-03-03 14:50:38,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 14:50:38,970 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:50:38,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:50:38,970 INFO L85 PathProgramCache]: Analyzing trace with hash 141215429, now seen corresponding path program 1 times [2025-03-03 14:50:38,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:50:38,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722160521] [2025-03-03 14:50:38,970 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:50:38,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:50:38,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-03 14:50:38,990 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-03 14:50:38,990 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:50:38,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:50:39,137 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-03 14:50:39,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:50:39,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722160521] [2025-03-03 14:50:39,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722160521] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:50:39,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:50:39,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 14:50:39,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861454323] [2025-03-03 14:50:39,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:50:39,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 14:50:39,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:50:39,138 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 14:50:39,138 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:50:39,139 INFO L87 Difference]: Start difference. First operand 13491 states and 20226 transitions. Second operand has 8 states, 8 states have (on average 13.125) internal successors, (105), 8 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:50:39,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:50:39,636 INFO L93 Difference]: Finished difference Result 39201 states and 59289 transitions. [2025-03-03 14:50:39,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 14:50:39,637 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.125) internal successors, (105), 8 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 111 [2025-03-03 14:50:39,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:50:39,697 INFO L225 Difference]: With dead ends: 39201 [2025-03-03 14:50:39,697 INFO L226 Difference]: Without dead ends: 34655 [2025-03-03 14:50:39,708 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-03-03 14:50:39,709 INFO L435 NwaCegarLoop]: 280 mSDtfsCounter, 1355 mSDsluCounter, 1244 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1355 SdHoareTripleChecker+Valid, 1524 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:50:39,709 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1355 Valid, 1524 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:50:39,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34655 states. [2025-03-03 14:50:40,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34655 to 17939. [2025-03-03 14:50:40,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17939 states, 17938 states have (on average 1.4994982718251757) internal successors, (26898), 17938 states have internal predecessors, (26898), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:50:40,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17939 states to 17939 states and 26898 transitions. [2025-03-03 14:50:40,254 INFO L78 Accepts]: Start accepts. Automaton has 17939 states and 26898 transitions. Word has length 111 [2025-03-03 14:50:40,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:50:40,255 INFO L471 AbstractCegarLoop]: Abstraction has 17939 states and 26898 transitions. [2025-03-03 14:50:40,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.125) internal successors, (105), 8 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:50:40,255 INFO L276 IsEmpty]: Start isEmpty. Operand 17939 states and 26898 transitions. [2025-03-03 14:50:40,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-03 14:50:40,261 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:50:40,262 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 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, 1, 1, 1, 1] [2025-03-03 14:50:40,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 14:50:40,262 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:50:40,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:50:40,262 INFO L85 PathProgramCache]: Analyzing trace with hash -1959889039, now seen corresponding path program 1 times [2025-03-03 14:50:40,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:50:40,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915121860] [2025-03-03 14:50:40,263 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:50:40,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:50:40,277 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-03 14:50:40,287 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-03 14:50:40,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:50:40,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:50:40,460 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-03 14:50:40,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:50:40,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915121860] [2025-03-03 14:50:40,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915121860] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:50:40,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:50:40,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 14:50:40,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812933756] [2025-03-03 14:50:40,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:50:40,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 14:50:40,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:50:40,462 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 14:50:40,462 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:50:40,462 INFO L87 Difference]: Start difference. First operand 17939 states and 26898 transitions. Second operand has 8 states, 8 states have (on average 13.0) internal successors, (104), 8 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:50:41,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:50:41,098 INFO L93 Difference]: Finished difference Result 43649 states and 65961 transitions. [2025-03-03 14:50:41,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 14:50:41,098 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.0) internal successors, (104), 8 states have internal predecessors, (104), 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 111 [2025-03-03 14:50:41,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:50:41,157 INFO L225 Difference]: With dead ends: 43649 [2025-03-03 14:50:41,157 INFO L226 Difference]: Without dead ends: 39103 [2025-03-03 14:50:41,167 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-03-03 14:50:41,167 INFO L435 NwaCegarLoop]: 278 mSDtfsCounter, 1507 mSDsluCounter, 1198 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1507 SdHoareTripleChecker+Valid, 1476 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:50:41,167 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1507 Valid, 1476 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:50:41,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39103 states. [2025-03-03 14:50:41,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39103 to 22387. [2025-03-03 14:50:41,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22387 states, 22386 states have (on average 1.499597963012597) internal successors, (33570), 22386 states have internal predecessors, (33570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:50:41,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22387 states to 22387 states and 33570 transitions. [2025-03-03 14:50:41,701 INFO L78 Accepts]: Start accepts. Automaton has 22387 states and 33570 transitions. Word has length 111 [2025-03-03 14:50:41,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:50:41,701 INFO L471 AbstractCegarLoop]: Abstraction has 22387 states and 33570 transitions. [2025-03-03 14:50:41,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.0) internal successors, (104), 8 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:50:41,701 INFO L276 IsEmpty]: Start isEmpty. Operand 22387 states and 33570 transitions. [2025-03-03 14:50:41,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-03 14:50:41,707 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:50:41,708 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:50:41,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 14:50:41,708 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:50:41,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:50:41,708 INFO L85 PathProgramCache]: Analyzing trace with hash 1750550818, now seen corresponding path program 1 times [2025-03-03 14:50:41,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:50:41,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164974058] [2025-03-03 14:50:41,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:50:41,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:50:41,717 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-03 14:50:41,727 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-03 14:50:41,729 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:50:41,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:50:41,863 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-03 14:50:41,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:50:41,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164974058] [2025-03-03 14:50:41,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164974058] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:50:41,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:50:41,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 14:50:41,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295332620] [2025-03-03 14:50:41,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:50:41,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 14:50:41,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:50:41,865 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 14:50:41,865 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:50:41,865 INFO L87 Difference]: Start difference. First operand 22387 states and 33570 transitions. Second operand has 8 states, 8 states have (on average 12.375) internal successors, (99), 8 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:50:42,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:50:42,398 INFO L93 Difference]: Finished difference Result 48097 states and 72633 transitions. [2025-03-03 14:50:42,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 14:50:42,398 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.375) internal successors, (99), 8 states have internal predecessors, (99), 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 111 [2025-03-03 14:50:42,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:50:42,468 INFO L225 Difference]: With dead ends: 48097 [2025-03-03 14:50:42,469 INFO L226 Difference]: Without dead ends: 43551 [2025-03-03 14:50:42,482 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-03-03 14:50:42,482 INFO L435 NwaCegarLoop]: 278 mSDtfsCounter, 1404 mSDsluCounter, 1293 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1404 SdHoareTripleChecker+Valid, 1571 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:50:42,482 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1404 Valid, 1571 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:50:42,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43551 states. [2025-03-03 14:50:43,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43551 to 26835. [2025-03-03 14:50:43,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26835 states, 26834 states have (on average 1.4996646046060969) internal successors, (40242), 26834 states have internal predecessors, (40242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:50:43,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26835 states to 26835 states and 40242 transitions. [2025-03-03 14:50:43,183 INFO L78 Accepts]: Start accepts. Automaton has 26835 states and 40242 transitions. Word has length 111 [2025-03-03 14:50:43,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:50:43,183 INFO L471 AbstractCegarLoop]: Abstraction has 26835 states and 40242 transitions. [2025-03-03 14:50:43,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.375) internal successors, (99), 8 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:50:43,183 INFO L276 IsEmpty]: Start isEmpty. Operand 26835 states and 40242 transitions. [2025-03-03 14:50:43,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-03 14:50:43,191 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:50:43,191 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:50:43,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 14:50:43,191 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:50:43,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:50:43,192 INFO L85 PathProgramCache]: Analyzing trace with hash 591874928, now seen corresponding path program 1 times [2025-03-03 14:50:43,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:50:43,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302944960] [2025-03-03 14:50:43,192 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:50:43,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:50:43,204 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-03 14:50:43,215 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-03 14:50:43,215 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:50:43,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:50:43,386 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 14:50:43,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:50:43,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302944960] [2025-03-03 14:50:43,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302944960] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:50:43,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:50:43,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 14:50:43,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050924238] [2025-03-03 14:50:43,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:50:43,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 14:50:43,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:50:43,388 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 14:50:43,388 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:50:43,388 INFO L87 Difference]: Start difference. First operand 26835 states and 40242 transitions. Second operand has 8 states, 8 states have (on average 12.875) internal successors, (103), 8 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-03 14:50:44,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:50:44,154 INFO L93 Difference]: Finished difference Result 52545 states and 79305 transitions. [2025-03-03 14:50:44,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 14:50:44,154 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.875) internal successors, (103), 8 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 111 [2025-03-03 14:50:44,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:50:44,220 INFO L225 Difference]: With dead ends: 52545 [2025-03-03 14:50:44,221 INFO L226 Difference]: Without dead ends: 47999 [2025-03-03 14:50:44,242 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-03-03 14:50:44,243 INFO L435 NwaCegarLoop]: 277 mSDtfsCounter, 1238 mSDsluCounter, 1441 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1238 SdHoareTripleChecker+Valid, 1718 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:50:44,243 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1238 Valid, 1718 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:50:44,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47999 states. [2025-03-03 14:50:44,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47999 to 31283. [2025-03-03 14:50:44,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31283 states, 31282 states have (on average 1.499712294610319) internal successors, (46914), 31282 states have internal predecessors, (46914), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:50:45,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31283 states to 31283 states and 46914 transitions. [2025-03-03 14:50:45,013 INFO L78 Accepts]: Start accepts. Automaton has 31283 states and 46914 transitions. Word has length 111 [2025-03-03 14:50:45,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:50:45,013 INFO L471 AbstractCegarLoop]: Abstraction has 31283 states and 46914 transitions. [2025-03-03 14:50:45,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.875) internal successors, (103), 8 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-03 14:50:45,013 INFO L276 IsEmpty]: Start isEmpty. Operand 31283 states and 46914 transitions. [2025-03-03 14:50:45,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-03 14:50:45,019 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:50:45,020 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:50:45,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 14:50:45,020 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:50:45,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:50:45,020 INFO L85 PathProgramCache]: Analyzing trace with hash -113527579, now seen corresponding path program 1 times [2025-03-03 14:50:45,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:50:45,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402253162] [2025-03-03 14:50:45,021 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:50:45,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:50:45,030 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-03 14:50:45,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-03 14:50:45,053 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:50:45,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:50:45,110 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:50:45,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:50:45,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402253162] [2025-03-03 14:50:45,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402253162] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:50:45,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:50:45,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:50:45,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349442713] [2025-03-03 14:50:45,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:50:45,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:50:45,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:50:45,111 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:50:45,111 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:50:45,111 INFO L87 Difference]: Start difference. First operand 31283 states and 46914 transitions. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:50:45,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:50:45,491 INFO L93 Difference]: Finished difference Result 62519 states and 93780 transitions. [2025-03-03 14:50:45,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:50:45,491 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 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 112 [2025-03-03 14:50:45,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:50:45,526 INFO L225 Difference]: With dead ends: 62519 [2025-03-03 14:50:45,527 INFO L226 Difference]: Without dead ends: 31285 [2025-03-03 14:50:45,546 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-03 14:50:45,547 INFO L435 NwaCegarLoop]: 209 mSDtfsCounter, 81 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:50:45,547 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 359 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:50:45,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31285 states. [2025-03-03 14:50:45,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31285 to 31283. [2025-03-03 14:50:45,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31283 states, 31282 states have (on average 1.488971293395563) internal successors, (46578), 31282 states have internal predecessors, (46578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:50:46,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31283 states to 31283 states and 46578 transitions. [2025-03-03 14:50:46,030 INFO L78 Accepts]: Start accepts. Automaton has 31283 states and 46578 transitions. Word has length 112 [2025-03-03 14:50:46,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:50:46,030 INFO L471 AbstractCegarLoop]: Abstraction has 31283 states and 46578 transitions. [2025-03-03 14:50:46,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:50:46,030 INFO L276 IsEmpty]: Start isEmpty. Operand 31283 states and 46578 transitions. [2025-03-03 14:50:46,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-03 14:50:46,035 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:50:46,035 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:50:46,035 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 14:50:46,035 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:50:46,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:50:46,035 INFO L85 PathProgramCache]: Analyzing trace with hash -413165192, now seen corresponding path program 1 times [2025-03-03 14:50:46,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:50:46,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338519524] [2025-03-03 14:50:46,036 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:50:46,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:50:46,045 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-03 14:50:46,057 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-03 14:50:46,057 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:50:46,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:50:46,111 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:50:46,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:50:46,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338519524] [2025-03-03 14:50:46,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338519524] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:50:46,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:50:46,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:50:46,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235065127] [2025-03-03 14:50:46,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:50:46,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:50:46,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:50:46,113 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:50:46,114 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:50:46,114 INFO L87 Difference]: Start difference. First operand 31283 states and 46578 transitions. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:50:46,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:50:46,357 INFO L93 Difference]: Finished difference Result 46903 states and 69844 transitions. [2025-03-03 14:50:46,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:50:46,357 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 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 112 [2025-03-03 14:50:46,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:50:46,377 INFO L225 Difference]: With dead ends: 46903 [2025-03-03 14:50:46,377 INFO L226 Difference]: Without dead ends: 15669 [2025-03-03 14:50:46,393 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-03 14:50:46,393 INFO L435 NwaCegarLoop]: 200 mSDtfsCounter, 75 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:50:46,393 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 340 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:50:46,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15669 states. [2025-03-03 14:50:46,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15669 to 15667. [2025-03-03 14:50:46,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15667 states, 15666 states have (on average 1.477467126260692) internal successors, (23146), 15666 states have internal predecessors, (23146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:50:46,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15667 states to 15667 states and 23146 transitions. [2025-03-03 14:50:46,627 INFO L78 Accepts]: Start accepts. Automaton has 15667 states and 23146 transitions. Word has length 112 [2025-03-03 14:50:46,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:50:46,628 INFO L471 AbstractCegarLoop]: Abstraction has 15667 states and 23146 transitions. [2025-03-03 14:50:46,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:50:46,628 INFO L276 IsEmpty]: Start isEmpty. Operand 15667 states and 23146 transitions. [2025-03-03 14:50:46,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-03 14:50:46,631 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:50:46,631 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:50:46,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 14:50:46,631 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:50:46,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:50:46,631 INFO L85 PathProgramCache]: Analyzing trace with hash -1032142965, now seen corresponding path program 1 times [2025-03-03 14:50:46,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:50:46,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497452099] [2025-03-03 14:50:46,632 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:50:46,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:50:46,643 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-03 14:50:46,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-03 14:50:46,662 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:50:46,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:50:47,017 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 16 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:50:47,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:50:47,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497452099] [2025-03-03 14:50:47,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497452099] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:50:47,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1577479372] [2025-03-03 14:50:47,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:50:47,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:50:47,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:50:47,020 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:50:47,023 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 14:50:47,100 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-03 14:50:47,167 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-03 14:50:47,167 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:50:47,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:50:47,171 INFO L256 TraceCheckSpWp]: Trace formula consists of 499 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-03 14:50:47,181 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:50:47,671 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:50:47,671 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:50:48,065 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:50:48,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1577479372] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:50:48,065 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:50:48,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 8] total 20 [2025-03-03 14:50:48,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456674161] [2025-03-03 14:50:48,066 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:50:48,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-03 14:50:48,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:50:48,066 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-03 14:50:48,066 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=327, Unknown=0, NotChecked=0, Total=380 [2025-03-03 14:50:48,067 INFO L87 Difference]: Start difference. First operand 15667 states and 23146 transitions. Second operand has 20 states, 20 states have (on average 16.45) internal successors, (329), 20 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:50:56,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:50:56,595 INFO L93 Difference]: Finished difference Result 171491 states and 250866 transitions. [2025-03-03 14:50:56,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 134 states. [2025-03-03 14:50:56,596 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 16.45) internal successors, (329), 20 states have internal predecessors, (329), 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 112 [2025-03-03 14:50:56,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:50:56,775 INFO L225 Difference]: With dead ends: 171491 [2025-03-03 14:50:56,775 INFO L226 Difference]: Without dead ends: 160737 [2025-03-03 14:50:56,812 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 364 GetRequests, 214 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9190 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=3457, Invalid=19495, Unknown=0, NotChecked=0, Total=22952 [2025-03-03 14:50:56,812 INFO L435 NwaCegarLoop]: 242 mSDtfsCounter, 5095 mSDsluCounter, 2689 mSDsCounter, 0 mSdLazyCounter, 2338 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5095 SdHoareTripleChecker+Valid, 2931 SdHoareTripleChecker+Invalid, 2409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 2338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-03 14:50:56,813 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5095 Valid, 2931 Invalid, 2409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 2338 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-03 14:50:56,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160737 states. [2025-03-03 14:50:59,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160737 to 137011. [2025-03-03 14:50:59,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137011 states, 137010 states have (on average 1.4441719582512225) internal successors, (197866), 137010 states have internal predecessors, (197866), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:51:00,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137011 states to 137011 states and 197866 transitions. [2025-03-03 14:51:00,037 INFO L78 Accepts]: Start accepts. Automaton has 137011 states and 197866 transitions. Word has length 112 [2025-03-03 14:51:00,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:51:00,038 INFO L471 AbstractCegarLoop]: Abstraction has 137011 states and 197866 transitions. [2025-03-03 14:51:00,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 16.45) internal successors, (329), 20 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:51:00,038 INFO L276 IsEmpty]: Start isEmpty. Operand 137011 states and 197866 transitions. [2025-03-03 14:51:00,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-03 14:51:00,041 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:51:00,041 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:51:00,049 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 14:51:00,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:51:00,242 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:51:00,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:51:00,243 INFO L85 PathProgramCache]: Analyzing trace with hash -306045571, now seen corresponding path program 1 times [2025-03-03 14:51:00,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:51:00,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019530629] [2025-03-03 14:51:00,243 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:51:00,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:51:00,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-03 14:51:00,262 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-03 14:51:00,262 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:51:00,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:51:00,364 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-03 14:51:00,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:51:00,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019530629] [2025-03-03 14:51:00,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019530629] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:51:00,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:51:00,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 14:51:00,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062449067] [2025-03-03 14:51:00,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:51:00,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 14:51:00,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:51:00,366 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 14:51:00,366 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:51:00,366 INFO L87 Difference]: Start difference. First operand 137011 states and 197866 transitions. Second operand has 8 states, 8 states have (on average 14.0) internal successors, (112), 8 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:51:05,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:51:05,167 INFO L93 Difference]: Finished difference Result 252625 states and 366745 transitions. [2025-03-03 14:51:05,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 14:51:05,167 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 14.0) internal successors, (112), 8 states have internal predecessors, (112), 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 113 [2025-03-03 14:51:05,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:51:05,449 INFO L225 Difference]: With dead ends: 252625 [2025-03-03 14:51:05,449 INFO L226 Difference]: Without dead ends: 235079 [2025-03-03 14:51:05,485 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-03-03 14:51:05,485 INFO L435 NwaCegarLoop]: 297 mSDtfsCounter, 1190 mSDsluCounter, 1814 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1190 SdHoareTripleChecker+Valid, 2111 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:51:05,485 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1190 Valid, 2111 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:51:05,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235079 states. [2025-03-03 14:51:08,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235079 to 154875. [2025-03-03 14:51:08,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154875 states, 154874 states have (on average 1.4435605718196727) internal successors, (223570), 154874 states have internal predecessors, (223570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:51:09,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154875 states to 154875 states and 223570 transitions. [2025-03-03 14:51:09,178 INFO L78 Accepts]: Start accepts. Automaton has 154875 states and 223570 transitions. Word has length 113 [2025-03-03 14:51:09,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:51:09,178 INFO L471 AbstractCegarLoop]: Abstraction has 154875 states and 223570 transitions. [2025-03-03 14:51:09,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.0) internal successors, (112), 8 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:51:09,178 INFO L276 IsEmpty]: Start isEmpty. Operand 154875 states and 223570 transitions. [2025-03-03 14:51:09,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-03-03 14:51:09,182 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:51:09,182 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:51:09,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-03 14:51:09,183 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:51:09,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:51:09,183 INFO L85 PathProgramCache]: Analyzing trace with hash 1550167457, now seen corresponding path program 1 times [2025-03-03 14:51:09,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:51:09,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293102397] [2025-03-03 14:51:09,183 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:51:09,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:51:09,193 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-03 14:51:09,205 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-03 14:51:09,205 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:51:09,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:51:09,265 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-03 14:51:09,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:51:09,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293102397] [2025-03-03 14:51:09,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293102397] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:51:09,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:51:09,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:51:09,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376539897] [2025-03-03 14:51:09,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:51:09,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:51:09,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:51:09,267 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:51:09,267 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:51:09,267 INFO L87 Difference]: Start difference. First operand 154875 states and 223570 transitions. Second operand has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:51:11,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:51:11,400 INFO L93 Difference]: Finished difference Result 222207 states and 318983 transitions. [2025-03-03 14:51:11,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:51:11,401 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 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 114 [2025-03-03 14:51:11,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:51:11,483 INFO L225 Difference]: With dead ends: 222207 [2025-03-03 14:51:11,483 INFO L226 Difference]: Without dead ends: 67381 [2025-03-03 14:51:11,538 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-03 14:51:11,538 INFO L435 NwaCegarLoop]: 201 mSDtfsCounter, 63 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:51:11,538 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 336 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:51:11,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67381 states.