./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.4_overflow.ufo.UNBOUNDED.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.4_overflow.ufo.UNBOUNDED.pals.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 315c7f7d4f861da6991110ab8f251d6e6bbcbe86dfcb4a71343434e33094f4a7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 19:12:57,247 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 19:12:57,295 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 19:12:57,299 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 19:12:57,301 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 19:12:57,322 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 19:12:57,323 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 19:12:57,324 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 19:12:57,324 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 19:12:57,324 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 19:12:57,325 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 19:12:57,325 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 19:12:57,325 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 19:12:57,325 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 19:12:57,326 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 19:12:57,326 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 19:12:57,326 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 19:12:57,326 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 19:12:57,326 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 19:12:57,326 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 19:12:57,326 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 19:12:57,326 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 19:12:57,326 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 19:12:57,326 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 19:12:57,326 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 19:12:57,326 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 19:12:57,327 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 19:12:57,327 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 19:12:57,327 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 19:12:57,327 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 19:12:57,327 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 19:12:57,327 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 19:12:57,327 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 19:12:57,327 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 19:12:57,327 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 19:12:57,327 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 19:12:57,327 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 19:12:57,327 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 19:12:57,327 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 19:12:57,327 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 19:12:57,327 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 19:12:57,327 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 19:12:57,327 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 19:12:57,327 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 -> 315c7f7d4f861da6991110ab8f251d6e6bbcbe86dfcb4a71343434e33094f4a7 [2025-03-16 19:12:57,553 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 19:12:57,560 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 19:12:57,562 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 19:12:57,563 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 19:12:57,563 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 19:12:57,564 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.4_overflow.ufo.UNBOUNDED.pals.c [2025-03-16 19:12:58,782 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c3cfc9a6c/a485e4a0f4b04e038e61048ad53e1e02/FLAG0afb84009 [2025-03-16 19:12:59,038 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 19:12:59,038 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.4_overflow.ufo.UNBOUNDED.pals.c [2025-03-16 19:12:59,051 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c3cfc9a6c/a485e4a0f4b04e038e61048ad53e1e02/FLAG0afb84009 [2025-03-16 19:12:59,347 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c3cfc9a6c/a485e4a0f4b04e038e61048ad53e1e02 [2025-03-16 19:12:59,352 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 19:12:59,353 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 19:12:59,354 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 19:12:59,354 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 19:12:59,357 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 19:12:59,357 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 07:12:59" (1/1) ... [2025-03-16 19:12:59,359 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d770c76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:12:59, skipping insertion in model container [2025-03-16 19:12:59,359 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 07:12:59" (1/1) ... [2025-03-16 19:12:59,389 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 19:12:59,606 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.4_overflow.ufo.UNBOUNDED.pals.c[31111,31124] [2025-03-16 19:12:59,610 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 19:12:59,621 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 19:12:59,693 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.4_overflow.ufo.UNBOUNDED.pals.c[31111,31124] [2025-03-16 19:12:59,694 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 19:12:59,709 INFO L204 MainTranslator]: Completed translation [2025-03-16 19:12:59,710 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:12:59 WrapperNode [2025-03-16 19:12:59,710 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 19:12:59,711 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 19:12:59,711 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 19:12:59,711 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 19:12:59,715 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:12:59" (1/1) ... [2025-03-16 19:12:59,725 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:12:59" (1/1) ... [2025-03-16 19:12:59,754 INFO L138 Inliner]: procedures = 24, calls = 15, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 1012 [2025-03-16 19:12:59,755 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 19:12:59,755 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 19:12:59,755 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 19:12:59,755 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 19:12:59,762 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:12:59" (1/1) ... [2025-03-16 19:12:59,763 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:12:59" (1/1) ... [2025-03-16 19:12:59,766 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:12:59" (1/1) ... [2025-03-16 19:12:59,783 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-16 19:12:59,783 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:12:59" (1/1) ... [2025-03-16 19:12:59,787 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:12:59" (1/1) ... [2025-03-16 19:12:59,803 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:12:59" (1/1) ... [2025-03-16 19:12:59,808 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:12:59" (1/1) ... [2025-03-16 19:12:59,810 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:12:59" (1/1) ... [2025-03-16 19:12:59,819 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:12:59" (1/1) ... [2025-03-16 19:12:59,824 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 19:12:59,826 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 19:12:59,826 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 19:12:59,826 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 19:12:59,827 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:12:59" (1/1) ... [2025-03-16 19:12:59,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 19:12:59,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:12:59,854 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-16 19:12:59,858 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-16 19:12:59,875 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 19:12:59,875 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 19:12:59,875 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 19:12:59,875 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 19:12:59,961 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 19:12:59,962 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 19:13:00,878 INFO L? ?]: Removed 111 outVars from TransFormulas that were not future-live. [2025-03-16 19:13:00,879 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 19:13:00,898 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 19:13:00,901 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 19:13:00,901 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 07:13:00 BoogieIcfgContainer [2025-03-16 19:13:00,901 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 19:13:00,903 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 19:13:00,903 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 19:13:00,907 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 19:13:00,907 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 07:12:59" (1/3) ... [2025-03-16 19:13:00,907 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b625dc0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 07:13:00, skipping insertion in model container [2025-03-16 19:13:00,907 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:12:59" (2/3) ... [2025-03-16 19:13:00,907 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b625dc0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 07:13:00, skipping insertion in model container [2025-03-16 19:13:00,907 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 07:13:00" (3/3) ... [2025-03-16 19:13:00,908 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.4_overflow.ufo.UNBOUNDED.pals.c [2025-03-16 19:13:00,920 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 19:13:00,923 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_opt-floodmax.4_overflow.ufo.UNBOUNDED.pals.c that has 1 procedures, 295 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 19:13:00,975 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 19:13:00,984 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;@5b5a15fe, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 19:13:00,984 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 19:13:00,989 INFO L276 IsEmpty]: Start isEmpty. Operand has 295 states, 293 states have (on average 1.8430034129692834) internal successors, (540), 294 states have internal predecessors, (540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:13:01,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-16 19:13:01,001 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:13:01,001 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:13:01,002 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:13:01,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:13:01,006 INFO L85 PathProgramCache]: Analyzing trace with hash 1778291907, now seen corresponding path program 1 times [2025-03-16 19:13:01,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:13:01,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612697378] [2025-03-16 19:13:01,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:13:01,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:13:01,086 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-16 19:13:01,236 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-16 19:13:01,239 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:13:01,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:13:01,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:13:01,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:13:01,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612697378] [2025-03-16 19:13:01,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612697378] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:13:01,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:13:01,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 19:13:01,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064316165] [2025-03-16 19:13:01,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:13:01,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 19:13:01,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:13:01,424 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 19:13:01,425 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 19:13:01,428 INFO L87 Difference]: Start difference. First operand has 295 states, 293 states have (on average 1.8430034129692834) internal successors, (540), 294 states have internal predecessors, (540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 37.0) internal successors, (74), 2 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:13:01,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:13:01,452 INFO L93 Difference]: Finished difference Result 395 states and 719 transitions. [2025-03-16 19:13:01,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 19:13:01,454 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 37.0) internal successors, (74), 2 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2025-03-16 19:13:01,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:13:01,460 INFO L225 Difference]: With dead ends: 395 [2025-03-16 19:13:01,460 INFO L226 Difference]: Without dead ends: 293 [2025-03-16 19:13:01,462 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 19:13:01,463 INFO L435 NwaCegarLoop]: 536 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 536 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:13:01,464 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 536 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:13:01,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2025-03-16 19:13:01,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 293. [2025-03-16 19:13:01,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 292 states have (on average 1.8356164383561644) internal successors, (536), 292 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:13:01,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 536 transitions. [2025-03-16 19:13:01,499 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 536 transitions. Word has length 74 [2025-03-16 19:13:01,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:13:01,499 INFO L471 AbstractCegarLoop]: Abstraction has 293 states and 536 transitions. [2025-03-16 19:13:01,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 37.0) internal successors, (74), 2 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:13:01,500 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 536 transitions. [2025-03-16 19:13:01,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-16 19:13:01,501 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:13:01,502 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:13:01,502 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 19:13:01,502 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:13:01,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:13:01,502 INFO L85 PathProgramCache]: Analyzing trace with hash -1271910908, now seen corresponding path program 1 times [2025-03-16 19:13:01,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:13:01,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65863248] [2025-03-16 19:13:01,503 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:13:01,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:13:01,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-16 19:13:01,587 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-16 19:13:01,587 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:13:01,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:13:01,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:13:01,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:13:01,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65863248] [2025-03-16 19:13:01,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65863248] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:13:01,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:13:01,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:13:01,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875033766] [2025-03-16 19:13:01,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:13:01,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:13:01,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:13:01,871 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:13:01,872 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:13:01,872 INFO L87 Difference]: Start difference. First operand 293 states and 536 transitions. Second operand has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:13:01,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:13:01,967 INFO L93 Difference]: Finished difference Result 395 states and 715 transitions. [2025-03-16 19:13:01,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:13:01,967 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2025-03-16 19:13:01,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:13:01,969 INFO L225 Difference]: With dead ends: 395 [2025-03-16 19:13:01,969 INFO L226 Difference]: Without dead ends: 293 [2025-03-16 19:13:01,970 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:13:01,970 INFO L435 NwaCegarLoop]: 535 mSDtfsCounter, 0 mSDsluCounter, 1020 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1555 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:13:01,970 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1555 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:13:01,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2025-03-16 19:13:01,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 293. [2025-03-16 19:13:01,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 292 states have (on average 1.678082191780822) internal successors, (490), 292 states have internal predecessors, (490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:13:01,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 490 transitions. [2025-03-16 19:13:01,979 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 490 transitions. Word has length 74 [2025-03-16 19:13:01,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:13:01,979 INFO L471 AbstractCegarLoop]: Abstraction has 293 states and 490 transitions. [2025-03-16 19:13:01,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:13:01,980 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 490 transitions. [2025-03-16 19:13:01,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-16 19:13:01,982 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:13:01,982 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:13:01,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 19:13:01,983 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:13:01,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:13:01,983 INFO L85 PathProgramCache]: Analyzing trace with hash 136677946, now seen corresponding path program 1 times [2025-03-16 19:13:01,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:13:01,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730248572] [2025-03-16 19:13:01,983 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:13:01,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:13:02,008 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-16 19:13:02,034 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-16 19:13:02,035 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:13:02,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:13:02,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:13:02,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:13:02,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730248572] [2025-03-16 19:13:02,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730248572] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:13:02,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:13:02,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:13:02,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174928726] [2025-03-16 19:13:02,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:13:02,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:13:02,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:13:02,208 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:13:02,210 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:13:02,210 INFO L87 Difference]: Start difference. First operand 293 states and 490 transitions. Second operand has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:13:02,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:13:02,258 INFO L93 Difference]: Finished difference Result 479 states and 820 transitions. [2025-03-16 19:13:02,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:13:02,259 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 119 [2025-03-16 19:13:02,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:13:02,261 INFO L225 Difference]: With dead ends: 479 [2025-03-16 19:13:02,262 INFO L226 Difference]: Without dead ends: 380 [2025-03-16 19:13:02,263 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-16 19:13:02,264 INFO L435 NwaCegarLoop]: 489 mSDtfsCounter, 146 mSDsluCounter, 437 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 926 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:13:02,265 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 926 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:13:02,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2025-03-16 19:13:02,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 378. [2025-03-16 19:13:02,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 378 states, 377 states have (on average 1.6923076923076923) internal successors, (638), 377 states have internal predecessors, (638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:13:02,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 638 transitions. [2025-03-16 19:13:02,279 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 638 transitions. Word has length 119 [2025-03-16 19:13:02,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:13:02,280 INFO L471 AbstractCegarLoop]: Abstraction has 378 states and 638 transitions. [2025-03-16 19:13:02,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:13:02,280 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 638 transitions. [2025-03-16 19:13:02,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-16 19:13:02,283 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:13:02,283 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:13:02,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 19:13:02,283 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:13:02,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:13:02,284 INFO L85 PathProgramCache]: Analyzing trace with hash -1957242253, now seen corresponding path program 1 times [2025-03-16 19:13:02,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:13:02,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114229086] [2025-03-16 19:13:02,284 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:13:02,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:13:02,306 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-16 19:13:02,325 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-16 19:13:02,325 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:13:02,325 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:13:02,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:13:02,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:13:02,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114229086] [2025-03-16 19:13:02,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114229086] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:13:02,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:13:02,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:13:02,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332211544] [2025-03-16 19:13:02,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:13:02,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:13:02,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:13:02,428 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:13:02,428 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:13:02,428 INFO L87 Difference]: Start difference. First operand 378 states and 638 transitions. Second operand has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:13:02,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:13:02,479 INFO L93 Difference]: Finished difference Result 726 states and 1250 transitions. [2025-03-16 19:13:02,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:13:02,481 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 122 [2025-03-16 19:13:02,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:13:02,485 INFO L225 Difference]: With dead ends: 726 [2025-03-16 19:13:02,485 INFO L226 Difference]: Without dead ends: 542 [2025-03-16 19:13:02,486 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-16 19:13:02,487 INFO L435 NwaCegarLoop]: 488 mSDtfsCounter, 147 mSDsluCounter, 446 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 934 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:13:02,487 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 934 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:13:02,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2025-03-16 19:13:02,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 540. [2025-03-16 19:13:02,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 540 states, 539 states have (on average 1.712430426716141) internal successors, (923), 539 states have internal predecessors, (923), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:13:02,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 923 transitions. [2025-03-16 19:13:02,508 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 923 transitions. Word has length 122 [2025-03-16 19:13:02,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:13:02,509 INFO L471 AbstractCegarLoop]: Abstraction has 540 states and 923 transitions. [2025-03-16 19:13:02,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:13:02,510 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 923 transitions. [2025-03-16 19:13:02,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-16 19:13:02,511 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:13:02,511 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:13:02,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 19:13:02,511 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:13:02,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:13:02,513 INFO L85 PathProgramCache]: Analyzing trace with hash 2108599680, now seen corresponding path program 1 times [2025-03-16 19:13:02,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:13:02,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427653243] [2025-03-16 19:13:02,513 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:13:02,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:13:02,537 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-16 19:13:02,560 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-16 19:13:02,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:13:02,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:13:02,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:13:02,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:13:02,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427653243] [2025-03-16 19:13:02,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427653243] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:13:02,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:13:02,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:13:02,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162251912] [2025-03-16 19:13:02,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:13:02,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:13:02,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:13:02,666 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:13:02,666 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:13:02,666 INFO L87 Difference]: Start difference. First operand 540 states and 923 transitions. Second operand has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:13:02,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:13:02,702 INFO L93 Difference]: Finished difference Result 1192 states and 2069 transitions. [2025-03-16 19:13:02,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:13:02,702 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 125 [2025-03-16 19:13:02,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:13:02,706 INFO L225 Difference]: With dead ends: 1192 [2025-03-16 19:13:02,706 INFO L226 Difference]: Without dead ends: 846 [2025-03-16 19:13:02,708 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-16 19:13:02,709 INFO L435 NwaCegarLoop]: 488 mSDtfsCounter, 140 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 935 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:13:02,709 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 935 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:13:02,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 846 states. [2025-03-16 19:13:02,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 846 to 844. [2025-03-16 19:13:02,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 844 states, 843 states have (on average 1.7259786476868328) internal successors, (1455), 843 states have internal predecessors, (1455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:13:02,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 844 states to 844 states and 1455 transitions. [2025-03-16 19:13:02,736 INFO L78 Accepts]: Start accepts. Automaton has 844 states and 1455 transitions. Word has length 125 [2025-03-16 19:13:02,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:13:02,737 INFO L471 AbstractCegarLoop]: Abstraction has 844 states and 1455 transitions. [2025-03-16 19:13:02,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:13:02,737 INFO L276 IsEmpty]: Start isEmpty. Operand 844 states and 1455 transitions. [2025-03-16 19:13:02,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-03-16 19:13:02,738 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:13:02,738 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:13:02,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 19:13:02,739 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:13:02,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:13:02,739 INFO L85 PathProgramCache]: Analyzing trace with hash -1235353543, now seen corresponding path program 1 times [2025-03-16 19:13:02,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:13:02,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34395554] [2025-03-16 19:13:02,739 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:13:02,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:13:02,759 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-16 19:13:02,781 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-16 19:13:02,781 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:13:02,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:13:02,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:13:02,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:13:02,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34395554] [2025-03-16 19:13:02,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34395554] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:13:02,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:13:02,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:13:02,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398747859] [2025-03-16 19:13:02,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:13:02,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:13:02,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:13:02,885 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:13:02,885 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:13:02,885 INFO L87 Difference]: Start difference. First operand 844 states and 1455 transitions. Second operand has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:13:02,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:13:02,924 INFO L93 Difference]: Finished difference Result 2064 states and 3593 transitions. [2025-03-16 19:13:02,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:13:02,924 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 128 [2025-03-16 19:13:02,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:13:02,930 INFO L225 Difference]: With dead ends: 2064 [2025-03-16 19:13:02,930 INFO L226 Difference]: Without dead ends: 1414 [2025-03-16 19:13:02,931 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-16 19:13:02,932 INFO L435 NwaCegarLoop]: 488 mSDtfsCounter, 133 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 936 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:13:02,932 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 936 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:13:02,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1414 states. [2025-03-16 19:13:02,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1414 to 1412. [2025-03-16 19:13:02,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1412 states, 1411 states have (on average 1.7313961729270022) internal successors, (2443), 1411 states have internal predecessors, (2443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:13:02,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1412 states to 1412 states and 2443 transitions. [2025-03-16 19:13:02,970 INFO L78 Accepts]: Start accepts. Automaton has 1412 states and 2443 transitions. Word has length 128 [2025-03-16 19:13:02,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:13:02,971 INFO L471 AbstractCegarLoop]: Abstraction has 1412 states and 2443 transitions. [2025-03-16 19:13:02,971 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:13:02,971 INFO L276 IsEmpty]: Start isEmpty. Operand 1412 states and 2443 transitions. [2025-03-16 19:13:02,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-16 19:13:02,973 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:13:02,973 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:13:02,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 19:13:02,974 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:13:02,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:13:02,974 INFO L85 PathProgramCache]: Analyzing trace with hash 1460537030, now seen corresponding path program 1 times [2025-03-16 19:13:02,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:13:02,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539608780] [2025-03-16 19:13:02,974 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:13:02,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:13:02,991 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-16 19:13:03,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-16 19:13:03,012 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:13:03,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:13:03,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:13:03,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:13:03,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539608780] [2025-03-16 19:13:03,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539608780] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:13:03,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:13:03,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:13:03,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167712908] [2025-03-16 19:13:03,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:13:03,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:13:03,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:13:03,176 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:13:03,176 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:13:03,176 INFO L87 Difference]: Start difference. First operand 1412 states and 2443 transitions. Second operand has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 6 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:13:03,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:13:03,443 INFO L93 Difference]: Finished difference Result 7148 states and 12563 transitions. [2025-03-16 19:13:03,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 19:13:03,444 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 6 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 131 [2025-03-16 19:13:03,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:13:03,463 INFO L225 Difference]: With dead ends: 7148 [2025-03-16 19:13:03,464 INFO L226 Difference]: Without dead ends: 5930 [2025-03-16 19:13:03,467 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-16 19:13:03,468 INFO L435 NwaCegarLoop]: 488 mSDtfsCounter, 1367 mSDsluCounter, 3734 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1367 SdHoareTripleChecker+Valid, 4222 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:13:03,468 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1367 Valid, 4222 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:13:03,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5930 states. [2025-03-16 19:13:03,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5930 to 2545. [2025-03-16 19:13:03,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2545 states, 2544 states have (on average 1.737814465408805) internal successors, (4421), 2544 states have internal predecessors, (4421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:13:03,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2545 states to 2545 states and 4421 transitions. [2025-03-16 19:13:03,565 INFO L78 Accepts]: Start accepts. Automaton has 2545 states and 4421 transitions. Word has length 131 [2025-03-16 19:13:03,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:13:03,566 INFO L471 AbstractCegarLoop]: Abstraction has 2545 states and 4421 transitions. [2025-03-16 19:13:03,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 6 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:13:03,566 INFO L276 IsEmpty]: Start isEmpty. Operand 2545 states and 4421 transitions. [2025-03-16 19:13:03,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-16 19:13:03,568 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:13:03,568 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:13:03,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 19:13:03,568 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:13:03,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:13:03,569 INFO L85 PathProgramCache]: Analyzing trace with hash -1966292283, now seen corresponding path program 1 times [2025-03-16 19:13:03,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:13:03,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922051384] [2025-03-16 19:13:03,569 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:13:03,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:13:03,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-16 19:13:03,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-16 19:13:03,604 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:13:03,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:13:03,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:13:03,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:13:03,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922051384] [2025-03-16 19:13:03,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922051384] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:13:03,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:13:03,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:13:03,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772611224] [2025-03-16 19:13:03,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:13:03,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:13:03,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:13:03,716 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:13:03,716 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:13:03,716 INFO L87 Difference]: Start difference. First operand 2545 states and 4421 transitions. Second operand has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:13:03,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:13:03,820 INFO L93 Difference]: Finished difference Result 7390 states and 12950 transitions. [2025-03-16 19:13:03,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:13:03,821 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 132 [2025-03-16 19:13:03,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:13:03,839 INFO L225 Difference]: With dead ends: 7390 [2025-03-16 19:13:03,839 INFO L226 Difference]: Without dead ends: 5039 [2025-03-16 19:13:03,843 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:13:03,844 INFO L435 NwaCegarLoop]: 491 mSDtfsCounter, 506 mSDsluCounter, 1082 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 506 SdHoareTripleChecker+Valid, 1573 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:13:03,844 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [506 Valid, 1573 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:13:03,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5039 states. [2025-03-16 19:13:03,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5039 to 3775. [2025-03-16 19:13:03,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3775 states, 3774 states have (on average 1.741123476417594) internal successors, (6571), 3774 states have internal predecessors, (6571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:13:03,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3775 states to 3775 states and 6571 transitions. [2025-03-16 19:13:03,956 INFO L78 Accepts]: Start accepts. Automaton has 3775 states and 6571 transitions. Word has length 132 [2025-03-16 19:13:03,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:13:03,956 INFO L471 AbstractCegarLoop]: Abstraction has 3775 states and 6571 transitions. [2025-03-16 19:13:03,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:13:03,956 INFO L276 IsEmpty]: Start isEmpty. Operand 3775 states and 6571 transitions. [2025-03-16 19:13:03,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-16 19:13:03,961 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:13:03,961 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:13:03,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 19:13:03,961 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:13:03,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:13:03,963 INFO L85 PathProgramCache]: Analyzing trace with hash -267265400, now seen corresponding path program 1 times [2025-03-16 19:13:03,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:13:03,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126912002] [2025-03-16 19:13:03,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:13:03,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:13:03,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-16 19:13:03,998 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-16 19:13:03,999 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:13:03,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:13:04,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:13:04,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:13:04,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126912002] [2025-03-16 19:13:04,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126912002] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:13:04,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:13:04,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:13:04,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980418875] [2025-03-16 19:13:04,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:13:04,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:13:04,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:13:04,067 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:13:04,067 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:13:04,068 INFO L87 Difference]: Start difference. First operand 3775 states and 6571 transitions. Second operand has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:13:04,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:13:04,148 INFO L93 Difference]: Finished difference Result 8322 states and 14569 transitions. [2025-03-16 19:13:04,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:13:04,148 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 133 [2025-03-16 19:13:04,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:13:04,167 INFO L225 Difference]: With dead ends: 8322 [2025-03-16 19:13:04,167 INFO L226 Difference]: Without dead ends: 5778 [2025-03-16 19:13:04,173 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-16 19:13:04,173 INFO L435 NwaCegarLoop]: 620 mSDtfsCounter, 155 mSDsluCounter, 460 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 1080 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:13:04,174 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 1080 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:13:04,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5778 states. [2025-03-16 19:13:04,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5778 to 5776. [2025-03-16 19:13:04,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5776 states, 5775 states have (on average 1.738874458874459) internal successors, (10042), 5775 states have internal predecessors, (10042), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:13:04,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5776 states to 5776 states and 10042 transitions. [2025-03-16 19:13:04,325 INFO L78 Accepts]: Start accepts. Automaton has 5776 states and 10042 transitions. Word has length 133 [2025-03-16 19:13:04,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:13:04,325 INFO L471 AbstractCegarLoop]: Abstraction has 5776 states and 10042 transitions. [2025-03-16 19:13:04,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:13:04,326 INFO L276 IsEmpty]: Start isEmpty. Operand 5776 states and 10042 transitions. [2025-03-16 19:13:04,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-16 19:13:04,327 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:13:04,327 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:13:04,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 19:13:04,327 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:13:04,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:13:04,328 INFO L85 PathProgramCache]: Analyzing trace with hash -601571644, now seen corresponding path program 1 times [2025-03-16 19:13:04,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:13:04,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467690742] [2025-03-16 19:13:04,328 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:13:04,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:13:04,350 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-16 19:13:04,369 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-16 19:13:04,369 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:13:04,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:13:04,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:13:04,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:13:04,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467690742] [2025-03-16 19:13:04,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467690742] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:13:04,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:13:04,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:13:04,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518561981] [2025-03-16 19:13:04,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:13:04,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:13:04,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:13:04,432 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:13:04,432 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:13:04,432 INFO L87 Difference]: Start difference. First operand 5776 states and 10042 transitions. Second operand has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:13:04,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:13:04,561 INFO L93 Difference]: Finished difference Result 11214 states and 19509 transitions. [2025-03-16 19:13:04,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:13:04,561 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 133 [2025-03-16 19:13:04,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:13:04,591 INFO L225 Difference]: With dead ends: 11214 [2025-03-16 19:13:04,591 INFO L226 Difference]: Without dead ends: 8140 [2025-03-16 19:13:04,598 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-16 19:13:04,599 INFO L435 NwaCegarLoop]: 613 mSDtfsCounter, 148 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 1074 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:13:04,600 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 1074 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:13:04,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8140 states. [2025-03-16 19:13:04,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8140 to 8138. [2025-03-16 19:13:04,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8138 states, 8137 states have (on average 1.730613248125845) internal successors, (14082), 8137 states have internal predecessors, (14082), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:13:04,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8138 states to 8138 states and 14082 transitions. [2025-03-16 19:13:04,819 INFO L78 Accepts]: Start accepts. Automaton has 8138 states and 14082 transitions. Word has length 133 [2025-03-16 19:13:04,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:13:04,819 INFO L471 AbstractCegarLoop]: Abstraction has 8138 states and 14082 transitions. [2025-03-16 19:13:04,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:13:04,819 INFO L276 IsEmpty]: Start isEmpty. Operand 8138 states and 14082 transitions. [2025-03-16 19:13:04,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-16 19:13:04,821 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:13:04,821 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:13:04,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 19:13:04,821 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:13:04,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:13:04,821 INFO L85 PathProgramCache]: Analyzing trace with hash -2041059832, now seen corresponding path program 1 times [2025-03-16 19:13:04,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:13:04,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371184331] [2025-03-16 19:13:04,822 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:13:04,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:13:04,839 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-16 19:13:04,855 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-16 19:13:04,856 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:13:04,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:13:04,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:13:04,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:13:04,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371184331] [2025-03-16 19:13:04,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371184331] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:13:04,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:13:04,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:13:04,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107688296] [2025-03-16 19:13:04,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:13:04,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:13:04,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:13:04,921 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:13:04,921 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:13:04,921 INFO L87 Difference]: Start difference. First operand 8138 states and 14082 transitions. Second operand has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:13:05,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:13:05,060 INFO L93 Difference]: Finished difference Result 15768 states and 27293 transitions. [2025-03-16 19:13:05,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:13:05,060 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 133 [2025-03-16 19:13:05,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:13:05,082 INFO L225 Difference]: With dead ends: 15768 [2025-03-16 19:13:05,083 INFO L226 Difference]: Without dead ends: 11418 [2025-03-16 19:13:05,091 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-16 19:13:05,092 INFO L435 NwaCegarLoop]: 597 mSDtfsCounter, 141 mSDsluCounter, 462 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 1059 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:13:05,092 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 1059 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:13:05,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11418 states. [2025-03-16 19:13:05,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11418 to 11416. [2025-03-16 19:13:05,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11416 states, 11415 states have (on average 1.7208935611038108) internal successors, (19644), 11415 states have internal predecessors, (19644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:13:05,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11416 states to 11416 states and 19644 transitions. [2025-03-16 19:13:05,375 INFO L78 Accepts]: Start accepts. Automaton has 11416 states and 19644 transitions. Word has length 133 [2025-03-16 19:13:05,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:13:05,375 INFO L471 AbstractCegarLoop]: Abstraction has 11416 states and 19644 transitions. [2025-03-16 19:13:05,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:13:05,376 INFO L276 IsEmpty]: Start isEmpty. Operand 11416 states and 19644 transitions. [2025-03-16 19:13:05,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-16 19:13:05,376 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:13:05,376 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:13:05,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 19:13:05,377 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:13:05,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:13:05,377 INFO L85 PathProgramCache]: Analyzing trace with hash 1351394116, now seen corresponding path program 1 times [2025-03-16 19:13:05,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:13:05,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663217053] [2025-03-16 19:13:05,377 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:13:05,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:13:05,396 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-16 19:13:05,409 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-16 19:13:05,409 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:13:05,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:13:05,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:13:05,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:13:05,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663217053] [2025-03-16 19:13:05,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663217053] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:13:05,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:13:05,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:13:05,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908376472] [2025-03-16 19:13:05,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:13:05,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:13:05,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:13:05,471 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:13:05,471 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:13:05,471 INFO L87 Difference]: Start difference. First operand 11416 states and 19644 transitions. Second operand has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:13:05,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:13:05,625 INFO L93 Difference]: Finished difference Result 22074 states and 37981 transitions. [2025-03-16 19:13:05,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:13:05,625 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 133 [2025-03-16 19:13:05,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:13:05,657 INFO L225 Difference]: With dead ends: 22074 [2025-03-16 19:13:05,658 INFO L226 Difference]: Without dead ends: 15940 [2025-03-16 19:13:05,669 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-16 19:13:05,671 INFO L435 NwaCegarLoop]: 581 mSDtfsCounter, 134 mSDsluCounter, 463 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 1044 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:13:05,671 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 1044 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:13:05,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15940 states. [2025-03-16 19:13:05,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15940 to 15938. [2025-03-16 19:13:06,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15938 states, 15937 states have (on average 1.7094810817594277) internal successors, (27244), 15937 states have internal predecessors, (27244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:13:06,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15938 states to 15938 states and 27244 transitions. [2025-03-16 19:13:06,058 INFO L78 Accepts]: Start accepts. Automaton has 15938 states and 27244 transitions. Word has length 133 [2025-03-16 19:13:06,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:13:06,058 INFO L471 AbstractCegarLoop]: Abstraction has 15938 states and 27244 transitions. [2025-03-16 19:13:06,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:13:06,059 INFO L276 IsEmpty]: Start isEmpty. Operand 15938 states and 27244 transitions. [2025-03-16 19:13:06,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-16 19:13:06,059 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:13:06,060 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:13:06,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 19:13:06,060 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:13:06,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:13:06,060 INFO L85 PathProgramCache]: Analyzing trace with hash -823878168, now seen corresponding path program 1 times [2025-03-16 19:13:06,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:13:06,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051947076] [2025-03-16 19:13:06,060 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:13:06,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:13:06,075 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-16 19:13:06,090 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-16 19:13:06,090 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:13:06,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:13:06,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:13:06,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:13:06,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051947076] [2025-03-16 19:13:06,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051947076] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:13:06,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:13:06,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:13:06,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375068958] [2025-03-16 19:13:06,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:13:06,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:13:06,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:13:06,177 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:13:06,177 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:13:06,177 INFO L87 Difference]: Start difference. First operand 15938 states and 27244 transitions. Second operand has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:13:06,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:13:06,594 INFO L93 Difference]: Finished difference Result 52266 states and 89426 transitions. [2025-03-16 19:13:06,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:13:06,595 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 133 [2025-03-16 19:13:06,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:13:06,673 INFO L225 Difference]: With dead ends: 52266 [2025-03-16 19:13:06,673 INFO L226 Difference]: Without dead ends: 36554 [2025-03-16 19:13:06,705 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:13:06,706 INFO L435 NwaCegarLoop]: 479 mSDtfsCounter, 505 mSDsluCounter, 1084 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 505 SdHoareTripleChecker+Valid, 1563 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:13:06,706 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [505 Valid, 1563 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:13:06,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36554 states. [2025-03-16 19:13:07,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36554 to 26157. [2025-03-16 19:13:07,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26157 states, 26156 states have (on average 1.6997629606973543) internal successors, (44459), 26156 states have internal predecessors, (44459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:13:07,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26157 states to 26157 states and 44459 transitions. [2025-03-16 19:13:07,430 INFO L78 Accepts]: Start accepts. Automaton has 26157 states and 44459 transitions. Word has length 133 [2025-03-16 19:13:07,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:13:07,430 INFO L471 AbstractCegarLoop]: Abstraction has 26157 states and 44459 transitions. [2025-03-16 19:13:07,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:13:07,430 INFO L276 IsEmpty]: Start isEmpty. Operand 26157 states and 44459 transitions. [2025-03-16 19:13:07,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-16 19:13:07,431 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:13:07,431 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:13:07,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 19:13:07,431 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:13:07,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:13:07,432 INFO L85 PathProgramCache]: Analyzing trace with hash 231161447, now seen corresponding path program 1 times [2025-03-16 19:13:07,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:13:07,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355410832] [2025-03-16 19:13:07,432 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:13:07,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:13:07,452 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-16 19:13:07,471 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-16 19:13:07,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:13:07,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:13:07,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:13:07,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:13:07,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355410832] [2025-03-16 19:13:07,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355410832] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:13:07,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:13:07,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:13:07,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628360824] [2025-03-16 19:13:07,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:13:07,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:13:07,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:13:07,599 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:13:07,599 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:13:07,599 INFO L87 Difference]: Start difference. First operand 26157 states and 44459 transitions. Second operand has 4 states, 4 states have (on average 33.5) internal successors, (134), 4 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:13:08,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:13:08,216 INFO L93 Difference]: Finished difference Result 85492 states and 145420 transitions. [2025-03-16 19:13:08,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:13:08,217 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.5) internal successors, (134), 4 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 134 [2025-03-16 19:13:08,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:13:08,345 INFO L225 Difference]: With dead ends: 85492 [2025-03-16 19:13:08,346 INFO L226 Difference]: Without dead ends: 59561 [2025-03-16 19:13:08,394 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:13:08,395 INFO L435 NwaCegarLoop]: 479 mSDtfsCounter, 503 mSDsluCounter, 1086 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 503 SdHoareTripleChecker+Valid, 1565 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:13:08,395 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [503 Valid, 1565 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:13:08,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59561 states. [2025-03-16 19:13:09,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59561 to 42716. [2025-03-16 19:13:09,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42716 states, 42715 states have (on average 1.6899449841975887) internal successors, (72186), 42715 states have internal predecessors, (72186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:13:09,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42716 states to 42716 states and 72186 transitions. [2025-03-16 19:13:09,251 INFO L78 Accepts]: Start accepts. Automaton has 42716 states and 72186 transitions. Word has length 134 [2025-03-16 19:13:09,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:13:09,251 INFO L471 AbstractCegarLoop]: Abstraction has 42716 states and 72186 transitions. [2025-03-16 19:13:09,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.5) internal successors, (134), 4 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:13:09,252 INFO L276 IsEmpty]: Start isEmpty. Operand 42716 states and 72186 transitions. [2025-03-16 19:13:09,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-16 19:13:09,252 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:13:09,253 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:13:09,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 19:13:09,253 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:13:09,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:13:09,253 INFO L85 PathProgramCache]: Analyzing trace with hash -1422408438, now seen corresponding path program 1 times [2025-03-16 19:13:09,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:13:09,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869026603] [2025-03-16 19:13:09,254 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:13:09,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:13:09,269 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-16 19:13:09,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-16 19:13:09,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:13:09,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:13:09,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:13:09,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:13:09,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869026603] [2025-03-16 19:13:09,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869026603] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:13:09,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:13:09,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:13:09,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51028935] [2025-03-16 19:13:09,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:13:09,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:13:09,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:13:09,477 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:13:09,477 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:13:09,477 INFO L87 Difference]: Start difference. First operand 42716 states and 72186 transitions. Second operand has 4 states, 4 states have (on average 33.75) internal successors, (135), 4 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:13:10,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:13:10,403 INFO L93 Difference]: Finished difference Result 138054 states and 233478 transitions. [2025-03-16 19:13:10,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:13:10,404 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.75) internal successors, (135), 4 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 135 [2025-03-16 19:13:10,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:13:10,657 INFO L225 Difference]: With dead ends: 138054 [2025-03-16 19:13:10,657 INFO L226 Difference]: Without dead ends: 95564 [2025-03-16 19:13:10,704 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:13:10,705 INFO L435 NwaCegarLoop]: 479 mSDtfsCounter, 501 mSDsluCounter, 1088 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 501 SdHoareTripleChecker+Valid, 1567 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:13:10,705 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [501 Valid, 1567 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:13:10,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95564 states. [2025-03-16 19:13:12,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95564 to 68915. [2025-03-16 19:13:12,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68915 states, 68914 states have (on average 1.680427779551325) internal successors, (115805), 68914 states have internal predecessors, (115805), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:13:12,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68915 states to 68915 states and 115805 transitions. [2025-03-16 19:13:12,395 INFO L78 Accepts]: Start accepts. Automaton has 68915 states and 115805 transitions. Word has length 135 [2025-03-16 19:13:12,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:13:12,395 INFO L471 AbstractCegarLoop]: Abstraction has 68915 states and 115805 transitions. [2025-03-16 19:13:12,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.75) internal successors, (135), 4 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:13:12,396 INFO L276 IsEmpty]: Start isEmpty. Operand 68915 states and 115805 transitions. [2025-03-16 19:13:12,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-03-16 19:13:12,397 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:13:12,397 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:13:12,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 19:13:12,397 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:13:12,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:13:12,397 INFO L85 PathProgramCache]: Analyzing trace with hash -1088193492, now seen corresponding path program 1 times [2025-03-16 19:13:12,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:13:12,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207546720] [2025-03-16 19:13:12,398 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:13:12,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:13:12,411 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-16 19:13:12,427 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-16 19:13:12,427 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:13:12,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:13:12,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:13:12,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:13:12,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207546720] [2025-03-16 19:13:12,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207546720] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:13:12,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:13:12,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:13:12,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060373176] [2025-03-16 19:13:12,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:13:12,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:13:12,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:13:12,681 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:13:12,681 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:13:12,681 INFO L87 Difference]: Start difference. First operand 68915 states and 115805 transitions. Second operand has 6 states, 6 states have (on average 22.833333333333332) internal successors, (137), 6 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:13:13,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:13:13,658 INFO L93 Difference]: Finished difference Result 137606 states and 231247 transitions. [2025-03-16 19:13:13,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 19:13:13,659 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.833333333333332) internal successors, (137), 6 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 137 [2025-03-16 19:13:13,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:13:13,762 INFO L225 Difference]: With dead ends: 137606 [2025-03-16 19:13:13,763 INFO L226 Difference]: Without dead ends: 68917 [2025-03-16 19:13:13,806 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:13:13,807 INFO L435 NwaCegarLoop]: 484 mSDtfsCounter, 539 mSDsluCounter, 1356 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 539 SdHoareTripleChecker+Valid, 1840 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:13:13,807 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [539 Valid, 1840 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:13:13,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68917 states. [2025-03-16 19:13:14,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68917 to 68915. [2025-03-16 19:13:14,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68915 states, 68914 states have (on average 1.671358504803088) internal successors, (115180), 68914 states have internal predecessors, (115180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:13:14,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68915 states to 68915 states and 115180 transitions. [2025-03-16 19:13:14,984 INFO L78 Accepts]: Start accepts. Automaton has 68915 states and 115180 transitions. Word has length 137 [2025-03-16 19:13:14,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:13:14,984 INFO L471 AbstractCegarLoop]: Abstraction has 68915 states and 115180 transitions. [2025-03-16 19:13:14,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.833333333333332) internal successors, (137), 6 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:13:14,984 INFO L276 IsEmpty]: Start isEmpty. Operand 68915 states and 115180 transitions. [2025-03-16 19:13:14,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-03-16 19:13:14,985 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:13:14,986 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:13:14,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-16 19:13:14,986 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:13:14,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:13:14,986 INFO L85 PathProgramCache]: Analyzing trace with hash 1341481198, now seen corresponding path program 1 times [2025-03-16 19:13:14,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:13:14,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449160855] [2025-03-16 19:13:14,986 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:13:14,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:13:15,007 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-16 19:13:15,032 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-16 19:13:15,032 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:13:15,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:13:15,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:13:15,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:13:15,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449160855] [2025-03-16 19:13:15,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449160855] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:13:15,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:13:15,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:13:15,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074146393] [2025-03-16 19:13:15,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:13:15,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:13:15,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:13:15,411 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:13:15,411 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:13:15,411 INFO L87 Difference]: Start difference. First operand 68915 states and 115180 transitions. Second operand has 6 states, 6 states have (on average 23.333333333333332) internal successors, (140), 6 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:13:16,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:13:16,399 INFO L93 Difference]: Finished difference Result 201524 states and 337235 transitions. [2025-03-16 19:13:16,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 19:13:16,400 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 23.333333333333332) internal successors, (140), 6 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 140 [2025-03-16 19:13:16,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:13:16,625 INFO L225 Difference]: With dead ends: 201524 [2025-03-16 19:13:16,625 INFO L226 Difference]: Without dead ends: 132835 [2025-03-16 19:13:16,691 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:13:16,692 INFO L435 NwaCegarLoop]: 477 mSDtfsCounter, 399 mSDsluCounter, 1374 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 399 SdHoareTripleChecker+Valid, 1851 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:13:16,692 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [399 Valid, 1851 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:13:16,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132835 states. [2025-03-16 19:13:18,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132835 to 132833. [2025-03-16 19:13:19,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132833 states, 132832 states have (on average 1.6592462659600096) internal successors, (220401), 132832 states have internal predecessors, (220401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:13:19,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132833 states to 132833 states and 220401 transitions. [2025-03-16 19:13:19,400 INFO L78 Accepts]: Start accepts. Automaton has 132833 states and 220401 transitions. Word has length 140 [2025-03-16 19:13:19,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:13:19,401 INFO L471 AbstractCegarLoop]: Abstraction has 132833 states and 220401 transitions. [2025-03-16 19:13:19,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.333333333333332) internal successors, (140), 6 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:13:19,401 INFO L276 IsEmpty]: Start isEmpty. Operand 132833 states and 220401 transitions. [2025-03-16 19:13:19,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-16 19:13:19,402 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:13:19,402 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:13:19,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-16 19:13:19,402 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:13:19,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:13:19,402 INFO L85 PathProgramCache]: Analyzing trace with hash -1362711181, now seen corresponding path program 1 times [2025-03-16 19:13:19,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:13:19,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727606318] [2025-03-16 19:13:19,402 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:13:19,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:13:19,414 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-16 19:13:19,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-16 19:13:19,469 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:13:19,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:13:19,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:13:19,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:13:19,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727606318] [2025-03-16 19:13:19,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727606318] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:13:19,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:13:19,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:13:19,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290693373] [2025-03-16 19:13:19,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:13:19,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:13:19,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:13:19,698 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:13:19,698 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:13:19,698 INFO L87 Difference]: Start difference. First operand 132833 states and 220401 transitions. Second operand has 4 states, 4 states have (on average 35.25) internal successors, (141), 4 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:13:20,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:13:20,456 INFO L93 Difference]: Finished difference Result 136707 states and 226210 transitions. [2025-03-16 19:13:20,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:13:20,457 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 35.25) internal successors, (141), 4 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 141 [2025-03-16 19:13:20,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:13:20,639 INFO L225 Difference]: With dead ends: 136707 [2025-03-16 19:13:20,639 INFO L226 Difference]: Without dead ends: 136705 [2025-03-16 19:13:20,807 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:13:20,808 INFO L435 NwaCegarLoop]: 488 mSDtfsCounter, 0 mSDsluCounter, 962 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1450 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:13:20,808 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1450 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:13:20,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136705 states. [2025-03-16 19:13:22,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136705 to 136705. [2025-03-16 19:13:22,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136705 states, 136704 states have (on average 1.6403762874531835) internal successors, (224246), 136704 states have internal predecessors, (224246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:13:23,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136705 states to 136705 states and 224246 transitions. [2025-03-16 19:13:23,090 INFO L78 Accepts]: Start accepts. Automaton has 136705 states and 224246 transitions. Word has length 141 [2025-03-16 19:13:23,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:13:23,090 INFO L471 AbstractCegarLoop]: Abstraction has 136705 states and 224246 transitions. [2025-03-16 19:13:23,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.25) internal successors, (141), 4 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:13:23,090 INFO L276 IsEmpty]: Start isEmpty. Operand 136705 states and 224246 transitions. [2025-03-16 19:13:23,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-03-16 19:13:23,094 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:13:23,094 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:13:23,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-16 19:13:23,095 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:13:23,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:13:23,095 INFO L85 PathProgramCache]: Analyzing trace with hash 2123878017, now seen corresponding path program 1 times [2025-03-16 19:13:23,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:13:23,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448683013] [2025-03-16 19:13:23,095 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:13:23,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:13:23,106 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-03-16 19:13:23,118 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-03-16 19:13:23,119 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:13:23,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:13:23,420 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-16 19:13:23,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:13:23,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448683013] [2025-03-16 19:13:23,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448683013] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:13:23,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:13:23,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:13:23,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367092128] [2025-03-16 19:13:23,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:13:23,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:13:23,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:13:23,422 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:13:23,422 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:13:23,423 INFO L87 Difference]: Start difference. First operand 136705 states and 224246 transitions. Second operand has 6 states, 6 states have (on average 29.166666666666668) internal successors, (175), 6 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:13:26,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:13:26,094 INFO L93 Difference]: Finished difference Result 376857 states and 619879 transitions. [2025-03-16 19:13:26,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 19:13:26,094 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 29.166666666666668) internal successors, (175), 6 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 176 [2025-03-16 19:13:26,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:13:26,692 INFO L225 Difference]: With dead ends: 376857 [2025-03-16 19:13:26,692 INFO L226 Difference]: Without dead ends: 315055 [2025-03-16 19:13:26,790 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-16 19:13:26,791 INFO L435 NwaCegarLoop]: 649 mSDtfsCounter, 1023 mSDsluCounter, 1981 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1023 SdHoareTripleChecker+Valid, 2630 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:13:26,791 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1023 Valid, 2630 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:13:27,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315055 states. [2025-03-16 19:13:30,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315055 to 220719. [2025-03-16 19:13:30,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220719 states, 220718 states have (on average 1.6371025471416014) internal successors, (361338), 220718 states have internal predecessors, (361338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:13:31,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220719 states to 220719 states and 361338 transitions. [2025-03-16 19:13:31,408 INFO L78 Accepts]: Start accepts. Automaton has 220719 states and 361338 transitions. Word has length 176 [2025-03-16 19:13:31,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:13:31,410 INFO L471 AbstractCegarLoop]: Abstraction has 220719 states and 361338 transitions. [2025-03-16 19:13:31,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 29.166666666666668) internal successors, (175), 6 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:13:31,410 INFO L276 IsEmpty]: Start isEmpty. Operand 220719 states and 361338 transitions. [2025-03-16 19:13:31,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-03-16 19:13:31,414 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:13:31,415 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:13:31,415 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-16 19:13:31,415 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:13:31,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:13:31,416 INFO L85 PathProgramCache]: Analyzing trace with hash 1789571773, now seen corresponding path program 1 times [2025-03-16 19:13:31,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:13:31,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283088501] [2025-03-16 19:13:31,416 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:13:31,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:13:31,431 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-03-16 19:13:31,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-03-16 19:13:31,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:13:31,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:13:31,849 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-16 19:13:31,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:13:31,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283088501] [2025-03-16 19:13:31,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283088501] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:13:31,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:13:31,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:13:31,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595432810] [2025-03-16 19:13:31,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:13:31,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:13:31,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:13:31,851 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:13:31,851 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:13:31,851 INFO L87 Difference]: Start difference. First operand 220719 states and 361338 transitions. Second operand has 6 states, 6 states have (on average 28.0) internal successors, (168), 6 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:13:34,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:13:34,865 INFO L93 Difference]: Finished difference Result 424331 states and 697987 transitions. [2025-03-16 19:13:34,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 19:13:34,865 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 6 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 176 [2025-03-16 19:13:34,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:13:35,570 INFO L225 Difference]: With dead ends: 424331 [2025-03-16 19:13:35,570 INFO L226 Difference]: Without dead ends: 363679 [2025-03-16 19:13:35,701 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-16 19:13:35,702 INFO L435 NwaCegarLoop]: 653 mSDtfsCounter, 1019 mSDsluCounter, 1936 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1019 SdHoareTripleChecker+Valid, 2589 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:13:35,702 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1019 Valid, 2589 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:13:35,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363679 states.