./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.6.ufo.BOUNDED-12.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.6.ufo.BOUNDED-12.pals.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 a44e961521da9b8f4535724e185f402d94bec27d495ab6df10e2b3c1ffa4513a --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 16:15:09,499 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 16:15:09,547 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 16:15:09,550 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 16:15:09,551 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 16:15:09,564 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 16:15:09,564 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 16:15:09,564 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 16:15:09,566 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 16:15:09,566 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 16:15:09,566 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 16:15:09,566 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 16:15:09,566 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 16:15:09,566 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 16:15:09,566 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 16:15:09,566 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 16:15:09,566 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 16:15:09,566 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 16:15:09,566 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 16:15:09,566 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 16:15:09,567 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 16:15:09,567 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 16:15:09,567 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 16:15:09,567 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 16:15:09,567 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 16:15:09,567 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 16:15:09,567 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 16:15:09,567 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 16:15:09,567 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 16:15:09,567 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 16:15:09,567 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 16:15:09,567 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 16:15:09,567 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 16:15:09,567 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 16:15:09,567 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 16:15:09,567 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 16:15:09,567 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 16:15:09,567 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 16:15:09,568 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 16:15:09,568 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 16:15:09,568 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 16:15:09,568 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 16:15:09,568 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 16:15:09,568 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-jdk21/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 -> a44e961521da9b8f4535724e185f402d94bec27d495ab6df10e2b3c1ffa4513a [2025-02-05 16:15:09,779 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 16:15:09,786 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 16:15:09,788 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 16:15:09,788 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 16:15:09,788 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 16:15:09,789 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.6.ufo.BOUNDED-12.pals.c [2025-02-05 16:15:10,893 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ade2c9072/fb6867ac08cc49298ffeec4cb020ae3d/FLAGa8f771714 [2025-02-05 16:15:11,157 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 16:15:11,158 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.6.ufo.BOUNDED-12.pals.c [2025-02-05 16:15:11,169 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ade2c9072/fb6867ac08cc49298ffeec4cb020ae3d/FLAGa8f771714 [2025-02-05 16:15:11,186 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ade2c9072/fb6867ac08cc49298ffeec4cb020ae3d [2025-02-05 16:15:11,188 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 16:15:11,189 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 16:15:11,191 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 16:15:11,192 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 16:15:11,200 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 16:15:11,201 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 04:15:11" (1/1) ... [2025-02-05 16:15:11,202 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@137ce0fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:15:11, skipping insertion in model container [2025-02-05 16:15:11,202 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 04:15:11" (1/1) ... [2025-02-05 16:15:11,229 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 16:15:11,388 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.6.ufo.BOUNDED-12.pals.c[16936,16949] [2025-02-05 16:15:11,390 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 16:15:11,399 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 16:15:11,446 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.6.ufo.BOUNDED-12.pals.c[16936,16949] [2025-02-05 16:15:11,446 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 16:15:11,457 INFO L204 MainTranslator]: Completed translation [2025-02-05 16:15:11,458 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:15:11 WrapperNode [2025-02-05 16:15:11,458 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 16:15:11,459 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 16:15:11,459 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 16:15:11,459 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 16:15:11,463 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:15:11" (1/1) ... [2025-02-05 16:15:11,473 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:15:11" (1/1) ... [2025-02-05 16:15:11,495 INFO L138 Inliner]: procedures = 25, calls = 17, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 452 [2025-02-05 16:15:11,495 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 16:15:11,498 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 16:15:11,499 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 16:15:11,499 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 16:15:11,505 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:15:11" (1/1) ... [2025-02-05 16:15:11,505 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:15:11" (1/1) ... [2025-02-05 16:15:11,511 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:15:11" (1/1) ... [2025-02-05 16:15:11,527 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-02-05 16:15:11,527 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:15:11" (1/1) ... [2025-02-05 16:15:11,527 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:15:11" (1/1) ... [2025-02-05 16:15:11,540 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:15:11" (1/1) ... [2025-02-05 16:15:11,544 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:15:11" (1/1) ... [2025-02-05 16:15:11,545 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:15:11" (1/1) ... [2025-02-05 16:15:11,546 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:15:11" (1/1) ... [2025-02-05 16:15:11,551 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 16:15:11,551 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 16:15:11,551 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 16:15:11,551 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 16:15:11,552 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:15:11" (1/1) ... [2025-02-05 16:15:11,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 16:15:11,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:15:11,578 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 16:15:11,583 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 16:15:11,598 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 16:15:11,599 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 16:15:11,599 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 16:15:11,599 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 16:15:11,666 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 16:15:11,667 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 16:15:12,081 INFO L? ?]: Removed 51 outVars from TransFormulas that were not future-live. [2025-02-05 16:15:12,081 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 16:15:12,090 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 16:15:12,092 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 16:15:12,092 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 04:15:12 BoogieIcfgContainer [2025-02-05 16:15:12,092 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 16:15:12,094 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 16:15:12,094 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 16:15:12,097 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 16:15:12,097 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 04:15:11" (1/3) ... [2025-02-05 16:15:12,098 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5afafb3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 04:15:12, skipping insertion in model container [2025-02-05 16:15:12,098 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:15:11" (2/3) ... [2025-02-05 16:15:12,098 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5afafb3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 04:15:12, skipping insertion in model container [2025-02-05 16:15:12,098 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 04:15:12" (3/3) ... [2025-02-05 16:15:12,100 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.6.ufo.BOUNDED-12.pals.c [2025-02-05 16:15:12,110 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 16:15:12,113 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr-var-start-time.6.ufo.BOUNDED-12.pals.c that has 1 procedures, 120 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 16:15:12,158 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 16:15:12,166 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;@137c9565, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 16:15:12,168 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 16:15:12,171 INFO L276 IsEmpty]: Start isEmpty. Operand has 120 states, 118 states have (on average 1.7627118644067796) internal successors, (208), 119 states have internal predecessors, (208), 0 states have call successors, (0), 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-02-05 16:15:12,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-02-05 16:15:12,177 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:15:12,178 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-02-05 16:15:12,179 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:15:12,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:15:12,184 INFO L85 PathProgramCache]: Analyzing trace with hash -68466005, now seen corresponding path program 1 times [2025-02-05 16:15:12,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:15:12,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713083596] [2025-02-05 16:15:12,191 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:15:12,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:15:12,263 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-02-05 16:15:12,310 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-02-05 16:15:12,311 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:15:12,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:15:12,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:15:12,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:15:12,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713083596] [2025-02-05 16:15:12,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713083596] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:15:12,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:15:12,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 16:15:12,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645643307] [2025-02-05 16:15:12,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:15:12,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:15:12,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:15:12,575 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:15:12,575 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:15:12,577 INFO L87 Difference]: Start difference. First operand has 120 states, 118 states have (on average 1.7627118644067796) internal successors, (208), 119 states have internal predecessors, (208), 0 states have call successors, (0), 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 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-02-05 16:15:12,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:15:12,668 INFO L93 Difference]: Finished difference Result 197 states and 332 transitions. [2025-02-05 16:15:12,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:15:12,670 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-02-05 16:15:12,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:15:12,676 INFO L225 Difference]: With dead ends: 197 [2025-02-05 16:15:12,676 INFO L226 Difference]: Without dead ends: 117 [2025-02-05 16:15:12,680 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-02-05 16:15:12,683 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-02-05 16:15:12,684 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-02-05 16:15:12,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2025-02-05 16:15:12,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2025-02-05 16:15:12,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 116 states have (on average 1.396551724137931) internal successors, (162), 116 states have internal predecessors, (162), 0 states have call successors, (0), 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-02-05 16:15:12,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 162 transitions. [2025-02-05 16:15:12,715 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 162 transitions. Word has length 37 [2025-02-05 16:15:12,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:15:12,715 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 162 transitions. [2025-02-05 16:15:12,715 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-02-05 16:15:12,716 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 162 transitions. [2025-02-05 16:15:12,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-02-05 16:15:12,717 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:15:12,717 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-02-05 16:15:12,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 16:15:12,718 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:15:12,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:15:12,718 INFO L85 PathProgramCache]: Analyzing trace with hash 1574890243, now seen corresponding path program 1 times [2025-02-05 16:15:12,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:15:12,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943028252] [2025-02-05 16:15:12,718 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:15:12,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:15:12,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-02-05 16:15:12,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-02-05 16:15:12,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:15:12,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:15:12,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:15:12,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:15:12,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943028252] [2025-02-05 16:15:12,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943028252] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:15:12,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:15:12,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:15:12,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945448958] [2025-02-05 16:15:12,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:15:12,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:15:12,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:15:12,890 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:15:12,890 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:15:12,890 INFO L87 Difference]: Start difference. First operand 117 states and 162 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-02-05 16:15:12,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:15:12,927 INFO L93 Difference]: Finished difference Result 249 states and 378 transitions. [2025-02-05 16:15:12,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:15:12,928 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-02-05 16:15:12,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:15:12,929 INFO L225 Difference]: With dead ends: 249 [2025-02-05 16:15:12,929 INFO L226 Difference]: Without dead ends: 179 [2025-02-05 16:15:12,929 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-02-05 16:15:12,930 INFO L435 NwaCegarLoop]: 259 mSDtfsCounter, 103 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 371 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-02-05 16:15:12,930 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 371 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:15:12,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2025-02-05 16:15:12,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 177. [2025-02-05 16:15:12,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 176 states have (on average 1.4829545454545454) internal successors, (261), 176 states have internal predecessors, (261), 0 states have call successors, (0), 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-02-05 16:15:12,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 261 transitions. [2025-02-05 16:15:12,940 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 261 transitions. Word has length 77 [2025-02-05 16:15:12,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:15:12,941 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 261 transitions. [2025-02-05 16:15:12,941 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-02-05 16:15:12,941 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 261 transitions. [2025-02-05 16:15:12,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-02-05 16:15:12,942 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:15:12,942 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:15:12,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 16:15:12,942 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:15:12,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:15:12,943 INFO L85 PathProgramCache]: Analyzing trace with hash 1700529072, now seen corresponding path program 1 times [2025-02-05 16:15:12,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:15:12,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541330115] [2025-02-05 16:15:12,943 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:15:12,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:15:12,958 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-02-05 16:15:12,973 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-02-05 16:15:12,974 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:15:12,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:15:13,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:15:13,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:15:13,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541330115] [2025-02-05 16:15:13,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541330115] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:15:13,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:15:13,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:15:13,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396227736] [2025-02-05 16:15:13,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:15:13,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:15:13,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:15:13,056 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:15:13,056 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:15:13,056 INFO L87 Difference]: Start difference. First operand 177 states and 261 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-02-05 16:15:13,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:15:13,083 INFO L93 Difference]: Finished difference Result 421 states and 661 transitions. [2025-02-05 16:15:13,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:15:13,083 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-02-05 16:15:13,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:15:13,086 INFO L225 Difference]: With dead ends: 421 [2025-02-05 16:15:13,087 INFO L226 Difference]: Without dead ends: 291 [2025-02-05 16:15:13,088 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-02-05 16:15:13,088 INFO L435 NwaCegarLoop]: 252 mSDtfsCounter, 99 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 368 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-02-05 16:15:13,089 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 368 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:15:13,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2025-02-05 16:15:13,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 289. [2025-02-05 16:15:13,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 288 states have (on average 1.5416666666666667) internal successors, (444), 288 states have internal predecessors, (444), 0 states have call successors, (0), 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-02-05 16:15:13,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 444 transitions. [2025-02-05 16:15:13,110 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 444 transitions. Word has length 77 [2025-02-05 16:15:13,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:15:13,111 INFO L471 AbstractCegarLoop]: Abstraction has 289 states and 444 transitions. [2025-02-05 16:15:13,111 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-02-05 16:15:13,111 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 444 transitions. [2025-02-05 16:15:13,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-02-05 16:15:13,112 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:15:13,112 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-02-05 16:15:13,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 16:15:13,112 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:15:13,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:15:13,112 INFO L85 PathProgramCache]: Analyzing trace with hash 1483897565, now seen corresponding path program 1 times [2025-02-05 16:15:13,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:15:13,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9546662] [2025-02-05 16:15:13,112 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:15:13,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:15:13,130 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-02-05 16:15:13,141 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-02-05 16:15:13,142 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:15:13,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:15:13,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:15:13,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:15:13,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9546662] [2025-02-05 16:15:13,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9546662] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:15:13,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:15:13,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:15:13,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997450876] [2025-02-05 16:15:13,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:15:13,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:15:13,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:15:13,204 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:15:13,204 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:15:13,205 INFO L87 Difference]: Start difference. First operand 289 states and 444 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-02-05 16:15:13,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:15:13,229 INFO L93 Difference]: Finished difference Result 741 states and 1182 transitions. [2025-02-05 16:15:13,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:15:13,230 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-02-05 16:15:13,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:15:13,251 INFO L225 Difference]: With dead ends: 741 [2025-02-05 16:15:13,251 INFO L226 Difference]: Without dead ends: 499 [2025-02-05 16:15:13,252 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-02-05 16:15:13,252 INFO L435 NwaCegarLoop]: 245 mSDtfsCounter, 95 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 365 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-02-05 16:15:13,252 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 365 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:15:13,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2025-02-05 16:15:13,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 497. [2025-02-05 16:15:13,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 497 states, 496 states have (on average 1.5725806451612903) internal successors, (780), 496 states have internal predecessors, (780), 0 states have call successors, (0), 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-02-05 16:15:13,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 497 states and 780 transitions. [2025-02-05 16:15:13,277 INFO L78 Accepts]: Start accepts. Automaton has 497 states and 780 transitions. Word has length 77 [2025-02-05 16:15:13,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:15:13,277 INFO L471 AbstractCegarLoop]: Abstraction has 497 states and 780 transitions. [2025-02-05 16:15:13,277 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-02-05 16:15:13,278 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 780 transitions. [2025-02-05 16:15:13,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-02-05 16:15:13,279 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:15:13,279 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-02-05 16:15:13,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 16:15:13,280 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:15:13,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:15:13,281 INFO L85 PathProgramCache]: Analyzing trace with hash 1670746250, now seen corresponding path program 1 times [2025-02-05 16:15:13,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:15:13,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410003488] [2025-02-05 16:15:13,281 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:15:13,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:15:13,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-02-05 16:15:13,307 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-02-05 16:15:13,307 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:15:13,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:15:13,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:15:13,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:15:13,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410003488] [2025-02-05 16:15:13,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410003488] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:15:13,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:15:13,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:15:13,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575099081] [2025-02-05 16:15:13,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:15:13,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:15:13,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:15:13,360 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:15:13,361 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:15:13,361 INFO L87 Difference]: Start difference. First operand 497 states and 780 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-02-05 16:15:13,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:15:13,388 INFO L93 Difference]: Finished difference Result 1333 states and 2134 transitions. [2025-02-05 16:15:13,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:15:13,389 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-02-05 16:15:13,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:15:13,392 INFO L225 Difference]: With dead ends: 1333 [2025-02-05 16:15:13,394 INFO L226 Difference]: Without dead ends: 883 [2025-02-05 16:15:13,395 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-02-05 16:15:13,396 INFO L435 NwaCegarLoop]: 238 mSDtfsCounter, 91 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 362 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-02-05 16:15:13,396 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 362 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:15:13,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 883 states. [2025-02-05 16:15:13,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 883 to 881. [2025-02-05 16:15:13,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 881 states, 880 states have (on average 1.5818181818181818) internal successors, (1392), 880 states have internal predecessors, (1392), 0 states have call successors, (0), 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-02-05 16:15:13,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 881 states to 881 states and 1392 transitions. [2025-02-05 16:15:13,417 INFO L78 Accepts]: Start accepts. Automaton has 881 states and 1392 transitions. Word has length 77 [2025-02-05 16:15:13,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:15:13,417 INFO L471 AbstractCegarLoop]: Abstraction has 881 states and 1392 transitions. [2025-02-05 16:15:13,418 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-02-05 16:15:13,418 INFO L276 IsEmpty]: Start isEmpty. Operand 881 states and 1392 transitions. [2025-02-05 16:15:13,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-02-05 16:15:13,418 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:15:13,418 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-02-05 16:15:13,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 16:15:13,419 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:15:13,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:15:13,419 INFO L85 PathProgramCache]: Analyzing trace with hash 1859683511, now seen corresponding path program 1 times [2025-02-05 16:15:13,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:15:13,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330591230] [2025-02-05 16:15:13,419 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:15:13,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:15:13,437 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-02-05 16:15:13,450 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-02-05 16:15:13,451 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:15:13,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:15:13,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:15:13,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:15:13,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330591230] [2025-02-05 16:15:13,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330591230] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:15:13,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:15:13,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:15:13,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661447305] [2025-02-05 16:15:13,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:15:13,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 16:15:13,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:15:13,627 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 16:15:13,627 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-05 16:15:13,627 INFO L87 Difference]: Start difference. First operand 881 states and 1392 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-02-05 16:15:13,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:15:13,868 INFO L93 Difference]: Finished difference Result 6719 states and 10807 transitions. [2025-02-05 16:15:13,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 16:15:13,869 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-02-05 16:15:13,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:15:13,889 INFO L225 Difference]: With dead ends: 6719 [2025-02-05 16:15:13,889 INFO L226 Difference]: Without dead ends: 5885 [2025-02-05 16:15:13,891 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-02-05 16:15:13,892 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 2081 mSDsluCounter, 1322 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2081 SdHoareTripleChecker+Valid, 1480 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-02-05 16:15:13,892 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2081 Valid, 1480 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:15:13,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5885 states. [2025-02-05 16:15:13,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5885 to 1713. [2025-02-05 16:15:13,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1713 states, 1712 states have (on average 1.5794392523364487) internal successors, (2704), 1712 states have internal predecessors, (2704), 0 states have call successors, (0), 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-02-05 16:15:13,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1713 states to 1713 states and 2704 transitions. [2025-02-05 16:15:13,985 INFO L78 Accepts]: Start accepts. Automaton has 1713 states and 2704 transitions. Word has length 77 [2025-02-05 16:15:13,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:15:13,985 INFO L471 AbstractCegarLoop]: Abstraction has 1713 states and 2704 transitions. [2025-02-05 16:15:13,985 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-02-05 16:15:13,985 INFO L276 IsEmpty]: Start isEmpty. Operand 1713 states and 2704 transitions. [2025-02-05 16:15:13,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-02-05 16:15:13,986 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:15:13,986 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-02-05 16:15:13,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 16:15:13,986 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:15:13,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:15:13,987 INFO L85 PathProgramCache]: Analyzing trace with hash 1845228205, now seen corresponding path program 1 times [2025-02-05 16:15:13,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:15:13,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497005869] [2025-02-05 16:15:13,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:15:13,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:15:13,999 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-02-05 16:15:14,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-02-05 16:15:14,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:15:14,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:15:14,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:15:14,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:15:14,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497005869] [2025-02-05 16:15:14,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497005869] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:15:14,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:15:14,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:15:14,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597485217] [2025-02-05 16:15:14,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:15:14,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 16:15:14,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:15:14,330 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 16:15:14,330 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-05 16:15:14,330 INFO L87 Difference]: Start difference. First operand 1713 states and 2704 transitions. Second operand has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 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-02-05 16:15:14,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:15:14,393 INFO L93 Difference]: Finished difference Result 1811 states and 2833 transitions. [2025-02-05 16:15:14,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 16:15:14,394 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 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-02-05 16:15:14,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:15:14,400 INFO L225 Difference]: With dead ends: 1811 [2025-02-05 16:15:14,401 INFO L226 Difference]: Without dead ends: 1809 [2025-02-05 16:15:14,402 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-05 16:15:14,403 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 0 mSDsluCounter, 924 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1080 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:15:14,403 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1080 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:15:14,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1809 states. [2025-02-05 16:15:14,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1809 to 1809. [2025-02-05 16:15:14,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1809 states, 1808 states have (on average 1.5486725663716814) internal successors, (2800), 1808 states have internal predecessors, (2800), 0 states have call successors, (0), 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-02-05 16:15:14,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1809 states to 1809 states and 2800 transitions. [2025-02-05 16:15:14,466 INFO L78 Accepts]: Start accepts. Automaton has 1809 states and 2800 transitions. Word has length 78 [2025-02-05 16:15:14,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:15:14,467 INFO L471 AbstractCegarLoop]: Abstraction has 1809 states and 2800 transitions. [2025-02-05 16:15:14,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 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-02-05 16:15:14,467 INFO L276 IsEmpty]: Start isEmpty. Operand 1809 states and 2800 transitions. [2025-02-05 16:15:14,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-02-05 16:15:14,467 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:15:14,467 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-02-05 16:15:14,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 16:15:14,467 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:15:14,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:15:14,468 INFO L85 PathProgramCache]: Analyzing trace with hash 1456219063, now seen corresponding path program 1 times [2025-02-05 16:15:14,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:15:14,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999815931] [2025-02-05 16:15:14,468 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:15:14,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:15:14,480 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-02-05 16:15:14,490 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-02-05 16:15:14,490 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:15:14,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:15:14,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:15:14,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:15:14,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999815931] [2025-02-05 16:15:14,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999815931] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:15:14,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:15:14,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:15:14,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062238112] [2025-02-05 16:15:14,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:15:14,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:15:14,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:15:14,539 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:15:14,539 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:15:14,539 INFO L87 Difference]: Start difference. First operand 1809 states and 2800 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-02-05 16:15:14,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:15:14,584 INFO L93 Difference]: Finished difference Result 4399 states and 6852 transitions. [2025-02-05 16:15:14,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:15:14,585 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-02-05 16:15:14,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:15:14,592 INFO L225 Difference]: With dead ends: 4399 [2025-02-05 16:15:14,592 INFO L226 Difference]: Without dead ends: 2637 [2025-02-05 16:15:14,595 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-02-05 16:15:14,595 INFO L435 NwaCegarLoop]: 190 mSDtfsCounter, 76 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:15:14,595 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 302 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:15:14,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2637 states. [2025-02-05 16:15:14,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2637 to 2635. [2025-02-05 16:15:14,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2635 states, 2634 states have (on average 1.5497342444950646) internal successors, (4082), 2634 states have internal predecessors, (4082), 0 states have call successors, (0), 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-02-05 16:15:14,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2635 states to 2635 states and 4082 transitions. [2025-02-05 16:15:14,653 INFO L78 Accepts]: Start accepts. Automaton has 2635 states and 4082 transitions. Word has length 79 [2025-02-05 16:15:14,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:15:14,653 INFO L471 AbstractCegarLoop]: Abstraction has 2635 states and 4082 transitions. [2025-02-05 16:15:14,653 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-02-05 16:15:14,654 INFO L276 IsEmpty]: Start isEmpty. Operand 2635 states and 4082 transitions. [2025-02-05 16:15:14,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-02-05 16:15:14,655 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:15:14,655 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-02-05 16:15:14,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 16:15:14,655 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:15:14,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:15:14,656 INFO L85 PathProgramCache]: Analyzing trace with hash -1066381702, now seen corresponding path program 1 times [2025-02-05 16:15:14,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:15:14,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882019071] [2025-02-05 16:15:14,656 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:15:14,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:15:14,671 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-02-05 16:15:14,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-02-05 16:15:14,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:15:14,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:15:14,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:15:14,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:15:14,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882019071] [2025-02-05 16:15:14,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882019071] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:15:14,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:15:14,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:15:14,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542366520] [2025-02-05 16:15:14,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:15:14,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:15:14,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:15:14,715 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:15:14,715 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:15:14,716 INFO L87 Difference]: Start difference. First operand 2635 states and 4082 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-02-05 16:15:14,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:15:14,781 INFO L93 Difference]: Finished difference Result 7423 states and 11476 transitions. [2025-02-05 16:15:14,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:15:14,782 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-02-05 16:15:14,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:15:14,797 INFO L225 Difference]: With dead ends: 7423 [2025-02-05 16:15:14,797 INFO L226 Difference]: Without dead ends: 4837 [2025-02-05 16:15:14,801 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-02-05 16:15:14,801 INFO L435 NwaCegarLoop]: 214 mSDtfsCounter, 83 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 346 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-02-05 16:15:14,802 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 346 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:15:14,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4837 states. [2025-02-05 16:15:14,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4837 to 4835. [2025-02-05 16:15:14,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4835 states, 4834 states have (on average 1.5295821266032272) internal successors, (7394), 4834 states have internal predecessors, (7394), 0 states have call successors, (0), 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-02-05 16:15:14,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4835 states to 4835 states and 7394 transitions. [2025-02-05 16:15:14,922 INFO L78 Accepts]: Start accepts. Automaton has 4835 states and 7394 transitions. Word has length 80 [2025-02-05 16:15:14,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:15:14,922 INFO L471 AbstractCegarLoop]: Abstraction has 4835 states and 7394 transitions. [2025-02-05 16:15:14,922 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-02-05 16:15:14,922 INFO L276 IsEmpty]: Start isEmpty. Operand 4835 states and 7394 transitions. [2025-02-05 16:15:14,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-02-05 16:15:14,922 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:15:14,922 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-02-05 16:15:14,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 16:15:14,923 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:15:14,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:15:14,923 INFO L85 PathProgramCache]: Analyzing trace with hash 2069909704, now seen corresponding path program 1 times [2025-02-05 16:15:14,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:15:14,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092443571] [2025-02-05 16:15:14,923 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:15:14,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:15:14,932 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-02-05 16:15:14,939 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-02-05 16:15:14,939 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:15:14,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:15:14,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:15:14,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:15:14,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092443571] [2025-02-05 16:15:14,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092443571] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:15:14,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:15:14,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:15:14,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355018629] [2025-02-05 16:15:14,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:15:14,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:15:14,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:15:14,973 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:15:14,973 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:15:14,973 INFO L87 Difference]: Start difference. First operand 4835 states and 7394 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-02-05 16:15:15,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:15:15,079 INFO L93 Difference]: Finished difference Result 13639 states and 20740 transitions. [2025-02-05 16:15:15,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:15:15,080 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-02-05 16:15:15,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:15:15,106 INFO L225 Difference]: With dead ends: 13639 [2025-02-05 16:15:15,106 INFO L226 Difference]: Without dead ends: 8853 [2025-02-05 16:15:15,116 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-02-05 16:15:15,117 INFO L435 NwaCegarLoop]: 231 mSDtfsCounter, 87 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 359 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-02-05 16:15:15,117 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 359 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:15:15,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8853 states. [2025-02-05 16:15:15,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8853 to 8851. [2025-02-05 16:15:15,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8851 states, 8850 states have (on average 1.5025988700564972) internal successors, (13298), 8850 states have internal predecessors, (13298), 0 states have call successors, (0), 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-02-05 16:15:15,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8851 states to 8851 states and 13298 transitions. [2025-02-05 16:15:15,331 INFO L78 Accepts]: Start accepts. Automaton has 8851 states and 13298 transitions. Word has length 80 [2025-02-05 16:15:15,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:15:15,331 INFO L471 AbstractCegarLoop]: Abstraction has 8851 states and 13298 transitions. [2025-02-05 16:15:15,331 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-02-05 16:15:15,331 INFO L276 IsEmpty]: Start isEmpty. Operand 8851 states and 13298 transitions. [2025-02-05 16:15:15,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-02-05 16:15:15,336 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:15:15,336 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] [2025-02-05 16:15:15,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 16:15:15,336 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:15:15,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:15:15,337 INFO L85 PathProgramCache]: Analyzing trace with hash 1335413349, now seen corresponding path program 1 times [2025-02-05 16:15:15,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:15:15,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652911044] [2025-02-05 16:15:15,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:15:15,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:15:15,347 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-02-05 16:15:15,366 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-02-05 16:15:15,367 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:15:15,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:15:15,436 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:15:15,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:15:15,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652911044] [2025-02-05 16:15:15,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652911044] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:15:15,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:15:15,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:15:15,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068448077] [2025-02-05 16:15:15,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:15:15,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:15:15,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:15:15,437 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:15:15,438 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:15:15,438 INFO L87 Difference]: Start difference. First operand 8851 states and 13298 transitions. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 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-02-05 16:15:15,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:15:15,555 INFO L93 Difference]: Finished difference Result 17655 states and 26548 transitions. [2025-02-05 16:15:15,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:15:15,556 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 110 [2025-02-05 16:15:15,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:15:15,572 INFO L225 Difference]: With dead ends: 17655 [2025-02-05 16:15:15,572 INFO L226 Difference]: Without dead ends: 8853 [2025-02-05 16:15:15,580 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-02-05 16:15:15,580 INFO L435 NwaCegarLoop]: 206 mSDtfsCounter, 80 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 353 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-02-05 16:15:15,580 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 353 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:15:15,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8853 states. [2025-02-05 16:15:15,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8853 to 8851. [2025-02-05 16:15:15,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8851 states, 8850 states have (on average 1.4917514124293785) internal successors, (13202), 8850 states have internal predecessors, (13202), 0 states have call successors, (0), 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-02-05 16:15:15,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8851 states to 8851 states and 13202 transitions. [2025-02-05 16:15:15,805 INFO L78 Accepts]: Start accepts. Automaton has 8851 states and 13202 transitions. Word has length 110 [2025-02-05 16:15:15,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:15:15,805 INFO L471 AbstractCegarLoop]: Abstraction has 8851 states and 13202 transitions. [2025-02-05 16:15:15,805 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 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-02-05 16:15:15,805 INFO L276 IsEmpty]: Start isEmpty. Operand 8851 states and 13202 transitions. [2025-02-05 16:15:15,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-02-05 16:15:15,810 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:15:15,810 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] [2025-02-05 16:15:15,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 16:15:15,810 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:15:15,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:15:15,811 INFO L85 PathProgramCache]: Analyzing trace with hash 1035775736, now seen corresponding path program 1 times [2025-02-05 16:15:15,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:15:15,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093112592] [2025-02-05 16:15:15,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:15:15,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:15:15,825 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-02-05 16:15:15,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-02-05 16:15:15,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:15:15,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:15:15,937 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:15:15,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:15:15,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093112592] [2025-02-05 16:15:15,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093112592] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:15:15,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:15:15,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:15:15,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559046294] [2025-02-05 16:15:15,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:15:15,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:15:15,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:15:15,938 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:15:15,938 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:15:15,938 INFO L87 Difference]: Start difference. First operand 8851 states and 13202 transitions. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 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-02-05 16:15:15,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:15:15,994 INFO L93 Difference]: Finished difference Result 13255 states and 19780 transitions. [2025-02-05 16:15:15,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:15:15,994 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 110 [2025-02-05 16:15:15,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:15:16,002 INFO L225 Difference]: With dead ends: 13255 [2025-02-05 16:15:16,002 INFO L226 Difference]: Without dead ends: 4453 [2025-02-05 16:15:16,010 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-02-05 16:15:16,010 INFO L435 NwaCegarLoop]: 197 mSDtfsCounter, 74 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 334 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-02-05 16:15:16,010 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 334 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:15:16,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4453 states. [2025-02-05 16:15:16,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4453 to 4451. [2025-02-05 16:15:16,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4451 states, 4450 states have (on average 1.4782022471910112) internal successors, (6578), 4450 states have internal predecessors, (6578), 0 states have call successors, (0), 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-02-05 16:15:16,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4451 states to 4451 states and 6578 transitions. [2025-02-05 16:15:16,135 INFO L78 Accepts]: Start accepts. Automaton has 4451 states and 6578 transitions. Word has length 110 [2025-02-05 16:15:16,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:15:16,135 INFO L471 AbstractCegarLoop]: Abstraction has 4451 states and 6578 transitions. [2025-02-05 16:15:16,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 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-02-05 16:15:16,136 INFO L276 IsEmpty]: Start isEmpty. Operand 4451 states and 6578 transitions. [2025-02-05 16:15:16,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-02-05 16:15:16,137 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:15:16,137 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] [2025-02-05 16:15:16,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 16:15:16,138 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:15:16,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:15:16,138 INFO L85 PathProgramCache]: Analyzing trace with hash 416797963, now seen corresponding path program 1 times [2025-02-05 16:15:16,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:15:16,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992821713] [2025-02-05 16:15:16,138 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:15:16,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:15:16,150 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-02-05 16:15:16,176 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-02-05 16:15:16,176 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:15:16,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:15:16,915 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:15:16,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:15:16,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992821713] [2025-02-05 16:15:16,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992821713] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:15:16,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1961633316] [2025-02-05 16:15:16,915 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:15:16,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:15:16,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:15:16,917 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 16:15:16,919 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 16:15:17,001 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-02-05 16:15:17,061 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-02-05 16:15:17,061 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:15:17,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:15:17,065 INFO L256 TraceCheckSpWp]: Trace formula consists of 503 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-02-05 16:15:17,069 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:15:17,676 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:15:17,676 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 16:15:18,380 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:15:18,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1961633316] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 16:15:18,381 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 16:15:18,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8, 7] total 24 [2025-02-05 16:15:18,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600696005] [2025-02-05 16:15:18,381 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 16:15:18,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-02-05 16:15:18,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:15:18,382 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-02-05 16:15:18,383 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=469, Unknown=0, NotChecked=0, Total=552 [2025-02-05 16:15:18,383 INFO L87 Difference]: Start difference. First operand 4451 states and 6578 transitions. Second operand has 24 states, 24 states have (on average 13.291666666666666) internal successors, (319), 24 states have internal predecessors, (319), 0 states have call successors, (0), 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-02-05 16:15:25,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:15:25,731 INFO L93 Difference]: Finished difference Result 35822 states and 51978 transitions. [2025-02-05 16:15:25,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 128 states. [2025-02-05 16:15:25,732 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 13.291666666666666) internal successors, (319), 24 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 110 [2025-02-05 16:15:25,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:15:25,781 INFO L225 Difference]: With dead ends: 35822 [2025-02-05 16:15:25,781 INFO L226 Difference]: Without dead ends: 31420 [2025-02-05 16:15:25,792 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 357 GetRequests, 209 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8202 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=3369, Invalid=18981, Unknown=0, NotChecked=0, Total=22350 [2025-02-05 16:15:25,793 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 10217 mSDsluCounter, 2070 mSDsCounter, 0 mSdLazyCounter, 1967 mSolverCounterSat, 214 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10217 SdHoareTripleChecker+Valid, 2194 SdHoareTripleChecker+Invalid, 2181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 214 IncrementalHoareTripleChecker+Valid, 1967 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-02-05 16:15:25,793 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10217 Valid, 2194 Invalid, 2181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [214 Valid, 1967 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-02-05 16:15:25,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31420 states. [2025-02-05 16:15:26,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31420 to 23742. [2025-02-05 16:15:26,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23742 states, 23741 states have (on average 1.4453898319363128) internal successors, (34315), 23741 states have internal predecessors, (34315), 0 states have call successors, (0), 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-02-05 16:15:26,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23742 states to 23742 states and 34315 transitions. [2025-02-05 16:15:26,351 INFO L78 Accepts]: Start accepts. Automaton has 23742 states and 34315 transitions. Word has length 110 [2025-02-05 16:15:26,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:15:26,351 INFO L471 AbstractCegarLoop]: Abstraction has 23742 states and 34315 transitions. [2025-02-05 16:15:26,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 13.291666666666666) internal successors, (319), 24 states have internal predecessors, (319), 0 states have call successors, (0), 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-02-05 16:15:26,351 INFO L276 IsEmpty]: Start isEmpty. Operand 23742 states and 34315 transitions. [2025-02-05 16:15:26,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-02-05 16:15:26,353 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:15:26,354 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] [2025-02-05 16:15:26,361 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-05 16:15:26,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-02-05 16:15:26,555 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:15:26,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:15:26,555 INFO L85 PathProgramCache]: Analyzing trace with hash 1661450237, now seen corresponding path program 1 times [2025-02-05 16:15:26,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:15:26,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295332620] [2025-02-05 16:15:26,556 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:15:26,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:15:26,566 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-02-05 16:15:26,579 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-02-05 16:15:26,580 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:15:26,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:15:26,717 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-05 16:15:26,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:15:26,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295332620] [2025-02-05 16:15:26,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295332620] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:15:26,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:15:26,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:15:26,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788331191] [2025-02-05 16:15:26,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:15:26,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 16:15:26,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:15:26,719 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 16:15:26,719 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-05 16:15:26,719 INFO L87 Difference]: Start difference. First operand 23742 states and 34315 transitions. Second operand has 8 states, 8 states have (on average 13.75) internal successors, (110), 8 states have internal predecessors, (110), 0 states have call successors, (0), 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-02-05 16:15:27,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:15:27,856 INFO L93 Difference]: Finished difference Result 95401 states and 138501 transitions. [2025-02-05 16:15:27,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 16:15:27,857 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.75) internal successors, (110), 8 states have internal predecessors, (110), 0 states have call successors, (0), 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-02-05 16:15:27,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:15:27,983 INFO L225 Difference]: With dead ends: 95401 [2025-02-05 16:15:27,983 INFO L226 Difference]: Without dead ends: 83455 [2025-02-05 16:15:28,001 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-02-05 16:15:28,002 INFO L435 NwaCegarLoop]: 271 mSDtfsCounter, 1440 mSDsluCounter, 1447 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1440 SdHoareTripleChecker+Valid, 1718 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:15:28,002 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1440 Valid, 1718 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:15:28,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83455 states. [2025-02-05 16:15:28,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83455 to 35379. [2025-02-05 16:15:28,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35379 states, 35378 states have (on average 1.4406693425292554) internal successors, (50968), 35378 states have internal predecessors, (50968), 0 states have call successors, (0), 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-02-05 16:15:29,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35379 states to 35379 states and 50968 transitions. [2025-02-05 16:15:29,041 INFO L78 Accepts]: Start accepts. Automaton has 35379 states and 50968 transitions. Word has length 111 [2025-02-05 16:15:29,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:15:29,041 INFO L471 AbstractCegarLoop]: Abstraction has 35379 states and 50968 transitions. [2025-02-05 16:15:29,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.75) internal successors, (110), 8 states have internal predecessors, (110), 0 states have call successors, (0), 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-02-05 16:15:29,042 INFO L276 IsEmpty]: Start isEmpty. Operand 35379 states and 50968 transitions. [2025-02-05 16:15:29,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-02-05 16:15:29,044 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:15:29,044 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] [2025-02-05 16:15:29,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 16:15:29,045 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:15:29,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:15:29,045 INFO L85 PathProgramCache]: Analyzing trace with hash -1215222951, now seen corresponding path program 1 times [2025-02-05 16:15:29,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:15:29,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050924238] [2025-02-05 16:15:29,045 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:15:29,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:15:29,054 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-02-05 16:15:29,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-02-05 16:15:29,065 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:15:29,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:15:29,190 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-05 16:15:29,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:15:29,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050924238] [2025-02-05 16:15:29,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050924238] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:15:29,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:15:29,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:15:29,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901671842] [2025-02-05 16:15:29,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:15:29,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 16:15:29,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:15:29,191 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 16:15:29,191 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-05 16:15:29,191 INFO L87 Difference]: Start difference. First operand 35379 states and 50968 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-02-05 16:15:30,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:15:30,899 INFO L93 Difference]: Finished difference Result 107038 states and 155154 transitions. [2025-02-05 16:15:30,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 16:15:30,900 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-02-05 16:15:30,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:15:31,021 INFO L225 Difference]: With dead ends: 107038 [2025-02-05 16:15:31,022 INFO L226 Difference]: Without dead ends: 95092 [2025-02-05 16:15:31,052 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-02-05 16:15:31,053 INFO L435 NwaCegarLoop]: 277 mSDtfsCounter, 1203 mSDsluCounter, 1600 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1203 SdHoareTripleChecker+Valid, 1877 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:15:31,053 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1203 Valid, 1877 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:15:31,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95092 states. [2025-02-05 16:15:32,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95092 to 46875. [2025-02-05 16:15:32,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46875 states, 46874 states have (on average 1.4377266715023254) internal successors, (67392), 46874 states have internal predecessors, (67392), 0 states have call successors, (0), 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-02-05 16:15:32,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46875 states to 46875 states and 67392 transitions. [2025-02-05 16:15:32,206 INFO L78 Accepts]: Start accepts. Automaton has 46875 states and 67392 transitions. Word has length 111 [2025-02-05 16:15:32,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:15:32,207 INFO L471 AbstractCegarLoop]: Abstraction has 46875 states and 67392 transitions. [2025-02-05 16:15:32,207 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-02-05 16:15:32,207 INFO L276 IsEmpty]: Start isEmpty. Operand 46875 states and 67392 transitions. [2025-02-05 16:15:32,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-02-05 16:15:32,210 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:15:32,210 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] [2025-02-05 16:15:32,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 16:15:32,210 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:15:32,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:15:32,210 INFO L85 PathProgramCache]: Analyzing trace with hash -1320979176, now seen corresponding path program 1 times [2025-02-05 16:15:32,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:15:32,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349442713] [2025-02-05 16:15:32,211 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:15:32,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:15:32,221 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-02-05 16:15:32,229 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-02-05 16:15:32,230 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:15:32,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:15:32,264 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:15:32,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:15:32,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349442713] [2025-02-05 16:15:32,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349442713] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:15:32,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:15:32,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:15:32,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814967973] [2025-02-05 16:15:32,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:15:32,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:15:32,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:15:32,266 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:15:32,266 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:15:32,266 INFO L87 Difference]: Start difference. First operand 46875 states and 67392 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-02-05 16:15:33,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:15:33,363 INFO L93 Difference]: Finished difference Result 127376 states and 182717 transitions. [2025-02-05 16:15:33,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:15:33,364 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-02-05 16:15:33,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:15:33,575 INFO L225 Difference]: With dead ends: 127376 [2025-02-05 16:15:33,576 INFO L226 Difference]: Without dead ends: 81130 [2025-02-05 16:15:33,601 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-02-05 16:15:33,603 INFO L435 NwaCegarLoop]: 163 mSDtfsCounter, 79 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:15:33,603 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 314 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:15:33,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81130 states. [2025-02-05 16:15:35,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81130 to 81128. [2025-02-05 16:15:35,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81128 states, 81127 states have (on average 1.4231143762249312) internal successors, (115453), 81127 states have internal predecessors, (115453), 0 states have call successors, (0), 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-02-05 16:15:35,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81128 states to 81128 states and 115453 transitions. [2025-02-05 16:15:35,494 INFO L78 Accepts]: Start accepts. Automaton has 81128 states and 115453 transitions. Word has length 112 [2025-02-05 16:15:35,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:15:35,494 INFO L471 AbstractCegarLoop]: Abstraction has 81128 states and 115453 transitions. [2025-02-05 16:15:35,494 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-02-05 16:15:35,494 INFO L276 IsEmpty]: Start isEmpty. Operand 81128 states and 115453 transitions. [2025-02-05 16:15:35,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-02-05 16:15:35,499 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:15:35,499 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] [2025-02-05 16:15:35,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 16:15:35,499 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:15:35,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:15:35,500 INFO L85 PathProgramCache]: Analyzing trace with hash 1716033402, now seen corresponding path program 1 times [2025-02-05 16:15:35,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:15:35,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733993234] [2025-02-05 16:15:35,500 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:15:35,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:15:35,512 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-02-05 16:15:35,522 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-02-05 16:15:35,523 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:15:35,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:15:35,567 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:15:35,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:15:35,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733993234] [2025-02-05 16:15:35,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733993234] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:15:35,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:15:35,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:15:35,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157549496] [2025-02-05 16:15:35,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:15:35,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:15:35,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:15:35,568 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:15:35,568 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:15:35,568 INFO L87 Difference]: Start difference. First operand 81128 states and 115453 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-02-05 16:15:37,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:15:37,951 INFO L93 Difference]: Finished difference Result 216123 states and 306090 transitions. [2025-02-05 16:15:37,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:15:37,952 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-02-05 16:15:37,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:15:38,111 INFO L225 Difference]: With dead ends: 216123 [2025-02-05 16:15:38,111 INFO L226 Difference]: Without dead ends: 136657 [2025-02-05 16:15:38,155 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-02-05 16:15:38,155 INFO L435 NwaCegarLoop]: 198 mSDtfsCounter, 76 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:15:38,155 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 349 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:15:38,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136657 states. [2025-02-05 16:15:41,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136657 to 136655. [2025-02-05 16:15:41,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136655 states, 136654 states have (on average 1.3965196774335182) internal successors, (190840), 136654 states have internal predecessors, (190840), 0 states have call successors, (0), 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-02-05 16:15:41,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136655 states to 136655 states and 190840 transitions. [2025-02-05 16:15:41,739 INFO L78 Accepts]: Start accepts. Automaton has 136655 states and 190840 transitions. Word has length 112 [2025-02-05 16:15:41,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:15:41,739 INFO L471 AbstractCegarLoop]: Abstraction has 136655 states and 190840 transitions. [2025-02-05 16:15:41,739 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-02-05 16:15:41,739 INFO L276 IsEmpty]: Start isEmpty. Operand 136655 states and 190840 transitions. [2025-02-05 16:15:41,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-02-05 16:15:41,745 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:15:41,745 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] [2025-02-05 16:15:41,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 16:15:41,745 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:15:41,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:15:41,745 INFO L85 PathProgramCache]: Analyzing trace with hash -272641476, now seen corresponding path program 1 times [2025-02-05 16:15:41,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:15:41,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787334572] [2025-02-05 16:15:41,745 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:15:41,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:15:41,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-02-05 16:15:41,760 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-02-05 16:15:41,760 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:15:41,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:15:41,857 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 16:15:41,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:15:41,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787334572] [2025-02-05 16:15:41,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787334572] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:15:41,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:15:41,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:15:41,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285415953] [2025-02-05 16:15:41,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:15:41,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 16:15:41,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:15:41,859 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 16:15:41,859 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-05 16:15:41,859 INFO L87 Difference]: Start difference. First operand 136655 states and 190840 transitions. Second operand has 8 states, 8 states have (on average 13.75) internal successors, (110), 8 states have internal predecessors, (110), 0 states have call successors, (0), 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-02-05 16:15:47,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:15:47,868 INFO L93 Difference]: Finished difference Result 367663 states and 517273 transitions. [2025-02-05 16:15:47,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 16:15:47,872 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.75) internal successors, (110), 8 states have internal predecessors, (110), 0 states have call successors, (0), 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-02-05 16:15:47,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:15:48,251 INFO L225 Difference]: With dead ends: 367663 [2025-02-05 16:15:48,251 INFO L226 Difference]: Without dead ends: 321421 [2025-02-05 16:15:48,302 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-02-05 16:15:48,302 INFO L435 NwaCegarLoop]: 277 mSDtfsCounter, 1364 mSDsluCounter, 1519 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1364 SdHoareTripleChecker+Valid, 1796 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:15:48,302 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1364 Valid, 1796 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:15:48,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321421 states. [2025-02-05 16:15:53,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321421 to 181489. [2025-02-05 16:15:53,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181489 states, 181488 states have (on average 1.3948580622410298) internal successors, (253150), 181488 states have internal predecessors, (253150), 0 states have call successors, (0), 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-02-05 16:15:53,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181489 states to 181489 states and 253150 transitions. [2025-02-05 16:15:53,524 INFO L78 Accepts]: Start accepts. Automaton has 181489 states and 253150 transitions. Word has length 112 [2025-02-05 16:15:53,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:15:53,524 INFO L471 AbstractCegarLoop]: Abstraction has 181489 states and 253150 transitions. [2025-02-05 16:15:53,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.75) internal successors, (110), 8 states have internal predecessors, (110), 0 states have call successors, (0), 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-02-05 16:15:53,524 INFO L276 IsEmpty]: Start isEmpty. Operand 181489 states and 253150 transitions. [2025-02-05 16:15:53,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-02-05 16:15:53,531 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:15:53,531 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] [2025-02-05 16:15:53,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-05 16:15:53,531 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:15:53,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:15:53,532 INFO L85 PathProgramCache]: Analyzing trace with hash 312691944, now seen corresponding path program 1 times [2025-02-05 16:15:53,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:15:53,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094923532] [2025-02-05 16:15:53,532 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:15:53,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:15:53,541 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-02-05 16:15:53,552 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-02-05 16:15:53,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:15:53,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:15:53,846 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-05 16:15:53,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:15:53,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094923532] [2025-02-05 16:15:53,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094923532] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:15:53,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:15:53,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:15:53,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419846815] [2025-02-05 16:15:53,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:15:53,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 16:15:53,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:15:53,847 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 16:15:53,847 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-05 16:15:53,847 INFO L87 Difference]: Start difference. First operand 181489 states and 253150 transitions. Second operand has 8 states, 8 states have (on average 13.625) internal successors, (109), 8 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)