./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_lcr.7.ufo.UNBOUNDED.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded/pals_lcr.7.ufo.UNBOUNDED.pals.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 760447de6aa5739f187553f004f72c898b25c540c6dba08996c9520ae7051de1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 16:17:35,210 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 16:17:35,264 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 16:17:35,269 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 16:17:35,270 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 16:17:35,287 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 16:17:35,287 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 16:17:35,288 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 16:17:35,288 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 16:17:35,289 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 16:17:35,289 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 16:17:35,289 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 16:17:35,290 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 16:17:35,290 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 16:17:35,290 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 16:17:35,290 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 16:17:35,290 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 16:17:35,290 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 16:17:35,290 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 16:17:35,290 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 16:17:35,291 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 16:17:35,291 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 16:17:35,291 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 16:17:35,291 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 16:17:35,291 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 16:17:35,291 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 16:17:35,291 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 16:17:35,291 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 16:17:35,291 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 16:17:35,291 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 16:17:35,291 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 16:17:35,291 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 16:17:35,292 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 16:17:35,292 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 16:17:35,292 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 16:17:35,292 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 16:17:35,292 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 16:17:35,292 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 16:17:35,292 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 16:17:35,293 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 16:17:35,293 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 16:17:35,293 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 16:17:35,293 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 16:17:35,293 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 760447de6aa5739f187553f004f72c898b25c540c6dba08996c9520ae7051de1 [2025-02-05 16:17:35,527 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 16:17:35,536 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 16:17:35,538 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 16:17:35,540 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 16:17:35,541 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 16:17:35,542 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_lcr.7.ufo.UNBOUNDED.pals.c [2025-02-05 16:17:36,752 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1b1b3c875/de8afd6dd3ff4793bb68e03245a49107/FLAGd4c222e5b [2025-02-05 16:17:37,029 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 16:17:37,030 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.7.ufo.UNBOUNDED.pals.c [2025-02-05 16:17:37,041 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1b1b3c875/de8afd6dd3ff4793bb68e03245a49107/FLAGd4c222e5b [2025-02-05 16:17:37,317 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1b1b3c875/de8afd6dd3ff4793bb68e03245a49107 [2025-02-05 16:17:37,319 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 16:17:37,320 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 16:17:37,321 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 16:17:37,321 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 16:17:37,324 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 16:17:37,325 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 04:17:37" (1/1) ... [2025-02-05 16:17:37,325 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17df6e52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:17:37, skipping insertion in model container [2025-02-05 16:17:37,325 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 04:17:37" (1/1) ... [2025-02-05 16:17:37,351 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 16:17:37,529 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.7.ufo.UNBOUNDED.pals.c[20047,20060] [2025-02-05 16:17:37,531 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 16:17:37,539 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 16:17:37,609 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.7.ufo.UNBOUNDED.pals.c[20047,20060] [2025-02-05 16:17:37,609 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 16:17:37,624 INFO L204 MainTranslator]: Completed translation [2025-02-05 16:17:37,625 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:17:37 WrapperNode [2025-02-05 16:17:37,625 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 16:17:37,626 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 16:17:37,627 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 16:17:37,627 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 16:17:37,631 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:17:37" (1/1) ... [2025-02-05 16:17:37,643 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:17:37" (1/1) ... [2025-02-05 16:17:37,676 INFO L138 Inliner]: procedures = 27, calls = 18, calls flagged for inlining = 13, calls inlined = 13, statements flattened = 455 [2025-02-05 16:17:37,677 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 16:17:37,677 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 16:17:37,677 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 16:17:37,677 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 16:17:37,683 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:17:37" (1/1) ... [2025-02-05 16:17:37,683 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:17:37" (1/1) ... [2025-02-05 16:17:37,685 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:17:37" (1/1) ... [2025-02-05 16:17:37,696 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-05 16:17:37,696 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:17:37" (1/1) ... [2025-02-05 16:17:37,696 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:17:37" (1/1) ... [2025-02-05 16:17:37,701 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:17:37" (1/1) ... [2025-02-05 16:17:37,703 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:17:37" (1/1) ... [2025-02-05 16:17:37,704 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:17:37" (1/1) ... [2025-02-05 16:17:37,704 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:17:37" (1/1) ... [2025-02-05 16:17:37,706 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 16:17:37,707 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 16:17:37,707 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 16:17:37,707 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 16:17:37,708 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:17:37" (1/1) ... [2025-02-05 16:17:37,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 16:17:37,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:17:37,743 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 16:17:37,746 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 16:17:37,766 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 16:17:37,766 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 16:17:37,766 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 16:17:37,766 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 16:17:37,842 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 16:17:37,844 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 16:17:38,214 INFO L? ?]: Removed 50 outVars from TransFormulas that were not future-live. [2025-02-05 16:17:38,214 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 16:17:38,222 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 16:17:38,222 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 16:17:38,223 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 04:17:38 BoogieIcfgContainer [2025-02-05 16:17:38,223 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 16:17:38,224 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 16:17:38,224 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 16:17:38,228 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 16:17:38,228 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 04:17:37" (1/3) ... [2025-02-05 16:17:38,228 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63e9a2a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 04:17:38, skipping insertion in model container [2025-02-05 16:17:38,228 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:17:37" (2/3) ... [2025-02-05 16:17:38,229 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63e9a2a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 04:17:38, skipping insertion in model container [2025-02-05 16:17:38,229 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 04:17:38" (3/3) ... [2025-02-05 16:17:38,230 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.7.ufo.UNBOUNDED.pals.c [2025-02-05 16:17:38,240 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 16:17:38,242 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.7.ufo.UNBOUNDED.pals.c that has 1 procedures, 115 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 16:17:38,291 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 16:17:38,301 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;@243c058d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 16:17:38,301 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 16:17:38,305 INFO L276 IsEmpty]: Start isEmpty. Operand has 115 states, 113 states have (on average 1.7787610619469028) internal successors, (201), 114 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:17:38,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-02-05 16:17:38,311 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:17:38,312 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] [2025-02-05 16:17:38,312 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:17:38,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:17:38,317 INFO L85 PathProgramCache]: Analyzing trace with hash 607750495, now seen corresponding path program 1 times [2025-02-05 16:17:38,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:17:38,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289651848] [2025-02-05 16:17:38,324 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:17:38,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:17:38,395 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-05 16:17:38,439 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-05 16:17:38,439 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:17:38,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:17:38,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:17:38,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:17:38,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289651848] [2025-02-05 16:17:38,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289651848] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:17:38,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:17:38,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 16:17:38,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719541973] [2025-02-05 16:17:38,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:17:38,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 16:17:38,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:17:38,572 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 16:17:38,573 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 16:17:38,575 INFO L87 Difference]: Start difference. First operand has 115 states, 113 states have (on average 1.7787610619469028) internal successors, (201), 114 states have internal predecessors, (201), 0 states have call successors, (0), 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 13.5) internal successors, (27), 2 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:17:38,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:17:38,597 INFO L93 Difference]: Finished difference Result 172 states and 294 transitions. [2025-02-05 16:17:38,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 16:17:38,599 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 0 states have call successors, (0), 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 27 [2025-02-05 16:17:38,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:17:38,604 INFO L225 Difference]: With dead ends: 172 [2025-02-05 16:17:38,606 INFO L226 Difference]: Without dead ends: 112 [2025-02-05 16:17:38,609 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-02-05 16:17:38,611 INFO L435 NwaCegarLoop]: 196 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, 196 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-02-05 16:17:38,613 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:17:38,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2025-02-05 16:17:38,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2025-02-05 16:17:38,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 111 states have (on average 1.7657657657657657) internal successors, (196), 111 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:17:38,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 196 transitions. [2025-02-05 16:17:38,646 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 196 transitions. Word has length 27 [2025-02-05 16:17:38,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:17:38,648 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 196 transitions. [2025-02-05 16:17:38,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:17:38,648 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 196 transitions. [2025-02-05 16:17:38,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-02-05 16:17:38,650 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:17:38,650 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] [2025-02-05 16:17:38,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 16:17:38,650 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:17:38,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:17:38,651 INFO L85 PathProgramCache]: Analyzing trace with hash -1430305794, now seen corresponding path program 1 times [2025-02-05 16:17:38,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:17:38,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334860651] [2025-02-05 16:17:38,652 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:17:38,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:17:38,689 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-05 16:17:38,715 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-05 16:17:38,715 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:17:38,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:17:38,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:17:38,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:17:38,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334860651] [2025-02-05 16:17:38,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334860651] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:17:38,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:17:38,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 16:17:38,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976034409] [2025-02-05 16:17:38,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:17:38,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:17:38,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:17:38,914 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:17:38,914 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:17:38,914 INFO L87 Difference]: Start difference. First operand 112 states and 196 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:17:38,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:17:38,995 INFO L93 Difference]: Finished difference Result 172 states and 290 transitions. [2025-02-05 16:17:38,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:17:38,998 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 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 27 [2025-02-05 16:17:38,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:17:38,998 INFO L225 Difference]: With dead ends: 172 [2025-02-05 16:17:38,999 INFO L226 Difference]: Without dead ends: 112 [2025-02-05 16:17:39,000 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:17:39,001 INFO L435 NwaCegarLoop]: 194 mSDtfsCounter, 0 mSDsluCounter, 527 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 721 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:17:39,001 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 721 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:17:39,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2025-02-05 16:17:39,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2025-02-05 16:17:39,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 111 states have (on average 1.3153153153153154) internal successors, (146), 111 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:17:39,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 146 transitions. [2025-02-05 16:17:39,011 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 146 transitions. Word has length 27 [2025-02-05 16:17:39,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:17:39,012 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 146 transitions. [2025-02-05 16:17:39,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:17:39,012 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 146 transitions. [2025-02-05 16:17:39,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-02-05 16:17:39,013 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:17:39,013 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] [2025-02-05 16:17:39,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 16:17:39,014 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:17:39,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:17:39,014 INFO L85 PathProgramCache]: Analyzing trace with hash 271306492, now seen corresponding path program 1 times [2025-02-05 16:17:39,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:17:39,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297817695] [2025-02-05 16:17:39,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:17:39,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:17:39,029 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-02-05 16:17:39,055 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-02-05 16:17:39,055 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:17:39,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:17:39,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:17:39,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:17:39,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297817695] [2025-02-05 16:17:39,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297817695] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:17:39,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:17:39,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 16:17:39,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859179211] [2025-02-05 16:17:39,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:17:39,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:17:39,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:17:39,320 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:17:39,320 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:17:39,320 INFO L87 Difference]: Start difference. First operand 112 states and 146 transitions. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:17:39,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:17:39,695 INFO L93 Difference]: Finished difference Result 896 states and 1406 transitions. [2025-02-05 16:17:39,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-05 16:17:39,696 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 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 76 [2025-02-05 16:17:39,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:17:39,702 INFO L225 Difference]: With dead ends: 896 [2025-02-05 16:17:39,704 INFO L226 Difference]: Without dead ends: 840 [2025-02-05 16:17:39,705 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=124, Invalid=256, Unknown=0, NotChecked=0, Total=380 [2025-02-05 16:17:39,707 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 1465 mSDsluCounter, 3104 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1465 SdHoareTripleChecker+Valid, 3244 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:17:39,707 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1465 Valid, 3244 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 262 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:17:39,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 840 states. [2025-02-05 16:17:39,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 840 to 166. [2025-02-05 16:17:39,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 165 states have (on average 1.412121212121212) internal successors, (233), 165 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:17:39,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 233 transitions. [2025-02-05 16:17:39,740 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 233 transitions. Word has length 76 [2025-02-05 16:17:39,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:17:39,740 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 233 transitions. [2025-02-05 16:17:39,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:17:39,740 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 233 transitions. [2025-02-05 16:17:39,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-02-05 16:17:39,741 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:17:39,741 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:17:39,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 16:17:39,742 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:17:39,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:17:39,742 INFO L85 PathProgramCache]: Analyzing trace with hash -147113033, now seen corresponding path program 1 times [2025-02-05 16:17:39,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:17:39,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425000226] [2025-02-05 16:17:39,742 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:17:39,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:17:39,756 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-02-05 16:17:39,772 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-02-05 16:17:39,773 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:17:39,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:17:39,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:17:39,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:17:39,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425000226] [2025-02-05 16:17:39,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425000226] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:17:39,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:17:39,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:17:39,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490955337] [2025-02-05 16:17:39,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:17:39,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:17:39,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:17:39,885 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:17:39,885 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:17:39,885 INFO L87 Difference]: Start difference. First operand 166 states and 233 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:17:39,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:17:39,912 INFO L93 Difference]: Finished difference Result 375 states and 568 transitions. [2025-02-05 16:17:39,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:17:39,912 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2025-02-05 16:17:39,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:17:39,913 INFO L225 Difference]: With dead ends: 375 [2025-02-05 16:17:39,913 INFO L226 Difference]: Without dead ends: 265 [2025-02-05 16:17:39,914 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:17:39,914 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 61 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:17:39,915 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 225 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:17:39,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2025-02-05 16:17:39,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 261. [2025-02-05 16:17:39,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 260 states have (on average 1.4730769230769232) internal successors, (383), 260 states have internal predecessors, (383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:17:39,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 383 transitions. [2025-02-05 16:17:39,929 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 383 transitions. Word has length 78 [2025-02-05 16:17:39,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:17:39,929 INFO L471 AbstractCegarLoop]: Abstraction has 261 states and 383 transitions. [2025-02-05 16:17:39,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:17:39,929 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 383 transitions. [2025-02-05 16:17:39,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-02-05 16:17:39,931 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:17:39,931 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:17:39,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 16:17:39,931 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:17:39,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:17:39,932 INFO L85 PathProgramCache]: Analyzing trace with hash -114789798, now seen corresponding path program 1 times [2025-02-05 16:17:39,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:17:39,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748761248] [2025-02-05 16:17:39,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:17:39,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:17:39,948 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-02-05 16:17:39,963 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-02-05 16:17:39,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:17:39,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:17:40,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:17:40,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:17:40,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748761248] [2025-02-05 16:17:40,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748761248] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:17:40,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:17:40,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 16:17:40,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521339162] [2025-02-05 16:17:40,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:17:40,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:17:40,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:17:40,332 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:17:40,332 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:17:40,332 INFO L87 Difference]: Start difference. First operand 261 states and 383 transitions. Second operand has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:17:40,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:17:40,611 INFO L93 Difference]: Finished difference Result 468 states and 711 transitions. [2025-02-05 16:17:40,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 16:17:40,611 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2025-02-05 16:17:40,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:17:40,613 INFO L225 Difference]: With dead ends: 468 [2025-02-05 16:17:40,613 INFO L226 Difference]: Without dead ends: 263 [2025-02-05 16:17:40,613 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2025-02-05 16:17:40,614 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 186 mSDsluCounter, 525 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 662 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:17:40,614 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 662 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:17:40,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2025-02-05 16:17:40,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 261. [2025-02-05 16:17:40,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 260 states have (on average 1.4653846153846153) internal successors, (381), 260 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:17:40,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 381 transitions. [2025-02-05 16:17:40,628 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 381 transitions. Word has length 78 [2025-02-05 16:17:40,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:17:40,628 INFO L471 AbstractCegarLoop]: Abstraction has 261 states and 381 transitions. [2025-02-05 16:17:40,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:17:40,628 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 381 transitions. [2025-02-05 16:17:40,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-02-05 16:17:40,630 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:17:40,630 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:17:40,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 16:17:40,630 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:17:40,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:17:40,631 INFO L85 PathProgramCache]: Analyzing trace with hash 767021291, now seen corresponding path program 1 times [2025-02-05 16:17:40,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:17:40,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846451018] [2025-02-05 16:17:40,631 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:17:40,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:17:40,647 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-02-05 16:17:40,685 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-02-05 16:17:40,686 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:17:40,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:17:40,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:17:40,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:17:40,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846451018] [2025-02-05 16:17:40,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846451018] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:17:40,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:17:40,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:17:40,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339221050] [2025-02-05 16:17:40,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:17:40,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 16:17:40,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:17:40,911 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 16:17:40,911 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-05 16:17:40,911 INFO L87 Difference]: Start difference. First operand 261 states and 381 transitions. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:17:40,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:17:40,954 INFO L93 Difference]: Finished difference Result 269 states and 390 transitions. [2025-02-05 16:17:40,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 16:17:40,954 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2025-02-05 16:17:40,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:17:40,955 INFO L225 Difference]: With dead ends: 269 [2025-02-05 16:17:40,957 INFO L226 Difference]: Without dead ends: 267 [2025-02-05 16:17:40,957 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-05 16:17:40,958 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 0 mSDsluCounter, 827 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 967 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:17:40,958 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 967 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:17:40,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2025-02-05 16:17:40,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 267. [2025-02-05 16:17:40,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 266 states have (on average 1.4511278195488722) internal successors, (386), 266 states have internal predecessors, (386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:17:40,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 386 transitions. [2025-02-05 16:17:40,969 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 386 transitions. Word has length 79 [2025-02-05 16:17:40,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:17:40,970 INFO L471 AbstractCegarLoop]: Abstraction has 267 states and 386 transitions. [2025-02-05 16:17:40,971 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:17:40,971 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 386 transitions. [2025-02-05 16:17:40,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-02-05 16:17:40,972 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:17:40,972 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:17:40,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 16:17:40,973 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:17:40,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:17:40,973 INFO L85 PathProgramCache]: Analyzing trace with hash 1842638168, now seen corresponding path program 1 times [2025-02-05 16:17:40,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:17:40,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040892197] [2025-02-05 16:17:40,973 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:17:40,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:17:40,990 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-02-05 16:17:41,000 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-02-05 16:17:41,001 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:17:41,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:17:41,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:17:41,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:17:41,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040892197] [2025-02-05 16:17:41,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040892197] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:17:41,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:17:41,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:17:41,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252820958] [2025-02-05 16:17:41,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:17:41,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:17:41,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:17:41,046 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:17:41,046 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:17:41,046 INFO L87 Difference]: Start difference. First operand 267 states and 386 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:17:41,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:17:41,069 INFO L93 Difference]: Finished difference Result 673 states and 1018 transitions. [2025-02-05 16:17:41,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:17:41,069 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2025-02-05 16:17:41,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:17:41,071 INFO L225 Difference]: With dead ends: 673 [2025-02-05 16:17:41,071 INFO L226 Difference]: Without dead ends: 462 [2025-02-05 16:17:41,072 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:17:41,075 INFO L435 NwaCegarLoop]: 213 mSDtfsCounter, 78 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:17:41,075 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 308 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:17:41,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2025-02-05 16:17:41,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 460. [2025-02-05 16:17:41,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 460 states, 459 states have (on average 1.4880174291938997) internal successors, (683), 459 states have internal predecessors, (683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:17:41,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 683 transitions. [2025-02-05 16:17:41,096 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 683 transitions. Word has length 80 [2025-02-05 16:17:41,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:17:41,096 INFO L471 AbstractCegarLoop]: Abstraction has 460 states and 683 transitions. [2025-02-05 16:17:41,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:17:41,096 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 683 transitions. [2025-02-05 16:17:41,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-02-05 16:17:41,097 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:17:41,097 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:17:41,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 16:17:41,098 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:17:41,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:17:41,098 INFO L85 PathProgramCache]: Analyzing trace with hash 1688269336, now seen corresponding path program 1 times [2025-02-05 16:17:41,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:17:41,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465643824] [2025-02-05 16:17:41,099 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:17:41,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:17:41,116 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-02-05 16:17:41,124 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-02-05 16:17:41,125 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:17:41,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:17:41,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:17:41,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:17:41,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465643824] [2025-02-05 16:17:41,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465643824] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:17:41,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:17:41,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:17:41,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308381417] [2025-02-05 16:17:41,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:17:41,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:17:41,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:17:41,163 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:17:41,163 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:17:41,164 INFO L87 Difference]: Start difference. First operand 460 states and 683 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:17:41,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:17:41,182 INFO L93 Difference]: Finished difference Result 1236 states and 1881 transitions. [2025-02-05 16:17:41,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:17:41,182 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2025-02-05 16:17:41,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:17:41,185 INFO L225 Difference]: With dead ends: 1236 [2025-02-05 16:17:41,185 INFO L226 Difference]: Without dead ends: 832 [2025-02-05 16:17:41,186 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:17:41,186 INFO L435 NwaCegarLoop]: 211 mSDtfsCounter, 76 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:17:41,186 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 310 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:17:41,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 832 states. [2025-02-05 16:17:41,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 832 to 830. [2025-02-05 16:17:41,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 830 states, 829 states have (on average 1.5018094089264173) internal successors, (1245), 829 states have internal predecessors, (1245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:17:41,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 830 states to 830 states and 1245 transitions. [2025-02-05 16:17:41,203 INFO L78 Accepts]: Start accepts. Automaton has 830 states and 1245 transitions. Word has length 80 [2025-02-05 16:17:41,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:17:41,203 INFO L471 AbstractCegarLoop]: Abstraction has 830 states and 1245 transitions. [2025-02-05 16:17:41,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:17:41,203 INFO L276 IsEmpty]: Start isEmpty. Operand 830 states and 1245 transitions. [2025-02-05 16:17:41,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-02-05 16:17:41,204 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:17:41,204 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:17:41,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 16:17:41,204 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:17:41,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:17:41,204 INFO L85 PathProgramCache]: Analyzing trace with hash 709338840, now seen corresponding path program 1 times [2025-02-05 16:17:41,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:17:41,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140055356] [2025-02-05 16:17:41,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:17:41,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:17:41,217 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-02-05 16:17:41,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-02-05 16:17:41,224 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:17:41,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:17:41,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:17:41,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:17:41,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140055356] [2025-02-05 16:17:41,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140055356] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:17:41,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:17:41,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:17:41,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200568083] [2025-02-05 16:17:41,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:17:41,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:17:41,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:17:41,259 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:17:41,260 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:17:41,260 INFO L87 Difference]: Start difference. First operand 830 states and 1245 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:17:41,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:17:41,296 INFO L93 Difference]: Finished difference Result 2314 states and 3511 transitions. [2025-02-05 16:17:41,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:17:41,296 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2025-02-05 16:17:41,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:17:41,301 INFO L225 Difference]: With dead ends: 2314 [2025-02-05 16:17:41,302 INFO L226 Difference]: Without dead ends: 1540 [2025-02-05 16:17:41,302 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:17:41,303 INFO L435 NwaCegarLoop]: 209 mSDtfsCounter, 74 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:17:41,303 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 312 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:17:41,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1540 states. [2025-02-05 16:17:41,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1540 to 1538. [2025-02-05 16:17:41,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1538 states, 1537 states have (on average 1.4996746909564085) internal successors, (2305), 1537 states have internal predecessors, (2305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:17:41,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1538 states to 1538 states and 2305 transitions. [2025-02-05 16:17:41,343 INFO L78 Accepts]: Start accepts. Automaton has 1538 states and 2305 transitions. Word has length 80 [2025-02-05 16:17:41,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:17:41,344 INFO L471 AbstractCegarLoop]: Abstraction has 1538 states and 2305 transitions. [2025-02-05 16:17:41,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:17:41,344 INFO L276 IsEmpty]: Start isEmpty. Operand 1538 states and 2305 transitions. [2025-02-05 16:17:41,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-02-05 16:17:41,347 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:17:41,347 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:17:41,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 16:17:41,348 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:17:41,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:17:41,349 INFO L85 PathProgramCache]: Analyzing trace with hash 261393304, now seen corresponding path program 1 times [2025-02-05 16:17:41,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:17:41,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390011938] [2025-02-05 16:17:41,349 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:17:41,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:17:41,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-02-05 16:17:41,365 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-02-05 16:17:41,365 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:17:41,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:17:41,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:17:41,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:17:41,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390011938] [2025-02-05 16:17:41,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390011938] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:17:41,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:17:41,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:17:41,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033959720] [2025-02-05 16:17:41,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:17:41,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:17:41,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:17:41,398 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:17:41,399 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:17:41,399 INFO L87 Difference]: Start difference. First operand 1538 states and 2305 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:17:41,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:17:41,439 INFO L93 Difference]: Finished difference Result 4374 states and 6579 transitions. [2025-02-05 16:17:41,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:17:41,440 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2025-02-05 16:17:41,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:17:41,449 INFO L225 Difference]: With dead ends: 4374 [2025-02-05 16:17:41,449 INFO L226 Difference]: Without dead ends: 2892 [2025-02-05 16:17:41,451 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:17:41,452 INFO L435 NwaCegarLoop]: 207 mSDtfsCounter, 72 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:17:41,452 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 314 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:17:41,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2892 states. [2025-02-05 16:17:41,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2892 to 2890. [2025-02-05 16:17:41,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2890 states, 2889 states have (on average 1.4873658705434407) internal successors, (4297), 2889 states have internal predecessors, (4297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:17:41,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2890 states to 2890 states and 4297 transitions. [2025-02-05 16:17:41,517 INFO L78 Accepts]: Start accepts. Automaton has 2890 states and 4297 transitions. Word has length 80 [2025-02-05 16:17:41,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:17:41,518 INFO L471 AbstractCegarLoop]: Abstraction has 2890 states and 4297 transitions. [2025-02-05 16:17:41,518 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:17:41,518 INFO L276 IsEmpty]: Start isEmpty. Operand 2890 states and 4297 transitions. [2025-02-05 16:17:41,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-02-05 16:17:41,518 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:17:41,518 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:17:41,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 16:17:41,519 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:17:41,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:17:41,519 INFO L85 PathProgramCache]: Analyzing trace with hash 676569176, now seen corresponding path program 1 times [2025-02-05 16:17:41,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:17:41,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179770738] [2025-02-05 16:17:41,519 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:17:41,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:17:41,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-02-05 16:17:41,533 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-02-05 16:17:41,533 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:17:41,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:17:41,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:17:41,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:17:41,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179770738] [2025-02-05 16:17:41,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179770738] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:17:41,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:17:41,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:17:41,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628047060] [2025-02-05 16:17:41,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:17:41,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:17:41,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:17:41,580 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:17:41,580 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:17:41,581 INFO L87 Difference]: Start difference. First operand 2890 states and 4297 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:17:41,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:17:41,651 INFO L93 Difference]: Finished difference Result 8302 states and 12331 transitions. [2025-02-05 16:17:41,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:17:41,651 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2025-02-05 16:17:41,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:17:41,668 INFO L225 Difference]: With dead ends: 8302 [2025-02-05 16:17:41,668 INFO L226 Difference]: Without dead ends: 5468 [2025-02-05 16:17:41,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-02-05 16:17:41,674 INFO L435 NwaCegarLoop]: 205 mSDtfsCounter, 70 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:17:41,674 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 316 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:17:41,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5468 states. [2025-02-05 16:17:41,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5468 to 5466. [2025-02-05 16:17:41,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5466 states, 5465 states have (on average 1.4684354986276305) internal successors, (8025), 5465 states have internal predecessors, (8025), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:17:41,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5466 states to 5466 states and 8025 transitions. [2025-02-05 16:17:41,839 INFO L78 Accepts]: Start accepts. Automaton has 5466 states and 8025 transitions. Word has length 80 [2025-02-05 16:17:41,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:17:41,839 INFO L471 AbstractCegarLoop]: Abstraction has 5466 states and 8025 transitions. [2025-02-05 16:17:41,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:17:41,839 INFO L276 IsEmpty]: Start isEmpty. Operand 5466 states and 8025 transitions. [2025-02-05 16:17:41,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-02-05 16:17:41,840 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:17:41,840 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:17:41,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 16:17:41,840 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:17:41,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:17:41,840 INFO L85 PathProgramCache]: Analyzing trace with hash 189850904, now seen corresponding path program 1 times [2025-02-05 16:17:41,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:17:41,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714135456] [2025-02-05 16:17:41,840 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:17:41,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:17:41,849 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-02-05 16:17:41,856 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-02-05 16:17:41,856 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:17:41,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:17:41,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:17:41,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:17:41,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714135456] [2025-02-05 16:17:41,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714135456] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:17:41,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:17:41,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:17:41,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663341559] [2025-02-05 16:17:41,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:17:41,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:17:41,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:17:41,888 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:17:41,888 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:17:41,888 INFO L87 Difference]: Start difference. First operand 5466 states and 8025 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:17:42,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:17:42,024 INFO L93 Difference]: Finished difference Result 15774 states and 23067 transitions. [2025-02-05 16:17:42,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:17:42,025 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2025-02-05 16:17:42,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:17:42,056 INFO L225 Difference]: With dead ends: 15774 [2025-02-05 16:17:42,057 INFO L226 Difference]: Without dead ends: 10364 [2025-02-05 16:17:42,066 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:17:42,066 INFO L435 NwaCegarLoop]: 203 mSDtfsCounter, 68 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:17:42,067 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 318 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:17:42,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10364 states. [2025-02-05 16:17:42,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10364 to 10362. [2025-02-05 16:17:42,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10362 states, 10361 states have (on average 1.444744715761027) internal successors, (14969), 10361 states have internal predecessors, (14969), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:17:42,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10362 states to 10362 states and 14969 transitions. [2025-02-05 16:17:42,410 INFO L78 Accepts]: Start accepts. Automaton has 10362 states and 14969 transitions. Word has length 80 [2025-02-05 16:17:42,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:17:42,410 INFO L471 AbstractCegarLoop]: Abstraction has 10362 states and 14969 transitions. [2025-02-05 16:17:42,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:17:42,410 INFO L276 IsEmpty]: Start isEmpty. Operand 10362 states and 14969 transitions. [2025-02-05 16:17:42,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-02-05 16:17:42,413 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:17:42,414 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] [2025-02-05 16:17:42,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 16:17:42,414 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:17:42,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:17:42,414 INFO L85 PathProgramCache]: Analyzing trace with hash -100597000, now seen corresponding path program 1 times [2025-02-05 16:17:42,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:17:42,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018801357] [2025-02-05 16:17:42,415 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:17:42,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:17:42,424 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-02-05 16:17:42,428 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-02-05 16:17:42,429 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:17:42,429 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:17:42,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-02-05 16:17:42,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:17:42,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018801357] [2025-02-05 16:17:42,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018801357] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:17:42,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:17:42,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:17:42,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282024454] [2025-02-05 16:17:42,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:17:42,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:17:42,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:17:42,465 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:17:42,465 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:17:42,466 INFO L87 Difference]: Start difference. First operand 10362 states and 14969 transitions. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:17:42,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:17:42,668 INFO L93 Difference]: Finished difference Result 21121 states and 30719 transitions. [2025-02-05 16:17:42,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:17:42,669 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 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 82 [2025-02-05 16:17:42,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:17:42,717 INFO L225 Difference]: With dead ends: 21121 [2025-02-05 16:17:42,717 INFO L226 Difference]: Without dead ends: 15358 [2025-02-05 16:17:42,730 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:17:42,731 INFO L435 NwaCegarLoop]: 218 mSDtfsCounter, 77 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:17:42,731 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 309 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:17:42,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15358 states. [2025-02-05 16:17:43,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15358 to 15356. [2025-02-05 16:17:43,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15356 states, 15355 states have (on average 1.4376424617388472) internal successors, (22075), 15355 states have internal predecessors, (22075), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:17:43,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15356 states to 15356 states and 22075 transitions. [2025-02-05 16:17:43,172 INFO L78 Accepts]: Start accepts. Automaton has 15356 states and 22075 transitions. Word has length 82 [2025-02-05 16:17:43,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:17:43,172 INFO L471 AbstractCegarLoop]: Abstraction has 15356 states and 22075 transitions. [2025-02-05 16:17:43,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:17:43,172 INFO L276 IsEmpty]: Start isEmpty. Operand 15356 states and 22075 transitions. [2025-02-05 16:17:43,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-02-05 16:17:43,176 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:17:43,176 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:17:43,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 16:17:43,177 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:17:43,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:17:43,177 INFO L85 PathProgramCache]: Analyzing trace with hash -674216713, now seen corresponding path program 1 times [2025-02-05 16:17:43,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:17:43,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21224454] [2025-02-05 16:17:43,177 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:17:43,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:17:43,189 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-02-05 16:17:43,199 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-02-05 16:17:43,199 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:17:43,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:17:43,413 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 16:17:43,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:17:43,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21224454] [2025-02-05 16:17:43,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21224454] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:17:43,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:17:43,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 16:17:43,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707044889] [2025-02-05 16:17:43,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:17:43,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:17:43,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:17:43,414 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:17:43,414 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:17:43,415 INFO L87 Difference]: Start difference. First operand 15356 states and 22075 transitions. Second operand has 9 states, 9 states have (on average 11.11111111111111) internal successors, (100), 9 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:17:44,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:17:44,751 INFO L93 Difference]: Finished difference Result 125580 states and 180547 transitions. [2025-02-05 16:17:44,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 16:17:44,752 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.11111111111111) internal successors, (100), 9 states have internal predecessors, (100), 0 states have call successors, (0), 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 103 [2025-02-05 16:17:44,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:17:45,000 INFO L225 Difference]: With dead ends: 125580 [2025-02-05 16:17:45,000 INFO L226 Difference]: Without dead ends: 110282 [2025-02-05 16:17:45,047 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2025-02-05 16:17:45,048 INFO L435 NwaCegarLoop]: 238 mSDtfsCounter, 1197 mSDsluCounter, 1484 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1197 SdHoareTripleChecker+Valid, 1722 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:17:45,048 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1197 Valid, 1722 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:17:45,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110282 states. [2025-02-05 16:17:46,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110282 to 30652. [2025-02-05 16:17:46,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30652 states, 30651 states have (on average 1.432220808456494) internal successors, (43899), 30651 states have internal predecessors, (43899), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:17:46,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30652 states to 30652 states and 43899 transitions. [2025-02-05 16:17:46,437 INFO L78 Accepts]: Start accepts. Automaton has 30652 states and 43899 transitions. Word has length 103 [2025-02-05 16:17:46,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:17:46,438 INFO L471 AbstractCegarLoop]: Abstraction has 30652 states and 43899 transitions. [2025-02-05 16:17:46,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.11111111111111) internal successors, (100), 9 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:17:46,438 INFO L276 IsEmpty]: Start isEmpty. Operand 30652 states and 43899 transitions. [2025-02-05 16:17:46,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-02-05 16:17:46,444 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:17:46,444 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:17:46,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 16:17:46,444 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:17:46,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:17:46,445 INFO L85 PathProgramCache]: Analyzing trace with hash -828585545, now seen corresponding path program 1 times [2025-02-05 16:17:46,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:17:46,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234377784] [2025-02-05 16:17:46,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:17:46,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:17:46,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-02-05 16:17:46,475 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-02-05 16:17:46,475 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:17:46,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:17:46,666 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-05 16:17:46,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:17:46,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234377784] [2025-02-05 16:17:46,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234377784] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:17:46,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:17:46,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 16:17:46,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875875519] [2025-02-05 16:17:46,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:17:46,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:17:46,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:17:46,670 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:17:46,670 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:17:46,670 INFO L87 Difference]: Start difference. First operand 30652 states and 43899 transitions. Second operand has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 9 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:17:48,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:17:48,224 INFO L93 Difference]: Finished difference Result 140876 states and 202371 transitions. [2025-02-05 16:17:48,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 16:17:48,225 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 9 states have internal predecessors, (98), 0 states have call successors, (0), 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 103 [2025-02-05 16:17:48,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:17:48,432 INFO L225 Difference]: With dead ends: 140876 [2025-02-05 16:17:48,432 INFO L226 Difference]: Without dead ends: 125578 [2025-02-05 16:17:48,461 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2025-02-05 16:17:48,462 INFO L435 NwaCegarLoop]: 235 mSDtfsCounter, 1218 mSDsluCounter, 1382 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1218 SdHoareTripleChecker+Valid, 1617 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:17:48,462 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1218 Valid, 1617 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:17:48,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125578 states. [2025-02-05 16:17:49,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125578 to 53628. [2025-02-05 16:17:49,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53628 states, 53627 states have (on average 1.4260540399425663) internal successors, (76475), 53627 states have internal predecessors, (76475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:17:50,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53628 states to 53628 states and 76475 transitions. [2025-02-05 16:17:50,098 INFO L78 Accepts]: Start accepts. Automaton has 53628 states and 76475 transitions. Word has length 103 [2025-02-05 16:17:50,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:17:50,100 INFO L471 AbstractCegarLoop]: Abstraction has 53628 states and 76475 transitions. [2025-02-05 16:17:50,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 9 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:17:50,100 INFO L276 IsEmpty]: Start isEmpty. Operand 53628 states and 76475 transitions. [2025-02-05 16:17:50,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-02-05 16:17:50,106 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:17:50,106 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:17:50,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 16:17:50,106 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:17:50,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:17:50,107 INFO L85 PathProgramCache]: Analyzing trace with hash -1807516041, now seen corresponding path program 1 times [2025-02-05 16:17:50,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:17:50,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512929783] [2025-02-05 16:17:50,107 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:17:50,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:17:50,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-02-05 16:17:50,138 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-02-05 16:17:50,138 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:17:50,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:17:50,332 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-05 16:17:50,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:17:50,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512929783] [2025-02-05 16:17:50,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512929783] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:17:50,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:17:50,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 16:17:50,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309209738] [2025-02-05 16:17:50,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:17:50,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:17:50,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:17:50,334 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:17:50,334 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:17:50,334 INFO L87 Difference]: Start difference. First operand 53628 states and 76475 transitions. Second operand has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:17:52,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:17:52,473 INFO L93 Difference]: Finished difference Result 156172 states and 224195 transitions. [2025-02-05 16:17:52,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 16:17:52,473 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 states have internal predecessors, (96), 0 states have call successors, (0), 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 103 [2025-02-05 16:17:52,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:17:52,657 INFO L225 Difference]: With dead ends: 156172 [2025-02-05 16:17:52,657 INFO L226 Difference]: Without dead ends: 140874 [2025-02-05 16:17:52,690 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2025-02-05 16:17:52,690 INFO L435 NwaCegarLoop]: 232 mSDtfsCounter, 1263 mSDsluCounter, 1279 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1263 SdHoareTripleChecker+Valid, 1511 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:17:52,690 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1263 Valid, 1511 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:17:52,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140874 states. [2025-02-05 16:17:54,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140874 to 68924. [2025-02-05 16:17:54,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68924 states, 68923 states have (on average 1.4262147614004033) internal successors, (98299), 68923 states have internal predecessors, (98299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:17:54,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68924 states to 68924 states and 98299 transitions. [2025-02-05 16:17:54,384 INFO L78 Accepts]: Start accepts. Automaton has 68924 states and 98299 transitions. Word has length 103 [2025-02-05 16:17:54,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:17:54,384 INFO L471 AbstractCegarLoop]: Abstraction has 68924 states and 98299 transitions. [2025-02-05 16:17:54,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:17:54,384 INFO L276 IsEmpty]: Start isEmpty. Operand 68924 states and 98299 transitions. [2025-02-05 16:17:54,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-02-05 16:17:54,389 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:17:54,390 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:17:54,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 16:17:54,390 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:17:54,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:17:54,391 INFO L85 PathProgramCache]: Analyzing trace with hash 2039505719, now seen corresponding path program 1 times [2025-02-05 16:17:54,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:17:54,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371272218] [2025-02-05 16:17:54,391 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:17:54,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:17:54,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-02-05 16:17:54,409 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-02-05 16:17:54,409 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:17:54,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:17:54,548 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-05 16:17:54,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:17:54,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371272218] [2025-02-05 16:17:54,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371272218] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:17:54,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:17:54,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 16:17:54,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115375102] [2025-02-05 16:17:54,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:17:54,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:17:54,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:17:54,549 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:17:54,549 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:17:54,549 INFO L87 Difference]: Start difference. First operand 68924 states and 98299 transitions. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:17:57,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:17:57,530 INFO L93 Difference]: Finished difference Result 171468 states and 246019 transitions. [2025-02-05 16:17:57,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 16:17:57,531 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 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 103 [2025-02-05 16:17:57,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:17:57,771 INFO L225 Difference]: With dead ends: 171468 [2025-02-05 16:17:57,771 INFO L226 Difference]: Without dead ends: 156170 [2025-02-05 16:17:57,826 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2025-02-05 16:17:57,827 INFO L435 NwaCegarLoop]: 229 mSDtfsCounter, 1309 mSDsluCounter, 1274 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1309 SdHoareTripleChecker+Valid, 1503 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:17:57,827 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1309 Valid, 1503 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:17:57,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156170 states. [2025-02-05 16:18:00,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156170 to 84220. [2025-02-05 16:18:00,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84220 states, 84219 states have (on average 1.4263171018416272) internal successors, (120123), 84219 states have internal predecessors, (120123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:18:00,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84220 states to 84220 states and 120123 transitions. [2025-02-05 16:18:00,321 INFO L78 Accepts]: Start accepts. Automaton has 84220 states and 120123 transitions. Word has length 103 [2025-02-05 16:18:00,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:18:00,321 INFO L471 AbstractCegarLoop]: Abstraction has 84220 states and 120123 transitions. [2025-02-05 16:18:00,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:18:00,321 INFO L276 IsEmpty]: Start isEmpty. Operand 84220 states and 120123 transitions. [2025-02-05 16:18:00,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-02-05 16:18:00,326 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:18:00,326 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:18:00,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 16:18:00,327 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:18:00,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:18:00,327 INFO L85 PathProgramCache]: Analyzing trace with hash -1840285705, now seen corresponding path program 1 times [2025-02-05 16:18:00,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:18:00,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978331397] [2025-02-05 16:18:00,328 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:18:00,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:18:00,339 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-02-05 16:18:00,348 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-02-05 16:18:00,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:18:00,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:18:00,512 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-05 16:18:00,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:18:00,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978331397] [2025-02-05 16:18:00,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978331397] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:18:00,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:18:00,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 16:18:00,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577716974] [2025-02-05 16:18:00,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:18:00,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:18:00,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:18:00,513 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:18:00,513 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:18:00,514 INFO L87 Difference]: Start difference. First operand 84220 states and 120123 transitions. Second operand has 9 states, 9 states have (on average 10.222222222222221) internal successors, (92), 9 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:18:03,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:18:03,652 INFO L93 Difference]: Finished difference Result 186764 states and 267843 transitions. [2025-02-05 16:18:03,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 16:18:03,652 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.222222222222221) internal successors, (92), 9 states have internal predecessors, (92), 0 states have call successors, (0), 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 103 [2025-02-05 16:18:03,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:18:03,894 INFO L225 Difference]: With dead ends: 186764 [2025-02-05 16:18:03,894 INFO L226 Difference]: Without dead ends: 171466 [2025-02-05 16:18:03,935 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2025-02-05 16:18:03,936 INFO L435 NwaCegarLoop]: 226 mSDtfsCounter, 1372 mSDsluCounter, 1307 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1372 SdHoareTripleChecker+Valid, 1533 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:18:03,936 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1372 Valid, 1533 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:18:04,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171466 states. [2025-02-05 16:18:06,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171466 to 99516. [2025-02-05 16:18:06,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99516 states, 99515 states have (on average 1.4263879817112999) internal successors, (141947), 99515 states have internal predecessors, (141947), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:18:06,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99516 states to 99516 states and 141947 transitions. [2025-02-05 16:18:06,511 INFO L78 Accepts]: Start accepts. Automaton has 99516 states and 141947 transitions. Word has length 103 [2025-02-05 16:18:06,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:18:06,511 INFO L471 AbstractCegarLoop]: Abstraction has 99516 states and 141947 transitions. [2025-02-05 16:18:06,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.222222222222221) internal successors, (92), 9 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:18:06,511 INFO L276 IsEmpty]: Start isEmpty. Operand 99516 states and 141947 transitions. [2025-02-05 16:18:06,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-02-05 16:18:06,516 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:18:06,516 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:18:06,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-05 16:18:06,516 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:18:06,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:18:06,517 INFO L85 PathProgramCache]: Analyzing trace with hash 1967963319, now seen corresponding path program 1 times [2025-02-05 16:18:06,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:18:06,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747481992] [2025-02-05 16:18:06,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:18:06,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:18:06,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-02-05 16:18:06,536 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-02-05 16:18:06,536 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:18:06,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:18:06,663 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-02-05 16:18:06,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:18:06,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747481992] [2025-02-05 16:18:06,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747481992] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:18:06,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:18:06,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 16:18:06,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211476710] [2025-02-05 16:18:06,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:18:06,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:18:06,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:18:06,665 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:18:06,665 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:18:06,665 INFO L87 Difference]: Start difference. First operand 99516 states and 141947 transitions. Second operand has 9 states, 9 states have (on average 10.0) internal successors, (90), 9 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:18:09,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:18:09,494 INFO L93 Difference]: Finished difference Result 202060 states and 289667 transitions. [2025-02-05 16:18:09,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 16:18:09,495 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.0) internal successors, (90), 9 states have internal predecessors, (90), 0 states have call successors, (0), 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 103 [2025-02-05 16:18:09,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:18:09,752 INFO L225 Difference]: With dead ends: 202060 [2025-02-05 16:18:09,752 INFO L226 Difference]: Without dead ends: 186762 [2025-02-05 16:18:09,806 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2025-02-05 16:18:09,806 INFO L435 NwaCegarLoop]: 235 mSDtfsCounter, 1217 mSDsluCounter, 1445 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1217 SdHoareTripleChecker+Valid, 1680 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:18:09,807 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1217 Valid, 1680 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:18:09,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186762 states.