./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem13_label00.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/eca-rers2012/Problem13_label00.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 1908a46c2d6c2885901135dd96252b8ed820acb687d93cae536846c5c1656ef1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 11:41:00,615 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 11:41:00,649 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 11:41:00,653 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 11:41:00,653 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 11:41:00,667 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 11:41:00,667 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 11:41:00,667 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 11:41:00,668 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 11:41:00,668 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 11:41:00,668 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 11:41:00,668 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 11:41:00,668 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 11:41:00,668 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 11:41:00,668 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 11:41:00,668 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 11:41:00,668 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 11:41:00,668 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 11:41:00,668 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 11:41:00,668 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 11:41:00,668 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 11:41:00,668 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 11:41:00,669 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 11:41:00,669 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 11:41:00,669 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 11:41:00,669 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 11:41:00,669 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 11:41:00,669 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 11:41:00,669 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 11:41:00,669 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 11:41:00,669 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 11:41:00,669 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 11:41:00,669 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 11:41:00,669 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 11:41:00,669 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 11:41:00,669 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 11:41:00,669 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 11:41:00,669 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 11:41:00,669 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 11:41:00,669 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 11:41:00,669 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 11:41:00,669 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 11:41:00,670 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 11:41:00,670 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 -> 1908a46c2d6c2885901135dd96252b8ed820acb687d93cae536846c5c1656ef1 [2025-02-05 11:41:00,877 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 11:41:00,882 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 11:41:00,883 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 11:41:00,884 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 11:41:00,884 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 11:41:00,885 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem13_label00.c [2025-02-05 11:41:01,958 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f53c14272/9f97725cfc6740189242fb59ef45eda9/FLAGd2b955eca [2025-02-05 11:41:02,490 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 11:41:02,491 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label00.c [2025-02-05 11:41:02,527 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f53c14272/9f97725cfc6740189242fb59ef45eda9/FLAGd2b955eca [2025-02-05 11:41:02,548 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f53c14272/9f97725cfc6740189242fb59ef45eda9 [2025-02-05 11:41:02,550 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 11:41:02,551 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 11:41:02,553 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 11:41:02,553 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 11:41:02,556 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 11:41:02,557 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 11:41:02" (1/1) ... [2025-02-05 11:41:02,557 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e94045c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:41:02, skipping insertion in model container [2025-02-05 11:41:02,559 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 11:41:02" (1/1) ... [2025-02-05 11:41:02,662 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 11:41:02,857 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/eca-rers2012/Problem13_label00.c[5434,5447] [2025-02-05 11:41:03,384 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 11:41:03,394 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 11:41:03,411 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/eca-rers2012/Problem13_label00.c[5434,5447] [2025-02-05 11:41:03,680 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 11:41:03,698 INFO L204 MainTranslator]: Completed translation [2025-02-05 11:41:03,698 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:41:03 WrapperNode [2025-02-05 11:41:03,699 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 11:41:03,700 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 11:41:03,700 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 11:41:03,700 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 11:41:03,704 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:41:03" (1/1) ... [2025-02-05 11:41:03,797 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:41:03" (1/1) ... [2025-02-05 11:41:04,187 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 5584 [2025-02-05 11:41:04,187 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 11:41:04,188 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 11:41:04,188 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 11:41:04,188 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 11:41:04,194 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:41:03" (1/1) ... [2025-02-05 11:41:04,195 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:41:03" (1/1) ... [2025-02-05 11:41:04,252 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:41:03" (1/1) ... [2025-02-05 11:41:04,464 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 11:41:04,464 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:41:03" (1/1) ... [2025-02-05 11:41:04,464 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:41:03" (1/1) ... [2025-02-05 11:41:04,562 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:41:03" (1/1) ... [2025-02-05 11:41:04,579 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:41:03" (1/1) ... [2025-02-05 11:41:04,599 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:41:03" (1/1) ... [2025-02-05 11:41:04,620 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:41:03" (1/1) ... [2025-02-05 11:41:04,667 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 11:41:04,669 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 11:41:04,669 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 11:41:04,669 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 11:41:04,670 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:41:03" (1/1) ... [2025-02-05 11:41:04,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 11:41:04,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:41:04,723 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 11:41:04,729 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 11:41:04,746 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 11:41:04,746 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 11:41:04,746 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 11:41:04,746 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 11:41:04,804 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 11:41:04,805 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 11:41:08,589 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1894: havoc calculate_output_#t~ret9#1; [2025-02-05 11:41:08,589 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3629: havoc calculate_output2_#t~ret10#1; [2025-02-05 11:41:08,589 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5351: havoc calculate_output3_#t~ret11#1; [2025-02-05 11:41:08,736 INFO L? ?]: Removed 738 outVars from TransFormulas that were not future-live. [2025-02-05 11:41:08,736 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 11:41:08,769 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 11:41:08,769 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 11:41:08,769 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 11:41:08 BoogieIcfgContainer [2025-02-05 11:41:08,769 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 11:41:08,775 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 11:41:08,775 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 11:41:08,778 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 11:41:08,778 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 11:41:02" (1/3) ... [2025-02-05 11:41:08,779 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d9fe480 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 11:41:08, skipping insertion in model container [2025-02-05 11:41:08,779 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:41:03" (2/3) ... [2025-02-05 11:41:08,779 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d9fe480 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 11:41:08, skipping insertion in model container [2025-02-05 11:41:08,780 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 11:41:08" (3/3) ... [2025-02-05 11:41:08,781 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem13_label00.c [2025-02-05 11:41:08,792 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 11:41:08,794 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem13_label00.c that has 1 procedures, 1098 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 11:41:08,866 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 11:41:08,874 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;@631d96a2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 11:41:08,875 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 11:41:08,882 INFO L276 IsEmpty]: Start isEmpty. Operand has 1098 states, 1096 states have (on average 1.8266423357664234) internal successors, (2002), 1097 states have internal predecessors, (2002), 0 states have call successors, (0), 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 11:41:08,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-02-05 11:41:08,887 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:41:08,888 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:41:08,888 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:41:08,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:41:08,892 INFO L85 PathProgramCache]: Analyzing trace with hash 2075515484, now seen corresponding path program 1 times [2025-02-05 11:41:08,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:41:08,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066546313] [2025-02-05 11:41:08,897 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:41:08,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:41:08,946 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-02-05 11:41:08,973 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-02-05 11:41:08,974 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:41:08,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:41:09,304 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 11:41:09,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:41:09,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066546313] [2025-02-05 11:41:09,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066546313] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:41:09,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:41:09,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:41:09,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414636866] [2025-02-05 11:41:09,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:41:09,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 11:41:09,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:41:09,328 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 11:41:09,328 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 11:41:09,333 INFO L87 Difference]: Start difference. First operand has 1098 states, 1096 states have (on average 1.8266423357664234) internal successors, (2002), 1097 states have internal predecessors, (2002), 0 states have call successors, (0), 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 4 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:41:14,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:41:14,660 INFO L93 Difference]: Finished difference Result 3829 states and 7202 transitions. [2025-02-05 11:41:14,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 11:41:14,661 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2025-02-05 11:41:14,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:41:14,683 INFO L225 Difference]: With dead ends: 3829 [2025-02-05 11:41:14,683 INFO L226 Difference]: Without dead ends: 2664 [2025-02-05 11:41:14,690 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 11:41:14,695 INFO L435 NwaCegarLoop]: 753 mSDtfsCounter, 2719 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 4246 mSolverCounterSat, 1607 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2719 SdHoareTripleChecker+Valid, 1051 SdHoareTripleChecker+Invalid, 5853 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1607 IncrementalHoareTripleChecker+Valid, 4246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2025-02-05 11:41:14,696 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2719 Valid, 1051 Invalid, 5853 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1607 Valid, 4246 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2025-02-05 11:41:14,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2664 states. [2025-02-05 11:41:14,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2664 to 2663. [2025-02-05 11:41:14,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2663 states, 2662 states have (on average 1.460931630353118) internal successors, (3889), 2662 states have internal predecessors, (3889), 0 states have call successors, (0), 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 11:41:14,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2663 states to 2663 states and 3889 transitions. [2025-02-05 11:41:14,806 INFO L78 Accepts]: Start accepts. Automaton has 2663 states and 3889 transitions. Word has length 37 [2025-02-05 11:41:14,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:41:14,807 INFO L471 AbstractCegarLoop]: Abstraction has 2663 states and 3889 transitions. [2025-02-05 11:41:14,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:41:14,807 INFO L276 IsEmpty]: Start isEmpty. Operand 2663 states and 3889 transitions. [2025-02-05 11:41:14,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-02-05 11:41:14,811 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:41:14,811 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:41:14,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 11:41:14,811 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:41:14,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:41:14,812 INFO L85 PathProgramCache]: Analyzing trace with hash 2136037161, now seen corresponding path program 1 times [2025-02-05 11:41:14,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:41:14,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510238763] [2025-02-05 11:41:14,812 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:41:14,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:41:14,833 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-02-05 11:41:14,865 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-02-05 11:41:14,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:41:14,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:41:15,155 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:41:15,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:41:15,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510238763] [2025-02-05 11:41:15,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510238763] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:41:15,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:41:15,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:41:15,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993734637] [2025-02-05 11:41:15,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:41:15,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 11:41:15,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:41:15,159 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 11:41:15,159 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 11:41:15,159 INFO L87 Difference]: Start difference. First operand 2663 states and 3889 transitions. Second operand has 4 states, 4 states have (on average 40.5) internal successors, (162), 3 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:41:21,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:41:21,556 INFO L93 Difference]: Finished difference Result 7866 states and 12670 transitions. [2025-02-05 11:41:21,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 11:41:21,557 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 40.5) internal successors, (162), 3 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 162 [2025-02-05 11:41:21,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:41:21,574 INFO L225 Difference]: With dead ends: 7866 [2025-02-05 11:41:21,574 INFO L226 Difference]: Without dead ends: 5992 [2025-02-05 11:41:21,576 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 11:41:21,577 INFO L435 NwaCegarLoop]: 894 mSDtfsCounter, 1721 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 5285 mSolverCounterSat, 842 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1721 SdHoareTripleChecker+Valid, 1070 SdHoareTripleChecker+Invalid, 6127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 842 IncrementalHoareTripleChecker+Valid, 5285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2025-02-05 11:41:21,577 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1721 Valid, 1070 Invalid, 6127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [842 Valid, 5285 Invalid, 0 Unknown, 0 Unchecked, 6.3s Time] [2025-02-05 11:41:21,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5992 states. [2025-02-05 11:41:21,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5992 to 5859. [2025-02-05 11:41:21,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5859 states, 5858 states have (on average 1.4453738477296005) internal successors, (8467), 5858 states have internal predecessors, (8467), 0 states have call successors, (0), 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 11:41:21,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5859 states to 5859 states and 8467 transitions. [2025-02-05 11:41:21,651 INFO L78 Accepts]: Start accepts. Automaton has 5859 states and 8467 transitions. Word has length 162 [2025-02-05 11:41:21,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:41:21,652 INFO L471 AbstractCegarLoop]: Abstraction has 5859 states and 8467 transitions. [2025-02-05 11:41:21,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.5) internal successors, (162), 3 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:41:21,652 INFO L276 IsEmpty]: Start isEmpty. Operand 5859 states and 8467 transitions. [2025-02-05 11:41:21,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2025-02-05 11:41:21,654 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:41:21,655 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-05 11:41:21,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 11:41:21,655 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:41:21,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:41:21,655 INFO L85 PathProgramCache]: Analyzing trace with hash 251587401, now seen corresponding path program 1 times [2025-02-05 11:41:21,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:41:21,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359993694] [2025-02-05 11:41:21,656 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:41:21,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:41:21,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-02-05 11:41:21,699 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-02-05 11:41:21,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:41:21,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:41:21,855 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-02-05 11:41:21,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:41:21,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359993694] [2025-02-05 11:41:21,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359993694] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:41:21,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:41:21,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 11:41:21,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048502725] [2025-02-05 11:41:21,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:41:21,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:41:21,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:41:21,857 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:41:21,857 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:41:21,857 INFO L87 Difference]: Start difference. First operand 5859 states and 8467 transitions. Second operand has 3 states, 3 states have (on average 45.0) internal successors, (135), 2 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:41:25,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:41:25,437 INFO L93 Difference]: Finished difference Result 15685 states and 23392 transitions. [2025-02-05 11:41:25,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:41:25,437 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 2 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 204 [2025-02-05 11:41:25,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:41:25,465 INFO L225 Difference]: With dead ends: 15685 [2025-02-05 11:41:25,466 INFO L226 Difference]: Without dead ends: 10615 [2025-02-05 11:41:25,474 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 11:41:25,476 INFO L435 NwaCegarLoop]: 785 mSDtfsCounter, 918 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 2553 mSolverCounterSat, 757 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 918 SdHoareTripleChecker+Valid, 917 SdHoareTripleChecker+Invalid, 3310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 757 IncrementalHoareTripleChecker+Valid, 2553 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2025-02-05 11:41:25,477 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [918 Valid, 917 Invalid, 3310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [757 Valid, 2553 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2025-02-05 11:41:25,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10615 states. [2025-02-05 11:41:25,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10615 to 10608. [2025-02-05 11:41:25,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10608 states, 10607 states have (on average 1.3553313849344772) internal successors, (14376), 10607 states have internal predecessors, (14376), 0 states have call successors, (0), 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 11:41:25,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10608 states to 10608 states and 14376 transitions. [2025-02-05 11:41:25,617 INFO L78 Accepts]: Start accepts. Automaton has 10608 states and 14376 transitions. Word has length 204 [2025-02-05 11:41:25,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:41:25,618 INFO L471 AbstractCegarLoop]: Abstraction has 10608 states and 14376 transitions. [2025-02-05 11:41:25,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 2 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:41:25,619 INFO L276 IsEmpty]: Start isEmpty. Operand 10608 states and 14376 transitions. [2025-02-05 11:41:25,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2025-02-05 11:41:25,622 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:41:25,622 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:41:25,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 11:41:25,623 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:41:25,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:41:25,625 INFO L85 PathProgramCache]: Analyzing trace with hash -2096496208, now seen corresponding path program 1 times [2025-02-05 11:41:25,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:41:25,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914756763] [2025-02-05 11:41:25,625 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:41:25,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:41:25,644 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 218 statements into 1 equivalence classes. [2025-02-05 11:41:25,663 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 218 of 218 statements. [2025-02-05 11:41:25,664 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:41:25,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:41:25,795 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-02-05 11:41:25,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:41:25,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914756763] [2025-02-05 11:41:25,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914756763] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:41:25,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:41:25,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 11:41:25,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237773994] [2025-02-05 11:41:25,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:41:25,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:41:25,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:41:25,796 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:41:25,796 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:41:25,796 INFO L87 Difference]: Start difference. First operand 10608 states and 14376 transitions. Second operand has 3 states, 3 states have (on average 45.0) internal successors, (135), 2 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:41:28,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:41:28,785 INFO L93 Difference]: Finished difference Result 28349 states and 39245 transitions. [2025-02-05 11:41:28,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:41:28,786 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 2 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 218 [2025-02-05 11:41:28,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:41:28,835 INFO L225 Difference]: With dead ends: 28349 [2025-02-05 11:41:28,836 INFO L226 Difference]: Without dead ends: 18530 [2025-02-05 11:41:28,845 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 11:41:28,848 INFO L435 NwaCegarLoop]: 451 mSDtfsCounter, 907 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 2871 mSolverCounterSat, 545 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 907 SdHoareTripleChecker+Valid, 616 SdHoareTripleChecker+Invalid, 3416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 545 IncrementalHoareTripleChecker+Valid, 2871 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2025-02-05 11:41:28,849 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [907 Valid, 616 Invalid, 3416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [545 Valid, 2871 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2025-02-05 11:41:28,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18530 states. [2025-02-05 11:41:29,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18530 to 18523. [2025-02-05 11:41:29,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18523 states, 18522 states have (on average 1.3251268761472843) internal successors, (24544), 18522 states have internal predecessors, (24544), 0 states have call successors, (0), 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 11:41:29,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18523 states to 18523 states and 24544 transitions. [2025-02-05 11:41:29,059 INFO L78 Accepts]: Start accepts. Automaton has 18523 states and 24544 transitions. Word has length 218 [2025-02-05 11:41:29,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:41:29,059 INFO L471 AbstractCegarLoop]: Abstraction has 18523 states and 24544 transitions. [2025-02-05 11:41:29,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 2 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:41:29,060 INFO L276 IsEmpty]: Start isEmpty. Operand 18523 states and 24544 transitions. [2025-02-05 11:41:29,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2025-02-05 11:41:29,064 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:41:29,064 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-05 11:41:29,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 11:41:29,064 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:41:29,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:41:29,065 INFO L85 PathProgramCache]: Analyzing trace with hash 254995923, now seen corresponding path program 1 times [2025-02-05 11:41:29,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:41:29,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932140445] [2025-02-05 11:41:29,065 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:41:29,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:41:29,083 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 244 statements into 1 equivalence classes. [2025-02-05 11:41:29,099 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 244 of 244 statements. [2025-02-05 11:41:29,099 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:41:29,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:41:29,327 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 164 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:41:29,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:41:29,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932140445] [2025-02-05 11:41:29,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932140445] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:41:29,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:41:29,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:41:29,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813378929] [2025-02-05 11:41:29,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:41:29,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:41:29,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:41:29,329 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:41:29,329 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:41:29,329 INFO L87 Difference]: Start difference. First operand 18523 states and 24544 transitions. Second operand has 3 states, 3 states have (on average 81.33333333333333) internal successors, (244), 3 states have internal predecessors, (244), 0 states have call successors, (0), 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 11:41:32,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:41:32,386 INFO L93 Difference]: Finished difference Result 52015 states and 69799 transitions. [2025-02-05 11:41:32,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:41:32,387 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 81.33333333333333) internal successors, (244), 3 states have internal predecessors, (244), 0 states have call successors, (0), 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 244 [2025-02-05 11:41:32,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:41:32,436 INFO L225 Difference]: With dead ends: 52015 [2025-02-05 11:41:32,436 INFO L226 Difference]: Without dead ends: 34281 [2025-02-05 11:41:32,450 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 11:41:32,452 INFO L435 NwaCegarLoop]: 828 mSDtfsCounter, 845 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 2393 mSolverCounterSat, 915 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 845 SdHoareTripleChecker+Valid, 946 SdHoareTripleChecker+Invalid, 3308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 915 IncrementalHoareTripleChecker+Valid, 2393 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2025-02-05 11:41:32,452 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [845 Valid, 946 Invalid, 3308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [915 Valid, 2393 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2025-02-05 11:41:32,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34281 states. [2025-02-05 11:41:32,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34281 to 34271. [2025-02-05 11:41:32,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34271 states, 34270 states have (on average 1.25503355704698) internal successors, (43010), 34270 states have internal predecessors, (43010), 0 states have call successors, (0), 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 11:41:32,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34271 states to 34271 states and 43010 transitions. [2025-02-05 11:41:32,728 INFO L78 Accepts]: Start accepts. Automaton has 34271 states and 43010 transitions. Word has length 244 [2025-02-05 11:41:32,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:41:32,729 INFO L471 AbstractCegarLoop]: Abstraction has 34271 states and 43010 transitions. [2025-02-05 11:41:32,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 81.33333333333333) internal successors, (244), 3 states have internal predecessors, (244), 0 states have call successors, (0), 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 11:41:32,729 INFO L276 IsEmpty]: Start isEmpty. Operand 34271 states and 43010 transitions. [2025-02-05 11:41:32,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2025-02-05 11:41:32,732 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:41:32,733 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-05 11:41:32,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 11:41:32,733 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:41:32,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:41:32,733 INFO L85 PathProgramCache]: Analyzing trace with hash 1485238653, now seen corresponding path program 1 times [2025-02-05 11:41:32,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:41:32,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652609140] [2025-02-05 11:41:32,733 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:41:32,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:41:32,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 258 statements into 1 equivalence classes. [2025-02-05 11:41:32,769 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 258 of 258 statements. [2025-02-05 11:41:32,769 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:41:32,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:41:32,881 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 164 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:41:32,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:41:32,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652609140] [2025-02-05 11:41:32,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652609140] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:41:32,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:41:32,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:41:32,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533100435] [2025-02-05 11:41:32,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:41:32,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:41:32,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:41:32,882 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:41:32,882 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:41:32,882 INFO L87 Difference]: Start difference. First operand 34271 states and 43010 transitions. Second operand has 3 states, 3 states have (on average 86.0) internal successors, (258), 3 states have internal predecessors, (258), 0 states have call successors, (0), 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 11:41:35,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:41:35,848 INFO L93 Difference]: Finished difference Result 81153 states and 101192 transitions. [2025-02-05 11:41:35,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:41:35,849 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 86.0) internal successors, (258), 3 states have internal predecessors, (258), 0 states have call successors, (0), 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 258 [2025-02-05 11:41:35,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:41:35,980 INFO L225 Difference]: With dead ends: 81153 [2025-02-05 11:41:35,983 INFO L226 Difference]: Without dead ends: 47671 [2025-02-05 11:41:36,028 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 11:41:36,028 INFO L435 NwaCegarLoop]: 1396 mSDtfsCounter, 974 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 2491 mSolverCounterSat, 678 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 974 SdHoareTripleChecker+Valid, 1448 SdHoareTripleChecker+Invalid, 3169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 678 IncrementalHoareTripleChecker+Valid, 2491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-02-05 11:41:36,028 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [974 Valid, 1448 Invalid, 3169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [678 Valid, 2491 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-02-05 11:41:36,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47671 states. [2025-02-05 11:41:36,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47671 to 47649. [2025-02-05 11:41:36,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47649 states, 47648 states have (on average 1.2083193418401612) internal successors, (57574), 47648 states have internal predecessors, (57574), 0 states have call successors, (0), 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 11:41:36,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47649 states to 47649 states and 57574 transitions. [2025-02-05 11:41:36,481 INFO L78 Accepts]: Start accepts. Automaton has 47649 states and 57574 transitions. Word has length 258 [2025-02-05 11:41:36,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:41:36,481 INFO L471 AbstractCegarLoop]: Abstraction has 47649 states and 57574 transitions. [2025-02-05 11:41:36,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 86.0) internal successors, (258), 3 states have internal predecessors, (258), 0 states have call successors, (0), 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 11:41:36,482 INFO L276 IsEmpty]: Start isEmpty. Operand 47649 states and 57574 transitions. [2025-02-05 11:41:36,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 332 [2025-02-05 11:41:36,486 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:41:36,487 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:41:36,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 11:41:36,487 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:41:36,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:41:36,487 INFO L85 PathProgramCache]: Analyzing trace with hash 855705726, now seen corresponding path program 1 times [2025-02-05 11:41:36,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:41:36,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372422963] [2025-02-05 11:41:36,488 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:41:36,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:41:36,507 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 331 statements into 1 equivalence classes. [2025-02-05 11:41:36,522 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 331 of 331 statements. [2025-02-05 11:41:36,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:41:36,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:41:36,700 INFO L134 CoverageAnalysis]: Checked inductivity of 391 backedges. 356 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-02-05 11:41:36,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:41:36,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372422963] [2025-02-05 11:41:36,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372422963] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:41:36,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:41:36,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:41:36,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136724863] [2025-02-05 11:41:36,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:41:36,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 11:41:36,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:41:36,702 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 11:41:36,702 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 11:41:36,703 INFO L87 Difference]: Start difference. First operand 47649 states and 57574 transitions. Second operand has 4 states, 4 states have (on average 74.25) internal successors, (297), 3 states have internal predecessors, (297), 0 states have call successors, (0), 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 11:41:42,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:41:42,393 INFO L93 Difference]: Finished difference Result 127792 states and 156476 transitions. [2025-02-05 11:41:42,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 11:41:42,393 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 74.25) internal successors, (297), 3 states have internal predecessors, (297), 0 states have call successors, (0), 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 331 [2025-02-05 11:41:42,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:41:42,514 INFO L225 Difference]: With dead ends: 127792 [2025-02-05 11:41:42,514 INFO L226 Difference]: Without dead ends: 80932 [2025-02-05 11:41:42,551 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 11:41:42,552 INFO L435 NwaCegarLoop]: 545 mSDtfsCounter, 1741 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 6064 mSolverCounterSat, 1187 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1741 SdHoareTripleChecker+Valid, 748 SdHoareTripleChecker+Invalid, 7251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1187 IncrementalHoareTripleChecker+Valid, 6064 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2025-02-05 11:41:42,552 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1741 Valid, 748 Invalid, 7251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1187 Valid, 6064 Invalid, 0 Unknown, 0 Unchecked, 5.2s Time] [2025-02-05 11:41:42,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80932 states. [2025-02-05 11:41:43,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80932 to 80806. [2025-02-05 11:41:43,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80806 states, 80805 states have (on average 1.2057545943939112) internal successors, (97431), 80805 states have internal predecessors, (97431), 0 states have call successors, (0), 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 11:41:43,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80806 states to 80806 states and 97431 transitions. [2025-02-05 11:41:43,233 INFO L78 Accepts]: Start accepts. Automaton has 80806 states and 97431 transitions. Word has length 331 [2025-02-05 11:41:43,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:41:43,234 INFO L471 AbstractCegarLoop]: Abstraction has 80806 states and 97431 transitions. [2025-02-05 11:41:43,234 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 74.25) internal successors, (297), 3 states have internal predecessors, (297), 0 states have call successors, (0), 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 11:41:43,234 INFO L276 IsEmpty]: Start isEmpty. Operand 80806 states and 97431 transitions. [2025-02-05 11:41:43,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2025-02-05 11:41:43,238 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:41:43,238 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-02-05 11:41:43,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 11:41:43,239 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:41:43,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:41:43,240 INFO L85 PathProgramCache]: Analyzing trace with hash -246151071, now seen corresponding path program 1 times [2025-02-05 11:41:43,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:41:43,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700397638] [2025-02-05 11:41:43,240 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:41:43,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:41:43,475 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 333 statements into 1 equivalence classes. [2025-02-05 11:41:43,490 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 333 of 333 statements. [2025-02-05 11:41:43,490 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:41:43,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:41:43,713 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 288 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2025-02-05 11:41:43,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:41:43,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700397638] [2025-02-05 11:41:43,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700397638] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:41:43,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:41:43,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:41:43,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358854019] [2025-02-05 11:41:43,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:41:43,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:41:43,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:41:43,715 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:41:43,715 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:41:43,715 INFO L87 Difference]: Start difference. First operand 80806 states and 97431 transitions. Second operand has 3 states, 3 states have (on average 82.0) internal successors, (246), 3 states have internal predecessors, (246), 0 states have call successors, (0), 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 11:41:47,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:41:47,496 INFO L93 Difference]: Finished difference Result 182871 states and 223441 transitions. [2025-02-05 11:41:47,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:41:47,496 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 82.0) internal successors, (246), 3 states have internal predecessors, (246), 0 states have call successors, (0), 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 333 [2025-02-05 11:41:47,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:41:47,603 INFO L225 Difference]: With dead ends: 182871 [2025-02-05 11:41:47,603 INFO L226 Difference]: Without dead ends: 102854 [2025-02-05 11:41:47,646 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 11:41:47,646 INFO L435 NwaCegarLoop]: 772 mSDtfsCounter, 915 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 2405 mSolverCounterSat, 917 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 915 SdHoareTripleChecker+Valid, 857 SdHoareTripleChecker+Invalid, 3322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 917 IncrementalHoareTripleChecker+Valid, 2405 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2025-02-05 11:41:47,647 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [915 Valid, 857 Invalid, 3322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [917 Valid, 2405 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2025-02-05 11:41:47,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102854 states. [2025-02-05 11:41:48,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102854 to 102833. [2025-02-05 11:41:48,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102833 states, 102832 states have (on average 1.2054127119962657) internal successors, (123955), 102832 states have internal predecessors, (123955), 0 states have call successors, (0), 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 11:41:48,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102833 states to 102833 states and 123955 transitions. [2025-02-05 11:41:48,518 INFO L78 Accepts]: Start accepts. Automaton has 102833 states and 123955 transitions. Word has length 333 [2025-02-05 11:41:48,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:41:48,518 INFO L471 AbstractCegarLoop]: Abstraction has 102833 states and 123955 transitions. [2025-02-05 11:41:48,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 82.0) internal successors, (246), 3 states have internal predecessors, (246), 0 states have call successors, (0), 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 11:41:48,519 INFO L276 IsEmpty]: Start isEmpty. Operand 102833 states and 123955 transitions. [2025-02-05 11:41:48,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2025-02-05 11:41:48,523 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:41:48,523 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-05 11:41:48,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 11:41:48,524 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:41:48,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:41:48,524 INFO L85 PathProgramCache]: Analyzing trace with hash -1124200351, now seen corresponding path program 1 times [2025-02-05 11:41:48,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:41:48,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724254888] [2025-02-05 11:41:48,524 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:41:48,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:41:48,549 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 340 statements into 1 equivalence classes. [2025-02-05 11:41:48,562 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 340 of 340 statements. [2025-02-05 11:41:48,563 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:41:48,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:41:48,639 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 193 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:41:48,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:41:48,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724254888] [2025-02-05 11:41:48,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724254888] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:41:48,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:41:48,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:41:48,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054246388] [2025-02-05 11:41:48,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:41:48,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:41:48,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:41:48,641 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:41:48,641 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:41:48,641 INFO L87 Difference]: Start difference. First operand 102833 states and 123955 transitions. Second operand has 3 states, 3 states have (on average 113.33333333333333) internal successors, (340), 3 states have internal predecessors, (340), 0 states have call successors, (0), 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 11:41:52,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:41:52,078 INFO L93 Difference]: Finished difference Result 204064 states and 246108 transitions. [2025-02-05 11:41:52,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:41:52,078 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 113.33333333333333) internal successors, (340), 3 states have internal predecessors, (340), 0 states have call successors, (0), 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 340 [2025-02-05 11:41:52,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:41:52,207 INFO L225 Difference]: With dead ends: 204064 [2025-02-05 11:41:52,207 INFO L226 Difference]: Without dead ends: 102020 [2025-02-05 11:41:52,266 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 11:41:52,270 INFO L435 NwaCegarLoop]: 1522 mSDtfsCounter, 943 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 2354 mSolverCounterSat, 594 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 943 SdHoareTripleChecker+Valid, 1666 SdHoareTripleChecker+Invalid, 2948 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 594 IncrementalHoareTripleChecker+Valid, 2354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2025-02-05 11:41:52,270 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [943 Valid, 1666 Invalid, 2948 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [594 Valid, 2354 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2025-02-05 11:41:52,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102020 states. [2025-02-05 11:41:53,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102020 to 102011. [2025-02-05 11:41:53,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102011 states, 102010 states have (on average 1.1385452406626801) internal successors, (116143), 102010 states have internal predecessors, (116143), 0 states have call successors, (0), 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 11:41:53,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102011 states to 102011 states and 116143 transitions. [2025-02-05 11:41:53,340 INFO L78 Accepts]: Start accepts. Automaton has 102011 states and 116143 transitions. Word has length 340 [2025-02-05 11:41:53,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:41:53,341 INFO L471 AbstractCegarLoop]: Abstraction has 102011 states and 116143 transitions. [2025-02-05 11:41:53,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.33333333333333) internal successors, (340), 3 states have internal predecessors, (340), 0 states have call successors, (0), 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 11:41:53,341 INFO L276 IsEmpty]: Start isEmpty. Operand 102011 states and 116143 transitions. [2025-02-05 11:41:53,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 347 [2025-02-05 11:41:53,353 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:41:53,353 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-02-05 11:41:53,353 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 11:41:53,353 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:41:53,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:41:53,354 INFO L85 PathProgramCache]: Analyzing trace with hash -742774692, now seen corresponding path program 1 times [2025-02-05 11:41:53,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:41:53,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515235150] [2025-02-05 11:41:53,354 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:41:53,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:41:53,375 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 346 statements into 1 equivalence classes. [2025-02-05 11:41:53,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 346 of 346 statements. [2025-02-05 11:41:53,385 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:41:53,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:41:53,526 INFO L134 CoverageAnalysis]: Checked inductivity of 391 backedges. 356 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-02-05 11:41:53,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:41:53,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515235150] [2025-02-05 11:41:53,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515235150] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:41:53,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:41:53,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:41:53,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814896240] [2025-02-05 11:41:53,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:41:53,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:41:53,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:41:53,527 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:41:53,527 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:41:53,528 INFO L87 Difference]: Start difference. First operand 102011 states and 116143 transitions. Second operand has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 0 states have call successors, (0), 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 11:41:56,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:41:56,956 INFO L93 Difference]: Finished difference Result 188311 states and 215780 transitions. [2025-02-05 11:41:56,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:41:56,956 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 0 states have call successors, (0), 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 346 [2025-02-05 11:41:56,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:41:57,063 INFO L225 Difference]: With dead ends: 188311 [2025-02-05 11:41:57,063 INFO L226 Difference]: Without dead ends: 102053 [2025-02-05 11:41:57,111 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 11:41:57,112 INFO L435 NwaCegarLoop]: 1873 mSDtfsCounter, 741 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 2620 mSolverCounterSat, 209 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 741 SdHoareTripleChecker+Valid, 2013 SdHoareTripleChecker+Invalid, 2829 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 209 IncrementalHoareTripleChecker+Valid, 2620 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2025-02-05 11:41:57,112 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [741 Valid, 2013 Invalid, 2829 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [209 Valid, 2620 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2025-02-05 11:41:57,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102053 states. [2025-02-05 11:41:57,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102053 to 102012. [2025-02-05 11:41:57,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102012 states, 102011 states have (on average 1.1325641352403173) internal successors, (115534), 102011 states have internal predecessors, (115534), 0 states have call successors, (0), 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 11:41:58,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102012 states to 102012 states and 115534 transitions. [2025-02-05 11:41:58,335 INFO L78 Accepts]: Start accepts. Automaton has 102012 states and 115534 transitions. Word has length 346 [2025-02-05 11:41:58,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:41:58,335 INFO L471 AbstractCegarLoop]: Abstraction has 102012 states and 115534 transitions. [2025-02-05 11:41:58,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 0 states have call successors, (0), 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 11:41:58,336 INFO L276 IsEmpty]: Start isEmpty. Operand 102012 states and 115534 transitions. [2025-02-05 11:41:58,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 370 [2025-02-05 11:41:58,344 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:41:58,344 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-05 11:41:58,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 11:41:58,345 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:41:58,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:41:58,349 INFO L85 PathProgramCache]: Analyzing trace with hash 1955332186, now seen corresponding path program 1 times [2025-02-05 11:41:58,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:41:58,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187189428] [2025-02-05 11:41:58,349 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:41:58,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:41:58,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 369 statements into 1 equivalence classes. [2025-02-05 11:41:58,399 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 369 of 369 statements. [2025-02-05 11:41:58,400 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:41:58,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:41:58,574 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 258 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2025-02-05 11:41:58,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:41:58,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187189428] [2025-02-05 11:41:58,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187189428] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:41:58,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:41:58,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 11:41:58,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537473692] [2025-02-05 11:41:58,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:41:58,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:41:58,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:41:58,576 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:41:58,576 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:41:58,576 INFO L87 Difference]: Start difference. First operand 102012 states and 115534 transitions. Second operand has 3 states, 3 states have (on average 90.66666666666667) internal successors, (272), 2 states have internal predecessors, (272), 0 states have call successors, (0), 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 11:42:02,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:42:02,063 INFO L93 Difference]: Finished difference Result 267749 states and 305110 transitions. [2025-02-05 11:42:02,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:42:02,064 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 90.66666666666667) internal successors, (272), 2 states have internal predecessors, (272), 0 states have call successors, (0), 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 369 [2025-02-05 11:42:02,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:42:02,229 INFO L225 Difference]: With dead ends: 267749 [2025-02-05 11:42:02,229 INFO L226 Difference]: Without dead ends: 162586 [2025-02-05 11:42:02,275 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 11:42:02,276 INFO L435 NwaCegarLoop]: 922 mSDtfsCounter, 810 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 2367 mSolverCounterSat, 862 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 810 SdHoareTripleChecker+Valid, 1056 SdHoareTripleChecker+Invalid, 3229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 862 IncrementalHoareTripleChecker+Valid, 2367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-02-05 11:42:02,276 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [810 Valid, 1056 Invalid, 3229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [862 Valid, 2367 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-02-05 11:42:02,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162586 states. [2025-02-05 11:42:03,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162586 to 152337. [2025-02-05 11:42:03,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152337 states, 152336 states have (on average 1.107328536918391) internal successors, (168686), 152336 states have internal predecessors, (168686), 0 states have call successors, (0), 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 11:42:03,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152337 states to 152337 states and 168686 transitions. [2025-02-05 11:42:03,626 INFO L78 Accepts]: Start accepts. Automaton has 152337 states and 168686 transitions. Word has length 369 [2025-02-05 11:42:03,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:42:03,626 INFO L471 AbstractCegarLoop]: Abstraction has 152337 states and 168686 transitions. [2025-02-05 11:42:03,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 90.66666666666667) internal successors, (272), 2 states have internal predecessors, (272), 0 states have call successors, (0), 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 11:42:03,626 INFO L276 IsEmpty]: Start isEmpty. Operand 152337 states and 168686 transitions. [2025-02-05 11:42:03,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 376 [2025-02-05 11:42:03,629 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:42:03,629 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:42:03,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 11:42:03,629 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:42:03,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:42:03,630 INFO L85 PathProgramCache]: Analyzing trace with hash -1808132261, now seen corresponding path program 1 times [2025-02-05 11:42:03,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:42:03,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048777273] [2025-02-05 11:42:03,630 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:42:03,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:42:03,650 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 375 statements into 1 equivalence classes. [2025-02-05 11:42:03,660 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 375 of 375 statements. [2025-02-05 11:42:03,660 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:42:03,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:42:04,824 INFO L134 CoverageAnalysis]: Checked inductivity of 410 backedges. 262 proven. 113 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-02-05 11:42:04,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:42:04,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048777273] [2025-02-05 11:42:04,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048777273] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 11:42:04,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [519235051] [2025-02-05 11:42:04,825 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:42:04,825 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:42:04,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:42:04,832 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 11:42:04,836 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 11:42:04,886 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 375 statements into 1 equivalence classes. [2025-02-05 11:42:04,949 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 375 of 375 statements. [2025-02-05 11:42:04,949 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:42:04,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:42:04,951 INFO L256 TraceCheckSpWp]: Trace formula consists of 511 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 11:42:04,960 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 11:42:05,084 INFO L134 CoverageAnalysis]: Checked inductivity of 410 backedges. 297 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2025-02-05 11:42:05,084 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 11:42:05,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [519235051] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:42:05,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 11:42:05,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2025-02-05 11:42:05,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786656359] [2025-02-05 11:42:05,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:42:05,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:42:05,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:42:05,086 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:42:05,086 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-02-05 11:42:05,086 INFO L87 Difference]: Start difference. First operand 152337 states and 168686 transitions. Second operand has 3 states, 3 states have (on average 87.66666666666667) internal successors, (263), 3 states have internal predecessors, (263), 0 states have call successors, (0), 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 11:42:08,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:42:08,413 INFO L93 Difference]: Finished difference Result 301521 states and 333816 transitions. [2025-02-05 11:42:08,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:42:08,414 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 87.66666666666667) internal successors, (263), 3 states have internal predecessors, (263), 0 states have call successors, (0), 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 375 [2025-02-05 11:42:08,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:42:08,581 INFO L225 Difference]: With dead ends: 301521 [2025-02-05 11:42:08,581 INFO L226 Difference]: Without dead ends: 149973 [2025-02-05 11:42:08,643 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 381 GetRequests, 374 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-02-05 11:42:08,644 INFO L435 NwaCegarLoop]: 1339 mSDtfsCounter, 1100 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 2449 mSolverCounterSat, 441 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1100 SdHoareTripleChecker+Valid, 1418 SdHoareTripleChecker+Invalid, 2890 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 441 IncrementalHoareTripleChecker+Valid, 2449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-02-05 11:42:08,645 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1100 Valid, 1418 Invalid, 2890 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [441 Valid, 2449 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-02-05 11:42:08,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149973 states. [2025-02-05 11:42:09,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149973 to 149181. [2025-02-05 11:42:09,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149181 states, 149180 states have (on average 1.081311167716852) internal successors, (161310), 149180 states have internal predecessors, (161310), 0 states have call successors, (0), 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 11:42:10,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149181 states to 149181 states and 161310 transitions. [2025-02-05 11:42:10,093 INFO L78 Accepts]: Start accepts. Automaton has 149181 states and 161310 transitions. Word has length 375 [2025-02-05 11:42:10,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:42:10,094 INFO L471 AbstractCegarLoop]: Abstraction has 149181 states and 161310 transitions. [2025-02-05 11:42:10,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 87.66666666666667) internal successors, (263), 3 states have internal predecessors, (263), 0 states have call successors, (0), 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 11:42:10,094 INFO L276 IsEmpty]: Start isEmpty. Operand 149181 states and 161310 transitions. [2025-02-05 11:42:10,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 393 [2025-02-05 11:42:10,097 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:42:10,097 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:42:10,103 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-05 11:42:10,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-02-05 11:42:10,298 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:42:10,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:42:10,298 INFO L85 PathProgramCache]: Analyzing trace with hash 1331990586, now seen corresponding path program 1 times [2025-02-05 11:42:10,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:42:10,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661318603] [2025-02-05 11:42:10,299 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:42:10,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:42:10,319 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 392 statements into 1 equivalence classes. [2025-02-05 11:42:10,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 392 of 392 statements. [2025-02-05 11:42:10,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:42:10,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:42:10,736 INFO L134 CoverageAnalysis]: Checked inductivity of 629 backedges. 139 proven. 0 refuted. 0 times theorem prover too weak. 490 trivial. 0 not checked. [2025-02-05 11:42:10,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:42:10,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661318603] [2025-02-05 11:42:10,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661318603] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:42:10,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:42:10,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:42:10,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734660052] [2025-02-05 11:42:10,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:42:10,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:42:10,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:42:10,738 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:42:10,738 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:42:10,738 INFO L87 Difference]: Start difference. First operand 149181 states and 161310 transitions. Second operand has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 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 11:42:14,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:42:14,870 INFO L93 Difference]: Finished difference Result 318106 states and 343822 transitions. [2025-02-05 11:42:14,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:42:14,871 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 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 392 [2025-02-05 11:42:14,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:42:15,069 INFO L225 Difference]: With dead ends: 318106 [2025-02-05 11:42:15,069 INFO L226 Difference]: Without dead ends: 169714 [2025-02-05 11:42:15,138 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 11:42:15,139 INFO L435 NwaCegarLoop]: 1660 mSDtfsCounter, 844 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 2916 mSolverCounterSat, 380 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 844 SdHoareTripleChecker+Valid, 1787 SdHoareTripleChecker+Invalid, 3296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 380 IncrementalHoareTripleChecker+Valid, 2916 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2025-02-05 11:42:15,139 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [844 Valid, 1787 Invalid, 3296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [380 Valid, 2916 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2025-02-05 11:42:15,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169714 states. [2025-02-05 11:42:16,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169714 to 158634. [2025-02-05 11:42:16,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158634 states, 158633 states have (on average 1.077537460679682) internal successors, (170933), 158633 states have internal predecessors, (170933), 0 states have call successors, (0), 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 11:42:16,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158634 states to 158634 states and 170933 transitions. [2025-02-05 11:42:16,808 INFO L78 Accepts]: Start accepts. Automaton has 158634 states and 170933 transitions. Word has length 392 [2025-02-05 11:42:16,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:42:16,809 INFO L471 AbstractCegarLoop]: Abstraction has 158634 states and 170933 transitions. [2025-02-05 11:42:16,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 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 11:42:16,809 INFO L276 IsEmpty]: Start isEmpty. Operand 158634 states and 170933 transitions. [2025-02-05 11:42:16,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 469 [2025-02-05 11:42:16,816 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:42:16,816 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:42:16,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 11:42:16,817 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:42:16,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:42:16,818 INFO L85 PathProgramCache]: Analyzing trace with hash 1717037750, now seen corresponding path program 1 times [2025-02-05 11:42:16,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:42:16,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105954406] [2025-02-05 11:42:16,818 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:42:16,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:42:16,862 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 468 statements into 1 equivalence classes. [2025-02-05 11:42:16,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 468 of 468 statements. [2025-02-05 11:42:16,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:42:16,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:42:17,249 INFO L134 CoverageAnalysis]: Checked inductivity of 710 backedges. 438 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2025-02-05 11:42:17,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:42:17,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105954406] [2025-02-05 11:42:17,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105954406] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:42:17,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:42:17,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:42:17,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069831870] [2025-02-05 11:42:17,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:42:17,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:42:17,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:42:17,250 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:42:17,250 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:42:17,250 INFO L87 Difference]: Start difference. First operand 158634 states and 170933 transitions. Second operand has 3 states, 3 states have (on average 95.33333333333333) internal successors, (286), 3 states have internal predecessors, (286), 0 states have call successors, (0), 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 11:42:20,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:42:20,977 INFO L93 Difference]: Finished difference Result 351127 states and 379889 transitions. [2025-02-05 11:42:20,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:42:20,977 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 95.33333333333333) internal successors, (286), 3 states have internal predecessors, (286), 0 states have call successors, (0), 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 468 [2025-02-05 11:42:20,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:42:21,191 INFO L225 Difference]: With dead ends: 351127 [2025-02-05 11:42:21,191 INFO L226 Difference]: Without dead ends: 191708 [2025-02-05 11:42:21,273 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 11:42:21,274 INFO L435 NwaCegarLoop]: 1736 mSDtfsCounter, 745 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 2518 mSolverCounterSat, 616 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 745 SdHoareTripleChecker+Valid, 1880 SdHoareTripleChecker+Invalid, 3134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 616 IncrementalHoareTripleChecker+Valid, 2518 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2025-02-05 11:42:21,274 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [745 Valid, 1880 Invalid, 3134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [616 Valid, 2518 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2025-02-05 11:42:21,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191708 states. [2025-02-05 11:42:22,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191708 to 188541. [2025-02-05 11:42:22,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188541 states, 188540 states have (on average 1.0686803861249603) internal successors, (201489), 188540 states have internal predecessors, (201489), 0 states have call successors, (0), 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 11:42:23,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188541 states to 188541 states and 201489 transitions. [2025-02-05 11:42:23,132 INFO L78 Accepts]: Start accepts. Automaton has 188541 states and 201489 transitions. Word has length 468 [2025-02-05 11:42:23,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:42:23,133 INFO L471 AbstractCegarLoop]: Abstraction has 188541 states and 201489 transitions. [2025-02-05 11:42:23,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 95.33333333333333) internal successors, (286), 3 states have internal predecessors, (286), 0 states have call successors, (0), 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 11:42:23,133 INFO L276 IsEmpty]: Start isEmpty. Operand 188541 states and 201489 transitions. [2025-02-05 11:42:23,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 495 [2025-02-05 11:42:23,141 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:42:23,141 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-02-05 11:42:23,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 11:42:23,141 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:42:23,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:42:23,142 INFO L85 PathProgramCache]: Analyzing trace with hash -1469862747, now seen corresponding path program 1 times [2025-02-05 11:42:23,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:42:23,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329737628] [2025-02-05 11:42:23,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:42:23,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:42:23,167 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 494 statements into 1 equivalence classes. [2025-02-05 11:42:23,183 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 494 of 494 statements. [2025-02-05 11:42:23,184 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:42:23,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:42:23,785 INFO L134 CoverageAnalysis]: Checked inductivity of 492 backedges. 368 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2025-02-05 11:42:23,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:42:23,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329737628] [2025-02-05 11:42:23,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329737628] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:42:23,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:42:23,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:42:23,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255783646] [2025-02-05 11:42:23,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:42:23,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:42:23,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:42:23,786 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:42:23,786 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:42:23,786 INFO L87 Difference]: Start difference. First operand 188541 states and 201489 transitions. Second operand has 3 states, 3 states have (on average 123.66666666666667) internal successors, (371), 3 states have internal predecessors, (371), 0 states have call successors, (0), 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 11:42:27,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:42:27,192 INFO L93 Difference]: Finished difference Result 365227 states and 391395 transitions. [2025-02-05 11:42:27,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:42:27,192 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 123.66666666666667) internal successors, (371), 3 states have internal predecessors, (371), 0 states have call successors, (0), 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 494 [2025-02-05 11:42:27,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:42:27,390 INFO L225 Difference]: With dead ends: 365227 [2025-02-05 11:42:27,390 INFO L226 Difference]: Without dead ends: 196369 [2025-02-05 11:42:27,719 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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 11:42:27,719 INFO L435 NwaCegarLoop]: 327 mSDtfsCounter, 1172 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 2250 mSolverCounterSat, 737 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1172 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 2987 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 737 IncrementalHoareTripleChecker+Valid, 2250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-02-05 11:42:27,720 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1172 Valid, 339 Invalid, 2987 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [737 Valid, 2250 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-02-05 11:42:27,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196369 states. [2025-02-05 11:42:29,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196369 to 196369. [2025-02-05 11:42:29,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196369 states, 196368 states have (on average 1.063854599527418) internal successors, (208907), 196368 states have internal predecessors, (208907), 0 states have call successors, (0), 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 11:42:30,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196369 states to 196369 states and 208907 transitions. [2025-02-05 11:42:30,024 INFO L78 Accepts]: Start accepts. Automaton has 196369 states and 208907 transitions. Word has length 494 [2025-02-05 11:42:30,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:42:30,024 INFO L471 AbstractCegarLoop]: Abstraction has 196369 states and 208907 transitions. [2025-02-05 11:42:30,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 123.66666666666667) internal successors, (371), 3 states have internal predecessors, (371), 0 states have call successors, (0), 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 11:42:30,024 INFO L276 IsEmpty]: Start isEmpty. Operand 196369 states and 208907 transitions. [2025-02-05 11:42:30,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 540 [2025-02-05 11:42:30,038 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:42:30,039 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:42:30,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 11:42:30,039 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:42:30,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:42:30,039 INFO L85 PathProgramCache]: Analyzing trace with hash -1860313185, now seen corresponding path program 1 times [2025-02-05 11:42:30,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:42:30,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531352836] [2025-02-05 11:42:30,040 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:42:30,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:42:30,070 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 539 statements into 1 equivalence classes. [2025-02-05 11:42:30,089 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 539 of 539 statements. [2025-02-05 11:42:30,089 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:42:30,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:42:30,343 INFO L134 CoverageAnalysis]: Checked inductivity of 457 backedges. 422 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-02-05 11:42:30,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:42:30,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531352836] [2025-02-05 11:42:30,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531352836] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:42:30,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:42:30,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:42:30,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468138723] [2025-02-05 11:42:30,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:42:30,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 11:42:30,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:42:30,345 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 11:42:30,345 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 11:42:30,345 INFO L87 Difference]: Start difference. First operand 196369 states and 208907 transitions. Second operand has 4 states, 4 states have (on average 126.25) internal successors, (505), 3 states have internal predecessors, (505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)