./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem13_label16.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem13_label16.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8b5d267cd1e473b445c52ec06f60f3c8a73f12a2c5a7f8cdb18f8745b90aa156 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 10:41:41,448 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 10:41:41,505 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 10:41:41,512 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 10:41:41,512 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 10:41:41,535 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 10:41:41,536 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 10:41:41,537 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 10:41:41,537 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 10:41:41,537 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 10:41:41,538 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 10:41:41,538 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 10:41:41,538 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 10:41:41,538 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 10:41:41,539 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 10:41:41,539 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 10:41:41,539 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 10:41:41,539 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 10:41:41,539 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 10:41:41,539 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 10:41:41,539 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 10:41:41,539 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 10:41:41,539 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 10:41:41,539 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 10:41:41,540 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 10:41:41,540 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 10:41:41,540 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 10:41:41,540 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 10:41:41,540 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 10:41:41,540 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 10:41:41,540 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 10:41:41,541 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 10:41:41,541 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 10:41:41,541 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 10:41:41,541 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 10:41:41,541 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 10:41:41,541 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 10:41:41,541 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 10:41:41,541 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 10:41:41,541 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 10:41:41,541 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 10:41:41,541 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 10:41:41,541 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 10:41:41,541 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8b5d267cd1e473b445c52ec06f60f3c8a73f12a2c5a7f8cdb18f8745b90aa156 [2025-03-03 10:41:41,756 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 10:41:41,766 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 10:41:41,769 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 10:41:41,770 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 10:41:41,770 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 10:41:41,771 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem13_label16.c [2025-03-03 10:41:42,911 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/68c57f3ac/cac4185e3459461c9745e49116d1527a/FLAGbbc05b7c8 [2025-03-03 10:41:43,398 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 10:41:43,399 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label16.c [2025-03-03 10:41:43,434 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/68c57f3ac/cac4185e3459461c9745e49116d1527a/FLAGbbc05b7c8 [2025-03-03 10:41:43,449 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/68c57f3ac/cac4185e3459461c9745e49116d1527a [2025-03-03 10:41:43,451 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 10:41:43,452 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 10:41:43,453 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 10:41:43,453 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 10:41:43,456 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 10:41:43,457 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:41:43" (1/1) ... [2025-03-03 10:41:43,458 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d795288 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:41:43, skipping insertion in model container [2025-03-03 10:41:43,459 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:41:43" (1/1) ... [2025-03-03 10:41:43,538 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 10:41:43,687 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label16.c[3388,3401] [2025-03-03 10:41:44,180 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 10:41:44,188 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 10:41:44,203 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label16.c[3388,3401] [2025-03-03 10:41:44,504 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 10:41:44,520 INFO L204 MainTranslator]: Completed translation [2025-03-03 10:41:44,521 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:41:44 WrapperNode [2025-03-03 10:41:44,521 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 10:41:44,522 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 10:41:44,522 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 10:41:44,522 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 10:41:44,526 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:41:44" (1/1) ... [2025-03-03 10:41:44,572 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:41:44" (1/1) ... [2025-03-03 10:41:44,986 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 5584 [2025-03-03 10:41:44,987 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 10:41:44,988 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 10:41:44,988 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 10:41:44,988 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 10:41:44,994 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:41:44" (1/1) ... [2025-03-03 10:41:44,994 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:41:44" (1/1) ... [2025-03-03 10:41:45,057 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:41:44" (1/1) ... [2025-03-03 10:41:45,253 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 10:41:45,253 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:41:44" (1/1) ... [2025-03-03 10:41:45,253 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:41:44" (1/1) ... [2025-03-03 10:41:45,456 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:41:44" (1/1) ... [2025-03-03 10:41:45,496 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:41:44" (1/1) ... [2025-03-03 10:41:45,516 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:41:44" (1/1) ... [2025-03-03 10:41:45,536 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:41:44" (1/1) ... [2025-03-03 10:41:45,584 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 10:41:45,586 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 10:41:45,586 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 10:41:45,586 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 10:41:45,587 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:41:44" (1/1) ... [2025-03-03 10:41:45,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 10:41:45,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:41:45,617 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 10:41:45,620 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 10:41:45,638 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 10:41:45,638 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 10:41:45,638 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 10:41:45,638 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 10:41:45,692 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 10:41:45,693 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 10:41:49,609 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1894: havoc calculate_output_#t~ret9#1; [2025-03-03 10:41:49,610 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3629: havoc calculate_output2_#t~ret10#1; [2025-03-03 10:41:49,610 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5351: havoc calculate_output3_#t~ret11#1; [2025-03-03 10:41:49,743 INFO L? ?]: Removed 738 outVars from TransFormulas that were not future-live. [2025-03-03 10:41:49,743 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 10:41:49,772 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 10:41:49,776 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 10:41:49,777 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:41:49 BoogieIcfgContainer [2025-03-03 10:41:49,777 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 10:41:49,779 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 10:41:49,779 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 10:41:49,785 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 10:41:49,785 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 10:41:43" (1/3) ... [2025-03-03 10:41:49,785 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17316450 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:41:49, skipping insertion in model container [2025-03-03 10:41:49,785 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:41:44" (2/3) ... [2025-03-03 10:41:49,785 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17316450 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:41:49, skipping insertion in model container [2025-03-03 10:41:49,785 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:41:49" (3/3) ... [2025-03-03 10:41:49,786 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem13_label16.c [2025-03-03 10:41:49,798 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 10:41:49,800 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem13_label16.c that has 1 procedures, 1098 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 10:41:49,871 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 10:41:49,879 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;@67a24898, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 10:41:49,880 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 10:41:49,887 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-03-03 10:41:49,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-03 10:41:49,891 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:41:49,891 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] [2025-03-03 10:41:49,892 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:41:49,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:41:49,896 INFO L85 PathProgramCache]: Analyzing trace with hash -1862024186, now seen corresponding path program 1 times [2025-03-03 10:41:49,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:41:49,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838617710] [2025-03-03 10:41:49,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:41:49,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:41:49,950 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-03 10:41:49,976 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-03 10:41:49,977 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:41:49,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:41:50,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:41:50,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:41:50,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838617710] [2025-03-03 10:41:50,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838617710] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:41:50,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:41:50,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:41:50,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510571139] [2025-03-03 10:41:50,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:41:50,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:41:50,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:41:50,128 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:41:50,129 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:41:50,134 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 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 2 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:41:53,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:41:53,396 INFO L93 Difference]: Finished difference Result 3147 states and 5803 transitions. [2025-03-03 10:41:53,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:41:53,398 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 2 states have internal predecessors, (22), 0 states have call successors, (0), 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 22 [2025-03-03 10:41:53,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:41:53,421 INFO L225 Difference]: With dead ends: 3147 [2025-03-03 10:41:53,422 INFO L226 Difference]: Without dead ends: 1964 [2025-03-03 10:41:53,429 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-03-03 10:41:53,431 INFO L435 NwaCegarLoop]: 759 mSDtfsCounter, 1157 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 2714 mSolverCounterSat, 584 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1157 SdHoareTripleChecker+Valid, 987 SdHoareTripleChecker+Invalid, 3298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 584 IncrementalHoareTripleChecker+Valid, 2714 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2025-03-03 10:41:53,431 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1157 Valid, 987 Invalid, 3298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [584 Valid, 2714 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2025-03-03 10:41:53,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1964 states. [2025-03-03 10:41:53,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1964 to 1951. [2025-03-03 10:41:53,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1951 states, 1950 states have (on average 1.6538461538461537) internal successors, (3225), 1950 states have internal predecessors, (3225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:41:53,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1951 states to 1951 states and 3225 transitions. [2025-03-03 10:41:53,530 INFO L78 Accepts]: Start accepts. Automaton has 1951 states and 3225 transitions. Word has length 22 [2025-03-03 10:41:53,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:41:53,531 INFO L471 AbstractCegarLoop]: Abstraction has 1951 states and 3225 transitions. [2025-03-03 10:41:53,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 2 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:41:53,531 INFO L276 IsEmpty]: Start isEmpty. Operand 1951 states and 3225 transitions. [2025-03-03 10:41:53,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-03 10:41:53,534 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:41:53,534 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 10:41:53,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 10:41:53,535 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:41:53,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:41:53,536 INFO L85 PathProgramCache]: Analyzing trace with hash -1771512434, now seen corresponding path program 1 times [2025-03-03 10:41:53,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:41:53,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015508294] [2025-03-03 10:41:53,536 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:41:53,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:41:53,551 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-03 10:41:53,586 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-03 10:41:53,590 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:41:53,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:41:53,741 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:41:53,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:41:53,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015508294] [2025-03-03 10:41:53,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015508294] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:41:53,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:41:53,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:41:53,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635648447] [2025-03-03 10:41:53,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:41:53,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:41:53,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:41:53,743 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:41:53,743 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:41:53,744 INFO L87 Difference]: Start difference. First operand 1951 states and 3225 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 2 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:41:56,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:41:56,636 INFO L93 Difference]: Finished difference Result 5540 states and 9221 transitions. [2025-03-03 10:41:56,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:41:56,637 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 2 states have internal predecessors, (93), 0 states have call successors, (0), 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 93 [2025-03-03 10:41:56,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:41:56,648 INFO L225 Difference]: With dead ends: 5540 [2025-03-03 10:41:56,648 INFO L226 Difference]: Without dead ends: 3591 [2025-03-03 10:41:56,651 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-03-03 10:41:56,652 INFO L435 NwaCegarLoop]: 872 mSDtfsCounter, 923 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 2591 mSolverCounterSat, 750 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 923 SdHoareTripleChecker+Valid, 1008 SdHoareTripleChecker+Invalid, 3341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 750 IncrementalHoareTripleChecker+Valid, 2591 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-03-03 10:41:56,652 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [923 Valid, 1008 Invalid, 3341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [750 Valid, 2591 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-03-03 10:41:56,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3591 states. [2025-03-03 10:41:56,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3591 to 3581. [2025-03-03 10:41:56,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3581 states, 3580 states have (on average 1.5050279329608938) internal successors, (5388), 3580 states have internal predecessors, (5388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:41:56,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3581 states to 3581 states and 5388 transitions. [2025-03-03 10:41:56,707 INFO L78 Accepts]: Start accepts. Automaton has 3581 states and 5388 transitions. Word has length 93 [2025-03-03 10:41:56,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:41:56,707 INFO L471 AbstractCegarLoop]: Abstraction has 3581 states and 5388 transitions. [2025-03-03 10:41:56,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 2 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:41:56,708 INFO L276 IsEmpty]: Start isEmpty. Operand 3581 states and 5388 transitions. [2025-03-03 10:41:56,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-03 10:41:56,709 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:41:56,709 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 10:41:56,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 10:41:56,710 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:41:56,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:41:56,710 INFO L85 PathProgramCache]: Analyzing trace with hash -1843163833, now seen corresponding path program 1 times [2025-03-03 10:41:56,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:41:56,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282286459] [2025-03-03 10:41:56,711 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:41:56,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:41:56,725 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-03 10:41:56,741 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-03 10:41:56,742 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:41:56,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:41:56,887 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:41:56,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:41:56,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282286459] [2025-03-03 10:41:56,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282286459] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:41:56,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:41:56,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:41:56,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333949519] [2025-03-03 10:41:56,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:41:56,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:41:56,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:41:56,888 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:41:56,888 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:41:56,889 INFO L87 Difference]: Start difference. First operand 3581 states and 5388 transitions. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 2 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:41:59,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:41:59,912 INFO L93 Difference]: Finished difference Result 10352 states and 15625 transitions. [2025-03-03 10:41:59,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:41:59,913 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 2 states have internal predecessors, (107), 0 states have call successors, (0), 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 107 [2025-03-03 10:41:59,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:41:59,931 INFO L225 Difference]: With dead ends: 10352 [2025-03-03 10:41:59,931 INFO L226 Difference]: Without dead ends: 6773 [2025-03-03 10:41:59,935 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-03-03 10:41:59,936 INFO L435 NwaCegarLoop]: 1020 mSDtfsCounter, 785 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 2491 mSolverCounterSat, 786 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 785 SdHoareTripleChecker+Valid, 1171 SdHoareTripleChecker+Invalid, 3277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 786 IncrementalHoareTripleChecker+Valid, 2491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2025-03-03 10:41:59,936 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [785 Valid, 1171 Invalid, 3277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [786 Valid, 2491 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2025-03-03 10:41:59,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6773 states. [2025-03-03 10:42:00,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6773 to 6749. [2025-03-03 10:42:00,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6749 states, 6748 states have (on average 1.3252815649081209) internal successors, (8943), 6748 states have internal predecessors, (8943), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:42:00,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6749 states to 6749 states and 8943 transitions. [2025-03-03 10:42:00,035 INFO L78 Accepts]: Start accepts. Automaton has 6749 states and 8943 transitions. Word has length 107 [2025-03-03 10:42:00,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:42:00,035 INFO L471 AbstractCegarLoop]: Abstraction has 6749 states and 8943 transitions. [2025-03-03 10:42:00,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 2 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:42:00,036 INFO L276 IsEmpty]: Start isEmpty. Operand 6749 states and 8943 transitions. [2025-03-03 10:42:00,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-03 10:42:00,037 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:42:00,037 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:42:00,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 10:42:00,037 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:42:00,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:42:00,041 INFO L85 PathProgramCache]: Analyzing trace with hash 2081982610, now seen corresponding path program 1 times [2025-03-03 10:42:00,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:42:00,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755798626] [2025-03-03 10:42:00,041 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:42:00,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:42:00,057 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-03 10:42:00,071 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-03 10:42:00,071 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:42:00,071 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:42:00,205 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:42:00,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:42:00,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755798626] [2025-03-03 10:42:00,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755798626] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:42:00,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:42:00,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:42:00,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985831182] [2025-03-03 10:42:00,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:42:00,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:42:00,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:42:00,206 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:42:00,206 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:42:00,207 INFO L87 Difference]: Start difference. First operand 6749 states and 8943 transitions. Second operand has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 2 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:42:03,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:42:03,426 INFO L93 Difference]: Finished difference Result 19871 states and 26319 transitions. [2025-03-03 10:42:03,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:42:03,431 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 2 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 136 [2025-03-03 10:42:03,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:42:03,462 INFO L225 Difference]: With dead ends: 19871 [2025-03-03 10:42:03,462 INFO L226 Difference]: Without dead ends: 13124 [2025-03-03 10:42:03,469 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-03-03 10:42:03,471 INFO L435 NwaCegarLoop]: 444 mSDtfsCounter, 899 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 2877 mSolverCounterSat, 555 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 899 SdHoareTripleChecker+Valid, 611 SdHoareTripleChecker+Invalid, 3432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 555 IncrementalHoareTripleChecker+Valid, 2877 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2025-03-03 10:42:03,472 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [899 Valid, 611 Invalid, 3432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [555 Valid, 2877 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2025-03-03 10:42:03,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13124 states. [2025-03-03 10:42:03,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13124 to 13114. [2025-03-03 10:42:03,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13114 states, 13113 states have (on average 1.2755281018836269) internal successors, (16726), 13113 states have internal predecessors, (16726), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:42:03,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13114 states to 13114 states and 16726 transitions. [2025-03-03 10:42:03,649 INFO L78 Accepts]: Start accepts. Automaton has 13114 states and 16726 transitions. Word has length 136 [2025-03-03 10:42:03,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:42:03,650 INFO L471 AbstractCegarLoop]: Abstraction has 13114 states and 16726 transitions. [2025-03-03 10:42:03,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 2 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:42:03,650 INFO L276 IsEmpty]: Start isEmpty. Operand 13114 states and 16726 transitions. [2025-03-03 10:42:03,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2025-03-03 10:42:03,653 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:42:03,653 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:42:03,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 10:42:03,653 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:42:03,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:42:03,654 INFO L85 PathProgramCache]: Analyzing trace with hash 853385999, now seen corresponding path program 1 times [2025-03-03 10:42:03,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:42:03,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939388788] [2025-03-03 10:42:03,654 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:42:03,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:42:03,675 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 219 statements into 1 equivalence classes. [2025-03-03 10:42:03,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 219 of 219 statements. [2025-03-03 10:42:03,702 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:42:03,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:42:03,942 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2025-03-03 10:42:03,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:42:03,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939388788] [2025-03-03 10:42:03,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939388788] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:42:03,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:42:03,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:42:03,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572018538] [2025-03-03 10:42:03,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:42:03,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:42:03,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:42:03,945 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:42:03,945 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:42:03,945 INFO L87 Difference]: Start difference. First operand 13114 states and 16726 transitions. Second operand has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 2 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:42:06,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:42:06,392 INFO L93 Difference]: Finished difference Result 36461 states and 47023 transitions. [2025-03-03 10:42:06,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:42:06,392 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 2 states have internal predecessors, (149), 0 states have call successors, (0), 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 219 [2025-03-03 10:42:06,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:42:06,429 INFO L225 Difference]: With dead ends: 36461 [2025-03-03 10:42:06,429 INFO L226 Difference]: Without dead ends: 24136 [2025-03-03 10:42:06,437 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-03-03 10:42:06,438 INFO L435 NwaCegarLoop]: 881 mSDtfsCounter, 849 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 2330 mSolverCounterSat, 875 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 849 SdHoareTripleChecker+Valid, 1033 SdHoareTripleChecker+Invalid, 3205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 875 IncrementalHoareTripleChecker+Valid, 2330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-03-03 10:42:06,438 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [849 Valid, 1033 Invalid, 3205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [875 Valid, 2330 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-03-03 10:42:06,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24136 states. [2025-03-03 10:42:06,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24136 to 24130. [2025-03-03 10:42:06,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24130 states, 24129 states have (on average 1.2020804840648183) internal successors, (29005), 24129 states have internal predecessors, (29005), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:42:06,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24130 states to 24130 states and 29005 transitions. [2025-03-03 10:42:06,673 INFO L78 Accepts]: Start accepts. Automaton has 24130 states and 29005 transitions. Word has length 219 [2025-03-03 10:42:06,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:42:06,673 INFO L471 AbstractCegarLoop]: Abstraction has 24130 states and 29005 transitions. [2025-03-03 10:42:06,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 2 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:42:06,673 INFO L276 IsEmpty]: Start isEmpty. Operand 24130 states and 29005 transitions. [2025-03-03 10:42:06,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2025-03-03 10:42:06,678 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:42:06,678 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:42:06,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 10:42:06,678 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:42:06,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:42:06,679 INFO L85 PathProgramCache]: Analyzing trace with hash -409201255, now seen corresponding path program 1 times [2025-03-03 10:42:06,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:42:06,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245923173] [2025-03-03 10:42:06,679 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:42:06,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:42:06,701 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 223 statements into 1 equivalence classes. [2025-03-03 10:42:06,712 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 223 of 223 statements. [2025-03-03 10:42:06,712 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:42:06,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:42:06,968 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-03 10:42:06,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:42:06,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245923173] [2025-03-03 10:42:06,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245923173] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:42:06,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:42:06,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:42:06,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660500210] [2025-03-03 10:42:06,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:42:06,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:42:06,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:42:06,972 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:42:06,973 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:42:06,973 INFO L87 Difference]: Start difference. First operand 24130 states and 29005 transitions. Second operand has 3 states, 3 states have (on average 68.0) internal successors, (204), 2 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:42:09,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:42:09,169 INFO L93 Difference]: Finished difference Result 43520 states and 52823 transitions. [2025-03-03 10:42:09,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:42:09,170 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 68.0) internal successors, (204), 2 states have internal predecessors, (204), 0 states have call successors, (0), 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 223 [2025-03-03 10:42:09,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:42:09,206 INFO L225 Difference]: With dead ends: 43520 [2025-03-03 10:42:09,206 INFO L226 Difference]: Without dead ends: 24131 [2025-03-03 10:42:09,216 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-03-03 10:42:09,216 INFO L435 NwaCegarLoop]: 1078 mSDtfsCounter, 676 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 2521 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 676 SdHoareTripleChecker+Valid, 1213 SdHoareTripleChecker+Invalid, 2525 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 2521 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-03 10:42:09,217 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [676 Valid, 1213 Invalid, 2525 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 2521 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-03 10:42:09,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24131 states. [2025-03-03 10:42:09,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24131 to 24130. [2025-03-03 10:42:09,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24130 states, 24129 states have (on average 1.2018732645364498) internal successors, (29000), 24129 states have internal predecessors, (29000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:42:09,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24130 states to 24130 states and 29000 transitions. [2025-03-03 10:42:09,439 INFO L78 Accepts]: Start accepts. Automaton has 24130 states and 29000 transitions. Word has length 223 [2025-03-03 10:42:09,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:42:09,440 INFO L471 AbstractCegarLoop]: Abstraction has 24130 states and 29000 transitions. [2025-03-03 10:42:09,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.0) internal successors, (204), 2 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:42:09,440 INFO L276 IsEmpty]: Start isEmpty. Operand 24130 states and 29000 transitions. [2025-03-03 10:42:09,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2025-03-03 10:42:09,447 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:42:09,447 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:42:09,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 10:42:09,447 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:42:09,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:42:09,447 INFO L85 PathProgramCache]: Analyzing trace with hash 2061165929, now seen corresponding path program 1 times [2025-03-03 10:42:09,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:42:09,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130594632] [2025-03-03 10:42:09,447 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:42:09,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:42:09,471 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 236 statements into 1 equivalence classes. [2025-03-03 10:42:09,505 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 236 of 236 statements. [2025-03-03 10:42:09,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:42:09,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:42:09,689 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:42:09,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:42:09,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130594632] [2025-03-03 10:42:09,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130594632] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:42:09,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:42:09,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:42:09,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49082652] [2025-03-03 10:42:09,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:42:09,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:42:09,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:42:09,692 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:42:09,692 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:42:09,692 INFO L87 Difference]: Start difference. First operand 24130 states and 29000 transitions. Second operand has 3 states, 3 states have (on average 78.66666666666667) internal successors, (236), 3 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:42:12,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:42:12,207 INFO L93 Difference]: Finished difference Result 47314 states and 56987 transitions. [2025-03-03 10:42:12,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:42:12,208 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 78.66666666666667) internal successors, (236), 3 states have internal predecessors, (236), 0 states have call successors, (0), 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 236 [2025-03-03 10:42:12,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:42:12,239 INFO L225 Difference]: With dead ends: 47314 [2025-03-03 10:42:12,239 INFO L226 Difference]: Without dead ends: 23973 [2025-03-03 10:42:12,258 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:42:12,260 INFO L435 NwaCegarLoop]: 1520 mSDtfsCounter, 1037 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 2354 mSolverCounterSat, 596 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1037 SdHoareTripleChecker+Valid, 1657 SdHoareTripleChecker+Invalid, 2950 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 596 IncrementalHoareTripleChecker+Valid, 2354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-03-03 10:42:12,260 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1037 Valid, 1657 Invalid, 2950 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [596 Valid, 2354 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-03-03 10:42:12,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23973 states. [2025-03-03 10:42:12,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23973 to 23968. [2025-03-03 10:42:12,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23968 states, 23967 states have (on average 1.1344348479158843) internal successors, (27189), 23967 states have internal predecessors, (27189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:42:12,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23968 states to 23968 states and 27189 transitions. [2025-03-03 10:42:12,513 INFO L78 Accepts]: Start accepts. Automaton has 23968 states and 27189 transitions. Word has length 236 [2025-03-03 10:42:12,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:42:12,514 INFO L471 AbstractCegarLoop]: Abstraction has 23968 states and 27189 transitions. [2025-03-03 10:42:12,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 78.66666666666667) internal successors, (236), 3 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:42:12,514 INFO L276 IsEmpty]: Start isEmpty. Operand 23968 states and 27189 transitions. [2025-03-03 10:42:12,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2025-03-03 10:42:12,516 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:42:12,518 INFO L218 NwaCegarLoop]: trace histogram [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, 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] [2025-03-03 10:42:12,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 10:42:12,518 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:42:12,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:42:12,519 INFO L85 PathProgramCache]: Analyzing trace with hash 586431618, now seen corresponding path program 1 times [2025-03-03 10:42:12,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:42:12,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839716334] [2025-03-03 10:42:12,519 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:42:12,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:42:12,538 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 255 statements into 1 equivalence classes. [2025-03-03 10:42:12,547 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 255 of 255 statements. [2025-03-03 10:42:12,548 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:42:12,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:42:12,810 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 161 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2025-03-03 10:42:12,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:42:12,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839716334] [2025-03-03 10:42:12,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839716334] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:42:12,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:42:12,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:42:12,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481684615] [2025-03-03 10:42:12,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:42:12,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:42:12,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:42:12,813 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:42:12,813 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:42:12,813 INFO L87 Difference]: Start difference. First operand 23968 states and 27189 transitions. Second operand has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 2 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:42:15,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:42:15,306 INFO L93 Difference]: Finished difference Result 47147 states and 53579 transitions. [2025-03-03 10:42:15,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:42:15,306 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 2 states have internal predecessors, (166), 0 states have call successors, (0), 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 255 [2025-03-03 10:42:15,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:42:15,336 INFO L225 Difference]: With dead ends: 47147 [2025-03-03 10:42:15,336 INFO L226 Difference]: Without dead ends: 23968 [2025-03-03 10:42:15,351 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-03-03 10:42:15,351 INFO L435 NwaCegarLoop]: 1056 mSDtfsCounter, 700 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 2493 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 700 SdHoareTripleChecker+Valid, 1185 SdHoareTripleChecker+Invalid, 2497 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 2493 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-03-03 10:42:15,352 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [700 Valid, 1185 Invalid, 2497 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 2493 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-03-03 10:42:15,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23968 states. [2025-03-03 10:42:15,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23968 to 23968. [2025-03-03 10:42:15,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23968 states, 23967 states have (on average 1.1342262277297952) internal successors, (27184), 23967 states have internal predecessors, (27184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:42:15,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23968 states to 23968 states and 27184 transitions. [2025-03-03 10:42:15,704 INFO L78 Accepts]: Start accepts. Automaton has 23968 states and 27184 transitions. Word has length 255 [2025-03-03 10:42:15,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:42:15,709 INFO L471 AbstractCegarLoop]: Abstraction has 23968 states and 27184 transitions. [2025-03-03 10:42:15,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 2 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:42:15,709 INFO L276 IsEmpty]: Start isEmpty. Operand 23968 states and 27184 transitions. [2025-03-03 10:42:15,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2025-03-03 10:42:15,712 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:42:15,712 INFO L218 NwaCegarLoop]: trace histogram [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, 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] [2025-03-03 10:42:15,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 10:42:15,712 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:42:15,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:42:15,718 INFO L85 PathProgramCache]: Analyzing trace with hash -1016544002, now seen corresponding path program 1 times [2025-03-03 10:42:15,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:42:15,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606379774] [2025-03-03 10:42:15,719 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:42:15,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:42:15,739 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 262 statements into 1 equivalence classes. [2025-03-03 10:42:15,756 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 262 of 262 statements. [2025-03-03 10:42:15,756 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:42:15,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:42:15,978 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 252 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-03 10:42:15,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:42:15,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606379774] [2025-03-03 10:42:15,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606379774] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:42:15,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:42:15,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:42:15,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734681558] [2025-03-03 10:42:15,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:42:15,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:42:15,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:42:15,979 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:42:15,979 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:42:15,980 INFO L87 Difference]: Start difference. First operand 23968 states and 27184 transitions. Second operand has 4 states, 4 states have (on average 60.75) internal successors, (243), 3 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:42:21,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:42:21,490 INFO L93 Difference]: Finished difference Result 85143 states and 97159 transitions. [2025-03-03 10:42:21,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:42:21,491 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 60.75) internal successors, (243), 3 states have internal predecessors, (243), 0 states have call successors, (0), 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 262 [2025-03-03 10:42:21,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:42:21,558 INFO L225 Difference]: With dead ends: 85143 [2025-03-03 10:42:21,558 INFO L226 Difference]: Without dead ends: 61964 [2025-03-03 10:42:21,574 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-03-03 10:42:21,575 INFO L435 NwaCegarLoop]: 627 mSDtfsCounter, 1740 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 6753 mSolverCounterSat, 1058 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1740 SdHoareTripleChecker+Valid, 867 SdHoareTripleChecker+Invalid, 7811 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1058 IncrementalHoareTripleChecker+Valid, 6753 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2025-03-03 10:42:21,575 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1740 Valid, 867 Invalid, 7811 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1058 Valid, 6753 Invalid, 0 Unknown, 0 Unchecked, 5.2s Time] [2025-03-03 10:42:21,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61964 states. [2025-03-03 10:42:22,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61964 to 60259. [2025-03-03 10:42:22,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60259 states, 60258 states have (on average 1.1227056988283712) internal successors, (67652), 60258 states have internal predecessors, (67652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:42:22,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60259 states to 60259 states and 67652 transitions. [2025-03-03 10:42:22,316 INFO L78 Accepts]: Start accepts. Automaton has 60259 states and 67652 transitions. Word has length 262 [2025-03-03 10:42:22,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:42:22,316 INFO L471 AbstractCegarLoop]: Abstraction has 60259 states and 67652 transitions. [2025-03-03 10:42:22,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 60.75) internal successors, (243), 3 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:42:22,317 INFO L276 IsEmpty]: Start isEmpty. Operand 60259 states and 67652 transitions. [2025-03-03 10:42:22,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 320 [2025-03-03 10:42:22,321 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:42:22,321 INFO L218 NwaCegarLoop]: trace histogram [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, 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] [2025-03-03 10:42:22,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 10:42:22,321 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:42:22,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:42:22,322 INFO L85 PathProgramCache]: Analyzing trace with hash -1977980026, now seen corresponding path program 1 times [2025-03-03 10:42:22,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:42:22,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493348648] [2025-03-03 10:42:22,322 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:42:22,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:42:22,343 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 319 statements into 1 equivalence classes. [2025-03-03 10:42:22,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 319 of 319 statements. [2025-03-03 10:42:22,358 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:42:22,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:42:22,752 INFO L134 CoverageAnalysis]: Checked inductivity of 323 backedges. 303 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-03 10:42:22,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:42:22,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493348648] [2025-03-03 10:42:22,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493348648] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:42:22,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:42:22,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:42:22,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659221938] [2025-03-03 10:42:22,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:42:22,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:42:22,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:42:22,755 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:42:22,755 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:42:22,756 INFO L87 Difference]: Start difference. First operand 60259 states and 67652 transitions. Second operand has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:42:25,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:42:25,782 INFO L93 Difference]: Finished difference Result 146519 states and 166338 transitions. [2025-03-03 10:42:25,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:42:25,783 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 0 states have call successors, (0), 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 319 [2025-03-03 10:42:25,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:42:25,861 INFO L225 Difference]: With dead ends: 146519 [2025-03-03 10:42:25,861 INFO L226 Difference]: Without dead ends: 83896 [2025-03-03 10:42:25,891 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:42:25,892 INFO L435 NwaCegarLoop]: 1827 mSDtfsCounter, 746 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 2589 mSolverCounterSat, 709 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 746 SdHoareTripleChecker+Valid, 1967 SdHoareTripleChecker+Invalid, 3298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 709 IncrementalHoareTripleChecker+Valid, 2589 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-03-03 10:42:25,892 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [746 Valid, 1967 Invalid, 3298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [709 Valid, 2589 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-03-03 10:42:25,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83896 states. [2025-03-03 10:42:26,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83896 to 80709. [2025-03-03 10:42:26,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80709 states, 80708 states have (on average 1.1046984189919216) internal successors, (89158), 80708 states have internal predecessors, (89158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:42:26,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80709 states to 80709 states and 89158 transitions. [2025-03-03 10:42:26,773 INFO L78 Accepts]: Start accepts. Automaton has 80709 states and 89158 transitions. Word has length 319 [2025-03-03 10:42:26,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:42:26,773 INFO L471 AbstractCegarLoop]: Abstraction has 80709 states and 89158 transitions. [2025-03-03 10:42:26,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:42:26,773 INFO L276 IsEmpty]: Start isEmpty. Operand 80709 states and 89158 transitions. [2025-03-03 10:42:26,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2025-03-03 10:42:26,776 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:42:26,776 INFO L218 NwaCegarLoop]: trace histogram [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, 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] [2025-03-03 10:42:26,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 10:42:26,776 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:42:26,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:42:26,777 INFO L85 PathProgramCache]: Analyzing trace with hash -1053922299, now seen corresponding path program 1 times [2025-03-03 10:42:26,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:42:26,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436902122] [2025-03-03 10:42:26,777 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:42:26,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:42:26,797 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 348 statements into 1 equivalence classes. [2025-03-03 10:42:26,808 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 348 of 348 statements. [2025-03-03 10:42:26,809 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:42:26,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:42:27,871 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 208 proven. 113 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-03 10:42:27,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:42:27,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436902122] [2025-03-03 10:42:27,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436902122] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:42:27,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1410808649] [2025-03-03 10:42:27,873 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:42:27,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:42:27,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:42:27,875 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 10:42:27,877 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 10:42:27,938 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 348 statements into 1 equivalence classes. [2025-03-03 10:42:28,004 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 348 of 348 statements. [2025-03-03 10:42:28,004 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:42:28,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:42:28,007 INFO L256 TraceCheckSpWp]: Trace formula consists of 485 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 10:42:28,019 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:42:28,137 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 208 proven. 0 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2025-03-03 10:42:28,137 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:42:28,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1410808649] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:42:28,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:42:28,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2025-03-03 10:42:28,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826133260] [2025-03-03 10:42:28,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:42:28,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:42:28,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:42:28,138 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:42:28,138 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-03 10:42:28,138 INFO L87 Difference]: Start difference. First operand 80709 states and 89158 transitions. Second operand has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 3 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:42:30,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:42:30,471 INFO L93 Difference]: Finished difference Result 160627 states and 177521 transitions. [2025-03-03 10:42:30,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:42:30,471 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 3 states have internal predecessors, (217), 0 states have call successors, (0), 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 348 [2025-03-03 10:42:30,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:42:30,554 INFO L225 Difference]: With dead ends: 160627 [2025-03-03 10:42:30,554 INFO L226 Difference]: Without dead ends: 80707 [2025-03-03 10:42:30,599 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 354 GetRequests, 347 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-03-03 10:42:30,600 INFO L435 NwaCegarLoop]: 1344 mSDtfsCounter, 1113 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 2451 mSolverCounterSat, 444 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1113 SdHoareTripleChecker+Valid, 1423 SdHoareTripleChecker+Invalid, 2895 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 444 IncrementalHoareTripleChecker+Valid, 2451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-03 10:42:30,600 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1113 Valid, 1423 Invalid, 2895 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [444 Valid, 2451 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-03 10:42:30,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80707 states. [2025-03-03 10:42:31,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80707 to 80706. [2025-03-03 10:42:31,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80706 states, 80705 states have (on average 1.0795861470788675) internal successors, (87128), 80705 states have internal predecessors, (87128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:42:31,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80706 states to 80706 states and 87128 transitions. [2025-03-03 10:42:31,385 INFO L78 Accepts]: Start accepts. Automaton has 80706 states and 87128 transitions. Word has length 348 [2025-03-03 10:42:31,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:42:31,386 INFO L471 AbstractCegarLoop]: Abstraction has 80706 states and 87128 transitions. [2025-03-03 10:42:31,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 3 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:42:31,386 INFO L276 IsEmpty]: Start isEmpty. Operand 80706 states and 87128 transitions. [2025-03-03 10:42:31,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 379 [2025-03-03 10:42:31,390 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:42:31,390 INFO L218 NwaCegarLoop]: trace histogram [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, 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] [2025-03-03 10:42:31,397 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 10:42:31,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-03 10:42:31,594 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:42:31,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:42:31,595 INFO L85 PathProgramCache]: Analyzing trace with hash 459057523, now seen corresponding path program 1 times [2025-03-03 10:42:31,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:42:31,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718105858] [2025-03-03 10:42:31,595 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:42:31,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:42:31,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 378 statements into 1 equivalence classes. [2025-03-03 10:42:31,652 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 378 of 378 statements. [2025-03-03 10:42:31,652 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:42:31,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:42:31,812 INFO L134 CoverageAnalysis]: Checked inductivity of 569 backedges. 408 proven. 0 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2025-03-03 10:42:31,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:42:31,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718105858] [2025-03-03 10:42:31,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718105858] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:42:31,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:42:31,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:42:31,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994087052] [2025-03-03 10:42:31,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:42:31,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:42:31,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:42:31,813 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:42:31,813 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:42:31,813 INFO L87 Difference]: Start difference. First operand 80706 states and 87128 transitions. Second operand has 3 states, 3 states have (on average 73.0) internal successors, (219), 3 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:42:35,841 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 10:42:35,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:42:35,939 INFO L93 Difference]: Finished difference Result 187388 states and 204112 transitions. [2025-03-03 10:42:35,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:42:35,939 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 73.0) internal successors, (219), 3 states have internal predecessors, (219), 0 states have call successors, (0), 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 378 [2025-03-03 10:42:35,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:42:36,055 INFO L225 Difference]: With dead ends: 187388 [2025-03-03 10:42:36,055 INFO L226 Difference]: Without dead ends: 107471 [2025-03-03 10:42:36,100 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:42:36,100 INFO L435 NwaCegarLoop]: 822 mSDtfsCounter, 874 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 2418 mSolverCounterSat, 920 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 874 SdHoareTripleChecker+Valid, 905 SdHoareTripleChecker+Invalid, 3338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 920 IncrementalHoareTripleChecker+Valid, 2418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2025-03-03 10:42:36,100 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [874 Valid, 905 Invalid, 3338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [920 Valid, 2418 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2025-03-03 10:42:36,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107471 states. [2025-03-03 10:42:36,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107471 to 105091. [2025-03-03 10:42:36,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105091 states, 105090 states have (on average 1.0853268626891237) internal successors, (114057), 105090 states have internal predecessors, (114057), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:42:37,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105091 states to 105091 states and 114057 transitions. [2025-03-03 10:42:37,456 INFO L78 Accepts]: Start accepts. Automaton has 105091 states and 114057 transitions. Word has length 378 [2025-03-03 10:42:37,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:42:37,457 INFO L471 AbstractCegarLoop]: Abstraction has 105091 states and 114057 transitions. [2025-03-03 10:42:37,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 73.0) internal successors, (219), 3 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:42:37,457 INFO L276 IsEmpty]: Start isEmpty. Operand 105091 states and 114057 transitions. [2025-03-03 10:42:37,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 417 [2025-03-03 10:42:37,461 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:42:37,461 INFO L218 NwaCegarLoop]: trace histogram [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, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:42:37,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 10:42:37,462 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:42:37,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:42:37,462 INFO L85 PathProgramCache]: Analyzing trace with hash -552062939, now seen corresponding path program 1 times [2025-03-03 10:42:37,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:42:37,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512503523] [2025-03-03 10:42:37,462 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:42:37,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:42:37,486 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 416 statements into 1 equivalence classes. [2025-03-03 10:42:37,500 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 416 of 416 statements. [2025-03-03 10:42:37,500 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:42:37,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:42:37,631 INFO L134 CoverageAnalysis]: Checked inductivity of 578 backedges. 306 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2025-03-03 10:42:37,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:42:37,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512503523] [2025-03-03 10:42:37,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512503523] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:42:37,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:42:37,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:42:37,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194330766] [2025-03-03 10:42:37,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:42:37,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:42:37,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:42:37,633 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:42:37,633 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:42:37,633 INFO L87 Difference]: Start difference. First operand 105091 states and 114057 transitions. Second operand has 3 states, 3 states have (on average 78.0) internal successors, (234), 3 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:42:40,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:42:40,711 INFO L93 Difference]: Finished difference Result 236166 states and 257963 transitions. [2025-03-03 10:42:40,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:42:40,712 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 78.0) internal successors, (234), 3 states have internal predecessors, (234), 0 states have call successors, (0), 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 416 [2025-03-03 10:42:40,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:42:40,883 INFO L225 Difference]: With dead ends: 236166 [2025-03-03 10:42:40,883 INFO L226 Difference]: Without dead ends: 129503 [2025-03-03 10:42:40,940 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:42:40,940 INFO L435 NwaCegarLoop]: 1741 mSDtfsCounter, 785 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 2521 mSolverCounterSat, 711 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 785 SdHoareTripleChecker+Valid, 1884 SdHoareTripleChecker+Invalid, 3232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 711 IncrementalHoareTripleChecker+Valid, 2521 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-03-03 10:42:40,940 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [785 Valid, 1884 Invalid, 3232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [711 Valid, 2521 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-03-03 10:42:41,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129503 states. [2025-03-03 10:42:42,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129503 to 127913. [2025-03-03 10:42:42,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127913 states, 127912 states have (on average 1.0750594158483957) internal successors, (137513), 127912 states have internal predecessors, (137513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:42:42,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127913 states to 127913 states and 137513 transitions. [2025-03-03 10:42:42,287 INFO L78 Accepts]: Start accepts. Automaton has 127913 states and 137513 transitions. Word has length 416 [2025-03-03 10:42:42,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:42:42,288 INFO L471 AbstractCegarLoop]: Abstraction has 127913 states and 137513 transitions. [2025-03-03 10:42:42,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 78.0) internal successors, (234), 3 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:42:42,288 INFO L276 IsEmpty]: Start isEmpty. Operand 127913 states and 137513 transitions. [2025-03-03 10:42:42,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 536 [2025-03-03 10:42:42,301 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:42:42,301 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 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, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 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] [2025-03-03 10:42:42,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 10:42:42,301 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:42:42,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:42:42,301 INFO L85 PathProgramCache]: Analyzing trace with hash -214147264, now seen corresponding path program 1 times [2025-03-03 10:42:42,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:42:42,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919034703] [2025-03-03 10:42:42,302 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:42:42,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:42:42,335 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 535 statements into 1 equivalence classes. [2025-03-03 10:42:42,352 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 535 of 535 statements. [2025-03-03 10:42:42,352 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:42:42,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:42:42,541 INFO L134 CoverageAnalysis]: Checked inductivity of 1017 backedges. 798 proven. 0 refuted. 0 times theorem prover too weak. 219 trivial. 0 not checked. [2025-03-03 10:42:42,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:42:42,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919034703] [2025-03-03 10:42:42,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919034703] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:42:42,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:42:42,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:42:42,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506915632] [2025-03-03 10:42:42,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:42:42,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:42:42,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:42:42,544 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:42:42,544 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:42:42,544 INFO L87 Difference]: Start difference. First operand 127913 states and 137513 transitions. Second operand has 3 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:42:45,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:42:45,546 INFO L93 Difference]: Finished difference Result 256615 states and 275822 transitions. [2025-03-03 10:42:45,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:42:45,546 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 0 states have call successors, (0), 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 535 [2025-03-03 10:42:45,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:42:45,690 INFO L225 Difference]: With dead ends: 256615 [2025-03-03 10:42:45,690 INFO L226 Difference]: Without dead ends: 129491 [2025-03-03 10:42:45,746 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:42:45,746 INFO L435 NwaCegarLoop]: 1376 mSDtfsCounter, 936 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 2474 mSolverCounterSat, 593 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 936 SdHoareTripleChecker+Valid, 1459 SdHoareTripleChecker+Invalid, 3067 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 593 IncrementalHoareTripleChecker+Valid, 2474 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-03-03 10:42:45,746 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [936 Valid, 1459 Invalid, 3067 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [593 Valid, 2474 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-03-03 10:42:45,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129491 states. [2025-03-03 10:42:47,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129491 to 127904. [2025-03-03 10:42:47,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127904 states, 127903 states have (on average 1.0560581065338577) internal successors, (135073), 127903 states have internal predecessors, (135073), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:42:47,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127904 states to 127904 states and 135073 transitions. [2025-03-03 10:42:47,246 INFO L78 Accepts]: Start accepts. Automaton has 127904 states and 135073 transitions. Word has length 535 [2025-03-03 10:42:47,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:42:47,246 INFO L471 AbstractCegarLoop]: Abstraction has 127904 states and 135073 transitions. [2025-03-03 10:42:47,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:42:47,246 INFO L276 IsEmpty]: Start isEmpty. Operand 127904 states and 135073 transitions. [2025-03-03 10:42:47,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 547 [2025-03-03 10:42:47,257 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:42:47,258 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:42:47,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 10:42:47,258 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:42:47,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:42:47,258 INFO L85 PathProgramCache]: Analyzing trace with hash -561457122, now seen corresponding path program 1 times [2025-03-03 10:42:47,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:42:47,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192689365] [2025-03-03 10:42:47,258 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:42:47,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:42:47,284 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 546 statements into 1 equivalence classes. [2025-03-03 10:42:47,300 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 546 of 546 statements. [2025-03-03 10:42:47,300 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:42:47,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:42:47,614 INFO L134 CoverageAnalysis]: Checked inductivity of 971 backedges. 679 proven. 0 refuted. 0 times theorem prover too weak. 292 trivial. 0 not checked. [2025-03-03 10:42:47,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:42:47,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192689365] [2025-03-03 10:42:47,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192689365] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:42:47,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:42:47,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:42:47,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661425488] [2025-03-03 10:42:47,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:42:47,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:42:47,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:42:47,616 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:42:47,617 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:42:47,617 INFO L87 Difference]: Start difference. First operand 127904 states and 135073 transitions. Second operand has 3 states, 3 states have (on average 115.0) internal successors, (345), 3 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:42:50,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:42:50,042 INFO L93 Difference]: Finished difference Result 240066 states and 254009 transitions. [2025-03-03 10:42:50,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:42:50,042 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 115.0) internal successors, (345), 3 states have internal predecessors, (345), 0 states have call successors, (0), 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 546 [2025-03-03 10:42:50,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:42:50,169 INFO L225 Difference]: With dead ends: 240066 [2025-03-03 10:42:50,169 INFO L226 Difference]: Without dead ends: 128697 [2025-03-03 10:42:50,215 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:42:50,215 INFO L435 NwaCegarLoop]: 1787 mSDtfsCounter, 722 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 2521 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 722 SdHoareTripleChecker+Valid, 1921 SdHoareTripleChecker+Invalid, 2526 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 2521 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-03 10:42:50,215 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [722 Valid, 1921 Invalid, 2526 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 2521 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-03 10:42:50,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128697 states. [2025-03-03 10:42:51,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128697 to 128692. [2025-03-03 10:42:51,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128692 states, 128691 states have (on average 1.0560179033498847) internal successors, (135900), 128691 states have internal predecessors, (135900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:42:51,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128692 states to 128692 states and 135900 transitions. [2025-03-03 10:42:51,591 INFO L78 Accepts]: Start accepts. Automaton has 128692 states and 135900 transitions. Word has length 546 [2025-03-03 10:42:51,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:42:51,591 INFO L471 AbstractCegarLoop]: Abstraction has 128692 states and 135900 transitions. [2025-03-03 10:42:51,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 115.0) internal successors, (345), 3 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:42:51,592 INFO L276 IsEmpty]: Start isEmpty. Operand 128692 states and 135900 transitions. [2025-03-03 10:42:51,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 577 [2025-03-03 10:42:51,613 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:42:51,613 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 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, 5, 5, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:42:51,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 10:42:51,613 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:42:51,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:42:51,614 INFO L85 PathProgramCache]: Analyzing trace with hash 477340358, now seen corresponding path program 1 times [2025-03-03 10:42:51,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:42:51,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025067477] [2025-03-03 10:42:51,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:42:51,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:42:51,660 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 576 statements into 1 equivalence classes. [2025-03-03 10:42:51,689 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 576 of 576 statements. [2025-03-03 10:42:51,689 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:42:51,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:42:51,964 INFO L134 CoverageAnalysis]: Checked inductivity of 1052 backedges. 510 proven. 0 refuted. 0 times theorem prover too weak. 542 trivial. 0 not checked. [2025-03-03 10:42:51,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:42:51,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025067477] [2025-03-03 10:42:51,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025067477] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:42:51,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:42:51,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:42:51,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292794480] [2025-03-03 10:42:51,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:42:51,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:42:51,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:42:51,965 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:42:51,965 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:42:51,965 INFO L87 Difference]: Start difference. First operand 128692 states and 135900 transitions. Second operand has 3 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:42:55,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:42:55,069 INFO L93 Difference]: Finished difference Result 250253 states and 264935 transitions. [2025-03-03 10:42:55,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:42:55,070 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 0 states have call successors, (0), 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 576 [2025-03-03 10:42:55,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:42:55,214 INFO L225 Difference]: With dead ends: 250253 [2025-03-03 10:42:55,214 INFO L226 Difference]: Without dead ends: 138096 [2025-03-03 10:42:55,250 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:42:55,251 INFO L435 NwaCegarLoop]: 1384 mSDtfsCounter, 1010 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 2348 mSolverCounterSat, 416 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1010 SdHoareTripleChecker+Valid, 1459 SdHoareTripleChecker+Invalid, 2764 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 416 IncrementalHoareTripleChecker+Valid, 2348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-03-03 10:42:55,251 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1010 Valid, 1459 Invalid, 2764 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [416 Valid, 2348 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-03-03 10:42:55,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138096 states. [2025-03-03 10:42:56,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138096 to 138095. [2025-03-03 10:42:56,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138095 states, 138094 states have (on average 1.0526308166900806) internal successors, (145362), 138094 states have internal predecessors, (145362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:42:56,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138095 states to 138095 states and 145362 transitions. [2025-03-03 10:42:56,671 INFO L78 Accepts]: Start accepts. Automaton has 138095 states and 145362 transitions. Word has length 576 [2025-03-03 10:42:56,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:42:56,671 INFO L471 AbstractCegarLoop]: Abstraction has 138095 states and 145362 transitions. [2025-03-03 10:42:56,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:42:56,671 INFO L276 IsEmpty]: Start isEmpty. Operand 138095 states and 145362 transitions. [2025-03-03 10:42:56,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 627 [2025-03-03 10:42:56,687 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:42:56,687 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:42:56,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 10:42:56,688 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:42:56,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:42:56,688 INFO L85 PathProgramCache]: Analyzing trace with hash 441045867, now seen corresponding path program 1 times [2025-03-03 10:42:56,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:42:56,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336489341] [2025-03-03 10:42:56,688 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:42:56,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:42:56,720 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 626 statements into 1 equivalence classes. [2025-03-03 10:42:56,746 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 626 of 626 statements. [2025-03-03 10:42:56,746 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:42:56,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:42:57,246 INFO L134 CoverageAnalysis]: Checked inductivity of 664 backedges. 556 proven. 0 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2025-03-03 10:42:57,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:42:57,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336489341] [2025-03-03 10:42:57,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336489341] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:42:57,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:42:57,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 10:42:57,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747277457] [2025-03-03 10:42:57,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:42:57,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:42:57,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:42:57,248 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:42:57,248 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:42:57,248 INFO L87 Difference]: Start difference. First operand 138095 states and 145362 transitions. Second operand has 4 states, 4 states have (on average 130.0) internal successors, (520), 4 states have internal predecessors, (520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:43:02,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:43:02,711 INFO L93 Difference]: Finished difference Result 388927 states and 409937 transitions. [2025-03-03 10:43:02,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:43:02,712 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 130.0) internal successors, (520), 4 states have internal predecessors, (520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 626 [2025-03-03 10:43:02,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:43:03,212 INFO L225 Difference]: With dead ends: 388927 [2025-03-03 10:43:03,212 INFO L226 Difference]: Without dead ends: 251621 [2025-03-03 10:43:03,271 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:43:03,272 INFO L435 NwaCegarLoop]: 633 mSDtfsCounter, 1705 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 6264 mSolverCounterSat, 1086 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1705 SdHoareTripleChecker+Valid, 878 SdHoareTripleChecker+Invalid, 7350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1086 IncrementalHoareTripleChecker+Valid, 6264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2025-03-03 10:43:03,272 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1705 Valid, 878 Invalid, 7350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1086 Valid, 6264 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2025-03-03 10:43:03,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251621 states.