./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_floodmax.4.2.ufo.UNBOUNDED.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded/pals_floodmax.4.2.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 2e33738ed6ea5e50e5f6c45ef52d667e94a1539d08a631ee5964d7b99a8f5c91 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 14:47:47,633 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 14:47:47,696 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 14:47:47,702 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 14:47:47,704 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 14:47:47,726 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 14:47:47,726 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 14:47:47,727 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 14:47:47,727 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 14:47:47,727 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 14:47:47,727 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 14:47:47,727 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 14:47:47,727 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 14:47:47,727 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 14:47:47,727 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 14:47:47,728 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 14:47:47,728 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 14:47:47,728 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 14:47:47,728 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 14:47:47,728 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 14:47:47,728 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 14:47:47,728 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 14:47:47,728 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 14:47:47,728 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 14:47:47,728 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 14:47:47,729 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 14:47:47,729 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 14:47:47,729 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 14:47:47,729 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 14:47:47,729 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 14:47:47,729 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 14:47:47,729 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 14:47:47,729 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:47:47,729 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 14:47:47,730 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 14:47:47,730 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 14:47:47,730 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 14:47:47,730 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 14:47:47,730 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 14:47:47,730 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 14:47:47,730 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 14:47:47,730 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 14:47:47,730 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 14:47:47,730 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 -> 2e33738ed6ea5e50e5f6c45ef52d667e94a1539d08a631ee5964d7b99a8f5c91 [2025-03-03 14:47:47,949 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 14:47:47,960 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 14:47:47,962 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 14:47:47,963 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 14:47:47,963 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 14:47:47,965 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_floodmax.4.2.ufo.UNBOUNDED.pals.c [2025-03-03 14:47:49,149 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/000521f1b/d1fd9acfe6c243db882bbafdac9c5d5f/FLAG81b3d688d [2025-03-03 14:47:49,411 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 14:47:49,412 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_floodmax.4.2.ufo.UNBOUNDED.pals.c [2025-03-03 14:47:49,420 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/000521f1b/d1fd9acfe6c243db882bbafdac9c5d5f/FLAG81b3d688d [2025-03-03 14:47:49,716 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/000521f1b/d1fd9acfe6c243db882bbafdac9c5d5f [2025-03-03 14:47:49,718 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 14:47:49,719 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 14:47:49,720 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 14:47:49,720 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 14:47:49,722 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 14:47:49,723 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:47:49" (1/1) ... [2025-03-03 14:47:49,724 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@319a484b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:47:49, skipping insertion in model container [2025-03-03 14:47:49,725 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:47:49" (1/1) ... [2025-03-03 14:47:49,748 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 14:47:49,946 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_floodmax.4.2.ufo.UNBOUNDED.pals.c[28368,28381] [2025-03-03 14:47:49,949 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:47:49,958 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 14:47:50,024 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_floodmax.4.2.ufo.UNBOUNDED.pals.c[28368,28381] [2025-03-03 14:47:50,025 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:47:50,036 INFO L204 MainTranslator]: Completed translation [2025-03-03 14:47:50,037 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:47:50 WrapperNode [2025-03-03 14:47:50,037 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 14:47:50,038 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 14:47:50,038 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 14:47:50,038 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 14:47:50,042 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:47:50" (1/1) ... [2025-03-03 14:47:50,050 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:47:50" (1/1) ... [2025-03-03 14:47:50,085 INFO L138 Inliner]: procedures = 24, calls = 15, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 956 [2025-03-03 14:47:50,086 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 14:47:50,086 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 14:47:50,086 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 14:47:50,086 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 14:47:50,093 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:47:50" (1/1) ... [2025-03-03 14:47:50,093 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:47:50" (1/1) ... [2025-03-03 14:47:50,098 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:47:50" (1/1) ... [2025-03-03 14:47:50,116 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 14:47:50,116 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:47:50" (1/1) ... [2025-03-03 14:47:50,116 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:47:50" (1/1) ... [2025-03-03 14:47:50,126 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:47:50" (1/1) ... [2025-03-03 14:47:50,128 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:47:50" (1/1) ... [2025-03-03 14:47:50,130 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:47:50" (1/1) ... [2025-03-03 14:47:50,131 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:47:50" (1/1) ... [2025-03-03 14:47:50,139 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 14:47:50,143 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 14:47:50,143 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 14:47:50,143 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 14:47:50,144 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:47:50" (1/1) ... [2025-03-03 14:47:50,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:47:50,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:47:50,171 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 14:47:50,174 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 14:47:50,194 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 14:47:50,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 14:47:50,194 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 14:47:50,194 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 14:47:50,286 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 14:47:50,287 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 14:47:51,063 INFO L? ?]: Removed 111 outVars from TransFormulas that were not future-live. [2025-03-03 14:47:51,063 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 14:47:51,078 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 14:47:51,080 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 14:47:51,081 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:47:51 BoogieIcfgContainer [2025-03-03 14:47:51,081 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 14:47:51,082 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 14:47:51,083 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 14:47:51,086 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 14:47:51,086 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 02:47:49" (1/3) ... [2025-03-03 14:47:51,086 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@787f6102 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:47:51, skipping insertion in model container [2025-03-03 14:47:51,087 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:47:50" (2/3) ... [2025-03-03 14:47:51,087 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@787f6102 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:47:51, skipping insertion in model container [2025-03-03 14:47:51,087 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:47:51" (3/3) ... [2025-03-03 14:47:51,088 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_floodmax.4.2.ufo.UNBOUNDED.pals.c [2025-03-03 14:47:51,098 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 14:47:51,101 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_floodmax.4.2.ufo.UNBOUNDED.pals.c that has 1 procedures, 287 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 14:47:51,151 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 14:47:51,163 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;@62d06c44, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 14:47:51,163 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 14:47:51,169 INFO L276 IsEmpty]: Start isEmpty. Operand has 287 states, 285 states have (on average 1.8245614035087718) internal successors, (520), 286 states have internal predecessors, (520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:47:51,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-03 14:47:51,179 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:47:51,180 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:47:51,180 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:47:51,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:47:51,184 INFO L85 PathProgramCache]: Analyzing trace with hash -317198031, now seen corresponding path program 1 times [2025-03-03 14:47:51,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:47:51,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505179304] [2025-03-03 14:47:51,189 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:47:51,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:47:51,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-03 14:47:51,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-03 14:47:51,371 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:47:51,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:47:51,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:47:51,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:47:51,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505179304] [2025-03-03 14:47:51,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505179304] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:47:51,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:47:51,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 14:47:51,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639595610] [2025-03-03 14:47:51,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:47:51,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 14:47:51,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:47:51,550 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 14:47:51,551 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 14:47:51,553 INFO L87 Difference]: Start difference. First operand has 287 states, 285 states have (on average 1.8245614035087718) internal successors, (520), 286 states have internal predecessors, (520), 0 states have call successors, (0), 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 38.5) internal successors, (77), 2 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:47:51,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:47:51,596 INFO L93 Difference]: Finished difference Result 380 states and 684 transitions. [2025-03-03 14:47:51,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 14:47:51,597 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 38.5) internal successors, (77), 2 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2025-03-03 14:47:51,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:47:51,603 INFO L225 Difference]: With dead ends: 380 [2025-03-03 14:47:51,603 INFO L226 Difference]: Without dead ends: 284 [2025-03-03 14:47:51,605 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 14:47:51,608 INFO L435 NwaCegarLoop]: 515 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, 515 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:47:51,609 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 515 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:47:51,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2025-03-03 14:47:51,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 284. [2025-03-03 14:47:51,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 283 states have (on average 1.8197879858657244) internal successors, (515), 283 states have internal predecessors, (515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:47:51,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 515 transitions. [2025-03-03 14:47:51,641 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 515 transitions. Word has length 77 [2025-03-03 14:47:51,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:47:51,641 INFO L471 AbstractCegarLoop]: Abstraction has 284 states and 515 transitions. [2025-03-03 14:47:51,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 38.5) internal successors, (77), 2 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:47:51,642 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 515 transitions. [2025-03-03 14:47:51,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-03 14:47:51,644 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:47:51,644 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:47:51,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 14:47:51,644 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:47:51,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:47:51,645 INFO L85 PathProgramCache]: Analyzing trace with hash -384204784, now seen corresponding path program 1 times [2025-03-03 14:47:51,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:47:51,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631808725] [2025-03-03 14:47:51,645 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:47:51,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:47:51,677 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-03 14:47:51,732 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-03 14:47:51,733 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:47:51,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:47:51,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:47:51,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:47:51,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631808725] [2025-03-03 14:47:51,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631808725] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:47:52,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:47:52,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:47:52,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293608281] [2025-03-03 14:47:52,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:47:52,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:47:52,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:47:52,002 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:47:52,002 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:47:52,002 INFO L87 Difference]: Start difference. First operand 284 states and 515 transitions. Second operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:47:52,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:47:52,139 INFO L93 Difference]: Finished difference Result 380 states and 680 transitions. [2025-03-03 14:47:52,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:47:52,144 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2025-03-03 14:47:52,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:47:52,147 INFO L225 Difference]: With dead ends: 380 [2025-03-03 14:47:52,150 INFO L226 Difference]: Without dead ends: 284 [2025-03-03 14:47:52,151 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:47:52,151 INFO L435 NwaCegarLoop]: 513 mSDtfsCounter, 0 mSDsluCounter, 1492 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2005 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:47:52,152 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2005 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:47:52,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2025-03-03 14:47:52,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 284. [2025-03-03 14:47:52,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 283 states have (on average 1.6713780918727916) internal successors, (473), 283 states have internal predecessors, (473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:47:52,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 473 transitions. [2025-03-03 14:47:52,165 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 473 transitions. Word has length 77 [2025-03-03 14:47:52,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:47:52,166 INFO L471 AbstractCegarLoop]: Abstraction has 284 states and 473 transitions. [2025-03-03 14:47:52,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:47:52,166 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 473 transitions. [2025-03-03 14:47:52,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-03 14:47:52,170 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:47:52,171 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] [2025-03-03 14:47:52,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 14:47:52,171 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:47:52,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:47:52,171 INFO L85 PathProgramCache]: Analyzing trace with hash -1125202192, now seen corresponding path program 1 times [2025-03-03 14:47:52,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:47:52,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060303486] [2025-03-03 14:47:52,172 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:47:52,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:47:52,195 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-03 14:47:52,231 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-03 14:47:52,232 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:47:52,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:47:52,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:47:52,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:47:52,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060303486] [2025-03-03 14:47:52,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060303486] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:47:52,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:47:52,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:47:52,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242334361] [2025-03-03 14:47:52,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:47:52,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:47:52,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:47:52,388 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:47:52,388 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:47:52,388 INFO L87 Difference]: Start difference. First operand 284 states and 473 transitions. Second operand has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:47:52,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:47:52,454 INFO L93 Difference]: Finished difference Result 457 states and 774 transitions. [2025-03-03 14:47:52,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:47:52,455 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 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 118 [2025-03-03 14:47:52,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:47:52,457 INFO L225 Difference]: With dead ends: 457 [2025-03-03 14:47:52,457 INFO L226 Difference]: Without dead ends: 365 [2025-03-03 14:47:52,457 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:47:52,458 INFO L435 NwaCegarLoop]: 467 mSDtfsCounter, 131 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 887 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:47:52,458 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 887 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:47:52,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2025-03-03 14:47:52,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 362. [2025-03-03 14:47:52,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 361 states have (on average 1.6759002770083102) internal successors, (605), 361 states have internal predecessors, (605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:47:52,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 605 transitions. [2025-03-03 14:47:52,475 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 605 transitions. Word has length 118 [2025-03-03 14:47:52,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:47:52,475 INFO L471 AbstractCegarLoop]: Abstraction has 362 states and 605 transitions. [2025-03-03 14:47:52,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:47:52,477 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 605 transitions. [2025-03-03 14:47:52,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-03 14:47:52,478 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:47:52,479 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] [2025-03-03 14:47:52,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 14:47:52,479 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:47:52,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:47:52,480 INFO L85 PathProgramCache]: Analyzing trace with hash 1145287309, now seen corresponding path program 1 times [2025-03-03 14:47:52,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:47:52,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276114023] [2025-03-03 14:47:52,480 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:47:52,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:47:52,499 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-03 14:47:52,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-03 14:47:52,525 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:47:52,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:47:52,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:47:52,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:47:52,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276114023] [2025-03-03 14:47:52,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276114023] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:47:52,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:47:52,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:47:52,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613663237] [2025-03-03 14:47:52,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:47:52,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:47:52,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:47:52,633 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:47:52,633 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:47:52,633 INFO L87 Difference]: Start difference. First operand 362 states and 605 transitions. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:47:52,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:47:52,670 INFO L93 Difference]: Finished difference Result 684 states and 1157 transitions. [2025-03-03 14:47:52,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:47:52,670 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 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 121 [2025-03-03 14:47:52,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:47:52,672 INFO L225 Difference]: With dead ends: 684 [2025-03-03 14:47:52,672 INFO L226 Difference]: Without dead ends: 514 [2025-03-03 14:47:52,673 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:47:52,675 INFO L435 NwaCegarLoop]: 470 mSDtfsCounter, 132 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 899 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:47:52,676 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 899 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:47:52,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2025-03-03 14:47:52,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 510. [2025-03-03 14:47:52,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 510 states, 509 states have (on average 1.6836935166994107) internal successors, (857), 509 states have internal predecessors, (857), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:47:52,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 857 transitions. [2025-03-03 14:47:52,697 INFO L78 Accepts]: Start accepts. Automaton has 510 states and 857 transitions. Word has length 121 [2025-03-03 14:47:52,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:47:52,698 INFO L471 AbstractCegarLoop]: Abstraction has 510 states and 857 transitions. [2025-03-03 14:47:52,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:47:52,698 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 857 transitions. [2025-03-03 14:47:52,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-03 14:47:52,699 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:47:52,699 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] [2025-03-03 14:47:52,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 14:47:52,699 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:47:52,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:47:52,700 INFO L85 PathProgramCache]: Analyzing trace with hash -794310143, now seen corresponding path program 1 times [2025-03-03 14:47:52,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:47:52,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170193141] [2025-03-03 14:47:52,700 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:47:52,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:47:52,715 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-03 14:47:52,738 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-03 14:47:52,741 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:47:52,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:47:52,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:47:52,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:47:52,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170193141] [2025-03-03 14:47:52,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170193141] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:47:52,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:47:52,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:47:52,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971252492] [2025-03-03 14:47:52,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:47:52,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:47:52,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:47:52,873 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:47:52,873 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:47:52,873 INFO L87 Difference]: Start difference. First operand 510 states and 857 transitions. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:47:52,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:47:52,933 INFO L93 Difference]: Finished difference Result 1110 states and 1879 transitions. [2025-03-03 14:47:52,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:47:52,933 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 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 124 [2025-03-03 14:47:52,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:47:52,937 INFO L225 Difference]: With dead ends: 1110 [2025-03-03 14:47:52,937 INFO L226 Difference]: Without dead ends: 792 [2025-03-03 14:47:52,938 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:47:52,938 INFO L435 NwaCegarLoop]: 470 mSDtfsCounter, 125 mSDsluCounter, 430 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 900 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:47:52,939 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 900 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:47:52,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 792 states. [2025-03-03 14:47:52,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 792 to 786. [2025-03-03 14:47:52,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 786 states, 785 states have (on average 1.6828025477707007) internal successors, (1321), 785 states have internal predecessors, (1321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:47:52,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 1321 transitions. [2025-03-03 14:47:52,958 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 1321 transitions. Word has length 124 [2025-03-03 14:47:52,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:47:52,958 INFO L471 AbstractCegarLoop]: Abstraction has 786 states and 1321 transitions. [2025-03-03 14:47:52,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:47:52,959 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 1321 transitions. [2025-03-03 14:47:52,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-03 14:47:52,960 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:47:52,960 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] [2025-03-03 14:47:52,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 14:47:52,961 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:47:52,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:47:52,961 INFO L85 PathProgramCache]: Analyzing trace with hash 235819710, now seen corresponding path program 1 times [2025-03-03 14:47:52,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:47:52,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569428238] [2025-03-03 14:47:52,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:47:52,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:47:52,981 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-03 14:47:53,008 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-03 14:47:53,009 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:47:53,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:47:53,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:47:53,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:47:53,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569428238] [2025-03-03 14:47:53,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569428238] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:47:53,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:47:53,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:47:53,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614459524] [2025-03-03 14:47:53,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:47:53,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:47:53,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:47:53,142 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:47:53,144 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:47:53,144 INFO L87 Difference]: Start difference. First operand 786 states and 1321 transitions. Second operand has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:47:53,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:47:53,181 INFO L93 Difference]: Finished difference Result 1902 states and 3203 transitions. [2025-03-03 14:47:53,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:47:53,182 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 0 states have call successors, (0), 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 127 [2025-03-03 14:47:53,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:47:53,186 INFO L225 Difference]: With dead ends: 1902 [2025-03-03 14:47:53,186 INFO L226 Difference]: Without dead ends: 1308 [2025-03-03 14:47:53,187 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:47:53,188 INFO L435 NwaCegarLoop]: 470 mSDtfsCounter, 118 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 901 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:47:53,188 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 901 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:47:53,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1308 states. [2025-03-03 14:47:53,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1308 to 1298. [2025-03-03 14:47:53,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1298 states, 1297 states have (on average 1.6723207401696223) internal successors, (2169), 1297 states have internal predecessors, (2169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:47:53,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1298 states to 1298 states and 2169 transitions. [2025-03-03 14:47:53,217 INFO L78 Accepts]: Start accepts. Automaton has 1298 states and 2169 transitions. Word has length 127 [2025-03-03 14:47:53,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:47:53,217 INFO L471 AbstractCegarLoop]: Abstraction has 1298 states and 2169 transitions. [2025-03-03 14:47:53,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:47:53,217 INFO L276 IsEmpty]: Start isEmpty. Operand 1298 states and 2169 transitions. [2025-03-03 14:47:53,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-03 14:47:53,218 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:47:53,218 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] [2025-03-03 14:47:53,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 14:47:53,219 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:47:53,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:47:53,219 INFO L85 PathProgramCache]: Analyzing trace with hash -469031183, now seen corresponding path program 1 times [2025-03-03 14:47:53,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:47:53,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052564961] [2025-03-03 14:47:53,219 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:47:53,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:47:53,237 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-03 14:47:53,273 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-03 14:47:53,274 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:47:53,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:47:53,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:47:53,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:47:53,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052564961] [2025-03-03 14:47:53,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052564961] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:47:53,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:47:53,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:47:53,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277463036] [2025-03-03 14:47:53,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:47:53,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:47:53,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:47:53,465 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:47:53,465 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:47:53,466 INFO L87 Difference]: Start difference. First operand 1298 states and 2169 transitions. Second operand has 6 states, 6 states have (on average 21.666666666666668) internal successors, (130), 6 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:47:53,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:47:53,744 INFO L93 Difference]: Finished difference Result 6530 states and 11093 transitions. [2025-03-03 14:47:53,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 14:47:53,745 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 21.666666666666668) internal successors, (130), 6 states have internal predecessors, (130), 0 states have call successors, (0), 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 130 [2025-03-03 14:47:53,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:47:53,762 INFO L225 Difference]: With dead ends: 6530 [2025-03-03 14:47:53,763 INFO L226 Difference]: Without dead ends: 5424 [2025-03-03 14:47:53,766 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-03 14:47:53,768 INFO L435 NwaCegarLoop]: 475 mSDtfsCounter, 1246 mSDsluCounter, 3436 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1246 SdHoareTripleChecker+Valid, 3911 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 14:47:53,769 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1246 Valid, 3911 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 14:47:53,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5424 states. [2025-03-03 14:47:53,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5424 to 2326. [2025-03-03 14:47:53,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2326 states, 2325 states have (on average 1.6748387096774193) internal successors, (3894), 2325 states have internal predecessors, (3894), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:47:53,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2326 states to 2326 states and 3894 transitions. [2025-03-03 14:47:53,857 INFO L78 Accepts]: Start accepts. Automaton has 2326 states and 3894 transitions. Word has length 130 [2025-03-03 14:47:53,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:47:53,858 INFO L471 AbstractCegarLoop]: Abstraction has 2326 states and 3894 transitions. [2025-03-03 14:47:53,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.666666666666668) internal successors, (130), 6 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:47:53,858 INFO L276 IsEmpty]: Start isEmpty. Operand 2326 states and 3894 transitions. [2025-03-03 14:47:53,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-03 14:47:53,860 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:47:53,860 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-03 14:47:53,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 14:47:53,861 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:47:53,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:47:53,861 INFO L85 PathProgramCache]: Analyzing trace with hash -1602362548, now seen corresponding path program 1 times [2025-03-03 14:47:53,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:47:53,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158842870] [2025-03-03 14:47:53,862 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:47:53,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:47:53,881 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-03 14:47:53,907 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-03 14:47:53,907 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:47:53,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:47:54,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:47:54,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:47:54,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158842870] [2025-03-03 14:47:54,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158842870] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:47:54,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:47:54,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:47:54,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958814036] [2025-03-03 14:47:54,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:47:54,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:47:54,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:47:54,057 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:47:54,057 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:47:54,057 INFO L87 Difference]: Start difference. First operand 2326 states and 3894 transitions. Second operand has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 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-03 14:47:54,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:47:54,171 INFO L93 Difference]: Finished difference Result 6744 states and 11406 transitions. [2025-03-03 14:47:54,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:47:54,172 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 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-03 14:47:54,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:47:54,186 INFO L225 Difference]: With dead ends: 6744 [2025-03-03 14:47:54,186 INFO L226 Difference]: Without dead ends: 4610 [2025-03-03 14:47:54,191 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:47:54,192 INFO L435 NwaCegarLoop]: 474 mSDtfsCounter, 457 mSDsluCounter, 1037 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 457 SdHoareTripleChecker+Valid, 1511 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:47:54,192 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [457 Valid, 1511 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:47:54,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4610 states. [2025-03-03 14:47:54,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4610 to 3451. [2025-03-03 14:47:54,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3451 states, 3450 states have (on average 1.6805797101449276) internal successors, (5798), 3450 states have internal predecessors, (5798), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:47:54,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3451 states to 3451 states and 5798 transitions. [2025-03-03 14:47:54,288 INFO L78 Accepts]: Start accepts. Automaton has 3451 states and 5798 transitions. Word has length 131 [2025-03-03 14:47:54,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:47:54,289 INFO L471 AbstractCegarLoop]: Abstraction has 3451 states and 5798 transitions. [2025-03-03 14:47:54,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 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-03 14:47:54,289 INFO L276 IsEmpty]: Start isEmpty. Operand 3451 states and 5798 transitions. [2025-03-03 14:47:54,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-03 14:47:54,291 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:47:54,291 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:47:54,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 14:47:54,291 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:47:54,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:47:54,294 INFO L85 PathProgramCache]: Analyzing trace with hash 1917223759, now seen corresponding path program 1 times [2025-03-03 14:47:54,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:47:54,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328489863] [2025-03-03 14:47:54,295 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:47:54,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:47:54,311 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-03 14:47:54,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-03 14:47:54,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:47:54,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:47:54,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:47:54,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:47:54,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328489863] [2025-03-03 14:47:54,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328489863] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:47:54,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:47:54,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:47:54,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621716272] [2025-03-03 14:47:54,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:47:54,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:47:54,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:47:54,455 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:47:54,455 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:47:54,456 INFO L87 Difference]: Start difference. First operand 3451 states and 5798 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-03 14:47:54,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:47:54,574 INFO L93 Difference]: Finished difference Result 10068 states and 17008 transitions. [2025-03-03 14:47:54,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:47:54,575 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-03 14:47:54,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:47:54,596 INFO L225 Difference]: With dead ends: 10068 [2025-03-03 14:47:54,596 INFO L226 Difference]: Without dead ends: 6809 [2025-03-03 14:47:54,603 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:47:54,604 INFO L435 NwaCegarLoop]: 462 mSDtfsCounter, 457 mSDsluCounter, 1039 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 457 SdHoareTripleChecker+Valid, 1501 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:47:54,604 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [457 Valid, 1501 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:47:54,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6809 states. [2025-03-03 14:47:54,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6809 to 5106. [2025-03-03 14:47:54,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5106 states, 5105 states have (on average 1.6789422135161607) internal successors, (8571), 5105 states have internal predecessors, (8571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:47:54,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5106 states to 5106 states and 8571 transitions. [2025-03-03 14:47:54,724 INFO L78 Accepts]: Start accepts. Automaton has 5106 states and 8571 transitions. Word has length 132 [2025-03-03 14:47:54,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:47:54,724 INFO L471 AbstractCegarLoop]: Abstraction has 5106 states and 8571 transitions. [2025-03-03 14:47:54,725 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-03 14:47:54,725 INFO L276 IsEmpty]: Start isEmpty. Operand 5106 states and 8571 transitions. [2025-03-03 14:47:54,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-03 14:47:54,727 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:47:54,728 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-03 14:47:54,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 14:47:54,728 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:47:54,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:47:54,729 INFO L85 PathProgramCache]: Analyzing trace with hash -658378125, now seen corresponding path program 1 times [2025-03-03 14:47:54,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:47:54,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554997148] [2025-03-03 14:47:54,729 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:47:54,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:47:54,746 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-03 14:47:54,760 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-03 14:47:54,760 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:47:54,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:47:54,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:47:54,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:47:54,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554997148] [2025-03-03 14:47:54,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554997148] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:47:54,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:47:54,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:47:54,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286515391] [2025-03-03 14:47:54,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:47:54,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:47:54,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:47:54,818 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:47:54,818 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:47:54,818 INFO L87 Difference]: Start difference. First operand 5106 states and 8571 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-03 14:47:54,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:47:54,947 INFO L93 Difference]: Finished difference Result 11425 states and 19299 transitions. [2025-03-03 14:47:54,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:47:54,948 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-03 14:47:54,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:47:54,970 INFO L225 Difference]: With dead ends: 11425 [2025-03-03 14:47:54,970 INFO L226 Difference]: Without dead ends: 7909 [2025-03-03 14:47:54,974 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:47:54,974 INFO L435 NwaCegarLoop]: 592 mSDtfsCounter, 138 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 1043 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:47:54,975 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 1043 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:47:54,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7909 states. [2025-03-03 14:47:55,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7909 to 7907. [2025-03-03 14:47:55,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7907 states, 7906 states have (on average 1.6750569187958513) internal successors, (13243), 7906 states have internal predecessors, (13243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:47:55,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7907 states to 7907 states and 13243 transitions. [2025-03-03 14:47:55,145 INFO L78 Accepts]: Start accepts. Automaton has 7907 states and 13243 transitions. Word has length 133 [2025-03-03 14:47:55,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:47:55,145 INFO L471 AbstractCegarLoop]: Abstraction has 7907 states and 13243 transitions. [2025-03-03 14:47:55,145 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-03 14:47:55,145 INFO L276 IsEmpty]: Start isEmpty. Operand 7907 states and 13243 transitions. [2025-03-03 14:47:55,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-03 14:47:55,147 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:47:55,147 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-03 14:47:55,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 14:47:55,147 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:47:55,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:47:55,148 INFO L85 PathProgramCache]: Analyzing trace with hash -1553750472, now seen corresponding path program 1 times [2025-03-03 14:47:55,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:47:55,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726096943] [2025-03-03 14:47:55,148 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:47:55,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:47:55,163 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-03 14:47:55,177 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-03 14:47:55,178 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:47:55,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:47:55,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:47:55,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:47:55,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726096943] [2025-03-03 14:47:55,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726096943] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:47:55,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:47:55,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:47:55,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586037595] [2025-03-03 14:47:55,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:47:55,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:47:55,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:47:55,235 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:47:55,235 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:47:55,235 INFO L87 Difference]: Start difference. First operand 7907 states and 13243 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-03 14:47:55,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:47:55,378 INFO L93 Difference]: Finished difference Result 17592 states and 29492 transitions. [2025-03-03 14:47:55,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:47:55,379 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-03 14:47:55,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:47:55,402 INFO L225 Difference]: With dead ends: 17592 [2025-03-03 14:47:55,402 INFO L226 Difference]: Without dead ends: 12155 [2025-03-03 14:47:55,413 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:47:55,413 INFO L435 NwaCegarLoop]: 590 mSDtfsCounter, 131 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 1042 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:47:55,414 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 1042 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:47:55,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12155 states. [2025-03-03 14:47:55,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12155 to 12153. [2025-03-03 14:47:55,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12153 states, 12152 states have (on average 1.663429888084266) internal successors, (20214), 12152 states have internal predecessors, (20214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:47:55,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12153 states to 12153 states and 20214 transitions. [2025-03-03 14:47:55,732 INFO L78 Accepts]: Start accepts. Automaton has 12153 states and 20214 transitions. Word has length 133 [2025-03-03 14:47:55,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:47:55,732 INFO L471 AbstractCegarLoop]: Abstraction has 12153 states and 20214 transitions. [2025-03-03 14:47:55,733 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-03 14:47:55,733 INFO L276 IsEmpty]: Start isEmpty. Operand 12153 states and 20214 transitions. [2025-03-03 14:47:55,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-03 14:47:55,734 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:47:55,734 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-03 14:47:55,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 14:47:55,734 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:47:55,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:47:55,735 INFO L85 PathProgramCache]: Analyzing trace with hash -928221677, now seen corresponding path program 1 times [2025-03-03 14:47:55,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:47:55,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234663393] [2025-03-03 14:47:55,735 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:47:55,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:47:55,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-03 14:47:55,771 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-03 14:47:55,772 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:47:55,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:47:55,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:47:55,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:47:55,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234663393] [2025-03-03 14:47:55,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234663393] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:47:55,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:47:55,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:47:55,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764703587] [2025-03-03 14:47:55,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:47:55,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:47:55,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:47:55,852 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:47:55,852 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:47:55,853 INFO L87 Difference]: Start difference. First operand 12153 states and 20214 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-03 14:47:55,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:47:55,999 INFO L93 Difference]: Finished difference Result 23965 states and 39928 transitions. [2025-03-03 14:47:56,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:47:56,000 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-03 14:47:56,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:47:56,033 INFO L225 Difference]: With dead ends: 23965 [2025-03-03 14:47:56,033 INFO L226 Difference]: Without dead ends: 17262 [2025-03-03 14:47:56,046 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:47:56,046 INFO L435 NwaCegarLoop]: 581 mSDtfsCounter, 124 mSDsluCounter, 453 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 1034 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:47:56,047 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 1034 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:47:56,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17262 states. [2025-03-03 14:47:56,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17262 to 17260. [2025-03-03 14:47:56,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17260 states, 17259 states have (on average 1.652702937597775) internal successors, (28524), 17259 states have internal predecessors, (28524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:47:56,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17260 states to 17260 states and 28524 transitions. [2025-03-03 14:47:56,399 INFO L78 Accepts]: Start accepts. Automaton has 17260 states and 28524 transitions. Word has length 133 [2025-03-03 14:47:56,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:47:56,400 INFO L471 AbstractCegarLoop]: Abstraction has 17260 states and 28524 transitions. [2025-03-03 14:47:56,400 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-03 14:47:56,400 INFO L276 IsEmpty]: Start isEmpty. Operand 17260 states and 28524 transitions. [2025-03-03 14:47:56,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-03 14:47:56,401 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:47:56,401 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-03 14:47:56,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 14:47:56,401 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:47:56,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:47:56,402 INFO L85 PathProgramCache]: Analyzing trace with hash 412010937, now seen corresponding path program 1 times [2025-03-03 14:47:56,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:47:56,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396052579] [2025-03-03 14:47:56,402 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:47:56,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:47:56,420 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-03 14:47:56,437 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-03 14:47:56,438 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:47:56,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:47:56,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:47:56,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:47:56,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396052579] [2025-03-03 14:47:56,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396052579] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:47:56,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:47:56,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:47:56,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554827383] [2025-03-03 14:47:56,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:47:56,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:47:56,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:47:56,500 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:47:56,500 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:47:56,500 INFO L87 Difference]: Start difference. First operand 17260 states and 28524 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-03 14:47:56,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:47:56,766 INFO L93 Difference]: Finished difference Result 33872 states and 56088 transitions. [2025-03-03 14:47:56,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:47:56,767 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-03 14:47:56,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:47:56,811 INFO L225 Difference]: With dead ends: 33872 [2025-03-03 14:47:56,812 INFO L226 Difference]: Without dead ends: 24369 [2025-03-03 14:47:56,823 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:47:56,824 INFO L435 NwaCegarLoop]: 571 mSDtfsCounter, 117 mSDsluCounter, 454 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 1025 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:47:56,824 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 1025 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:47:56,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24369 states. [2025-03-03 14:47:57,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24369 to 24367. [2025-03-03 14:47:57,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24367 states, 24366 states have (on average 1.6409751292785029) internal successors, (39984), 24366 states have internal predecessors, (39984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:47:57,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24367 states to 24367 states and 39984 transitions. [2025-03-03 14:47:57,319 INFO L78 Accepts]: Start accepts. Automaton has 24367 states and 39984 transitions. Word has length 133 [2025-03-03 14:47:57,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:47:57,319 INFO L471 AbstractCegarLoop]: Abstraction has 24367 states and 39984 transitions. [2025-03-03 14:47:57,319 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-03 14:47:57,319 INFO L276 IsEmpty]: Start isEmpty. Operand 24367 states and 39984 transitions. [2025-03-03 14:47:57,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-03 14:47:57,320 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:47:57,320 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-03 14:47:57,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 14:47:57,321 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:47:57,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:47:57,321 INFO L85 PathProgramCache]: Analyzing trace with hash -646597462, now seen corresponding path program 1 times [2025-03-03 14:47:57,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:47:57,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548526899] [2025-03-03 14:47:57,321 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:47:57,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:47:57,335 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-03 14:47:57,351 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-03 14:47:57,351 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:47:57,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:47:57,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:47:57,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:47:57,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548526899] [2025-03-03 14:47:57,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548526899] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:47:57,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:47:57,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:47:57,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312343032] [2025-03-03 14:47:57,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:47:57,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:47:57,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:47:57,441 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:47:57,441 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:47:57,441 INFO L87 Difference]: Start difference. First operand 24367 states and 39984 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-03 14:47:58,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:47:58,007 INFO L93 Difference]: Finished difference Result 79851 states and 131402 transitions. [2025-03-03 14:47:58,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:47:58,008 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-03 14:47:58,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:47:58,131 INFO L225 Difference]: With dead ends: 79851 [2025-03-03 14:47:58,131 INFO L226 Difference]: Without dead ends: 55699 [2025-03-03 14:47:58,164 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:47:58,164 INFO L435 NwaCegarLoop]: 462 mSDtfsCounter, 455 mSDsluCounter, 1041 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 455 SdHoareTripleChecker+Valid, 1503 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:47:58,165 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [455 Valid, 1503 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:47:58,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55699 states. [2025-03-03 14:47:59,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55699 to 39890. [2025-03-03 14:47:59,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39890 states, 39889 states have (on average 1.633708541201835) internal successors, (65167), 39889 states have internal predecessors, (65167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:47:59,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39890 states to 39890 states and 65167 transitions. [2025-03-03 14:47:59,139 INFO L78 Accepts]: Start accepts. Automaton has 39890 states and 65167 transitions. Word has length 133 [2025-03-03 14:47:59,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:47:59,139 INFO L471 AbstractCegarLoop]: Abstraction has 39890 states and 65167 transitions. [2025-03-03 14:47:59,140 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-03 14:47:59,140 INFO L276 IsEmpty]: Start isEmpty. Operand 39890 states and 65167 transitions. [2025-03-03 14:47:59,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-03 14:47:59,140 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:47:59,141 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-03 14:47:59,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 14:47:59,141 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:47:59,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:47:59,141 INFO L85 PathProgramCache]: Analyzing trace with hash 1477476269, now seen corresponding path program 1 times [2025-03-03 14:47:59,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:47:59,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751597776] [2025-03-03 14:47:59,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:47:59,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:47:59,154 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-03 14:47:59,170 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-03 14:47:59,171 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:47:59,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:47:59,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:47:59,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:47:59,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751597776] [2025-03-03 14:47:59,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751597776] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:47:59,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:47:59,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:47:59,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091346057] [2025-03-03 14:47:59,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:47:59,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:47:59,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:47:59,275 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:47:59,275 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:47:59,275 INFO L87 Difference]: Start difference. First operand 39890 states and 65167 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-03 14:48:00,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:48:00,192 INFO L93 Difference]: Finished difference Result 129245 states and 211740 transitions. [2025-03-03 14:48:00,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:48:00,193 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-03 14:48:00,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:48:00,380 INFO L225 Difference]: With dead ends: 129245 [2025-03-03 14:48:00,380 INFO L226 Difference]: Without dead ends: 89570 [2025-03-03 14:48:00,422 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:48:00,422 INFO L435 NwaCegarLoop]: 462 mSDtfsCounter, 453 mSDsluCounter, 1043 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 453 SdHoareTripleChecker+Valid, 1505 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:48:00,423 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [453 Valid, 1505 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:48:00,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89570 states. [2025-03-03 14:48:01,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89570 to 64505. [2025-03-03 14:48:01,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64505 states, 64504 states have (on average 1.626658811856629) internal successors, (104926), 64504 states have internal predecessors, (104926), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:48:01,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64505 states to 64505 states and 104926 transitions. [2025-03-03 14:48:01,930 INFO L78 Accepts]: Start accepts. Automaton has 64505 states and 104926 transitions. Word has length 134 [2025-03-03 14:48:01,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:48:01,931 INFO L471 AbstractCegarLoop]: Abstraction has 64505 states and 104926 transitions. [2025-03-03 14:48:01,931 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-03 14:48:01,931 INFO L276 IsEmpty]: Start isEmpty. Operand 64505 states and 104926 transitions. [2025-03-03 14:48:01,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-03 14:48:01,932 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:48:01,932 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] [2025-03-03 14:48:01,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 14:48:01,932 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:48:01,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:48:01,932 INFO L85 PathProgramCache]: Analyzing trace with hash -331277301, now seen corresponding path program 1 times [2025-03-03 14:48:01,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:48:01,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735195164] [2025-03-03 14:48:01,932 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:48:01,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:48:01,957 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-03 14:48:01,985 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-03 14:48:01,985 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:48:01,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:48:02,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:48:02,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:48:02,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735195164] [2025-03-03 14:48:02,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735195164] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:48:02,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:48:02,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:48:02,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888424606] [2025-03-03 14:48:02,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:48:02,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:48:02,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:48:02,204 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:48:02,204 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:48:02,204 INFO L87 Difference]: Start difference. First operand 64505 states and 104926 transitions. Second operand has 6 states, 6 states have (on average 22.666666666666668) internal successors, (136), 6 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:48:02,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:48:02,903 INFO L93 Difference]: Finished difference Result 128797 states and 209509 transitions. [2025-03-03 14:48:02,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:48:02,903 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.666666666666668) internal successors, (136), 6 states have internal predecessors, (136), 0 states have call successors, (0), 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 136 [2025-03-03 14:48:02,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:48:02,996 INFO L225 Difference]: With dead ends: 128797 [2025-03-03 14:48:02,996 INFO L226 Difference]: Without dead ends: 64507 [2025-03-03 14:48:03,052 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-03 14:48:03,053 INFO L435 NwaCegarLoop]: 471 mSDtfsCounter, 241 mSDsluCounter, 1311 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 1782 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:48:03,054 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 1782 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:48:03,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64507 states. [2025-03-03 14:48:03,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64507 to 64505. [2025-03-03 14:48:04,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64505 states, 64504 states have (on average 1.6169694902641696) internal successors, (104301), 64504 states have internal predecessors, (104301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:48:04,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64505 states to 64505 states and 104301 transitions. [2025-03-03 14:48:04,340 INFO L78 Accepts]: Start accepts. Automaton has 64505 states and 104301 transitions. Word has length 136 [2025-03-03 14:48:04,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:48:04,341 INFO L471 AbstractCegarLoop]: Abstraction has 64505 states and 104301 transitions. [2025-03-03 14:48:04,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.666666666666668) internal successors, (136), 6 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:48:04,341 INFO L276 IsEmpty]: Start isEmpty. Operand 64505 states and 104301 transitions. [2025-03-03 14:48:04,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-03-03 14:48:04,342 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:48:04,342 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] [2025-03-03 14:48:04,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 14:48:04,343 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:48:04,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:48:04,344 INFO L85 PathProgramCache]: Analyzing trace with hash -1875817149, now seen corresponding path program 1 times [2025-03-03 14:48:04,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:48:04,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038511881] [2025-03-03 14:48:04,344 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:48:04,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:48:04,366 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-03 14:48:04,388 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-03 14:48:04,388 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:48:04,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:48:04,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:48:04,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:48:04,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038511881] [2025-03-03 14:48:04,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038511881] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:48:04,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:48:04,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:48:04,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76206243] [2025-03-03 14:48:04,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:48:04,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:48:04,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:48:04,652 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:48:04,652 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:48:04,653 INFO L87 Difference]: Start difference. First operand 64505 states and 104301 transitions. Second operand has 6 states, 6 states have (on average 23.166666666666668) internal successors, (139), 6 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:48:05,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:48:05,878 INFO L93 Difference]: Finished difference Result 188667 states and 305529 transitions. [2025-03-03 14:48:05,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:48:05,878 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 23.166666666666668) internal successors, (139), 6 states have internal predecessors, (139), 0 states have call successors, (0), 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 139 [2025-03-03 14:48:05,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:48:06,052 INFO L225 Difference]: With dead ends: 188667 [2025-03-03 14:48:06,052 INFO L226 Difference]: Without dead ends: 124377 [2025-03-03 14:48:06,090 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-03 14:48:06,091 INFO L435 NwaCegarLoop]: 460 mSDtfsCounter, 354 mSDsluCounter, 1329 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 354 SdHoareTripleChecker+Valid, 1789 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:48:06,091 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [354 Valid, 1789 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:48:06,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124377 states. [2025-03-03 14:48:07,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124377 to 124375. [2025-03-03 14:48:08,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124375 states, 124374 states have (on average 1.6044671715953496) internal successors, (199554), 124374 states have internal predecessors, (199554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:48:08,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124375 states to 124375 states and 199554 transitions. [2025-03-03 14:48:08,305 INFO L78 Accepts]: Start accepts. Automaton has 124375 states and 199554 transitions. Word has length 139 [2025-03-03 14:48:08,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:48:08,305 INFO L471 AbstractCegarLoop]: Abstraction has 124375 states and 199554 transitions. [2025-03-03 14:48:08,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.166666666666668) internal successors, (139), 6 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:48:08,306 INFO L276 IsEmpty]: Start isEmpty. Operand 124375 states and 199554 transitions. [2025-03-03 14:48:08,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-03-03 14:48:08,306 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:48:08,307 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-03 14:48:08,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 14:48:08,311 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:48:08,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:48:08,311 INFO L85 PathProgramCache]: Analyzing trace with hash 2011595300, now seen corresponding path program 1 times [2025-03-03 14:48:08,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:48:08,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193089249] [2025-03-03 14:48:08,311 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:48:08,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:48:08,323 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-03 14:48:08,380 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-03 14:48:08,381 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:48:08,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:48:08,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:48:08,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:48:08,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193089249] [2025-03-03 14:48:08,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193089249] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:48:08,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:48:08,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 14:48:08,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442137414] [2025-03-03 14:48:08,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:48:08,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 14:48:08,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:48:08,863 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 14:48:08,864 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:48:08,864 INFO L87 Difference]: Start difference. First operand 124375 states and 199554 transitions. Second operand has 8 states, 8 states have (on average 17.5) internal successors, (140), 8 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-03 14:48:09,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:48:09,651 INFO L93 Difference]: Finished difference Result 130185 states and 207299 transitions. [2025-03-03 14:48:09,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 14:48:09,652 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 17.5) internal successors, (140), 8 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-03 14:48:09,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:48:09,847 INFO L225 Difference]: With dead ends: 130185 [2025-03-03 14:48:09,847 INFO L226 Difference]: Without dead ends: 130183 [2025-03-03 14:48:09,885 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:48:09,885 INFO L435 NwaCegarLoop]: 467 mSDtfsCounter, 0 mSDsluCounter, 2783 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3250 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:48:09,885 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3250 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:48:09,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130183 states. [2025-03-03 14:48:11,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130183 to 130183. [2025-03-03 14:48:12,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130183 states, 130182 states have (on average 1.5772917914919113) internal successors, (205335), 130182 states have internal predecessors, (205335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:48:12,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130183 states to 130183 states and 205335 transitions. [2025-03-03 14:48:12,370 INFO L78 Accepts]: Start accepts. Automaton has 130183 states and 205335 transitions. Word has length 140 [2025-03-03 14:48:12,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:48:12,370 INFO L471 AbstractCegarLoop]: Abstraction has 130183 states and 205335 transitions. [2025-03-03 14:48:12,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 17.5) internal successors, (140), 8 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-03 14:48:12,370 INFO L276 IsEmpty]: Start isEmpty. Operand 130183 states and 205335 transitions. [2025-03-03 14:48:12,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-03-03 14:48:12,374 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:48:12,374 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, 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] [2025-03-03 14:48:12,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 14:48:12,374 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:48:12,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:48:12,375 INFO L85 PathProgramCache]: Analyzing trace with hash 316305547, now seen corresponding path program 1 times [2025-03-03 14:48:12,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:48:12,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368731195] [2025-03-03 14:48:12,375 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:48:12,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:48:12,387 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-03-03 14:48:12,402 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-03-03 14:48:12,402 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:48:12,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:48:12,460 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:48:12,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:48:12,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368731195] [2025-03-03 14:48:12,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368731195] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:48:12,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:48:12,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:48:12,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872255448] [2025-03-03 14:48:12,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:48:12,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:48:12,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:48:12,462 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:48:12,462 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:48:12,462 INFO L87 Difference]: Start difference. First operand 130183 states and 205335 transitions. Second operand has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:48:14,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:48:14,803 INFO L93 Difference]: Finished difference Result 389528 states and 613982 transitions. [2025-03-03 14:48:14,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:48:14,803 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 0 states have call successors, (0), 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 177 [2025-03-03 14:48:14,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:48:15,279 INFO L225 Difference]: With dead ends: 389528 [2025-03-03 14:48:15,280 INFO L226 Difference]: Without dead ends: 259404 [2025-03-03 14:48:15,374 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:48:15,374 INFO L435 NwaCegarLoop]: 733 mSDtfsCounter, 349 mSDsluCounter, 457 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 349 SdHoareTripleChecker+Valid, 1190 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:48:15,374 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [349 Valid, 1190 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:48:15,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259404 states. [2025-03-03 14:48:19,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259404 to 259402. [2025-03-03 14:48:19,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259402 states, 259401 states have (on average 1.567040990589859) internal successors, (406492), 259401 states have internal predecessors, (406492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:48:20,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259402 states to 259402 states and 406492 transitions. [2025-03-03 14:48:20,143 INFO L78 Accepts]: Start accepts. Automaton has 259402 states and 406492 transitions. Word has length 177 [2025-03-03 14:48:20,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:48:20,144 INFO L471 AbstractCegarLoop]: Abstraction has 259402 states and 406492 transitions. [2025-03-03 14:48:20,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:48:20,144 INFO L276 IsEmpty]: Start isEmpty. Operand 259402 states and 406492 transitions. [2025-03-03 14:48:20,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-03-03 14:48:20,151 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:48:20,151 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, 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] [2025-03-03 14:48:20,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-03 14:48:20,152 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:48:20,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:48:20,152 INFO L85 PathProgramCache]: Analyzing trace with hash -579066800, now seen corresponding path program 1 times [2025-03-03 14:48:20,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:48:20,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095291435] [2025-03-03 14:48:20,152 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:48:20,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:48:20,165 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-03-03 14:48:20,184 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-03-03 14:48:20,184 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:48:20,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:48:20,258 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-03 14:48:20,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:48:20,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095291435] [2025-03-03 14:48:20,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095291435] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:48:20,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:48:20,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:48:20,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625174002] [2025-03-03 14:48:20,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:48:20,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:48:20,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:48:20,260 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:48:20,260 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:48:20,260 INFO L87 Difference]: Start difference. First operand 259402 states and 406492 transitions. Second operand has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:48:25,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:48:25,060 INFO L93 Difference]: Finished difference Result 776226 states and 1215543 transitions. [2025-03-03 14:48:25,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:48:25,061 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 0 states have call successors, (0), 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 177 [2025-03-03 14:48:25,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:48:26,073 INFO L225 Difference]: With dead ends: 776226 [2025-03-03 14:48:26,073 INFO L226 Difference]: Without dead ends: 516911 [2025-03-03 14:48:26,255 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:48:26,256 INFO L435 NwaCegarLoop]: 713 mSDtfsCounter, 329 mSDsluCounter, 457 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 329 SdHoareTripleChecker+Valid, 1170 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:48:26,256 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [329 Valid, 1170 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:48:26,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516911 states.