./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-86.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-86.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 59727828023891546cc5a25cf7f297a1b2c37fd03b88eda6114da55f7e3ce778 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 13:18:57,409 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 13:18:57,466 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 13:18:57,470 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 13:18:57,472 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 13:18:57,494 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 13:18:57,495 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 13:18:57,496 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 13:18:57,496 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 13:18:57,496 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 13:18:57,497 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 13:18:57,497 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 13:18:57,497 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 13:18:57,497 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 13:18:57,497 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 13:18:57,497 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 13:18:57,498 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 13:18:57,498 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 13:18:57,498 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 13:18:57,498 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 13:18:57,498 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 13:18:57,498 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 13:18:57,498 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 13:18:57,498 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 13:18:57,498 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 13:18:57,498 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 13:18:57,498 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 13:18:57,498 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 13:18:57,499 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 13:18:57,499 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 13:18:57,499 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 13:18:57,499 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 13:18:57,499 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 13:18:57,499 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 13:18:57,499 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 13:18:57,500 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 13:18:57,500 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 13:18:57,500 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 13:18:57,500 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 13:18:57,500 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 13:18:57,500 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 13:18:57,500 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 13:18:57,500 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 13:18:57,500 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 59727828023891546cc5a25cf7f297a1b2c37fd03b88eda6114da55f7e3ce778 [2025-03-08 13:18:57,721 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 13:18:57,729 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 13:18:57,730 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 13:18:57,732 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 13:18:57,732 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 13:18:57,733 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-86.i [2025-03-08 13:18:58,862 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39bc30cc5/2750f22fa9ad487aa9dfbf91d709890f/FLAG435da3467 [2025-03-08 13:18:59,127 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 13:18:59,128 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-86.i [2025-03-08 13:18:59,143 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39bc30cc5/2750f22fa9ad487aa9dfbf91d709890f/FLAG435da3467 [2025-03-08 13:18:59,431 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39bc30cc5/2750f22fa9ad487aa9dfbf91d709890f [2025-03-08 13:18:59,433 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 13:18:59,434 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 13:18:59,435 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 13:18:59,435 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 13:18:59,438 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 13:18:59,439 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 01:18:59" (1/1) ... [2025-03-08 13:18:59,439 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41fbbab3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:18:59, skipping insertion in model container [2025-03-08 13:18:59,439 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 01:18:59" (1/1) ... [2025-03-08 13:18:59,454 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 13:18:59,557 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-86.i[919,932] [2025-03-08 13:18:59,627 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 13:18:59,644 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 13:18:59,653 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-86.i[919,932] [2025-03-08 13:18:59,690 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 13:18:59,706 INFO L204 MainTranslator]: Completed translation [2025-03-08 13:18:59,706 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:18:59 WrapperNode [2025-03-08 13:18:59,707 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 13:18:59,708 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 13:18:59,708 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 13:18:59,708 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 13:18:59,713 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:18:59" (1/1) ... [2025-03-08 13:18:59,725 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:18:59" (1/1) ... [2025-03-08 13:18:59,754 INFO L138 Inliner]: procedures = 26, calls = 40, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 233 [2025-03-08 13:18:59,755 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 13:18:59,755 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 13:18:59,755 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 13:18:59,756 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 13:18:59,761 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:18:59" (1/1) ... [2025-03-08 13:18:59,761 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:18:59" (1/1) ... [2025-03-08 13:18:59,764 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:18:59" (1/1) ... [2025-03-08 13:18:59,779 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 13:18:59,779 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:18:59" (1/1) ... [2025-03-08 13:18:59,779 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:18:59" (1/1) ... [2025-03-08 13:18:59,786 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:18:59" (1/1) ... [2025-03-08 13:18:59,787 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:18:59" (1/1) ... [2025-03-08 13:18:59,788 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:18:59" (1/1) ... [2025-03-08 13:18:59,789 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:18:59" (1/1) ... [2025-03-08 13:18:59,792 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 13:18:59,793 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 13:18:59,793 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 13:18:59,793 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 13:18:59,793 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:18:59" (1/1) ... [2025-03-08 13:18:59,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 13:18:59,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 13:18:59,823 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 13:18:59,826 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 13:18:59,843 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 13:18:59,843 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 13:18:59,843 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 13:18:59,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 13:18:59,843 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 13:18:59,843 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 13:18:59,905 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 13:18:59,907 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 13:19:00,273 INFO L? ?]: Removed 23 outVars from TransFormulas that were not future-live. [2025-03-08 13:19:00,274 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 13:19:00,286 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 13:19:00,287 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 13:19:00,287 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 01:19:00 BoogieIcfgContainer [2025-03-08 13:19:00,287 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 13:19:00,289 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 13:19:00,289 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 13:19:00,292 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 13:19:00,292 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 01:18:59" (1/3) ... [2025-03-08 13:19:00,292 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5be03986 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 01:19:00, skipping insertion in model container [2025-03-08 13:19:00,293 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:18:59" (2/3) ... [2025-03-08 13:19:00,293 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5be03986 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 01:19:00, skipping insertion in model container [2025-03-08 13:19:00,293 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 01:19:00" (3/3) ... [2025-03-08 13:19:00,294 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-co_file-86.i [2025-03-08 13:19:00,304 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 13:19:00,306 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-ps-co_file-86.i that has 2 procedures, 97 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 13:19:00,342 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 13:19:00,350 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;@4eaef00e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 13:19:00,350 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 13:19:00,353 INFO L276 IsEmpty]: Start isEmpty. Operand has 97 states, 67 states have (on average 1.4776119402985075) internal successors, (99), 68 states have internal predecessors, (99), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-03-08 13:19:00,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-03-08 13:19:00,362 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:19:00,363 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:19:00,363 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:19:00,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:19:00,367 INFO L85 PathProgramCache]: Analyzing trace with hash 352489927, now seen corresponding path program 1 times [2025-03-08 13:19:00,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 13:19:00,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359032684] [2025-03-08 13:19:00,373 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:19:00,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 13:19:00,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-03-08 13:19:00,485 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-03-08 13:19:00,488 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:19:00,488 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:19:00,682 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 1352 trivial. 0 not checked. [2025-03-08 13:19:00,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 13:19:00,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359032684] [2025-03-08 13:19:00,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359032684] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 13:19:00,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1869577076] [2025-03-08 13:19:00,683 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:19:00,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 13:19:00,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 13:19:00,685 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 13:19:00,687 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 13:19:00,757 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-03-08 13:19:00,812 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-03-08 13:19:00,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:19:00,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:19:00,815 INFO L256 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 13:19:00,820 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 13:19:00,848 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 1352 trivial. 0 not checked. [2025-03-08 13:19:00,848 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 13:19:00,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1869577076] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 13:19:00,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 13:19:00,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 13:19:00,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155518109] [2025-03-08 13:19:00,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 13:19:00,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 13:19:00,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 13:19:00,866 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 13:19:00,867 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 13:19:00,868 INFO L87 Difference]: Start difference. First operand has 97 states, 67 states have (on average 1.4776119402985075) internal successors, (99), 68 states have internal predecessors, (99), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) Second operand has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 2 states have call successors, (27) [2025-03-08 13:19:00,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:19:00,893 INFO L93 Difference]: Finished difference Result 188 states and 328 transitions. [2025-03-08 13:19:00,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 13:19:00,895 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 2 states have call successors, (27) Word has length 175 [2025-03-08 13:19:00,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:19:00,900 INFO L225 Difference]: With dead ends: 188 [2025-03-08 13:19:00,900 INFO L226 Difference]: Without dead ends: 94 [2025-03-08 13:19:00,903 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 13:19:00,904 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 13:19:00,905 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 143 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 13:19:00,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2025-03-08 13:19:00,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2025-03-08 13:19:00,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 65 states have (on average 1.4307692307692308) internal successors, (93), 65 states have internal predecessors, (93), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-03-08 13:19:00,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 147 transitions. [2025-03-08 13:19:00,933 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 147 transitions. Word has length 175 [2025-03-08 13:19:00,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:19:00,933 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 147 transitions. [2025-03-08 13:19:00,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 2 states have call successors, (27) [2025-03-08 13:19:00,933 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 147 transitions. [2025-03-08 13:19:00,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-03-08 13:19:00,936 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:19:00,936 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:19:00,943 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 13:19:01,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-08 13:19:01,137 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:19:01,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:19:01,138 INFO L85 PathProgramCache]: Analyzing trace with hash 1598856296, now seen corresponding path program 1 times [2025-03-08 13:19:01,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 13:19:01,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805513561] [2025-03-08 13:19:01,138 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:19:01,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 13:19:01,156 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-03-08 13:19:01,218 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-03-08 13:19:01,219 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:19:01,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:19:01,423 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-03-08 13:19:01,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 13:19:01,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805513561] [2025-03-08 13:19:01,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805513561] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 13:19:01,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 13:19:01,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 13:19:01,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232633440] [2025-03-08 13:19:01,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 13:19:01,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 13:19:01,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 13:19:01,424 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 13:19:01,424 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 13:19:01,425 INFO L87 Difference]: Start difference. First operand 94 states and 147 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-08 13:19:01,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:19:01,459 INFO L93 Difference]: Finished difference Result 186 states and 293 transitions. [2025-03-08 13:19:01,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 13:19:01,460 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 175 [2025-03-08 13:19:01,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:19:01,461 INFO L225 Difference]: With dead ends: 186 [2025-03-08 13:19:01,461 INFO L226 Difference]: Without dead ends: 95 [2025-03-08 13:19:01,462 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 13:19:01,463 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 0 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 13:19:01,463 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 279 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 13:19:01,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2025-03-08 13:19:01,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2025-03-08 13:19:01,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 66 states have (on average 1.4242424242424243) internal successors, (94), 66 states have internal predecessors, (94), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-03-08 13:19:01,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 148 transitions. [2025-03-08 13:19:01,477 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 148 transitions. Word has length 175 [2025-03-08 13:19:01,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:19:01,479 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 148 transitions. [2025-03-08 13:19:01,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-08 13:19:01,479 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 148 transitions. [2025-03-08 13:19:01,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-03-08 13:19:01,480 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:19:01,481 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:19:01,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 13:19:01,481 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:19:01,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:19:01,481 INFO L85 PathProgramCache]: Analyzing trace with hash 601783943, now seen corresponding path program 1 times [2025-03-08 13:19:01,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 13:19:01,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934510178] [2025-03-08 13:19:01,481 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:19:01,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 13:19:01,494 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-03-08 13:19:01,535 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-03-08 13:19:01,535 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:19:01,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:19:01,725 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-03-08 13:19:01,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 13:19:01,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934510178] [2025-03-08 13:19:01,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934510178] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 13:19:01,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 13:19:01,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 13:19:01,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225597177] [2025-03-08 13:19:01,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 13:19:01,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 13:19:01,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 13:19:01,727 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 13:19:01,727 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 13:19:01,728 INFO L87 Difference]: Start difference. First operand 95 states and 148 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-08 13:19:01,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:19:01,964 INFO L93 Difference]: Finished difference Result 280 states and 439 transitions. [2025-03-08 13:19:01,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 13:19:01,965 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 175 [2025-03-08 13:19:01,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:19:01,967 INFO L225 Difference]: With dead ends: 280 [2025-03-08 13:19:01,969 INFO L226 Difference]: Without dead ends: 188 [2025-03-08 13:19:01,970 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 13:19:01,971 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 147 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 13:19:01,972 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 462 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 13:19:01,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2025-03-08 13:19:01,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 168. [2025-03-08 13:19:01,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 111 states have (on average 1.3963963963963963) internal successors, (155), 111 states have internal predecessors, (155), 54 states have call successors, (54), 2 states have call predecessors, (54), 2 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2025-03-08 13:19:01,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 263 transitions. [2025-03-08 13:19:01,998 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 263 transitions. Word has length 175 [2025-03-08 13:19:01,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:19:01,999 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 263 transitions. [2025-03-08 13:19:01,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-08 13:19:02,000 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 263 transitions. [2025-03-08 13:19:02,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-03-08 13:19:02,002 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:19:02,003 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:19:02,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 13:19:02,003 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:19:02,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:19:02,003 INFO L85 PathProgramCache]: Analyzing trace with hash 96225318, now seen corresponding path program 1 times [2025-03-08 13:19:02,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 13:19:02,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514580497] [2025-03-08 13:19:02,004 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:19:02,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 13:19:02,014 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-03-08 13:19:02,036 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-03-08 13:19:02,036 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:19:02,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:19:02,259 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-03-08 13:19:02,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 13:19:02,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514580497] [2025-03-08 13:19:02,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514580497] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 13:19:02,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 13:19:02,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 13:19:02,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895613326] [2025-03-08 13:19:02,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 13:19:02,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 13:19:02,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 13:19:02,262 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 13:19:02,262 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 13:19:02,262 INFO L87 Difference]: Start difference. First operand 168 states and 263 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-08 13:19:02,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:19:02,307 INFO L93 Difference]: Finished difference Result 378 states and 594 transitions. [2025-03-08 13:19:02,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 13:19:02,308 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 175 [2025-03-08 13:19:02,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:19:02,311 INFO L225 Difference]: With dead ends: 378 [2025-03-08 13:19:02,313 INFO L226 Difference]: Without dead ends: 260 [2025-03-08 13:19:02,314 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 13:19:02,314 INFO L435 NwaCegarLoop]: 163 mSDtfsCounter, 100 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 13:19:02,315 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 298 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 13:19:02,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2025-03-08 13:19:02,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 258. [2025-03-08 13:19:02,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 173 states have (on average 1.4046242774566473) internal successors, (243), 173 states have internal predecessors, (243), 81 states have call successors, (81), 3 states have call predecessors, (81), 3 states have return successors, (81), 81 states have call predecessors, (81), 81 states have call successors, (81) [2025-03-08 13:19:02,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 405 transitions. [2025-03-08 13:19:02,347 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 405 transitions. Word has length 175 [2025-03-08 13:19:02,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:19:02,347 INFO L471 AbstractCegarLoop]: Abstraction has 258 states and 405 transitions. [2025-03-08 13:19:02,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-08 13:19:02,347 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 405 transitions. [2025-03-08 13:19:02,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-03-08 13:19:02,350 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:19:02,350 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:19:02,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 13:19:02,351 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:19:02,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:19:02,352 INFO L85 PathProgramCache]: Analyzing trace with hash -1941830971, now seen corresponding path program 1 times [2025-03-08 13:19:02,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 13:19:02,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128035120] [2025-03-08 13:19:02,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:19:02,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 13:19:02,361 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-03-08 13:19:02,489 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-03-08 13:19:02,489 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:19:02,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:19:11,740 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-03-08 13:19:11,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 13:19:11,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128035120] [2025-03-08 13:19:11,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128035120] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 13:19:11,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 13:19:11,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-08 13:19:11,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942345175] [2025-03-08 13:19:11,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 13:19:11,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-08 13:19:11,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 13:19:11,742 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-08 13:19:11,742 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2025-03-08 13:19:11,742 INFO L87 Difference]: Start difference. First operand 258 states and 405 transitions. Second operand has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-08 13:19:15,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:19:15,078 INFO L93 Difference]: Finished difference Result 521 states and 805 transitions. [2025-03-08 13:19:15,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 13:19:15,078 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 175 [2025-03-08 13:19:15,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:19:15,080 INFO L225 Difference]: With dead ends: 521 [2025-03-08 13:19:15,081 INFO L226 Difference]: Without dead ends: 339 [2025-03-08 13:19:15,081 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=160, Invalid=490, Unknown=0, NotChecked=0, Total=650 [2025-03-08 13:19:15,082 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 423 mSDsluCounter, 668 mSDsCounter, 0 mSdLazyCounter, 510 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 423 SdHoareTripleChecker+Valid, 788 SdHoareTripleChecker+Invalid, 624 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 510 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-08 13:19:15,082 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [423 Valid, 788 Invalid, 624 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 510 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-08 13:19:15,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2025-03-08 13:19:15,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 275. [2025-03-08 13:19:15,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 190 states have (on average 1.4) internal successors, (266), 190 states have internal predecessors, (266), 81 states have call successors, (81), 3 states have call predecessors, (81), 3 states have return successors, (81), 81 states have call predecessors, (81), 81 states have call successors, (81) [2025-03-08 13:19:15,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 428 transitions. [2025-03-08 13:19:15,109 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 428 transitions. Word has length 175 [2025-03-08 13:19:15,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:19:15,109 INFO L471 AbstractCegarLoop]: Abstraction has 275 states and 428 transitions. [2025-03-08 13:19:15,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-08 13:19:15,109 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 428 transitions. [2025-03-08 13:19:15,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-03-08 13:19:15,110 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:19:15,113 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:19:15,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 13:19:15,113 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:19:15,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:19:15,113 INFO L85 PathProgramCache]: Analyzing trace with hash 556184966, now seen corresponding path program 1 times [2025-03-08 13:19:15,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 13:19:15,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554026406] [2025-03-08 13:19:15,114 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:19:15,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 13:19:15,121 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-03-08 13:19:15,129 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-03-08 13:19:15,130 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:19:15,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:19:15,172 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-03-08 13:19:15,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 13:19:15,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554026406] [2025-03-08 13:19:15,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554026406] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 13:19:15,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 13:19:15,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 13:19:15,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540821122] [2025-03-08 13:19:15,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 13:19:15,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 13:19:15,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 13:19:15,174 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 13:19:15,174 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 13:19:15,174 INFO L87 Difference]: Start difference. First operand 275 states and 428 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-08 13:19:15,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:19:15,222 INFO L93 Difference]: Finished difference Result 549 states and 861 transitions. [2025-03-08 13:19:15,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 13:19:15,223 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 175 [2025-03-08 13:19:15,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:19:15,225 INFO L225 Difference]: With dead ends: 549 [2025-03-08 13:19:15,225 INFO L226 Difference]: Without dead ends: 367 [2025-03-08 13:19:15,226 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 13:19:15,230 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 139 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 13:19:15,230 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 286 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 13:19:15,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2025-03-08 13:19:15,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 365. [2025-03-08 13:19:15,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 252 states have (on average 1.3888888888888888) internal successors, (350), 252 states have internal predecessors, (350), 108 states have call successors, (108), 4 states have call predecessors, (108), 4 states have return successors, (108), 108 states have call predecessors, (108), 108 states have call successors, (108) [2025-03-08 13:19:15,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 566 transitions. [2025-03-08 13:19:15,259 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 566 transitions. Word has length 175 [2025-03-08 13:19:15,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:19:15,260 INFO L471 AbstractCegarLoop]: Abstraction has 365 states and 566 transitions. [2025-03-08 13:19:15,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-08 13:19:15,260 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 566 transitions. [2025-03-08 13:19:15,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-03-08 13:19:15,261 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:19:15,261 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:19:15,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 13:19:15,262 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:19:15,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:19:15,262 INFO L85 PathProgramCache]: Analyzing trace with hash 20578079, now seen corresponding path program 1 times [2025-03-08 13:19:15,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 13:19:15,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809286576] [2025-03-08 13:19:15,262 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:19:15,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 13:19:15,268 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-03-08 13:19:15,354 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-03-08 13:19:15,354 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:19:15,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:19:24,158 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-03-08 13:19:24,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 13:19:24,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809286576] [2025-03-08 13:19:24,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809286576] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 13:19:24,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 13:19:24,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-08 13:19:24,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380713217] [2025-03-08 13:19:24,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 13:19:24,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-08 13:19:24,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 13:19:24,160 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-08 13:19:24,160 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2025-03-08 13:19:24,161 INFO L87 Difference]: Start difference. First operand 365 states and 566 transitions. Second operand has 16 states, 16 states have (on average 2.75) internal successors, (44), 16 states have internal predecessors, (44), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-08 13:19:28,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:19:28,499 INFO L93 Difference]: Finished difference Result 415 states and 624 transitions. [2025-03-08 13:19:28,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-08 13:19:28,500 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.75) internal successors, (44), 16 states have internal predecessors, (44), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 176 [2025-03-08 13:19:28,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:19:28,503 INFO L225 Difference]: With dead ends: 415 [2025-03-08 13:19:28,505 INFO L226 Difference]: Without dead ends: 413 [2025-03-08 13:19:28,506 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=249, Invalid=743, Unknown=0, NotChecked=0, Total=992 [2025-03-08 13:19:28,506 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 302 mSDsluCounter, 786 mSDsCounter, 0 mSdLazyCounter, 442 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 302 SdHoareTripleChecker+Valid, 903 SdHoareTripleChecker+Invalid, 524 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 442 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-08 13:19:28,507 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [302 Valid, 903 Invalid, 524 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 442 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-08 13:19:28,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2025-03-08 13:19:28,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 366. [2025-03-08 13:19:28,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366 states, 253 states have (on average 1.3873517786561265) internal successors, (351), 253 states have internal predecessors, (351), 108 states have call successors, (108), 4 states have call predecessors, (108), 4 states have return successors, (108), 108 states have call predecessors, (108), 108 states have call successors, (108) [2025-03-08 13:19:28,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 567 transitions. [2025-03-08 13:19:28,549 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 567 transitions. Word has length 176 [2025-03-08 13:19:28,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:19:28,554 INFO L471 AbstractCegarLoop]: Abstraction has 366 states and 567 transitions. [2025-03-08 13:19:28,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.75) internal successors, (44), 16 states have internal predecessors, (44), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-08 13:19:28,554 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 567 transitions. [2025-03-08 13:19:28,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-03-08 13:19:28,555 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:19:28,555 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:19:28,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 13:19:28,555 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:19:28,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:19:28,556 INFO L85 PathProgramCache]: Analyzing trace with hash -1538212516, now seen corresponding path program 1 times [2025-03-08 13:19:28,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 13:19:28,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595438061] [2025-03-08 13:19:28,556 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:19:28,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 13:19:28,568 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-03-08 13:19:28,594 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-03-08 13:19:28,595 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:19:28,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:19:28,666 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-03-08 13:19:28,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 13:19:28,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595438061] [2025-03-08 13:19:28,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595438061] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 13:19:28,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 13:19:28,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 13:19:28,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876644183] [2025-03-08 13:19:28,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 13:19:28,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 13:19:28,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 13:19:28,669 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 13:19:28,669 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 13:19:28,669 INFO L87 Difference]: Start difference. First operand 366 states and 567 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-08 13:19:28,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:19:28,707 INFO L93 Difference]: Finished difference Result 653 states and 1013 transitions. [2025-03-08 13:19:28,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 13:19:28,711 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 176 [2025-03-08 13:19:28,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:19:28,713 INFO L225 Difference]: With dead ends: 653 [2025-03-08 13:19:28,713 INFO L226 Difference]: Without dead ends: 378 [2025-03-08 13:19:28,714 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 13:19:28,715 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 6 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 13:19:28,715 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 272 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 13:19:28,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2025-03-08 13:19:28,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 366. [2025-03-08 13:19:28,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366 states, 253 states have (on average 1.3715415019762847) internal successors, (347), 253 states have internal predecessors, (347), 108 states have call successors, (108), 4 states have call predecessors, (108), 4 states have return successors, (108), 108 states have call predecessors, (108), 108 states have call successors, (108) [2025-03-08 13:19:28,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 563 transitions. [2025-03-08 13:19:28,742 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 563 transitions. Word has length 176 [2025-03-08 13:19:28,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:19:28,743 INFO L471 AbstractCegarLoop]: Abstraction has 366 states and 563 transitions. [2025-03-08 13:19:28,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-08 13:19:28,743 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 563 transitions. [2025-03-08 13:19:28,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-03-08 13:19:28,744 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:19:28,745 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:19:28,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 13:19:28,745 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:19:28,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:19:28,746 INFO L85 PathProgramCache]: Analyzing trace with hash -650708835, now seen corresponding path program 1 times [2025-03-08 13:19:28,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 13:19:28,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565956845] [2025-03-08 13:19:28,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:19:28,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 13:19:28,759 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-03-08 13:19:28,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-03-08 13:19:28,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:19:28,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:19:36,901 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-03-08 13:19:36,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 13:19:36,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565956845] [2025-03-08 13:19:36,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565956845] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 13:19:36,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 13:19:36,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-03-08 13:19:36,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005304154] [2025-03-08 13:19:36,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 13:19:36,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-08 13:19:36,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 13:19:36,902 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-08 13:19:36,902 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2025-03-08 13:19:36,902 INFO L87 Difference]: Start difference. First operand 366 states and 563 transitions. Second operand has 17 states, 17 states have (on average 2.588235294117647) internal successors, (44), 17 states have internal predecessors, (44), 2 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2025-03-08 13:19:44,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:19:44,214 INFO L93 Difference]: Finished difference Result 416 states and 619 transitions. [2025-03-08 13:19:44,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-08 13:19:44,217 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.588235294117647) internal successors, (44), 17 states have internal predecessors, (44), 2 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) Word has length 176 [2025-03-08 13:19:44,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:19:44,220 INFO L225 Difference]: With dead ends: 416 [2025-03-08 13:19:44,220 INFO L226 Difference]: Without dead ends: 414 [2025-03-08 13:19:44,220 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=233, Invalid=759, Unknown=0, NotChecked=0, Total=992 [2025-03-08 13:19:44,225 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 282 mSDsluCounter, 969 mSDsCounter, 0 mSdLazyCounter, 760 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 1081 SdHoareTripleChecker+Invalid, 848 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 760 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-08 13:19:44,225 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [282 Valid, 1081 Invalid, 848 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 760 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-08 13:19:44,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2025-03-08 13:19:44,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 366. [2025-03-08 13:19:44,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366 states, 253 states have (on average 1.3715415019762847) internal successors, (347), 253 states have internal predecessors, (347), 108 states have call successors, (108), 4 states have call predecessors, (108), 4 states have return successors, (108), 108 states have call predecessors, (108), 108 states have call successors, (108) [2025-03-08 13:19:44,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 563 transitions. [2025-03-08 13:19:44,250 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 563 transitions. Word has length 176 [2025-03-08 13:19:44,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:19:44,251 INFO L471 AbstractCegarLoop]: Abstraction has 366 states and 563 transitions. [2025-03-08 13:19:44,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.588235294117647) internal successors, (44), 17 states have internal predecessors, (44), 2 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2025-03-08 13:19:44,251 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 563 transitions. [2025-03-08 13:19:44,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-03-08 13:19:44,253 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:19:44,253 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:19:44,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 13:19:44,253 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:19:44,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:19:44,254 INFO L85 PathProgramCache]: Analyzing trace with hash 2130203195, now seen corresponding path program 1 times [2025-03-08 13:19:44,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 13:19:44,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632688529] [2025-03-08 13:19:44,254 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:19:44,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 13:19:44,261 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-03-08 13:19:44,317 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-03-08 13:19:44,317 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:19:44,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:19:51,841 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-03-08 13:19:51,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 13:19:51,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632688529] [2025-03-08 13:19:51,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632688529] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 13:19:51,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 13:19:51,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-08 13:19:51,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511780019] [2025-03-08 13:19:51,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 13:19:51,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-08 13:19:51,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 13:19:51,842 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-08 13:19:51,842 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2025-03-08 13:19:51,842 INFO L87 Difference]: Start difference. First operand 366 states and 563 transitions. Second operand has 15 states, 15 states have (on average 2.933333333333333) internal successors, (44), 15 states have internal predecessors, (44), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-08 13:20:01,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:20:01,649 INFO L93 Difference]: Finished difference Result 436 states and 642 transitions. [2025-03-08 13:20:01,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-08 13:20:01,650 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.933333333333333) internal successors, (44), 15 states have internal predecessors, (44), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 176 [2025-03-08 13:20:01,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:20:01,652 INFO L225 Difference]: With dead ends: 436 [2025-03-08 13:20:01,652 INFO L226 Difference]: Without dead ends: 434 [2025-03-08 13:20:01,653 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=256, Invalid=674, Unknown=0, NotChecked=0, Total=930 [2025-03-08 13:20:01,653 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 371 mSDsluCounter, 684 mSDsCounter, 0 mSdLazyCounter, 630 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 371 SdHoareTripleChecker+Valid, 804 SdHoareTripleChecker+Invalid, 740 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 630 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2025-03-08 13:20:01,654 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [371 Valid, 804 Invalid, 740 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 630 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2025-03-08 13:20:01,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2025-03-08 13:20:01,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 376. [2025-03-08 13:20:01,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 376 states, 263 states have (on average 1.3688212927756653) internal successors, (360), 263 states have internal predecessors, (360), 108 states have call successors, (108), 4 states have call predecessors, (108), 4 states have return successors, (108), 108 states have call predecessors, (108), 108 states have call successors, (108) [2025-03-08 13:20:01,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 576 transitions. [2025-03-08 13:20:01,675 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 576 transitions. Word has length 176 [2025-03-08 13:20:01,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:20:01,675 INFO L471 AbstractCegarLoop]: Abstraction has 376 states and 576 transitions. [2025-03-08 13:20:01,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.933333333333333) internal successors, (44), 15 states have internal predecessors, (44), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-08 13:20:01,675 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 576 transitions. [2025-03-08 13:20:01,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-03-08 13:20:01,677 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:20:01,678 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:20:01,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 13:20:01,678 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:20:01,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:20:01,678 INFO L85 PathProgramCache]: Analyzing trace with hash 322748732, now seen corresponding path program 1 times [2025-03-08 13:20:01,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 13:20:01,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758216392] [2025-03-08 13:20:01,678 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:20:01,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 13:20:01,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-03-08 13:20:01,734 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-03-08 13:20:01,734 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:20:01,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:20:11,053 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-03-08 13:20:11,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 13:20:11,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758216392] [2025-03-08 13:20:11,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758216392] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 13:20:11,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 13:20:11,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-08 13:20:11,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890096031] [2025-03-08 13:20:11,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 13:20:11,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-08 13:20:11,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 13:20:11,054 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-08 13:20:11,054 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2025-03-08 13:20:11,054 INFO L87 Difference]: Start difference. First operand 376 states and 576 transitions. Second operand has 16 states, 16 states have (on average 2.75) internal successors, (44), 16 states have internal predecessors, (44), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-08 13:20:21,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:20:21,078 INFO L93 Difference]: Finished difference Result 430 states and 636 transitions. [2025-03-08 13:20:21,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-08 13:20:21,079 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.75) internal successors, (44), 16 states have internal predecessors, (44), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 176 [2025-03-08 13:20:21,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:20:21,081 INFO L225 Difference]: With dead ends: 430 [2025-03-08 13:20:21,081 INFO L226 Difference]: Without dead ends: 428 [2025-03-08 13:20:21,082 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 11.4s TimeCoverageRelationStatistics Valid=273, Invalid=719, Unknown=0, NotChecked=0, Total=992 [2025-03-08 13:20:21,082 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 306 mSDsluCounter, 834 mSDsCounter, 0 mSdLazyCounter, 650 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 306 SdHoareTripleChecker+Valid, 956 SdHoareTripleChecker+Invalid, 734 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 650 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-03-08 13:20:21,083 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [306 Valid, 956 Invalid, 734 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 650 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-03-08 13:20:21,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2025-03-08 13:20:21,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 376. [2025-03-08 13:20:21,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 376 states, 263 states have (on average 1.3688212927756653) internal successors, (360), 263 states have internal predecessors, (360), 108 states have call successors, (108), 4 states have call predecessors, (108), 4 states have return successors, (108), 108 states have call predecessors, (108), 108 states have call successors, (108) [2025-03-08 13:20:21,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 576 transitions. [2025-03-08 13:20:21,100 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 576 transitions. Word has length 176 [2025-03-08 13:20:21,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:20:21,100 INFO L471 AbstractCegarLoop]: Abstraction has 376 states and 576 transitions. [2025-03-08 13:20:21,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.75) internal successors, (44), 16 states have internal predecessors, (44), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-08 13:20:21,100 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 576 transitions. [2025-03-08 13:20:21,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-03-08 13:20:21,102 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:20:21,102 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:20:21,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 13:20:21,102 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:20:21,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:20:21,103 INFO L85 PathProgramCache]: Analyzing trace with hash 1652932643, now seen corresponding path program 1 times [2025-03-08 13:20:21,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 13:20:21,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605333459] [2025-03-08 13:20:21,103 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:20:21,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 13:20:21,110 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-03-08 13:20:21,142 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-03-08 13:20:21,142 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:20:21,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat