./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem18_label39.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 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/Problem18_label39.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 f0612bb91079a4342bce93cd5005e7b82df3fd34455b6d64ae48c6a29323af8c --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 15:25:31,281 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 15:25:31,330 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 15:25:31,336 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 15:25:31,337 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 15:25:31,354 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 15:25:31,354 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 15:25:31,354 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 15:25:31,355 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 15:25:31,355 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 15:25:31,355 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 15:25:31,355 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 15:25:31,355 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 15:25:31,355 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 15:25:31,355 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 15:25:31,355 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 15:25:31,355 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 15:25:31,355 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 15:25:31,355 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 15:25:31,355 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 15:25:31,355 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 15:25:31,355 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 15:25:31,356 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 15:25:31,356 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 15:25:31,356 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 15:25:31,356 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 15:25:31,356 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 15:25:31,356 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 15:25:31,356 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 15:25:31,356 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 15:25:31,356 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 15:25:31,356 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 15:25:31,356 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 15:25:31,356 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 15:25:31,356 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 15:25:31,356 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 15:25:31,356 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 15:25:31,356 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 15:25:31,356 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 15:25:31,356 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 15:25:31,356 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 15:25:31,356 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 15:25:31,357 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 15:25:31,357 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 -> f0612bb91079a4342bce93cd5005e7b82df3fd34455b6d64ae48c6a29323af8c [2025-03-16 15:25:31,554 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 15:25:31,563 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 15:25:31,564 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 15:25:31,565 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 15:25:31,565 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 15:25:31,566 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem18_label39.c [2025-03-16 15:25:32,714 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5ba58861/9aa35f8f788640e5bfbe51e4f5490820/FLAGa34e246d9 [2025-03-16 15:25:33,182 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 15:25:33,183 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem18_label39.c [2025-03-16 15:25:33,204 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5ba58861/9aa35f8f788640e5bfbe51e4f5490820/FLAGa34e246d9 [2025-03-16 15:25:33,282 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5ba58861/9aa35f8f788640e5bfbe51e4f5490820 [2025-03-16 15:25:33,285 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 15:25:33,286 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 15:25:33,288 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 15:25:33,289 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 15:25:33,291 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 15:25:33,292 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 03:25:33" (1/1) ... [2025-03-16 15:25:33,292 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48c12871 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:25:33, skipping insertion in model container [2025-03-16 15:25:33,293 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 03:25:33" (1/1) ... [2025-03-16 15:25:33,364 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 15:25:33,519 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/Problem18_label39.c[1705,1718] [2025-03-16 15:25:33,908 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 15:25:33,915 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 15:25:33,923 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/Problem18_label39.c[1705,1718] [2025-03-16 15:25:34,115 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 15:25:34,132 INFO L204 MainTranslator]: Completed translation [2025-03-16 15:25:34,133 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:25:34 WrapperNode [2025-03-16 15:25:34,133 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 15:25:34,134 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 15:25:34,134 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 15:25:34,134 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 15:25:34,139 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:25:34" (1/1) ... [2025-03-16 15:25:34,174 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:25:34" (1/1) ... [2025-03-16 15:25:34,321 INFO L138 Inliner]: procedures = 16, calls = 10, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 4132 [2025-03-16 15:25:34,322 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 15:25:34,323 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 15:25:34,323 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 15:25:34,323 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 15:25:34,330 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:25:34" (1/1) ... [2025-03-16 15:25:34,331 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:25:34" (1/1) ... [2025-03-16 15:25:34,357 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:25:34" (1/1) ... [2025-03-16 15:25:34,449 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-16 15:25:34,450 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:25:34" (1/1) ... [2025-03-16 15:25:34,450 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:25:34" (1/1) ... [2025-03-16 15:25:34,491 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:25:34" (1/1) ... [2025-03-16 15:25:34,499 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:25:34" (1/1) ... [2025-03-16 15:25:34,508 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:25:34" (1/1) ... [2025-03-16 15:25:34,517 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:25:34" (1/1) ... [2025-03-16 15:25:34,537 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 15:25:34,539 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 15:25:34,539 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 15:25:34,539 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 15:25:34,540 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:25:34" (1/1) ... [2025-03-16 15:25:34,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 15:25:34,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:25:34,564 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-16 15:25:34,569 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-16 15:25:34,582 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 15:25:34,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 15:25:34,582 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 15:25:34,582 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 15:25:34,657 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 15:25:34,658 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 15:25:37,172 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1647: havoc calculate_output_#t~ret8#1; [2025-03-16 15:25:37,172 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3060: havoc calculate_output2_#t~ret9#1; [2025-03-16 15:25:37,264 INFO L? ?]: Removed 639 outVars from TransFormulas that were not future-live. [2025-03-16 15:25:37,264 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 15:25:37,286 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 15:25:37,289 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 15:25:37,290 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 03:25:37 BoogieIcfgContainer [2025-03-16 15:25:37,290 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 15:25:37,292 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 15:25:37,292 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 15:25:37,295 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 15:25:37,296 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 03:25:33" (1/3) ... [2025-03-16 15:25:37,296 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ba0c5d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 03:25:37, skipping insertion in model container [2025-03-16 15:25:37,297 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:25:34" (2/3) ... [2025-03-16 15:25:37,297 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ba0c5d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 03:25:37, skipping insertion in model container [2025-03-16 15:25:37,297 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 03:25:37" (3/3) ... [2025-03-16 15:25:37,298 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem18_label39.c [2025-03-16 15:25:37,310 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 15:25:37,311 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem18_label39.c that has 1 procedures, 696 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 15:25:37,371 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 15:25:37,381 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;@6c0d0d7c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 15:25:37,381 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 15:25:37,387 INFO L276 IsEmpty]: Start isEmpty. Operand has 696 states, 694 states have (on average 1.9913544668587897) internal successors, (1382), 695 states have internal predecessors, (1382), 0 states have call successors, (0), 0 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-16 15:25:37,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-16 15:25:37,392 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:25:37,393 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:25:37,393 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:25:37,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:25:37,397 INFO L85 PathProgramCache]: Analyzing trace with hash -95834383, now seen corresponding path program 1 times [2025-03-16 15:25:37,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:25:37,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082652825] [2025-03-16 15:25:37,403 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:25:37,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:25:37,464 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-16 15:25:37,473 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-16 15:25:37,474 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:25:37,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:25:37,511 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-16 15:25:37,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:25:37,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082652825] [2025-03-16 15:25:37,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082652825] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:25:37,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:25:37,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:25:37,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288191137] [2025-03-16 15:25:37,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:25:37,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 15:25:37,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:25:37,532 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 15:25:37,533 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 15:25:37,536 INFO L87 Difference]: Start difference. First operand has 696 states, 694 states have (on average 1.9913544668587897) internal successors, (1382), 695 states have internal predecessors, (1382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 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-16 15:25:37,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:25:37,586 INFO L93 Difference]: Finished difference Result 1391 states and 2763 transitions. [2025-03-16 15:25:37,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 15:25:37,588 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 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 12 [2025-03-16 15:25:37,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:25:37,596 INFO L225 Difference]: With dead ends: 1391 [2025-03-16 15:25:37,596 INFO L226 Difference]: Without dead ends: 693 [2025-03-16 15:25:37,599 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 15:25:37,601 INFO L435 NwaCegarLoop]: 1320 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1320 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 15:25:37,602 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1320 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 15:25:37,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 693 states. [2025-03-16 15:25:37,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 693 to 693. [2025-03-16 15:25:37,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 693 states, 692 states have (on average 1.903179190751445) internal successors, (1317), 692 states have internal predecessors, (1317), 0 states have call successors, (0), 0 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-16 15:25:37,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 693 states to 693 states and 1317 transitions. [2025-03-16 15:25:37,655 INFO L78 Accepts]: Start accepts. Automaton has 693 states and 1317 transitions. Word has length 12 [2025-03-16 15:25:37,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:25:37,655 INFO L471 AbstractCegarLoop]: Abstraction has 693 states and 1317 transitions. [2025-03-16 15:25:37,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 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-16 15:25:37,656 INFO L276 IsEmpty]: Start isEmpty. Operand 693 states and 1317 transitions. [2025-03-16 15:25:37,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-16 15:25:37,656 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:25:37,656 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:25:37,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 15:25:37,657 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:25:37,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:25:37,657 INFO L85 PathProgramCache]: Analyzing trace with hash 756578803, now seen corresponding path program 1 times [2025-03-16 15:25:37,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:25:37,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263815033] [2025-03-16 15:25:37,658 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:25:37,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:25:37,665 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-16 15:25:37,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-16 15:25:37,683 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:25:37,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:25:37,743 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-16 15:25:37,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:25:37,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263815033] [2025-03-16 15:25:37,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263815033] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:25:37,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:25:37,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:25:37,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213101324] [2025-03-16 15:25:37,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:25:37,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:25:37,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:25:37,745 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:25:37,745 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:25:37,745 INFO L87 Difference]: Start difference. First operand 693 states and 1317 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 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-16 15:25:39,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:25:39,891 INFO L93 Difference]: Finished difference Result 2075 states and 3948 transitions. [2025-03-16 15:25:39,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:25:39,891 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 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 12 [2025-03-16 15:25:39,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:25:39,896 INFO L225 Difference]: With dead ends: 2075 [2025-03-16 15:25:39,896 INFO L226 Difference]: Without dead ends: 1383 [2025-03-16 15:25:39,897 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-16 15:25:39,898 INFO L435 NwaCegarLoop]: 358 mSDtfsCounter, 702 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2172 mSolverCounterSat, 470 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 702 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 2642 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 470 IncrementalHoareTripleChecker+Valid, 2172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-16 15:25:39,898 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [702 Valid, 364 Invalid, 2642 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [470 Valid, 2172 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-16 15:25:39,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1383 states. [2025-03-16 15:25:39,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1383 to 1383. [2025-03-16 15:25:39,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1383 states, 1382 states have (on average 1.6519536903039074) internal successors, (2283), 1382 states have internal predecessors, (2283), 0 states have call successors, (0), 0 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-16 15:25:39,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1383 states to 1383 states and 2283 transitions. [2025-03-16 15:25:39,927 INFO L78 Accepts]: Start accepts. Automaton has 1383 states and 2283 transitions. Word has length 12 [2025-03-16 15:25:39,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:25:39,927 INFO L471 AbstractCegarLoop]: Abstraction has 1383 states and 2283 transitions. [2025-03-16 15:25:39,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 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-16 15:25:39,927 INFO L276 IsEmpty]: Start isEmpty. Operand 1383 states and 2283 transitions. [2025-03-16 15:25:39,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-16 15:25:39,929 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:25:39,929 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-16 15:25:39,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 15:25:39,929 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:25:39,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:25:39,930 INFO L85 PathProgramCache]: Analyzing trace with hash -362119329, now seen corresponding path program 1 times [2025-03-16 15:25:39,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:25:39,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368239469] [2025-03-16 15:25:39,930 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:25:39,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:25:39,940 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-16 15:25:39,967 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-16 15:25:39,971 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:25:39,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:25:40,115 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:25:40,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:25:40,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368239469] [2025-03-16 15:25:40,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368239469] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:25:40,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:25:40,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:25:40,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69600374] [2025-03-16 15:25:40,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:25:40,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:25:40,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:25:40,117 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:25:40,117 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:25:40,117 INFO L87 Difference]: Start difference. First operand 1383 states and 2283 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 2 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:25:42,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:25:42,155 INFO L93 Difference]: Finished difference Result 4145 states and 6846 transitions. [2025-03-16 15:25:42,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:25:42,156 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 2 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2025-03-16 15:25:42,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:25:42,164 INFO L225 Difference]: With dead ends: 4145 [2025-03-16 15:25:42,164 INFO L226 Difference]: Without dead ends: 2763 [2025-03-16 15:25:42,166 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-16 15:25:42,166 INFO L435 NwaCegarLoop]: 525 mSDtfsCounter, 712 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 1701 mSolverCounterSat, 918 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 712 SdHoareTripleChecker+Valid, 530 SdHoareTripleChecker+Invalid, 2619 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 918 IncrementalHoareTripleChecker+Valid, 1701 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-16 15:25:42,166 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [712 Valid, 530 Invalid, 2619 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [918 Valid, 1701 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-16 15:25:42,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2763 states. [2025-03-16 15:25:42,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2763 to 2763. [2025-03-16 15:25:42,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2763 states, 2762 states have (on average 1.4047791455467054) internal successors, (3880), 2762 states have internal predecessors, (3880), 0 states have call successors, (0), 0 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-16 15:25:42,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2763 states to 2763 states and 3880 transitions. [2025-03-16 15:25:42,236 INFO L78 Accepts]: Start accepts. Automaton has 2763 states and 3880 transitions. Word has length 78 [2025-03-16 15:25:42,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:25:42,237 INFO L471 AbstractCegarLoop]: Abstraction has 2763 states and 3880 transitions. [2025-03-16 15:25:42,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 2 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:25:42,237 INFO L276 IsEmpty]: Start isEmpty. Operand 2763 states and 3880 transitions. [2025-03-16 15:25:42,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-16 15:25:42,240 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:25:42,240 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-16 15:25:42,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 15:25:42,240 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:25:42,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:25:42,242 INFO L85 PathProgramCache]: Analyzing trace with hash 1939035687, now seen corresponding path program 1 times [2025-03-16 15:25:42,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:25:42,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745730214] [2025-03-16 15:25:42,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:25:42,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:25:42,250 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-16 15:25:42,256 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-16 15:25:42,256 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:25:42,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:25:42,329 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:25:42,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:25:42,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745730214] [2025-03-16 15:25:42,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745730214] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:25:42,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:25:42,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:25:42,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089027311] [2025-03-16 15:25:42,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:25:42,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:25:42,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:25:42,330 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:25:42,330 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:25:42,331 INFO L87 Difference]: Start difference. First operand 2763 states and 3880 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 2 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:25:44,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:25:44,151 INFO L93 Difference]: Finished difference Result 8287 states and 11638 transitions. [2025-03-16 15:25:44,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:25:44,152 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 2 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2025-03-16 15:25:44,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:25:44,167 INFO L225 Difference]: With dead ends: 8287 [2025-03-16 15:25:44,168 INFO L226 Difference]: Without dead ends: 5525 [2025-03-16 15:25:44,172 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-16 15:25:44,173 INFO L435 NwaCegarLoop]: 427 mSDtfsCounter, 709 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1994 mSolverCounterSat, 672 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 709 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 2666 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 672 IncrementalHoareTripleChecker+Valid, 1994 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-16 15:25:44,173 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [709 Valid, 433 Invalid, 2666 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [672 Valid, 1994 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-16 15:25:44,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5525 states. [2025-03-16 15:25:44,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5525 to 5523. [2025-03-16 15:25:44,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5523 states, 5522 states have (on average 1.2658457080767838) internal successors, (6990), 5522 states have internal predecessors, (6990), 0 states have call successors, (0), 0 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-16 15:25:44,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5523 states to 5523 states and 6990 transitions. [2025-03-16 15:25:44,273 INFO L78 Accepts]: Start accepts. Automaton has 5523 states and 6990 transitions. Word has length 79 [2025-03-16 15:25:44,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:25:44,275 INFO L471 AbstractCegarLoop]: Abstraction has 5523 states and 6990 transitions. [2025-03-16 15:25:44,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 2 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:25:44,275 INFO L276 IsEmpty]: Start isEmpty. Operand 5523 states and 6990 transitions. [2025-03-16 15:25:44,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-16 15:25:44,277 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:25:44,277 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-16 15:25:44,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 15:25:44,277 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:25:44,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:25:44,278 INFO L85 PathProgramCache]: Analyzing trace with hash 1252362024, now seen corresponding path program 1 times [2025-03-16 15:25:44,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:25:44,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221781655] [2025-03-16 15:25:44,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:25:44,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:25:44,291 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-16 15:25:44,299 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-16 15:25:44,299 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:25:44,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:25:44,386 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:25:44,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:25:44,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221781655] [2025-03-16 15:25:44,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221781655] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:25:44,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:25:44,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:25:44,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203847954] [2025-03-16 15:25:44,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:25:44,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:25:44,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:25:44,387 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:25:44,387 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:25:44,387 INFO L87 Difference]: Start difference. First operand 5523 states and 6990 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 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-16 15:25:46,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:25:46,113 INFO L93 Difference]: Finished difference Result 13805 states and 17709 transitions. [2025-03-16 15:25:46,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:25:46,113 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 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 105 [2025-03-16 15:25:46,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:25:46,154 INFO L225 Difference]: With dead ends: 13805 [2025-03-16 15:25:46,154 INFO L226 Difference]: Without dead ends: 6903 [2025-03-16 15:25:46,158 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-16 15:25:46,159 INFO L435 NwaCegarLoop]: 1194 mSDtfsCounter, 742 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1721 mSolverCounterSat, 904 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 742 SdHoareTripleChecker+Valid, 1200 SdHoareTripleChecker+Invalid, 2625 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 904 IncrementalHoareTripleChecker+Valid, 1721 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-16 15:25:46,160 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [742 Valid, 1200 Invalid, 2625 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [904 Valid, 1721 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-16 15:25:46,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6903 states. [2025-03-16 15:25:46,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6903 to 6903. [2025-03-16 15:25:46,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6903 states, 6902 states have (on average 1.1056215589684149) internal successors, (7631), 6902 states have internal predecessors, (7631), 0 states have call successors, (0), 0 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-16 15:25:46,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6903 states to 6903 states and 7631 transitions. [2025-03-16 15:25:46,242 INFO L78 Accepts]: Start accepts. Automaton has 6903 states and 7631 transitions. Word has length 105 [2025-03-16 15:25:46,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:25:46,242 INFO L471 AbstractCegarLoop]: Abstraction has 6903 states and 7631 transitions. [2025-03-16 15:25:46,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 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-16 15:25:46,243 INFO L276 IsEmpty]: Start isEmpty. Operand 6903 states and 7631 transitions. [2025-03-16 15:25:46,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2025-03-16 15:25:46,247 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:25:46,247 INFO L218 NwaCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-16 15:25:46,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 15:25:46,247 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:25:46,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:25:46,248 INFO L85 PathProgramCache]: Analyzing trace with hash 76830451, now seen corresponding path program 1 times [2025-03-16 15:25:46,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:25:46,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870628293] [2025-03-16 15:25:46,248 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:25:46,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:25:46,275 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 299 statements into 1 equivalence classes. [2025-03-16 15:25:46,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 299 of 299 statements. [2025-03-16 15:25:46,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:25:46,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:25:46,699 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 177 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2025-03-16 15:25:46,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:25:46,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870628293] [2025-03-16 15:25:46,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870628293] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:25:46,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:25:46,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:25:46,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568404470] [2025-03-16 15:25:46,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:25:46,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:25:46,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:25:46,700 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:25:46,700 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:25:46,700 INFO L87 Difference]: Start difference. First operand 6903 states and 7631 transitions. Second operand has 4 states, 4 states have (on average 55.75) 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-16 15:25:48,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:25:48,768 INFO L93 Difference]: Finished difference Result 17255 states and 18884 transitions. [2025-03-16 15:25:48,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:25:48,769 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 55.75) 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 299 [2025-03-16 15:25:48,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:25:48,790 INFO L225 Difference]: With dead ends: 17255 [2025-03-16 15:25:48,790 INFO L226 Difference]: Without dead ends: 10353 [2025-03-16 15:25:48,796 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-16 15:25:48,796 INFO L435 NwaCegarLoop]: 243 mSDtfsCounter, 1872 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 3368 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1872 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 3438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 3368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-16 15:25:48,797 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1872 Valid, 260 Invalid, 3438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 3368 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-16 15:25:48,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10353 states. [2025-03-16 15:25:48,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10353 to 9663. [2025-03-16 15:25:48,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9663 states, 9662 states have (on average 1.0853860484371767) internal successors, (10487), 9662 states have internal predecessors, (10487), 0 states have call successors, (0), 0 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-16 15:25:48,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9663 states to 9663 states and 10487 transitions. [2025-03-16 15:25:48,938 INFO L78 Accepts]: Start accepts. Automaton has 9663 states and 10487 transitions. Word has length 299 [2025-03-16 15:25:48,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:25:48,938 INFO L471 AbstractCegarLoop]: Abstraction has 9663 states and 10487 transitions. [2025-03-16 15:25:48,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 55.75) 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-16 15:25:48,939 INFO L276 IsEmpty]: Start isEmpty. Operand 9663 states and 10487 transitions. [2025-03-16 15:25:48,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 380 [2025-03-16 15:25:48,942 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:25:48,943 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 15:25:48,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 15:25:48,943 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:25:48,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:25:48,943 INFO L85 PathProgramCache]: Analyzing trace with hash -1171795248, now seen corresponding path program 1 times [2025-03-16 15:25:48,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:25:48,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142734260] [2025-03-16 15:25:48,944 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:25:48,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:25:48,978 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 379 statements into 1 equivalence classes. [2025-03-16 15:25:49,009 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 379 of 379 statements. [2025-03-16 15:25:49,010 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:25:49,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:25:49,222 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2025-03-16 15:25:49,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:25:49,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142734260] [2025-03-16 15:25:49,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142734260] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:25:49,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:25:49,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:25:49,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801103324] [2025-03-16 15:25:49,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:25:49,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:25:49,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:25:49,224 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:25:49,224 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:25:49,224 INFO L87 Difference]: Start difference. First operand 9663 states and 10487 transitions. Second operand has 3 states, 3 states have (on average 104.33333333333333) internal successors, (313), 2 states have internal predecessors, (313), 0 states have call successors, (0), 0 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-16 15:25:50,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:25:50,477 INFO L93 Difference]: Finished difference Result 22085 states and 23931 transitions. [2025-03-16 15:25:50,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:25:50,478 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 104.33333333333333) internal successors, (313), 2 states have internal predecessors, (313), 0 states have call successors, (0), 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-16 15:25:50,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:25:50,497 INFO L225 Difference]: With dead ends: 22085 [2025-03-16 15:25:50,497 INFO L226 Difference]: Without dead ends: 12423 [2025-03-16 15:25:50,505 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-16 15:25:50,505 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 444 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 1653 mSolverCounterSat, 309 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 444 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 1962 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 309 IncrementalHoareTripleChecker+Valid, 1653 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-16 15:25:50,506 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [444 Valid, 58 Invalid, 1962 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [309 Valid, 1653 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-16 15:25:50,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12423 states. [2025-03-16 15:25:50,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12423 to 12423. [2025-03-16 15:25:50,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12423 states, 12422 states have (on average 1.0686684913862503) internal successors, (13275), 12422 states have internal predecessors, (13275), 0 states have call successors, (0), 0 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-16 15:25:50,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12423 states to 12423 states and 13275 transitions. [2025-03-16 15:25:50,654 INFO L78 Accepts]: Start accepts. Automaton has 12423 states and 13275 transitions. Word has length 379 [2025-03-16 15:25:50,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:25:50,655 INFO L471 AbstractCegarLoop]: Abstraction has 12423 states and 13275 transitions. [2025-03-16 15:25:50,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.33333333333333) internal successors, (313), 2 states have internal predecessors, (313), 0 states have call successors, (0), 0 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-16 15:25:50,656 INFO L276 IsEmpty]: Start isEmpty. Operand 12423 states and 13275 transitions. [2025-03-16 15:25:50,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 466 [2025-03-16 15:25:50,662 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:25:50,662 INFO L218 NwaCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 15:25:50,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 15:25:50,662 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:25:50,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:25:50,663 INFO L85 PathProgramCache]: Analyzing trace with hash 1596983214, now seen corresponding path program 1 times [2025-03-16 15:25:50,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:25:50,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541867958] [2025-03-16 15:25:50,663 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:25:50,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:25:50,689 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 465 statements into 1 equivalence classes. [2025-03-16 15:25:50,709 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 465 of 465 statements. [2025-03-16 15:25:50,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:25:50,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:25:50,935 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-16 15:25:50,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:25:50,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541867958] [2025-03-16 15:25:50,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541867958] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:25:50,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:25:50,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:25:50,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738014400] [2025-03-16 15:25:50,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:25:50,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:25:50,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:25:50,937 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:25:50,937 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:25:50,937 INFO L87 Difference]: Start difference. First operand 12423 states and 13275 transitions. Second operand has 3 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 0 states have call successors, (0), 0 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-16 15:25:52,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:25:52,273 INFO L93 Difference]: Finished difference Result 28295 states and 30411 transitions. [2025-03-16 15:25:52,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:25:52,274 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 0 states have call successors, (0), 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 465 [2025-03-16 15:25:52,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:25:52,296 INFO L225 Difference]: With dead ends: 28295 [2025-03-16 15:25:52,296 INFO L226 Difference]: Without dead ends: 14493 [2025-03-16 15:25:52,305 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-16 15:25:52,306 INFO L435 NwaCegarLoop]: 931 mSDtfsCounter, 697 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1659 mSolverCounterSat, 257 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 697 SdHoareTripleChecker+Valid, 937 SdHoareTripleChecker+Invalid, 1916 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 257 IncrementalHoareTripleChecker+Valid, 1659 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-16 15:25:52,306 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [697 Valid, 937 Invalid, 1916 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [257 Valid, 1659 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-16 15:25:52,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14493 states. [2025-03-16 15:25:52,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14493 to 14493. [2025-03-16 15:25:52,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14493 states, 14492 states have (on average 1.0641043334253382) internal successors, (15421), 14492 states have internal predecessors, (15421), 0 states have call successors, (0), 0 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-16 15:25:52,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14493 states to 14493 states and 15421 transitions. [2025-03-16 15:25:52,446 INFO L78 Accepts]: Start accepts. Automaton has 14493 states and 15421 transitions. Word has length 465 [2025-03-16 15:25:52,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:25:52,446 INFO L471 AbstractCegarLoop]: Abstraction has 14493 states and 15421 transitions. [2025-03-16 15:25:52,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 0 states have call successors, (0), 0 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-16 15:25:52,447 INFO L276 IsEmpty]: Start isEmpty. Operand 14493 states and 15421 transitions. [2025-03-16 15:25:52,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 585 [2025-03-16 15:25:52,454 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:25:52,454 INFO L218 NwaCegarLoop]: trace histogram [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, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 15:25:52,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 15:25:52,454 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:25:52,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:25:52,455 INFO L85 PathProgramCache]: Analyzing trace with hash 511959369, now seen corresponding path program 1 times [2025-03-16 15:25:52,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:25:52,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219968894] [2025-03-16 15:25:52,455 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:25:52,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:25:52,491 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 584 statements into 1 equivalence classes. [2025-03-16 15:25:52,511 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 584 of 584 statements. [2025-03-16 15:25:52,512 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:25:52,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:25:53,053 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 410 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-16 15:25:53,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:25:53,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219968894] [2025-03-16 15:25:53,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219968894] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:25:53,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:25:53,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:25:53,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077118470] [2025-03-16 15:25:53,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:25:53,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:25:53,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:25:53,055 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:25:53,055 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:25:53,056 INFO L87 Difference]: Start difference. First operand 14493 states and 15421 transitions. Second operand has 3 states, 3 states have (on average 191.33333333333334) internal successors, (574), 3 states have internal predecessors, (574), 0 states have call successors, (0), 0 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-16 15:25:54,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:25:54,442 INFO L93 Difference]: Finished difference Result 38645 states and 41267 transitions. [2025-03-16 15:25:54,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:25:54,443 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 191.33333333333334) internal successors, (574), 3 states have internal predecessors, (574), 0 states have call successors, (0), 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 584 [2025-03-16 15:25:54,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:25:54,479 INFO L225 Difference]: With dead ends: 38645 [2025-03-16 15:25:54,479 INFO L226 Difference]: Without dead ends: 24153 [2025-03-16 15:25:54,488 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-16 15:25:54,491 INFO L435 NwaCegarLoop]: 909 mSDtfsCounter, 573 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1755 mSolverCounterSat, 235 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 573 SdHoareTripleChecker+Valid, 915 SdHoareTripleChecker+Invalid, 1990 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 235 IncrementalHoareTripleChecker+Valid, 1755 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-16 15:25:54,492 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [573 Valid, 915 Invalid, 1990 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [235 Valid, 1755 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-16 15:25:54,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24153 states. [2025-03-16 15:25:54,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24153 to 24153. [2025-03-16 15:25:54,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24153 states, 24152 states have (on average 1.0515485260019874) internal successors, (25397), 24152 states have internal predecessors, (25397), 0 states have call successors, (0), 0 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-16 15:25:54,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24153 states to 24153 states and 25397 transitions. [2025-03-16 15:25:54,749 INFO L78 Accepts]: Start accepts. Automaton has 24153 states and 25397 transitions. Word has length 584 [2025-03-16 15:25:54,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:25:54,750 INFO L471 AbstractCegarLoop]: Abstraction has 24153 states and 25397 transitions. [2025-03-16 15:25:54,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 191.33333333333334) internal successors, (574), 3 states have internal predecessors, (574), 0 states have call successors, (0), 0 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-16 15:25:54,751 INFO L276 IsEmpty]: Start isEmpty. Operand 24153 states and 25397 transitions. [2025-03-16 15:25:54,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 646 [2025-03-16 15:25:54,762 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:25:54,762 INFO L218 NwaCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-16 15:25:54,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 15:25:54,763 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:25:54,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:25:54,768 INFO L85 PathProgramCache]: Analyzing trace with hash 864676272, now seen corresponding path program 1 times [2025-03-16 15:25:54,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:25:54,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844872707] [2025-03-16 15:25:54,768 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:25:54,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:25:54,809 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 645 statements into 1 equivalence classes. [2025-03-16 15:25:54,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 645 of 645 statements. [2025-03-16 15:25:54,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:25:54,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:25:55,053 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 418 trivial. 0 not checked. [2025-03-16 15:25:55,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:25:55,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844872707] [2025-03-16 15:25:55,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844872707] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:25:55,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:25:55,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:25:55,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378575786] [2025-03-16 15:25:55,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:25:55,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:25:55,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:25:55,054 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:25:55,054 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:25:55,055 INFO L87 Difference]: Start difference. First operand 24153 states and 25397 transitions. Second operand has 3 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 0 states have call successors, (0), 0 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-16 15:25:56,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:25:56,383 INFO L93 Difference]: Finished difference Result 56585 states and 59858 transitions. [2025-03-16 15:25:56,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:25:56,384 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 0 states have call successors, (0), 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 645 [2025-03-16 15:25:56,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:25:56,426 INFO L225 Difference]: With dead ends: 56585 [2025-03-16 15:25:56,426 INFO L226 Difference]: Without dead ends: 32433 [2025-03-16 15:25:56,442 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-16 15:25:56,443 INFO L435 NwaCegarLoop]: 838 mSDtfsCounter, 718 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1727 mSolverCounterSat, 204 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 718 SdHoareTripleChecker+Valid, 844 SdHoareTripleChecker+Invalid, 1931 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 204 IncrementalHoareTripleChecker+Valid, 1727 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-16 15:25:56,443 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [718 Valid, 844 Invalid, 1931 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [204 Valid, 1727 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-16 15:25:56,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32433 states. [2025-03-16 15:25:56,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32433 to 32433. [2025-03-16 15:25:56,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32433 states, 32432 states have (on average 1.046620621608288) internal successors, (33944), 32432 states have internal predecessors, (33944), 0 states have call successors, (0), 0 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-16 15:25:56,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32433 states to 32433 states and 33944 transitions. [2025-03-16 15:25:56,689 INFO L78 Accepts]: Start accepts. Automaton has 32433 states and 33944 transitions. Word has length 645 [2025-03-16 15:25:56,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:25:56,690 INFO L471 AbstractCegarLoop]: Abstraction has 32433 states and 33944 transitions. [2025-03-16 15:25:56,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 0 states have call successors, (0), 0 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-16 15:25:56,690 INFO L276 IsEmpty]: Start isEmpty. Operand 32433 states and 33944 transitions. [2025-03-16 15:25:56,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 689 [2025-03-16 15:25:56,744 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:25:56,744 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 15:25:56,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 15:25:56,744 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:25:56,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:25:56,745 INFO L85 PathProgramCache]: Analyzing trace with hash -369930689, now seen corresponding path program 1 times [2025-03-16 15:25:56,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:25:56,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157858466] [2025-03-16 15:25:56,745 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:25:56,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:25:56,776 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 688 statements into 1 equivalence classes. [2025-03-16 15:25:56,803 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 688 of 688 statements. [2025-03-16 15:25:56,804 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:25:56,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:25:57,052 INFO L134 CoverageAnalysis]: Checked inductivity of 895 backedges. 634 proven. 0 refuted. 0 times theorem prover too weak. 261 trivial. 0 not checked. [2025-03-16 15:25:57,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:25:57,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157858466] [2025-03-16 15:25:57,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157858466] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:25:57,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:25:57,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:25:57,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848240039] [2025-03-16 15:25:57,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:25:57,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:25:57,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:25:57,054 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:25:57,054 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:25:57,054 INFO L87 Difference]: Start difference. First operand 32433 states and 33944 transitions. Second operand has 3 states, 3 states have (on average 173.33333333333334) internal successors, (520), 3 states have internal predecessors, (520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:25:58,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:25:58,516 INFO L93 Difference]: Finished difference Result 79355 states and 83347 transitions. [2025-03-16 15:25:58,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:25:58,517 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 173.33333333333334) internal successors, (520), 3 states have internal predecessors, (520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 688 [2025-03-16 15:25:58,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:25:58,563 INFO L225 Difference]: With dead ends: 79355 [2025-03-16 15:25:58,563 INFO L226 Difference]: Without dead ends: 46923 [2025-03-16 15:25:58,582 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-16 15:25:58,584 INFO L435 NwaCegarLoop]: 225 mSDtfsCounter, 612 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 1750 mSolverCounterSat, 260 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 612 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 2010 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 260 IncrementalHoareTripleChecker+Valid, 1750 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-16 15:25:58,584 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [612 Valid, 230 Invalid, 2010 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [260 Valid, 1750 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-16 15:25:58,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46923 states. [2025-03-16 15:25:58,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46923 to 46923. [2025-03-16 15:25:58,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46923 states, 46922 states have (on average 1.043966582839606) internal successors, (48985), 46922 states have internal predecessors, (48985), 0 states have call successors, (0), 0 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-16 15:25:58,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46923 states to 46923 states and 48985 transitions. [2025-03-16 15:25:58,949 INFO L78 Accepts]: Start accepts. Automaton has 46923 states and 48985 transitions. Word has length 688 [2025-03-16 15:25:58,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:25:58,950 INFO L471 AbstractCegarLoop]: Abstraction has 46923 states and 48985 transitions. [2025-03-16 15:25:58,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 173.33333333333334) internal successors, (520), 3 states have internal predecessors, (520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:25:58,950 INFO L276 IsEmpty]: Start isEmpty. Operand 46923 states and 48985 transitions. [2025-03-16 15:25:58,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 758 [2025-03-16 15:25:58,958 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:25:58,958 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:25:58,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 15:25:58,959 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:25:58,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:25:58,959 INFO L85 PathProgramCache]: Analyzing trace with hash -467085542, now seen corresponding path program 1 times [2025-03-16 15:25:58,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:25:58,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491466575] [2025-03-16 15:25:58,960 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:25:58,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:25:59,051 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 757 statements into 1 equivalence classes. [2025-03-16 15:25:59,075 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 757 of 757 statements. [2025-03-16 15:25:59,076 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:25:59,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:25:59,664 INFO L134 CoverageAnalysis]: Checked inductivity of 848 backedges. 693 proven. 0 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2025-03-16 15:25:59,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:25:59,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491466575] [2025-03-16 15:25:59,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491466575] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:25:59,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:25:59,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:25:59,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78923173] [2025-03-16 15:25:59,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:25:59,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:25:59,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:25:59,666 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:25:59,666 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:25:59,666 INFO L87 Difference]: Start difference. First operand 46923 states and 48985 transitions. Second operand has 4 states, 4 states have (on average 153.75) internal successors, (615), 3 states have internal predecessors, (615), 0 states have call successors, (0), 0 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-16 15:26:01,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:26:01,633 INFO L93 Difference]: Finished difference Result 106265 states and 111445 transitions. [2025-03-16 15:26:01,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:26:01,633 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 153.75) internal successors, (615), 3 states have internal predecessors, (615), 0 states have call successors, (0), 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 757 [2025-03-16 15:26:01,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:26:01,692 INFO L225 Difference]: With dead ends: 106265 [2025-03-16 15:26:01,692 INFO L226 Difference]: Without dead ends: 59343 [2025-03-16 15:26:01,719 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-16 15:26:01,719 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 1014 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 2719 mSolverCounterSat, 390 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1014 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 3109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 390 IncrementalHoareTripleChecker+Valid, 2719 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-16 15:26:01,719 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1014 Valid, 73 Invalid, 3109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [390 Valid, 2719 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-16 15:26:01,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59343 states. [2025-03-16 15:26:02,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59343 to 57273. [2025-03-16 15:26:02,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57273 states, 57272 states have (on average 1.04202751780975) internal successors, (59679), 57272 states have internal predecessors, (59679), 0 states have call successors, (0), 0 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-16 15:26:02,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57273 states to 57273 states and 59679 transitions. [2025-03-16 15:26:02,286 INFO L78 Accepts]: Start accepts. Automaton has 57273 states and 59679 transitions. Word has length 757 [2025-03-16 15:26:02,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:26:02,287 INFO L471 AbstractCegarLoop]: Abstraction has 57273 states and 59679 transitions. [2025-03-16 15:26:02,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 153.75) internal successors, (615), 3 states have internal predecessors, (615), 0 states have call successors, (0), 0 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-16 15:26:02,287 INFO L276 IsEmpty]: Start isEmpty. Operand 57273 states and 59679 transitions. [2025-03-16 15:26:02,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1343 [2025-03-16 15:26:02,302 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:26:02,302 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 15:26:02,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 15:26:02,303 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:26:02,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:26:02,303 INFO L85 PathProgramCache]: Analyzing trace with hash -1383921429, now seen corresponding path program 1 times [2025-03-16 15:26:02,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:26:02,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20633643] [2025-03-16 15:26:02,303 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:26:02,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:26:02,368 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1342 statements into 1 equivalence classes. [2025-03-16 15:26:02,413 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1342 of 1342 statements. [2025-03-16 15:26:02,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:26:02,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:26:04,164 INFO L134 CoverageAnalysis]: Checked inductivity of 2246 backedges. 1363 proven. 308 refuted. 0 times theorem prover too weak. 575 trivial. 0 not checked. [2025-03-16 15:26:04,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:26:04,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20633643] [2025-03-16 15:26:04,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20633643] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:26:04,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [163543606] [2025-03-16 15:26:04,164 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:26:04,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:26:04,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:26:04,166 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-16 15:26:04,168 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-16 15:26:04,299 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1342 statements into 1 equivalence classes. [2025-03-16 15:26:04,463 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1342 of 1342 statements. [2025-03-16 15:26:04,463 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:26:04,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:26:04,468 INFO L256 TraceCheckSpWp]: Trace formula consists of 1578 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 15:26:04,487 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:26:04,606 INFO L134 CoverageAnalysis]: Checked inductivity of 2246 backedges. 1300 proven. 0 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2025-03-16 15:26:04,606 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 15:26:04,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [163543606] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:26:04,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 15:26:04,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-03-16 15:26:04,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452930104] [2025-03-16 15:26:04,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:26:04,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:26:04,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:26:04,608 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:26:04,608 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-16 15:26:04,609 INFO L87 Difference]: Start difference. First operand 57273 states and 59679 transitions. Second operand has 3 states, 3 states have (on average 240.33333333333334) internal successors, (721), 3 states have internal predecessors, (721), 0 states have call successors, (0), 0 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-16 15:26:06,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:26:06,127 INFO L93 Difference]: Finished difference Result 130415 states and 136344 transitions. [2025-03-16 15:26:06,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:26:06,127 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 240.33333333333334) internal successors, (721), 3 states have internal predecessors, (721), 0 states have call successors, (0), 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 1342 [2025-03-16 15:26:06,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:26:06,196 INFO L225 Difference]: With dead ends: 130415 [2025-03-16 15:26:06,196 INFO L226 Difference]: Without dead ends: 73833 [2025-03-16 15:26:06,231 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1347 GetRequests, 1342 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-16 15:26:06,232 INFO L435 NwaCegarLoop]: 966 mSDtfsCounter, 623 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1774 mSolverCounterSat, 215 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 623 SdHoareTripleChecker+Valid, 972 SdHoareTripleChecker+Invalid, 1989 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 215 IncrementalHoareTripleChecker+Valid, 1774 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-16 15:26:06,232 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [623 Valid, 972 Invalid, 1989 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [215 Valid, 1774 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-16 15:26:06,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73833 states. [2025-03-16 15:26:06,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73833 to 73833. [2025-03-16 15:26:06,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73833 states, 73832 states have (on average 1.038411528876368) internal successors, (76668), 73832 states have internal predecessors, (76668), 0 states have call successors, (0), 0 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-16 15:26:06,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73833 states to 73833 states and 76668 transitions. [2025-03-16 15:26:06,825 INFO L78 Accepts]: Start accepts. Automaton has 73833 states and 76668 transitions. Word has length 1342 [2025-03-16 15:26:06,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:26:06,825 INFO L471 AbstractCegarLoop]: Abstraction has 73833 states and 76668 transitions. [2025-03-16 15:26:06,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 240.33333333333334) internal successors, (721), 3 states have internal predecessors, (721), 0 states have call successors, (0), 0 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-16 15:26:06,825 INFO L276 IsEmpty]: Start isEmpty. Operand 73833 states and 76668 transitions. [2025-03-16 15:26:06,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1364 [2025-03-16 15:26:06,839 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:26:06,839 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 15:26:06,847 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-16 15:26:07,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-16 15:26:07,040 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:26:07,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:26:07,041 INFO L85 PathProgramCache]: Analyzing trace with hash -616099791, now seen corresponding path program 1 times [2025-03-16 15:26:07,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:26:07,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733147480] [2025-03-16 15:26:07,041 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:26:07,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:26:07,115 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1363 statements into 1 equivalence classes. [2025-03-16 15:26:07,159 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1363 of 1363 statements. [2025-03-16 15:26:07,159 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:26:07,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:26:08,162 INFO L134 CoverageAnalysis]: Checked inductivity of 2336 backedges. 1647 proven. 0 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2025-03-16 15:26:08,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:26:08,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733147480] [2025-03-16 15:26:08,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733147480] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:26:08,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:26:08,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 15:26:08,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710037207] [2025-03-16 15:26:08,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:26:08,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:26:08,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:26:08,164 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:26:08,164 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:26:08,165 INFO L87 Difference]: Start difference. First operand 73833 states and 76668 transitions. Second operand has 4 states, 4 states have (on average 206.75) internal successors, (827), 4 states have internal predecessors, (827), 0 states have call successors, (0), 0 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-16 15:26:10,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:26:10,556 INFO L93 Difference]: Finished difference Result 180095 states and 187934 transitions. [2025-03-16 15:26:10,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:26:10,556 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 206.75) internal successors, (827), 4 states have internal predecessors, (827), 0 states have call successors, (0), 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 1363 [2025-03-16 15:26:10,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:26:10,660 INFO L225 Difference]: With dead ends: 180095 [2025-03-16 15:26:10,660 INFO L226 Difference]: Without dead ends: 106953 [2025-03-16 15:26:10,702 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-16 15:26:10,703 INFO L435 NwaCegarLoop]: 958 mSDtfsCounter, 1241 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 3357 mSolverCounterSat, 337 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1241 SdHoareTripleChecker+Valid, 969 SdHoareTripleChecker+Invalid, 3694 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 337 IncrementalHoareTripleChecker+Valid, 3357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-16 15:26:10,703 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1241 Valid, 969 Invalid, 3694 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [337 Valid, 3357 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-16 15:26:10,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106953 states. [2025-03-16 15:26:11,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106953 to 104883. [2025-03-16 15:26:11,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104883 states, 104882 states have (on average 1.0354016895177438) internal successors, (108595), 104882 states have internal predecessors, (108595), 0 states have call successors, (0), 0 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-16 15:26:11,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104883 states to 104883 states and 108595 transitions. [2025-03-16 15:26:11,542 INFO L78 Accepts]: Start accepts. Automaton has 104883 states and 108595 transitions. Word has length 1363 [2025-03-16 15:26:11,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:26:11,543 INFO L471 AbstractCegarLoop]: Abstraction has 104883 states and 108595 transitions. [2025-03-16 15:26:11,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 206.75) internal successors, (827), 4 states have internal predecessors, (827), 0 states have call successors, (0), 0 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-16 15:26:11,543 INFO L276 IsEmpty]: Start isEmpty. Operand 104883 states and 108595 transitions. [2025-03-16 15:26:11,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1405 [2025-03-16 15:26:11,556 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:26:11,556 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 15:26:11,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 15:26:11,557 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:26:11,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:26:11,558 INFO L85 PathProgramCache]: Analyzing trace with hash 1169091553, now seen corresponding path program 1 times [2025-03-16 15:26:11,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:26:11,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840933518] [2025-03-16 15:26:11,558 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:26:11,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:26:11,617 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1404 statements into 1 equivalence classes. [2025-03-16 15:26:11,656 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1404 of 1404 statements. [2025-03-16 15:26:11,657 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:26:11,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:26:13,081 INFO L134 CoverageAnalysis]: Checked inductivity of 2274 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 2209 trivial. 0 not checked. [2025-03-16 15:26:13,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:26:13,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840933518] [2025-03-16 15:26:13,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840933518] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:26:13,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:26:13,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:26:13,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107241013] [2025-03-16 15:26:13,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:26:13,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:26:13,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:26:13,085 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:26:13,085 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:26:13,085 INFO L87 Difference]: Start difference. First operand 104883 states and 108595 transitions. Second operand has 3 states, 3 states have (on average 177.66666666666666) internal successors, (533), 3 states have internal predecessors, (533), 0 states have call successors, (0), 0 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-16 15:26:14,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:26:14,658 INFO L93 Difference]: Finished difference Result 209075 states and 216498 transitions. [2025-03-16 15:26:14,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:26:14,658 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 177.66666666666666) internal successors, (533), 3 states have internal predecessors, (533), 0 states have call successors, (0), 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 1404 [2025-03-16 15:26:14,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:26:14,765 INFO L225 Difference]: With dead ends: 209075 [2025-03-16 15:26:14,765 INFO L226 Difference]: Without dead ends: 104883 [2025-03-16 15:26:14,821 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:26:14,821 INFO L435 NwaCegarLoop]: 738 mSDtfsCounter, 784 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1674 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 784 SdHoareTripleChecker+Valid, 744 SdHoareTripleChecker+Invalid, 1811 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 1674 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-16 15:26:14,821 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [784 Valid, 744 Invalid, 1811 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 1674 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-16 15:26:14,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104883 states. [2025-03-16 15:26:15,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104883 to 104883. [2025-03-16 15:26:15,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104883 states, 104882 states have (on average 1.0333136286493392) internal successors, (108376), 104882 states have internal predecessors, (108376), 0 states have call successors, (0), 0 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-16 15:26:16,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104883 states to 104883 states and 108376 transitions. [2025-03-16 15:26:16,018 INFO L78 Accepts]: Start accepts. Automaton has 104883 states and 108376 transitions. Word has length 1404 [2025-03-16 15:26:16,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:26:16,019 INFO L471 AbstractCegarLoop]: Abstraction has 104883 states and 108376 transitions. [2025-03-16 15:26:16,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 177.66666666666666) internal successors, (533), 3 states have internal predecessors, (533), 0 states have call successors, (0), 0 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-16 15:26:16,019 INFO L276 IsEmpty]: Start isEmpty. Operand 104883 states and 108376 transitions. [2025-03-16 15:26:16,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1522 [2025-03-16 15:26:16,037 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:26:16,039 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 15:26:16,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 15:26:16,040 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:26:16,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:26:16,041 INFO L85 PathProgramCache]: Analyzing trace with hash -616826266, now seen corresponding path program 1 times [2025-03-16 15:26:16,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:26:16,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826914379] [2025-03-16 15:26:16,041 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:26:16,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:26:16,103 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1521 statements into 1 equivalence classes. [2025-03-16 15:26:16,150 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1521 of 1521 statements. [2025-03-16 15:26:16,150 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:26:16,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:26:18,000 INFO L134 CoverageAnalysis]: Checked inductivity of 2849 backedges. 1972 proven. 291 refuted. 0 times theorem prover too weak. 586 trivial. 0 not checked. [2025-03-16 15:26:18,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:26:18,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826914379] [2025-03-16 15:26:18,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826914379] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:26:18,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [968164234] [2025-03-16 15:26:18,001 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:26:18,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:26:18,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:26:18,003 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-16 15:26:18,004 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-16 15:26:18,134 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1521 statements into 1 equivalence classes. [2025-03-16 15:26:18,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1521 of 1521 statements. [2025-03-16 15:26:18,342 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:26:18,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:26:18,347 INFO L256 TraceCheckSpWp]: Trace formula consists of 1753 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-16 15:26:18,363 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:26:20,777 INFO L134 CoverageAnalysis]: Checked inductivity of 2849 backedges. 1731 proven. 223 refuted. 0 times theorem prover too weak. 895 trivial. 0 not checked. [2025-03-16 15:26:20,778 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 15:26:22,004 INFO L134 CoverageAnalysis]: Checked inductivity of 2849 backedges. 1731 proven. 223 refuted. 0 times theorem prover too weak. 895 trivial. 0 not checked. [2025-03-16 15:26:22,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [968164234] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 15:26:22,004 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 15:26:22,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-03-16 15:26:22,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176619897] [2025-03-16 15:26:22,005 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 15:26:22,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-16 15:26:22,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:26:22,008 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-16 15:26:22,008 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-03-16 15:26:22,008 INFO L87 Difference]: Start difference. First operand 104883 states and 108376 transitions. Second operand has 11 states, 11 states have (on average 179.72727272727272) internal successors, (1977), 11 states have internal predecessors, (1977), 0 states have call successors, (0), 0 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-16 15:26:38,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:26:38,780 INFO L93 Difference]: Finished difference Result 331897 states and 345295 transitions. [2025-03-16 15:26:38,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-03-16 15:26:38,781 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 179.72727272727272) internal successors, (1977), 11 states have internal predecessors, (1977), 0 states have call successors, (0), 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 1521 [2025-03-16 15:26:38,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:26:39,044 INFO L225 Difference]: With dead ends: 331897 [2025-03-16 15:26:39,044 INFO L226 Difference]: Without dead ends: 227705 [2025-03-16 15:26:39,098 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3095 GetRequests, 3061 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 351 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=302, Invalid=958, Unknown=0, NotChecked=0, Total=1260 [2025-03-16 15:26:39,099 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 32445 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 22565 mSolverCounterSat, 6975 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32445 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 29540 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 6975 IncrementalHoareTripleChecker+Valid, 22565 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.0s IncrementalHoareTripleChecker+Time [2025-03-16 15:26:39,099 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32445 Valid, 147 Invalid, 29540 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [6975 Valid, 22565 Invalid, 0 Unknown, 0 Unchecked, 15.0s Time] [2025-03-16 15:26:39,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227705 states. [2025-03-16 15:26:41,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227705 to 195273. [2025-03-16 15:26:41,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195273 states, 195272 states have (on average 1.0306956450489573) internal successors, (201266), 195272 states have internal predecessors, (201266), 0 states have call successors, (0), 0 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-16 15:26:41,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195273 states to 195273 states and 201266 transitions. [2025-03-16 15:26:41,355 INFO L78 Accepts]: Start accepts. Automaton has 195273 states and 201266 transitions. Word has length 1521 [2025-03-16 15:26:41,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:26:41,356 INFO L471 AbstractCegarLoop]: Abstraction has 195273 states and 201266 transitions. [2025-03-16 15:26:41,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 179.72727272727272) internal successors, (1977), 11 states have internal predecessors, (1977), 0 states have call successors, (0), 0 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-16 15:26:41,356 INFO L276 IsEmpty]: Start isEmpty. Operand 195273 states and 201266 transitions. [2025-03-16 15:26:41,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1676 [2025-03-16 15:26:41,381 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:26:41,381 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 15:26:41,389 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-16 15:26:41,582 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,SelfDestructingSolverStorable15 [2025-03-16 15:26:41,582 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:26:41,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:26:41,583 INFO L85 PathProgramCache]: Analyzing trace with hash -71017628, now seen corresponding path program 1 times [2025-03-16 15:26:41,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:26:41,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201911751] [2025-03-16 15:26:41,583 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:26:41,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:26:41,654 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1675 statements into 1 equivalence classes. [2025-03-16 15:26:41,703 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1675 of 1675 statements. [2025-03-16 15:26:41,704 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:26:41,704 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:26:43,979 INFO L134 CoverageAnalysis]: Checked inductivity of 3155 backedges. 2130 proven. 0 refuted. 0 times theorem prover too weak. 1025 trivial. 0 not checked. [2025-03-16 15:26:43,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:26:43,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201911751] [2025-03-16 15:26:43,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201911751] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:26:43,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:26:43,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:26:43,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192311809] [2025-03-16 15:26:43,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:26:43,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:26:43,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:26:43,990 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:26:43,990 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:26:43,991 INFO L87 Difference]: Start difference. First operand 195273 states and 201266 transitions. Second operand has 3 states, 3 states have (on average 339.0) internal successors, (1017), 3 states have internal predecessors, (1017), 0 states have call successors, (0), 0 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-16 15:26:46,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:26:46,282 INFO L93 Difference]: Finished difference Result 389165 states and 401125 transitions. [2025-03-16 15:26:46,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:26:46,283 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 339.0) internal successors, (1017), 3 states have internal predecessors, (1017), 0 states have call successors, (0), 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 1675 [2025-03-16 15:26:46,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:26:46,528 INFO L225 Difference]: With dead ends: 389165 [2025-03-16 15:26:46,528 INFO L226 Difference]: Without dead ends: 189063 [2025-03-16 15:26:46,638 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:26:46,639 INFO L435 NwaCegarLoop]: 751 mSDtfsCounter, 366 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 1664 mSolverCounterSat, 241 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 366 SdHoareTripleChecker+Valid, 756 SdHoareTripleChecker+Invalid, 1905 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 241 IncrementalHoareTripleChecker+Valid, 1664 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-16 15:26:46,639 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [366 Valid, 756 Invalid, 1905 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [241 Valid, 1664 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-16 15:26:46,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189063 states. [2025-03-16 15:26:48,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189063 to 188373. [2025-03-16 15:26:48,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188373 states, 188372 states have (on average 1.0268935935277006) internal successors, (193438), 188372 states have internal predecessors, (193438), 0 states have call successors, (0), 0 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-16 15:26:48,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188373 states to 188373 states and 193438 transitions. [2025-03-16 15:26:48,826 INFO L78 Accepts]: Start accepts. Automaton has 188373 states and 193438 transitions. Word has length 1675 [2025-03-16 15:26:48,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:26:48,826 INFO L471 AbstractCegarLoop]: Abstraction has 188373 states and 193438 transitions. [2025-03-16 15:26:48,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 339.0) internal successors, (1017), 3 states have internal predecessors, (1017), 0 states have call successors, (0), 0 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-16 15:26:48,827 INFO L276 IsEmpty]: Start isEmpty. Operand 188373 states and 193438 transitions. [2025-03-16 15:26:48,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1753 [2025-03-16 15:26:48,850 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:26:48,851 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:26:48,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-16 15:26:48,851 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:26:48,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:26:48,852 INFO L85 PathProgramCache]: Analyzing trace with hash -263018589, now seen corresponding path program 1 times [2025-03-16 15:26:48,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:26:48,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949751372] [2025-03-16 15:26:48,852 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:26:48,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:26:49,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1752 statements into 1 equivalence classes. [2025-03-16 15:26:49,286 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1752 of 1752 statements. [2025-03-16 15:26:49,286 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:26:49,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:26:50,094 INFO L134 CoverageAnalysis]: Checked inductivity of 3038 backedges. 1119 proven. 0 refuted. 0 times theorem prover too weak. 1919 trivial. 0 not checked. [2025-03-16 15:26:50,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:26:50,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949751372] [2025-03-16 15:26:50,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949751372] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:26:50,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:26:50,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:26:50,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806754599] [2025-03-16 15:26:50,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:26:50,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:26:50,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:26:50,096 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:26:50,096 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:26:50,096 INFO L87 Difference]: Start difference. First operand 188373 states and 193438 transitions. Second operand has 3 states, 3 states have (on average 253.66666666666666) internal successors, (761), 3 states have internal predecessors, (761), 0 states have call successors, (0), 0 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-16 15:26:52,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:26:52,281 INFO L93 Difference]: Finished difference Result 364325 states and 374151 transitions. [2025-03-16 15:26:52,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:26:52,282 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 253.66666666666666) internal successors, (761), 3 states have internal predecessors, (761), 0 states have call successors, (0), 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 1752 [2025-03-16 15:26:52,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:26:52,521 INFO L225 Difference]: With dead ends: 364325 [2025-03-16 15:26:52,521 INFO L226 Difference]: Without dead ends: 176643 [2025-03-16 15:26:52,609 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-16 15:26:52,610 INFO L435 NwaCegarLoop]: 918 mSDtfsCounter, 589 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 1747 mSolverCounterSat, 214 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 589 SdHoareTripleChecker+Valid, 923 SdHoareTripleChecker+Invalid, 1961 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 214 IncrementalHoareTripleChecker+Valid, 1747 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-16 15:26:52,610 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [589 Valid, 923 Invalid, 1961 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [214 Valid, 1747 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-16 15:26:52,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176643 states. [2025-03-16 15:26:54,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176643 to 173193.