./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem13_label51.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_label51.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 c60e1c745de50239709fa60c913e491a1f371528f5baa59b32c10ff978467292 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 10:45:06,777 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 10:45:06,819 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 10:45:06,827 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 10:45:06,827 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 10:45:06,847 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 10:45:06,848 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 10:45:06,848 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 10:45:06,848 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 10:45:06,848 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 10:45:06,849 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 10:45:06,849 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 10:45:06,849 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 10:45:06,850 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 10:45:06,850 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 10:45:06,850 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 10:45:06,850 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 10:45:06,850 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 10:45:06,850 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 10:45:06,850 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 10:45:06,851 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 10:45:06,851 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 10:45:06,851 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 10:45:06,851 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 10:45:06,851 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 10:45:06,851 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 10:45:06,851 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 10:45:06,851 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 10:45:06,851 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 10:45:06,851 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 10:45:06,852 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 10:45:06,852 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 10:45:06,852 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 10:45:06,852 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 10:45:06,852 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 10:45:06,852 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 10:45:06,852 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 10:45:06,852 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 10:45:06,852 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 10:45:06,852 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 10:45:06,852 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 10:45:06,853 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 10:45:06,853 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 10:45:06,853 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 -> c60e1c745de50239709fa60c913e491a1f371528f5baa59b32c10ff978467292 [2025-03-03 10:45:07,065 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 10:45:07,072 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 10:45:07,074 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 10:45:07,074 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 10:45:07,075 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 10:45:07,076 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem13_label51.c [2025-03-03 10:45:08,203 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a8fbda634/d0ccfc1f753f44f3a9e5ef9228f859a5/FLAG6dc26547c [2025-03-03 10:45:08,739 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 10:45:08,741 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label51.c [2025-03-03 10:45:08,775 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a8fbda634/d0ccfc1f753f44f3a9e5ef9228f859a5/FLAG6dc26547c [2025-03-03 10:45:09,278 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a8fbda634/d0ccfc1f753f44f3a9e5ef9228f859a5 [2025-03-03 10:45:09,280 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 10:45:09,282 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 10:45:09,283 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 10:45:09,283 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 10:45:09,286 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 10:45:09,286 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:45:09" (1/1) ... [2025-03-03 10:45:09,287 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@637fae3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:45:09, skipping insertion in model container [2025-03-03 10:45:09,288 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:45:09" (1/1) ... [2025-03-03 10:45:09,373 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 10:45:09,545 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_label51.c[3668,3681] [2025-03-03 10:45:10,006 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 10:45:10,014 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 10:45:10,027 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_label51.c[3668,3681] [2025-03-03 10:45:10,322 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 10:45:10,338 INFO L204 MainTranslator]: Completed translation [2025-03-03 10:45:10,339 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:45:10 WrapperNode [2025-03-03 10:45:10,340 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 10:45:10,341 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 10:45:10,341 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 10:45:10,341 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 10:45:10,345 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:45:10" (1/1) ... [2025-03-03 10:45:10,389 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:45:10" (1/1) ... [2025-03-03 10:45:10,749 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 5584 [2025-03-03 10:45:10,750 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 10:45:10,750 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 10:45:10,750 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 10:45:10,750 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 10:45:10,756 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:45:10" (1/1) ... [2025-03-03 10:45:10,757 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:45:10" (1/1) ... [2025-03-03 10:45:10,813 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:45:10" (1/1) ... [2025-03-03 10:45:11,023 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:45:11,026 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:45:10" (1/1) ... [2025-03-03 10:45:11,027 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:45:10" (1/1) ... [2025-03-03 10:45:11,191 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:45:10" (1/1) ... [2025-03-03 10:45:11,209 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:45:10" (1/1) ... [2025-03-03 10:45:11,234 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:45:10" (1/1) ... [2025-03-03 10:45:11,256 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:45:10" (1/1) ... [2025-03-03 10:45:11,332 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 10:45:11,338 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 10:45:11,338 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 10:45:11,338 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 10:45:11,339 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:45:10" (1/1) ... [2025-03-03 10:45:11,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 10:45:11,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:45:11,386 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:45:11,391 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:45:11,414 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 10:45:11,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 10:45:11,415 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 10:45:11,415 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 10:45:11,470 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 10:45:11,471 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 10:45:15,601 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1894: havoc calculate_output_#t~ret9#1; [2025-03-03 10:45:15,601 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3629: havoc calculate_output2_#t~ret10#1; [2025-03-03 10:45:15,601 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5351: havoc calculate_output3_#t~ret11#1; [2025-03-03 10:45:15,744 INFO L? ?]: Removed 738 outVars from TransFormulas that were not future-live. [2025-03-03 10:45:15,744 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 10:45:15,769 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 10:45:15,772 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 10:45:15,773 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:45:15 BoogieIcfgContainer [2025-03-03 10:45:15,773 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 10:45:15,775 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 10:45:15,775 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 10:45:15,778 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 10:45:15,778 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 10:45:09" (1/3) ... [2025-03-03 10:45:15,778 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e07a0ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:45:15, skipping insertion in model container [2025-03-03 10:45:15,778 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:45:10" (2/3) ... [2025-03-03 10:45:15,778 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e07a0ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:45:15, skipping insertion in model container [2025-03-03 10:45:15,779 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:45:15" (3/3) ... [2025-03-03 10:45:15,779 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem13_label51.c [2025-03-03 10:45:15,791 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 10:45:15,792 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem13_label51.c that has 1 procedures, 1098 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 10:45:15,859 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 10:45:15,867 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;@772c922b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 10:45:15,868 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 10:45:15,875 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:45:15,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-03 10:45:15,880 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:45:15,880 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:45:15,880 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:45:15,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:45:15,885 INFO L85 PathProgramCache]: Analyzing trace with hash 1596234083, now seen corresponding path program 1 times [2025-03-03 10:45:15,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:45:15,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976666046] [2025-03-03 10:45:15,891 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:45:15,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:45:15,945 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-03 10:45:15,975 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-03 10:45:15,975 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:45:15,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:45:16,105 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:45:16,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:45:16,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976666046] [2025-03-03 10:45:16,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976666046] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:45:16,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:45:16,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:45:16,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646543188] [2025-03-03 10:45:16,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:45:16,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:45:16,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:45:16,131 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:45:16,132 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:45:16,135 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 8.0) internal successors, (24), 2 states have internal predecessors, (24), 0 states have call successors, (0), 0 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:45:19,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:45:19,246 INFO L93 Difference]: Finished difference Result 3035 states and 5640 transitions. [2025-03-03 10:45:19,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:45:19,249 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 [2025-03-03 10:45:19,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:45:19,266 INFO L225 Difference]: With dead ends: 3035 [2025-03-03 10:45:19,267 INFO L226 Difference]: Without dead ends: 1873 [2025-03-03 10:45:19,273 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:45:19,277 INFO L435 NwaCegarLoop]: 991 mSDtfsCounter, 881 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 2505 mSolverCounterSat, 858 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 881 SdHoareTripleChecker+Valid, 1145 SdHoareTripleChecker+Invalid, 3363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 858 IncrementalHoareTripleChecker+Valid, 2505 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2025-03-03 10:45:19,278 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [881 Valid, 1145 Invalid, 3363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [858 Valid, 2505 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2025-03-03 10:45:19,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1873 states. [2025-03-03 10:45:19,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1873 to 1859. [2025-03-03 10:45:19,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1859 states, 1858 states have (on average 1.5441334768568353) internal successors, (2869), 1858 states have internal predecessors, (2869), 0 states have call successors, (0), 0 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:45:19,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1859 states to 1859 states and 2869 transitions. [2025-03-03 10:45:19,380 INFO L78 Accepts]: Start accepts. Automaton has 1859 states and 2869 transitions. Word has length 24 [2025-03-03 10:45:19,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:45:19,380 INFO L471 AbstractCegarLoop]: Abstraction has 1859 states and 2869 transitions. [2025-03-03 10:45:19,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 0 states have call successors, (0), 0 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:45:19,380 INFO L276 IsEmpty]: Start isEmpty. Operand 1859 states and 2869 transitions. [2025-03-03 10:45:19,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-03 10:45:19,383 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:45:19,383 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:19,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 10:45:19,384 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:45:19,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:45:19,384 INFO L85 PathProgramCache]: Analyzing trace with hash 1608795896, now seen corresponding path program 1 times [2025-03-03 10:45:19,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:45:19,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793880171] [2025-03-03 10:45:19,385 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:45:19,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:45:19,402 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-03 10:45:19,438 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-03 10:45:19,438 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:45:19,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:45:19,631 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:45:19,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:45:19,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793880171] [2025-03-03 10:45:19,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793880171] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:45:19,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:45:19,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:45:19,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409111883] [2025-03-03 10:45:19,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:45:19,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:45:19,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:45:19,633 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:45:19,633 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:45:19,633 INFO L87 Difference]: Start difference. First operand 1859 states and 2869 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 2 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:45:22,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:45:22,920 INFO L93 Difference]: Finished difference Result 5317 states and 8229 transitions. [2025-03-03 10:45:22,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:45:22,920 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 2 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 96 [2025-03-03 10:45:22,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:45:22,930 INFO L225 Difference]: With dead ends: 5317 [2025-03-03 10:45:22,930 INFO L226 Difference]: Without dead ends: 3460 [2025-03-03 10:45:22,933 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:45:22,934 INFO L435 NwaCegarLoop]: 1039 mSDtfsCounter, 826 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 2402 mSolverCounterSat, 877 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 826 SdHoareTripleChecker+Valid, 1192 SdHoareTripleChecker+Invalid, 3279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 877 IncrementalHoareTripleChecker+Valid, 2402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2025-03-03 10:45:22,934 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [826 Valid, 1192 Invalid, 3279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [877 Valid, 2402 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2025-03-03 10:45:22,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3460 states. [2025-03-03 10:45:22,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3460 to 3459. [2025-03-03 10:45:22,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3459 states, 3458 states have (on average 1.3805668016194332) internal successors, (4774), 3458 states have internal predecessors, (4774), 0 states have call successors, (0), 0 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:45:22,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3459 states to 3459 states and 4774 transitions. [2025-03-03 10:45:22,983 INFO L78 Accepts]: Start accepts. Automaton has 3459 states and 4774 transitions. Word has length 96 [2025-03-03 10:45:22,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:45:22,984 INFO L471 AbstractCegarLoop]: Abstraction has 3459 states and 4774 transitions. [2025-03-03 10:45:22,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 2 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:45:22,984 INFO L276 IsEmpty]: Start isEmpty. Operand 3459 states and 4774 transitions. [2025-03-03 10:45:22,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-03 10:45:22,985 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:45:22,985 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:22,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 10:45:22,985 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:45:22,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:45:22,985 INFO L85 PathProgramCache]: Analyzing trace with hash -782301376, now seen corresponding path program 1 times [2025-03-03 10:45:22,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:45:22,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242197116] [2025-03-03 10:45:22,985 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:45:22,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:45:22,997 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-03 10:45:23,007 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-03 10:45:23,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:45:23,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:45:23,152 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:45:23,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:45:23,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242197116] [2025-03-03 10:45:23,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242197116] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:45:23,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:45:23,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:45:23,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280534592] [2025-03-03 10:45:23,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:45:23,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:45:23,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:45:23,154 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:45:23,154 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:45:23,154 INFO L87 Difference]: Start difference. First operand 3459 states and 4774 transitions. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 0 states have call successors, (0), 0 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:45:25,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:45:25,906 INFO L93 Difference]: Finished difference Result 10097 states and 13940 transitions. [2025-03-03 10:45:25,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:45:25,907 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 0 states have call successors, (0), 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 110 [2025-03-03 10:45:25,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:45:25,924 INFO L225 Difference]: With dead ends: 10097 [2025-03-03 10:45:25,924 INFO L226 Difference]: Without dead ends: 6640 [2025-03-03 10:45:25,928 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:45:25,928 INFO L435 NwaCegarLoop]: 771 mSDtfsCounter, 932 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 2552 mSolverCounterSat, 763 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 932 SdHoareTripleChecker+Valid, 904 SdHoareTripleChecker+Invalid, 3315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 763 IncrementalHoareTripleChecker+Valid, 2552 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-03-03 10:45:25,929 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [932 Valid, 904 Invalid, 3315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [763 Valid, 2552 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-03-03 10:45:25,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6640 states. [2025-03-03 10:45:26,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6640 to 6631. [2025-03-03 10:45:26,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6631 states, 6630 states have (on average 1.2722473604826545) internal successors, (8435), 6630 states have internal predecessors, (8435), 0 states have call successors, (0), 0 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:45:26,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6631 states to 6631 states and 8435 transitions. [2025-03-03 10:45:26,037 INFO L78 Accepts]: Start accepts. Automaton has 6631 states and 8435 transitions. Word has length 110 [2025-03-03 10:45:26,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:45:26,038 INFO L471 AbstractCegarLoop]: Abstraction has 6631 states and 8435 transitions. [2025-03-03 10:45:26,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 0 states have call successors, (0), 0 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:45:26,038 INFO L276 IsEmpty]: Start isEmpty. Operand 6631 states and 8435 transitions. [2025-03-03 10:45:26,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-03 10:45:26,040 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:45:26,041 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:26,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 10:45:26,041 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:45:26,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:45:26,041 INFO L85 PathProgramCache]: Analyzing trace with hash 1335702202, now seen corresponding path program 1 times [2025-03-03 10:45:26,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:45:26,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110327243] [2025-03-03 10:45:26,041 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:45:26,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:45:26,061 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-03 10:45:26,074 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-03 10:45:26,074 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:45:26,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:45:26,174 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:45:26,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:45:26,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110327243] [2025-03-03 10:45:26,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110327243] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:45:26,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:45:26,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:45:26,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125979701] [2025-03-03 10:45:26,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:45:26,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:45:26,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:45:26,176 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:45:26,176 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:45:26,176 INFO L87 Difference]: Start difference. First operand 6631 states and 8435 transitions. Second operand has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 0 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:45:28,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:45:28,691 INFO L93 Difference]: Finished difference Result 16437 states and 21419 transitions. [2025-03-03 10:45:28,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:45:28,692 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 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 113 [2025-03-03 10:45:28,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:45:28,713 INFO L225 Difference]: With dead ends: 16437 [2025-03-03 10:45:28,713 INFO L226 Difference]: Without dead ends: 9808 [2025-03-03 10:45:28,719 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:45:28,721 INFO L435 NwaCegarLoop]: 740 mSDtfsCounter, 1014 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 2392 mSolverCounterSat, 1004 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1014 SdHoareTripleChecker+Valid, 831 SdHoareTripleChecker+Invalid, 3396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1004 IncrementalHoareTripleChecker+Valid, 2392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-03-03 10:45:28,722 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1014 Valid, 831 Invalid, 3396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1004 Valid, 2392 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-03-03 10:45:28,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9808 states. [2025-03-03 10:45:28,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9808 to 9797. [2025-03-03 10:45:28,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9797 states, 9796 states have (on average 1.273887300939159) internal successors, (12479), 9796 states have internal predecessors, (12479), 0 states have call successors, (0), 0 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:45:28,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9797 states to 9797 states and 12479 transitions. [2025-03-03 10:45:28,840 INFO L78 Accepts]: Start accepts. Automaton has 9797 states and 12479 transitions. Word has length 113 [2025-03-03 10:45:28,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:45:28,841 INFO L471 AbstractCegarLoop]: Abstraction has 9797 states and 12479 transitions. [2025-03-03 10:45:28,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 0 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:45:28,841 INFO L276 IsEmpty]: Start isEmpty. Operand 9797 states and 12479 transitions. [2025-03-03 10:45:28,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2025-03-03 10:45:28,845 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:45:28,846 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:28,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 10:45:28,846 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:45:28,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:45:28,846 INFO L85 PathProgramCache]: Analyzing trace with hash -2062751864, now seen corresponding path program 1 times [2025-03-03 10:45:28,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:45:28,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411200820] [2025-03-03 10:45:28,846 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:45:28,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:45:28,870 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-03-03 10:45:28,887 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-03-03 10:45:28,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:45:28,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:45:29,369 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:45:29,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:45:29,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411200820] [2025-03-03 10:45:29,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411200820] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:45:29,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:45:29,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:45:29,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116263999] [2025-03-03 10:45:29,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:45:29,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:45:29,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:45:29,370 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:45:29,370 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:45:29,370 INFO L87 Difference]: Start difference. First operand 9797 states and 12479 transitions. Second operand has 4 states, 4 states have (on average 47.5) internal successors, (190), 3 states have internal predecessors, (190), 0 states have call successors, (0), 0 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:45:33,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:45:33,828 INFO L93 Difference]: Finished difference Result 29889 states and 37879 transitions. [2025-03-03 10:45:33,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:45:33,829 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 47.5) internal successors, (190), 3 states have internal predecessors, (190), 0 states have call successors, (0), 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 190 [2025-03-03 10:45:33,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:45:33,862 INFO L225 Difference]: With dead ends: 29889 [2025-03-03 10:45:33,862 INFO L226 Difference]: Without dead ends: 20094 [2025-03-03 10:45:33,867 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 10:45:33,867 INFO L435 NwaCegarLoop]: 1034 mSDtfsCounter, 2125 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 5793 mSolverCounterSat, 547 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2125 SdHoareTripleChecker+Valid, 1309 SdHoareTripleChecker+Invalid, 6340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 547 IncrementalHoareTripleChecker+Valid, 5793 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2025-03-03 10:45:33,868 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2125 Valid, 1309 Invalid, 6340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [547 Valid, 5793 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2025-03-03 10:45:33,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20094 states. [2025-03-03 10:45:34,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20094 to 20066. [2025-03-03 10:45:34,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20066 states, 20065 states have (on average 1.184500373785198) internal successors, (23767), 20065 states have internal predecessors, (23767), 0 states have call successors, (0), 0 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:45:34,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20066 states to 20066 states and 23767 transitions. [2025-03-03 10:45:34,077 INFO L78 Accepts]: Start accepts. Automaton has 20066 states and 23767 transitions. Word has length 190 [2025-03-03 10:45:34,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:45:34,077 INFO L471 AbstractCegarLoop]: Abstraction has 20066 states and 23767 transitions. [2025-03-03 10:45:34,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 47.5) internal successors, (190), 3 states have internal predecessors, (190), 0 states have call successors, (0), 0 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:45:34,078 INFO L276 IsEmpty]: Start isEmpty. Operand 20066 states and 23767 transitions. [2025-03-03 10:45:34,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2025-03-03 10:45:34,080 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:45:34,081 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 10:45:34,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 10:45:34,081 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:45:34,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:45:34,081 INFO L85 PathProgramCache]: Analyzing trace with hash -22376060, now seen corresponding path program 1 times [2025-03-03 10:45:34,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:45:34,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71953270] [2025-03-03 10:45:34,082 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:45:34,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:45:34,103 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 223 statements into 1 equivalence classes. [2025-03-03 10:45:34,124 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 223 of 223 statements. [2025-03-03 10:45:34,124 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:45:34,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:45:34,246 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 138 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:45:34,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:45:34,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71953270] [2025-03-03 10:45:34,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71953270] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:45:34,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:45:34,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:45:34,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012098365] [2025-03-03 10:45:34,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:45:34,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:45:34,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:45:34,250 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:45:34,250 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:45:34,250 INFO L87 Difference]: Start difference. First operand 20066 states and 23767 transitions. Second operand has 3 states, 3 states have (on average 74.33333333333333) internal successors, (223), 3 states have internal predecessors, (223), 0 states have call successors, (0), 0 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:45:36,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:45:36,718 INFO L93 Difference]: Finished difference Result 45653 states and 54278 transitions. [2025-03-03 10:45:36,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:45:36,718 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 74.33333333333333) internal successors, (223), 3 states have internal predecessors, (223), 0 states have call successors, (0), 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:45:36,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:45:36,758 INFO L225 Difference]: With dead ends: 45653 [2025-03-03 10:45:36,758 INFO L226 Difference]: Without dead ends: 26376 [2025-03-03 10:45:36,773 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:45:36,774 INFO L435 NwaCegarLoop]: 830 mSDtfsCounter, 859 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 2388 mSolverCounterSat, 655 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 859 SdHoareTripleChecker+Valid, 950 SdHoareTripleChecker+Invalid, 3043 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 655 IncrementalHoareTripleChecker+Valid, 2388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-03-03 10:45:36,774 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [859 Valid, 950 Invalid, 3043 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [655 Valid, 2388 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-03-03 10:45:36,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26376 states. [2025-03-03 10:45:37,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26376 to 25578. [2025-03-03 10:45:37,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25578 states, 25577 states have (on average 1.177581420807757) internal successors, (30119), 25577 states have internal predecessors, (30119), 0 states have call successors, (0), 0 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:45:37,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25578 states to 25578 states and 30119 transitions. [2025-03-03 10:45:37,197 INFO L78 Accepts]: Start accepts. Automaton has 25578 states and 30119 transitions. Word has length 223 [2025-03-03 10:45:37,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:45:37,198 INFO L471 AbstractCegarLoop]: Abstraction has 25578 states and 30119 transitions. [2025-03-03 10:45:37,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 74.33333333333333) internal successors, (223), 3 states have internal predecessors, (223), 0 states have call successors, (0), 0 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:45:37,198 INFO L276 IsEmpty]: Start isEmpty. Operand 25578 states and 30119 transitions. [2025-03-03 10:45:37,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2025-03-03 10:45:37,205 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:45:37,206 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 10:45:37,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 10:45:37,206 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:45:37,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:45:37,206 INFO L85 PathProgramCache]: Analyzing trace with hash -592066597, now seen corresponding path program 1 times [2025-03-03 10:45:37,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:45:37,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645777060] [2025-03-03 10:45:37,207 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:45:37,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:45:37,275 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 286 statements into 1 equivalence classes. [2025-03-03 10:45:37,323 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 286 of 286 statements. [2025-03-03 10:45:37,323 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:45:37,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:45:37,556 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 138 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:45:37,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:45:37,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645777060] [2025-03-03 10:45:37,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645777060] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:45:37,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:45:37,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:45:37,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446201122] [2025-03-03 10:45:37,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:45:37,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:45:37,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:45:37,559 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:45:37,559 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:45:37,559 INFO L87 Difference]: Start difference. First operand 25578 states and 30119 transitions. Second operand has 3 states, 3 states have (on average 95.33333333333333) internal successors, (286), 3 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:45:40,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:45:40,256 INFO L93 Difference]: Finished difference Result 51187 states and 60296 transitions. [2025-03-03 10:45:40,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:45:40,257 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 95.33333333333333) internal successors, (286), 3 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 286 [2025-03-03 10:45:40,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:45:40,290 INFO L225 Difference]: With dead ends: 51187 [2025-03-03 10:45:40,290 INFO L226 Difference]: Without dead ends: 26398 [2025-03-03 10:45:40,308 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:45:40,309 INFO L435 NwaCegarLoop]: 1775 mSDtfsCounter, 722 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 2542 mSolverCounterSat, 313 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 722 SdHoareTripleChecker+Valid, 1918 SdHoareTripleChecker+Invalid, 2855 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 313 IncrementalHoareTripleChecker+Valid, 2542 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-03-03 10:45:40,310 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [722 Valid, 1918 Invalid, 2855 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [313 Valid, 2542 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-03-03 10:45:40,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26398 states. [2025-03-03 10:45:40,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26398 to 26366. [2025-03-03 10:45:40,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26366 states, 26365 states have (on average 1.1610847714773374) internal successors, (30612), 26365 states have internal predecessors, (30612), 0 states have call successors, (0), 0 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:45:40,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26366 states to 26366 states and 30612 transitions. [2025-03-03 10:45:40,650 INFO L78 Accepts]: Start accepts. Automaton has 26366 states and 30612 transitions. Word has length 286 [2025-03-03 10:45:40,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:45:40,651 INFO L471 AbstractCegarLoop]: Abstraction has 26366 states and 30612 transitions. [2025-03-03 10:45:40,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 95.33333333333333) internal successors, (286), 3 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:45:40,651 INFO L276 IsEmpty]: Start isEmpty. Operand 26366 states and 30612 transitions. [2025-03-03 10:45:40,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2025-03-03 10:45:40,654 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:45:40,655 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:45:40,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 10:45:40,655 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:45:40,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:45:40,655 INFO L85 PathProgramCache]: Analyzing trace with hash -482568241, now seen corresponding path program 1 times [2025-03-03 10:45:40,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:45:40,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348308589] [2025-03-03 10:45:40,656 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:45:40,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:45:40,675 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 312 statements into 1 equivalence classes. [2025-03-03 10:45:40,695 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 312 of 312 statements. [2025-03-03 10:45:40,695 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:45:40,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:45:40,849 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 319 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-03 10:45:40,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:45:40,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348308589] [2025-03-03 10:45:40,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348308589] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:45:40,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:45:40,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:45:40,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801027338] [2025-03-03 10:45:40,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:45:40,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:45:40,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:45:40,851 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:45:40,851 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:45:40,851 INFO L87 Difference]: Start difference. First operand 26366 states and 30612 transitions. Second operand has 4 states, 4 states have (on average 72.75) internal successors, (291), 3 states have internal predecessors, (291), 0 states have call successors, (0), 0 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:45:46,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:45:46,257 INFO L93 Difference]: Finished difference Result 77342 states and 91874 transitions. [2025-03-03 10:45:46,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:45:46,258 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 72.75) internal successors, (291), 3 states have internal predecessors, (291), 0 states have call successors, (0), 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 312 [2025-03-03 10:45:46,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:45:46,318 INFO L225 Difference]: With dead ends: 77342 [2025-03-03 10:45:46,318 INFO L226 Difference]: Without dead ends: 51765 [2025-03-03 10:45:46,335 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:45:46,336 INFO L435 NwaCegarLoop]: 857 mSDtfsCounter, 1707 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 7165 mSolverCounterSat, 990 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1707 SdHoareTripleChecker+Valid, 1124 SdHoareTripleChecker+Invalid, 8155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 990 IncrementalHoareTripleChecker+Valid, 7165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2025-03-03 10:45:46,336 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1707 Valid, 1124 Invalid, 8155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [990 Valid, 7165 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2025-03-03 10:45:46,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51765 states. [2025-03-03 10:45:46,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51765 to 51641. [2025-03-03 10:45:46,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51641 states, 51640 states have (on average 1.1671766072811773) internal successors, (60273), 51640 states have internal predecessors, (60273), 0 states have call successors, (0), 0 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:45:46,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51641 states to 51641 states and 60273 transitions. [2025-03-03 10:45:46,809 INFO L78 Accepts]: Start accepts. Automaton has 51641 states and 60273 transitions. Word has length 312 [2025-03-03 10:45:46,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:45:46,809 INFO L471 AbstractCegarLoop]: Abstraction has 51641 states and 60273 transitions. [2025-03-03 10:45:46,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 72.75) internal successors, (291), 3 states have internal predecessors, (291), 0 states have call successors, (0), 0 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:45:46,809 INFO L276 IsEmpty]: Start isEmpty. Operand 51641 states and 60273 transitions. [2025-03-03 10:45:46,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2025-03-03 10:45:46,947 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:45:46,948 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:45:46,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 10:45:46,948 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:45:46,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:45:46,952 INFO L85 PathProgramCache]: Analyzing trace with hash 967149992, now seen corresponding path program 1 times [2025-03-03 10:45:46,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:45:46,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349193836] [2025-03-03 10:45:46,953 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:45:46,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:45:47,006 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 340 statements into 1 equivalence classes. [2025-03-03 10:45:47,059 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 340 of 340 statements. [2025-03-03 10:45:47,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:45:47,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:45:47,769 INFO L134 CoverageAnalysis]: Checked inductivity of 337 backedges. 0 proven. 71 refuted. 0 times theorem prover too weak. 266 trivial. 0 not checked. [2025-03-03 10:45:47,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:45:47,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349193836] [2025-03-03 10:45:47,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349193836] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:45:47,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [714647541] [2025-03-03 10:45:47,770 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:45:47,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:45:47,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:45:47,772 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:45:47,773 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:45:47,835 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 340 statements into 1 equivalence classes. [2025-03-03 10:45:47,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 340 of 340 statements. [2025-03-03 10:45:47,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:45:47,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:45:47,902 INFO L256 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 10:45:47,909 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:45:48,277 INFO L134 CoverageAnalysis]: Checked inductivity of 337 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 337 trivial. 0 not checked. [2025-03-03 10:45:48,277 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:45:48,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [714647541] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:45:48,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:45:48,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2025-03-03 10:45:48,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214787831] [2025-03-03 10:45:48,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:45:48,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:45:48,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:45:48,279 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:45:48,279 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 10:45:48,279 INFO L87 Difference]: Start difference. First operand 51641 states and 60273 transitions. Second operand has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 2 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:45:51,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:45:51,249 INFO L93 Difference]: Finished difference Result 148341 states and 173370 transitions. [2025-03-03 10:45:51,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:45:51,250 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 2 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 340 [2025-03-03 10:45:51,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:45:51,352 INFO L225 Difference]: With dead ends: 148341 [2025-03-03 10:45:51,353 INFO L226 Difference]: Without dead ends: 97489 [2025-03-03 10:45:51,396 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 342 GetRequests, 339 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 10:45:51,397 INFO L435 NwaCegarLoop]: 713 mSDtfsCounter, 1008 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 2633 mSolverCounterSat, 538 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1008 SdHoareTripleChecker+Valid, 927 SdHoareTripleChecker+Invalid, 3171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 538 IncrementalHoareTripleChecker+Valid, 2633 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-03-03 10:45:51,397 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1008 Valid, 927 Invalid, 3171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [538 Valid, 2633 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-03-03 10:45:51,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97489 states. [2025-03-03 10:45:52,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97489 to 97444. [2025-03-03 10:45:52,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97444 states, 97443 states have (on average 1.1412723335693689) internal successors, (111209), 97443 states have internal predecessors, (111209), 0 states have call successors, (0), 0 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:45:52,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97444 states to 97444 states and 111209 transitions. [2025-03-03 10:45:52,386 INFO L78 Accepts]: Start accepts. Automaton has 97444 states and 111209 transitions. Word has length 340 [2025-03-03 10:45:52,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:45:52,386 INFO L471 AbstractCegarLoop]: Abstraction has 97444 states and 111209 transitions. [2025-03-03 10:45:52,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 2 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:45:52,387 INFO L276 IsEmpty]: Start isEmpty. Operand 97444 states and 111209 transitions. [2025-03-03 10:45:52,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 370 [2025-03-03 10:45:52,391 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:45:52,391 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:45:52,400 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:45:52,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:45:52,596 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:45:52,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:45:52,597 INFO L85 PathProgramCache]: Analyzing trace with hash 1675903689, now seen corresponding path program 1 times [2025-03-03 10:45:52,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:45:52,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184496886] [2025-03-03 10:45:52,597 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:45:52,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:45:52,654 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 369 statements into 1 equivalence classes. [2025-03-03 10:45:52,666 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 369 of 369 statements. [2025-03-03 10:45:52,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:45:52,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:45:52,787 INFO L134 CoverageAnalysis]: Checked inductivity of 366 backedges. 344 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-03 10:45:52,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:45:52,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184496886] [2025-03-03 10:45:52,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184496886] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:45:52,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:45:52,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:45:52,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806359656] [2025-03-03 10:45:52,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:45:52,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:45:52,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:45:52,788 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:45:52,788 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:45:52,789 INFO L87 Difference]: Start difference. First operand 97444 states and 111209 transitions. Second operand has 3 states, 3 states have (on average 116.0) internal successors, (348), 3 states have internal predecessors, (348), 0 states have call successors, (0), 0 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:45:55,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:45:55,512 INFO L93 Difference]: Finished difference Result 180523 states and 206685 transitions. [2025-03-03 10:45:55,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:45:55,512 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 116.0) internal successors, (348), 3 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 369 [2025-03-03 10:45:55,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:45:55,597 INFO L225 Difference]: With dead ends: 180523 [2025-03-03 10:45:55,598 INFO L226 Difference]: Without dead ends: 81502 [2025-03-03 10:45:55,638 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:45:55,638 INFO L435 NwaCegarLoop]: 1510 mSDtfsCounter, 1036 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 2348 mSolverCounterSat, 594 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1036 SdHoareTripleChecker+Valid, 1646 SdHoareTripleChecker+Invalid, 2942 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 594 IncrementalHoareTripleChecker+Valid, 2348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-03 10:45:55,639 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1036 Valid, 1646 Invalid, 2942 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [594 Valid, 2348 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-03 10:45:55,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81502 states. [2025-03-03 10:45:56,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81502 to 76772. [2025-03-03 10:45:56,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76772 states, 76771 states have (on average 1.111005457790051) internal successors, (85293), 76771 states have internal predecessors, (85293), 0 states have call successors, (0), 0 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:45:56,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76772 states to 76772 states and 85293 transitions. [2025-03-03 10:45:56,555 INFO L78 Accepts]: Start accepts. Automaton has 76772 states and 85293 transitions. Word has length 369 [2025-03-03 10:45:56,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:45:56,556 INFO L471 AbstractCegarLoop]: Abstraction has 76772 states and 85293 transitions. [2025-03-03 10:45:56,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 116.0) internal successors, (348), 3 states have internal predecessors, (348), 0 states have call successors, (0), 0 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:45:56,556 INFO L276 IsEmpty]: Start isEmpty. Operand 76772 states and 85293 transitions. [2025-03-03 10:45:56,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 380 [2025-03-03 10:45:56,561 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:45:56,561 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-03 10:45:56,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 10:45:56,561 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:45:56,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:45:56,562 INFO L85 PathProgramCache]: Analyzing trace with hash -175740528, now seen corresponding path program 1 times [2025-03-03 10:45:56,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:45:56,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239275566] [2025-03-03 10:45:56,562 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:45:56,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:45:56,596 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 379 statements into 1 equivalence classes. [2025-03-03 10:45:56,612 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 379 of 379 statements. [2025-03-03 10:45:56,612 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:45:56,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:45:57,461 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 269 proven. 110 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-03 10:45:57,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:45:57,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239275566] [2025-03-03 10:45:57,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239275566] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:45:57,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1462597976] [2025-03-03 10:45:57,462 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:45:57,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:45:57,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:45:57,464 INFO L229 MonitoredProcess]: Starting monitored process 3 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:45:57,465 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 10:45:57,508 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 379 statements into 1 equivalence classes. [2025-03-03 10:45:57,563 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 379 of 379 statements. [2025-03-03 10:45:57,563 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:45:57,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:45:57,565 INFO L256 TraceCheckSpWp]: Trace formula consists of 511 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 10:45:57,573 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:45:57,614 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 336 trivial. 0 not checked. [2025-03-03 10:45:57,615 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:45:57,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1462597976] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:45:57,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:45:57,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2025-03-03 10:45:57,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116154236] [2025-03-03 10:45:57,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:45:57,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:45:57,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:45:57,616 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:45:57,616 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-03 10:45:57,616 INFO L87 Difference]: Start difference. First operand 76772 states and 85293 transitions. Second operand has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 0 states have call successors, (0), 0 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:46:00,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:46:00,129 INFO L93 Difference]: Finished difference Result 169273 states and 187828 transitions. [2025-03-03 10:46:00,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:46:00,129 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 0 states have call successors, (0), 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 379 [2025-03-03 10:46:00,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:46:00,238 INFO L225 Difference]: With dead ends: 169273 [2025-03-03 10:46:00,238 INFO L226 Difference]: Without dead ends: 88560 [2025-03-03 10:46:00,294 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 383 GetRequests, 378 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-03 10:46:00,294 INFO L435 NwaCegarLoop]: 1728 mSDtfsCounter, 865 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 2388 mSolverCounterSat, 460 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 865 SdHoareTripleChecker+Valid, 1856 SdHoareTripleChecker+Invalid, 2848 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 460 IncrementalHoareTripleChecker+Valid, 2388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-03 10:46:00,295 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [865 Valid, 1856 Invalid, 2848 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [460 Valid, 2388 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-03 10:46:00,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88560 states. [2025-03-03 10:46:01,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88560 to 80686. [2025-03-03 10:46:01,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80686 states, 80685 states have (on average 1.1059800458573465) internal successors, (89236), 80685 states have internal predecessors, (89236), 0 states have call successors, (0), 0 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:46:01,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80686 states to 80686 states and 89236 transitions. [2025-03-03 10:46:01,221 INFO L78 Accepts]: Start accepts. Automaton has 80686 states and 89236 transitions. Word has length 379 [2025-03-03 10:46:01,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:46:01,222 INFO L471 AbstractCegarLoop]: Abstraction has 80686 states and 89236 transitions. [2025-03-03 10:46:01,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 0 states have call successors, (0), 0 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:46:01,222 INFO L276 IsEmpty]: Start isEmpty. Operand 80686 states and 89236 transitions. [2025-03-03 10:46:01,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 455 [2025-03-03 10:46:01,231 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:46:01,231 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:01,237 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-03 10:46:01,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-03 10:46:01,432 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:46:01,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:46:01,432 INFO L85 PathProgramCache]: Analyzing trace with hash 199307999, now seen corresponding path program 1 times [2025-03-03 10:46:01,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:46:01,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315070290] [2025-03-03 10:46:01,432 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:46:01,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:46:01,473 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 454 statements into 1 equivalence classes. [2025-03-03 10:46:01,490 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 454 of 454 statements. [2025-03-03 10:46:01,491 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:46:01,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:46:02,515 INFO L134 CoverageAnalysis]: Checked inductivity of 416 backedges. 281 proven. 113 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-03 10:46:02,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:46:02,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315070290] [2025-03-03 10:46:02,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315070290] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:46:02,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2010005388] [2025-03-03 10:46:02,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:46:02,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:46:02,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:46:02,518 INFO L229 MonitoredProcess]: Starting monitored process 4 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:46:02,519 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 10:46:02,569 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 454 statements into 1 equivalence classes. [2025-03-03 10:46:02,626 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 454 of 454 statements. [2025-03-03 10:46:02,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:46:02,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:46:02,628 INFO L256 TraceCheckSpWp]: Trace formula consists of 590 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 10:46:02,632 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:46:02,799 INFO L134 CoverageAnalysis]: Checked inductivity of 416 backedges. 303 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2025-03-03 10:46:02,799 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:46:02,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2010005388] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:46:02,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:46:02,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2025-03-03 10:46:02,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052646352] [2025-03-03 10:46:02,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:46:02,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:46:02,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:46:02,800 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:46:02,800 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-03-03 10:46:02,801 INFO L87 Difference]: Start difference. First operand 80686 states and 89236 transitions. Second operand has 3 states, 3 states have (on average 114.0) internal successors, (342), 3 states have internal predecessors, (342), 0 states have call successors, (0), 0 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:46:05,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:46:05,580 INFO L93 Difference]: Finished difference Result 171590 states and 190551 transitions. [2025-03-03 10:46:05,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:46:05,580 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 114.0) internal successors, (342), 3 states have internal predecessors, (342), 0 states have call successors, (0), 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 454 [2025-03-03 10:46:05,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:46:05,691 INFO L225 Difference]: With dead ends: 171590 [2025-03-03 10:46:05,691 INFO L226 Difference]: Without dead ends: 91693 [2025-03-03 10:46:05,729 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 460 GetRequests, 453 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-03-03 10:46:05,729 INFO L435 NwaCegarLoop]: 364 mSDtfsCounter, 1131 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 2249 mSolverCounterSat, 983 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1131 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 3232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 983 IncrementalHoareTripleChecker+Valid, 2249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-03 10:46:05,729 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1131 Valid, 377 Invalid, 3232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [983 Valid, 2249 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-03 10:46:05,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91693 states. [2025-03-03 10:46:06,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91693 to 91693. [2025-03-03 10:46:06,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91693 states, 91692 states have (on average 1.0997796972473062) internal successors, (100841), 91692 states have internal predecessors, (100841), 0 states have call successors, (0), 0 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:46:06,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91693 states to 91693 states and 100841 transitions. [2025-03-03 10:46:06,675 INFO L78 Accepts]: Start accepts. Automaton has 91693 states and 100841 transitions. Word has length 454 [2025-03-03 10:46:06,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:46:06,676 INFO L471 AbstractCegarLoop]: Abstraction has 91693 states and 100841 transitions. [2025-03-03 10:46:06,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 114.0) internal successors, (342), 3 states have internal predecessors, (342), 0 states have call successors, (0), 0 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:46:06,676 INFO L276 IsEmpty]: Start isEmpty. Operand 91693 states and 100841 transitions. [2025-03-03 10:46:06,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 473 [2025-03-03 10:46:06,683 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:46:06,683 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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] [2025-03-03 10:46:06,689 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-03 10:46:06,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:46:06,883 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:46:06,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:46:06,884 INFO L85 PathProgramCache]: Analyzing trace with hash 1971043295, now seen corresponding path program 1 times [2025-03-03 10:46:06,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:46:06,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818632967] [2025-03-03 10:46:06,884 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:46:06,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:46:06,909 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 472 statements into 1 equivalence classes. [2025-03-03 10:46:06,925 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 472 of 472 statements. [2025-03-03 10:46:06,925 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:46:06,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:46:07,210 INFO L134 CoverageAnalysis]: Checked inductivity of 672 backedges. 400 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2025-03-03 10:46:07,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:46:07,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818632967] [2025-03-03 10:46:07,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818632967] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:46:07,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:46:07,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:46:07,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772518448] [2025-03-03 10:46:07,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:46:07,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:46:07,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:46:07,213 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:46:07,213 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:46:07,213 INFO L87 Difference]: Start difference. First operand 91693 states and 100841 transitions. Second operand has 3 states, 3 states have (on average 96.66666666666667) internal successors, (290), 3 states have internal predecessors, (290), 0 states have call successors, (0), 0 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:46:10,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:46:10,125 INFO L93 Difference]: Finished difference Result 203064 states and 224269 transitions. [2025-03-03 10:46:10,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:46:10,125 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 96.66666666666667) internal successors, (290), 3 states have internal predecessors, (290), 0 states have call successors, (0), 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 472 [2025-03-03 10:46:10,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:46:10,274 INFO L225 Difference]: With dead ends: 203064 [2025-03-03 10:46:10,275 INFO L226 Difference]: Without dead ends: 109797 [2025-03-03 10:46:10,320 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:46:10,321 INFO L435 NwaCegarLoop]: 1679 mSDtfsCounter, 729 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 2463 mSolverCounterSat, 658 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 729 SdHoareTripleChecker+Valid, 1811 SdHoareTripleChecker+Invalid, 3121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 658 IncrementalHoareTripleChecker+Valid, 2463 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-03-03 10:46:10,321 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [729 Valid, 1811 Invalid, 3121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [658 Valid, 2463 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-03-03 10:46:10,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109797 states. [2025-03-03 10:46:11,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109797 to 108995. [2025-03-03 10:46:11,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108995 states, 108994 states have (on average 1.0847753087325909) internal successors, (118234), 108994 states have internal predecessors, (118234), 0 states have call successors, (0), 0 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:46:11,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108995 states to 108995 states and 118234 transitions. [2025-03-03 10:46:11,550 INFO L78 Accepts]: Start accepts. Automaton has 108995 states and 118234 transitions. Word has length 472 [2025-03-03 10:46:11,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:46:11,551 INFO L471 AbstractCegarLoop]: Abstraction has 108995 states and 118234 transitions. [2025-03-03 10:46:11,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 96.66666666666667) internal successors, (290), 3 states have internal predecessors, (290), 0 states have call successors, (0), 0 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:46:11,551 INFO L276 IsEmpty]: Start isEmpty. Operand 108995 states and 118234 transitions. [2025-03-03 10:46:11,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 502 [2025-03-03 10:46:11,560 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:46:11,560 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 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:46:11,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 10:46:11,560 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:46:11,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:46:11,560 INFO L85 PathProgramCache]: Analyzing trace with hash 815724401, now seen corresponding path program 1 times [2025-03-03 10:46:11,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:46:11,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651872425] [2025-03-03 10:46:11,560 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:46:11,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:46:11,588 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 501 statements into 1 equivalence classes. [2025-03-03 10:46:11,605 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 501 of 501 statements. [2025-03-03 10:46:11,605 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:46:11,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:46:11,837 INFO L134 CoverageAnalysis]: Checked inductivity of 479 backedges. 355 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2025-03-03 10:46:11,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:46:11,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651872425] [2025-03-03 10:46:11,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651872425] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:46:11,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:46:11,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:46:11,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717566883] [2025-03-03 10:46:11,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:46:11,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:46:11,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:46:11,838 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:46:11,838 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:46:11,838 INFO L87 Difference]: Start difference. First operand 108995 states and 118234 transitions. Second operand has 3 states, 3 states have (on average 126.0) internal successors, (378), 3 states have internal predecessors, (378), 0 states have call successors, (0), 0 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:46:14,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:46:14,576 INFO L93 Difference]: Finished difference Result 218778 states and 237248 transitions. [2025-03-03 10:46:14,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:46:14,576 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 126.0) internal successors, (378), 3 states have internal predecessors, (378), 0 states have call successors, (0), 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 501 [2025-03-03 10:46:14,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:46:14,701 INFO L225 Difference]: With dead ends: 218778 [2025-03-03 10:46:14,701 INFO L226 Difference]: Without dead ends: 110572 [2025-03-03 10:46:14,753 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:46:14,754 INFO L435 NwaCegarLoop]: 1651 mSDtfsCounter, 685 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 2417 mSolverCounterSat, 586 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 685 SdHoareTripleChecker+Valid, 1782 SdHoareTripleChecker+Invalid, 3003 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 586 IncrementalHoareTripleChecker+Valid, 2417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-03 10:46:14,754 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [685 Valid, 1782 Invalid, 3003 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [586 Valid, 2417 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-03 10:46:14,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110572 states. [2025-03-03 10:46:15,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110572 to 108202. [2025-03-03 10:46:15,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108202 states, 108201 states have (on average 1.0652304507352057) internal successors, (115259), 108201 states have internal predecessors, (115259), 0 states have call successors, (0), 0 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:46:16,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108202 states to 108202 states and 115259 transitions. [2025-03-03 10:46:16,023 INFO L78 Accepts]: Start accepts. Automaton has 108202 states and 115259 transitions. Word has length 501 [2025-03-03 10:46:16,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:46:16,024 INFO L471 AbstractCegarLoop]: Abstraction has 108202 states and 115259 transitions. [2025-03-03 10:46:16,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 126.0) internal successors, (378), 3 states have internal predecessors, (378), 0 states have call successors, (0), 0 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:46:16,024 INFO L276 IsEmpty]: Start isEmpty. Operand 108202 states and 115259 transitions. [2025-03-03 10:46:16,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 510 [2025-03-03 10:46:16,032 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:46:16,032 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:16,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 10:46:16,033 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:46:16,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:46:16,033 INFO L85 PathProgramCache]: Analyzing trace with hash -1913309632, now seen corresponding path program 1 times [2025-03-03 10:46:16,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:46:16,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334505698] [2025-03-03 10:46:16,033 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:46:16,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:46:16,057 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 509 statements into 1 equivalence classes. [2025-03-03 10:46:16,072 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 509 of 509 statements. [2025-03-03 10:46:16,072 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:46:16,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:46:16,177 INFO L134 CoverageAnalysis]: Checked inductivity of 866 backedges. 109 proven. 0 refuted. 0 times theorem prover too weak. 757 trivial. 0 not checked. [2025-03-03 10:46:16,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:46:16,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334505698] [2025-03-03 10:46:16,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334505698] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:46:16,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:46:16,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:46:16,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194924293] [2025-03-03 10:46:16,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:46:16,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:46:16,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:46:16,178 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:46:16,178 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:46:16,178 INFO L87 Difference]: Start difference. First operand 108202 states and 115259 transitions. Second operand has 3 states, 3 states have (on average 63.0) internal successors, (189), 2 states have internal predecessors, (189), 0 states have call successors, (0), 0 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:46:17,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:46:17,897 INFO L93 Difference]: Finished difference Result 214814 states and 228694 transitions. [2025-03-03 10:46:17,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:46:17,898 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 63.0) internal successors, (189), 2 states have internal predecessors, (189), 0 states have call successors, (0), 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 509 [2025-03-03 10:46:17,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:46:18,014 INFO L225 Difference]: With dead ends: 214814 [2025-03-03 10:46:18,014 INFO L226 Difference]: Without dead ends: 107401 [2025-03-03 10:46:18,062 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:46:18,063 INFO L435 NwaCegarLoop]: 270 mSDtfsCounter, 1582 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1476 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1582 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 1485 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1476 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-03 10:46:18,063 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1582 Valid, 270 Invalid, 1485 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1476 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-03 10:46:18,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107401 states. [2025-03-03 10:46:18,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107401 to 107400. [2025-03-03 10:46:18,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107400 states, 107399 states have (on average 1.0634456559185839) internal successors, (114213), 107399 states have internal predecessors, (114213), 0 states have call successors, (0), 0 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:46:19,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107400 states to 107400 states and 114213 transitions. [2025-03-03 10:46:19,344 INFO L78 Accepts]: Start accepts. Automaton has 107400 states and 114213 transitions. Word has length 509 [2025-03-03 10:46:19,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:46:19,344 INFO L471 AbstractCegarLoop]: Abstraction has 107400 states and 114213 transitions. [2025-03-03 10:46:19,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.0) internal successors, (189), 2 states have internal predecessors, (189), 0 states have call successors, (0), 0 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:46:19,344 INFO L276 IsEmpty]: Start isEmpty. Operand 107400 states and 114213 transitions. [2025-03-03 10:46:19,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 524 [2025-03-03 10:46:19,356 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:46:19,357 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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] [2025-03-03 10:46:19,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 10:46:19,357 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:46:19,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:46:19,357 INFO L85 PathProgramCache]: Analyzing trace with hash -1817089908, now seen corresponding path program 1 times [2025-03-03 10:46:19,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:46:19,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673689332] [2025-03-03 10:46:19,357 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:46:19,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:46:19,398 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 523 statements into 1 equivalence classes. [2025-03-03 10:46:19,422 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 523 of 523 statements. [2025-03-03 10:46:19,422 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:46:19,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:46:19,981 INFO L134 CoverageAnalysis]: Checked inductivity of 672 backedges. 400 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2025-03-03 10:46:19,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:46:19,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673689332] [2025-03-03 10:46:19,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673689332] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:46:19,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:46:19,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:46:19,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784026984] [2025-03-03 10:46:19,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:46:19,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:46:19,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:46:19,982 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:46:19,982 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:46:19,982 INFO L87 Difference]: Start difference. First operand 107400 states and 114213 transitions. Second operand has 3 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 0 states have call successors, (0), 0 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:46:22,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:46:22,621 INFO L93 Difference]: Finished difference Result 214802 states and 228504 transitions. [2025-03-03 10:46:22,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:46:22,621 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 0 states have call successors, (0), 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 523 [2025-03-03 10:46:22,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:46:22,740 INFO L225 Difference]: With dead ends: 214802 [2025-03-03 10:46:22,740 INFO L226 Difference]: Without dead ends: 108191 [2025-03-03 10:46:22,765 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:46:22,766 INFO L435 NwaCegarLoop]: 1736 mSDtfsCounter, 609 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 2483 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 609 SdHoareTripleChecker+Valid, 1859 SdHoareTripleChecker+Invalid, 2518 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 2483 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-03 10:46:22,766 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [609 Valid, 1859 Invalid, 2518 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 2483 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-03 10:46:22,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108191 states. [2025-03-03 10:46:23,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108191 to 108188. [2025-03-03 10:46:23,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108188 states, 108187 states have (on average 1.063390240971651) internal successors, (115045), 108187 states have internal predecessors, (115045), 0 states have call successors, (0), 0 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:46:23,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108188 states to 108188 states and 115045 transitions. [2025-03-03 10:46:23,724 INFO L78 Accepts]: Start accepts. Automaton has 108188 states and 115045 transitions. Word has length 523 [2025-03-03 10:46:23,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:46:23,725 INFO L471 AbstractCegarLoop]: Abstraction has 108188 states and 115045 transitions. [2025-03-03 10:46:23,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 0 states have call successors, (0), 0 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:46:23,725 INFO L276 IsEmpty]: Start isEmpty. Operand 108188 states and 115045 transitions. [2025-03-03 10:46:23,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 527 [2025-03-03 10:46:23,735 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:46:23,735 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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] [2025-03-03 10:46:23,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 10:46:23,735 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:46:23,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:46:23,736 INFO L85 PathProgramCache]: Analyzing trace with hash -195400099, now seen corresponding path program 1 times [2025-03-03 10:46:23,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:46:23,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356454322] [2025-03-03 10:46:23,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:46:23,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:46:23,762 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 526 statements into 1 equivalence classes. [2025-03-03 10:46:23,777 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 526 of 526 statements. [2025-03-03 10:46:23,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:46:23,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:46:24,143 INFO L134 CoverageAnalysis]: Checked inductivity of 672 backedges. 400 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2025-03-03 10:46:24,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:46:24,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356454322] [2025-03-03 10:46:24,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356454322] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:46:24,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:46:24,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:46:24,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641416183] [2025-03-03 10:46:24,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:46:24,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:46:24,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:46:24,145 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:46:24,145 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:46:24,145 INFO L87 Difference]: Start difference. First operand 108188 states and 115045 transitions. Second operand has 3 states, 3 states have (on average 114.66666666666667) internal successors, (344), 3 states have internal predecessors, (344), 0 states have call successors, (0), 0 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:46:26,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:46:26,759 INFO L93 Difference]: Finished difference Result 214795 states and 228295 transitions. [2025-03-03 10:46:26,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:46:26,760 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 114.66666666666667) internal successors, (344), 3 states have internal predecessors, (344), 0 states have call successors, (0), 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 526 [2025-03-03 10:46:26,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:46:26,907 INFO L225 Difference]: With dead ends: 214795 [2025-03-03 10:46:26,907 INFO L226 Difference]: Without dead ends: 107396 [2025-03-03 10:46:26,954 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:46:26,955 INFO L435 NwaCegarLoop]: 1371 mSDtfsCounter, 956 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 2318 mSolverCounterSat, 570 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 956 SdHoareTripleChecker+Valid, 1445 SdHoareTripleChecker+Invalid, 2888 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 570 IncrementalHoareTripleChecker+Valid, 2318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-03 10:46:26,955 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [956 Valid, 1445 Invalid, 2888 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [570 Valid, 2318 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-03 10:46:27,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107396 states. [2025-03-03 10:46:28,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107396 to 107394. [2025-03-03 10:46:28,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107394 states, 107393 states have (on average 1.0501243097781048) internal successors, (112776), 107393 states have internal predecessors, (112776), 0 states have call successors, (0), 0 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:46:28,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107394 states to 107394 states and 112776 transitions. [2025-03-03 10:46:28,228 INFO L78 Accepts]: Start accepts. Automaton has 107394 states and 112776 transitions. Word has length 526 [2025-03-03 10:46:28,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:46:28,229 INFO L471 AbstractCegarLoop]: Abstraction has 107394 states and 112776 transitions. [2025-03-03 10:46:28,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 114.66666666666667) internal successors, (344), 3 states have internal predecessors, (344), 0 states have call successors, (0), 0 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:46:28,229 INFO L276 IsEmpty]: Start isEmpty. Operand 107394 states and 112776 transitions. [2025-03-03 10:46:28,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 627 [2025-03-03 10:46:28,245 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:46:28,246 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:46:28,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 10:46:28,246 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:46:28,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:46:28,246 INFO L85 PathProgramCache]: Analyzing trace with hash 917477897, now seen corresponding path program 1 times [2025-03-03 10:46:28,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:46:28,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173127348] [2025-03-03 10:46:28,246 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:46:28,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:46:28,279 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 626 statements into 1 equivalence classes. [2025-03-03 10:46:28,305 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 626 of 626 statements. [2025-03-03 10:46:28,305 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:46:28,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:46:29,027 INFO L134 CoverageAnalysis]: Checked inductivity of 1017 backedges. 784 proven. 0 refuted. 0 times theorem prover too weak. 233 trivial. 0 not checked. [2025-03-03 10:46:29,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:46:29,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173127348] [2025-03-03 10:46:29,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173127348] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:46:29,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:46:29,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 10:46:29,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887340776] [2025-03-03 10:46:29,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:46:29,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:46:29,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:46:29,029 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:46:29,029 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:46:29,029 INFO L87 Difference]: Start difference. First operand 107394 states and 112776 transitions. Second operand has 4 states, 4 states have (on average 116.75) internal successors, (467), 4 states have internal predecessors, (467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)