./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.v_non-pipelined-microprocessor.c --full-output --architecture 64bit -------------------------------------------------------------------------------- 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/hardware-verification-bv/btor2c-lazyMod.v_non-pipelined-microprocessor.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-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 64bit --witnessprinter.graph.data.programhash 013fc4a889617293119ec23d82d2fd495e032e9bab1929da87247ff74d1355ed --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 22:44:12,707 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 22:44:12,761 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-16 22:44:12,766 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 22:44:12,766 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 22:44:12,784 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 22:44:12,784 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 22:44:12,785 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 22:44:12,785 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 22:44:12,785 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 22:44:12,785 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 22:44:12,785 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 22:44:12,785 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 22:44:12,786 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 22:44:12,786 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 22:44:12,786 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 22:44:12,786 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 22:44:12,786 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 22:44:12,787 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 22:44:12,787 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 22:44:12,787 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 22:44:12,787 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 22:44:12,787 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 22:44:12,787 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 22:44:12,787 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 22:44:12,788 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 22:44:12,788 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 22:44:12,788 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 22:44:12,788 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 22:44:12,788 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 22:44:12,788 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 22:44:12,788 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 22:44:12,788 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 22:44:12,788 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 22:44:12,788 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 22:44:12,788 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 22:44:12,788 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 22:44:12,788 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 22:44:12,788 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 22:44:12,788 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 22:44:12,788 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 013fc4a889617293119ec23d82d2fd495e032e9bab1929da87247ff74d1355ed [2025-03-16 22:44:12,981 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 22:44:12,987 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 22:44:12,988 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 22:44:12,989 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 22:44:12,989 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 22:44:12,990 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.v_non-pipelined-microprocessor.c [2025-03-16 22:44:14,141 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d24176a6/24a7a866e94d42c88c92ad8f4c055905/FLAG879e9dbc2 [2025-03-16 22:44:14,459 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 22:44:14,460 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.v_non-pipelined-microprocessor.c [2025-03-16 22:44:14,472 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d24176a6/24a7a866e94d42c88c92ad8f4c055905/FLAG879e9dbc2 [2025-03-16 22:44:14,727 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d24176a6/24a7a866e94d42c88c92ad8f4c055905 [2025-03-16 22:44:14,730 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 22:44:14,732 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 22:44:14,733 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 22:44:14,733 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 22:44:14,736 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 22:44:14,736 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 10:44:14" (1/1) ... [2025-03-16 22:44:14,738 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ed0eb3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:44:14, skipping insertion in model container [2025-03-16 22:44:14,738 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 10:44:14" (1/1) ... [2025-03-16 22:44:14,762 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 22:44:14,849 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/hardware-verification-bv/btor2c-lazyMod.v_non-pipelined-microprocessor.c[1270,1283] [2025-03-16 22:44:14,943 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 22:44:14,951 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 22:44:14,958 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/hardware-verification-bv/btor2c-lazyMod.v_non-pipelined-microprocessor.c[1270,1283] [2025-03-16 22:44:15,021 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 22:44:15,032 INFO L204 MainTranslator]: Completed translation [2025-03-16 22:44:15,033 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:44:15 WrapperNode [2025-03-16 22:44:15,034 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 22:44:15,034 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 22:44:15,034 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 22:44:15,035 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 22:44:15,039 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:44:15" (1/1) ... [2025-03-16 22:44:15,053 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:44:15" (1/1) ... [2025-03-16 22:44:15,131 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1100 [2025-03-16 22:44:15,131 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 22:44:15,132 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 22:44:15,132 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 22:44:15,132 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 22:44:15,138 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:44:15" (1/1) ... [2025-03-16 22:44:15,139 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:44:15" (1/1) ... [2025-03-16 22:44:15,155 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:44:15" (1/1) ... [2025-03-16 22:44:15,197 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 22:44:15,197 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:44:15" (1/1) ... [2025-03-16 22:44:15,199 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:44:15" (1/1) ... [2025-03-16 22:44:15,231 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:44:15" (1/1) ... [2025-03-16 22:44:15,238 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:44:15" (1/1) ... [2025-03-16 22:44:15,246 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:44:15" (1/1) ... [2025-03-16 22:44:15,255 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:44:15" (1/1) ... [2025-03-16 22:44:15,272 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 22:44:15,274 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 22:44:15,274 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 22:44:15,274 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 22:44:15,275 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:44:15" (1/1) ... [2025-03-16 22:44:15,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 22:44:15,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 22:44:15,301 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 22:44:15,305 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 22:44:15,324 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 22:44:15,324 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 22:44:15,324 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 22:44:15,324 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 22:44:15,464 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 22:44:15,466 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 22:44:16,390 INFO L? ?]: Removed 641 outVars from TransFormulas that were not future-live. [2025-03-16 22:44:16,391 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 22:44:16,442 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 22:44:16,442 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 22:44:16,442 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 10:44:16 BoogieIcfgContainer [2025-03-16 22:44:16,443 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 22:44:16,444 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 22:44:16,444 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 22:44:16,448 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 22:44:16,448 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 10:44:14" (1/3) ... [2025-03-16 22:44:16,448 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@159281a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 10:44:16, skipping insertion in model container [2025-03-16 22:44:16,449 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:44:15" (2/3) ... [2025-03-16 22:44:16,449 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@159281a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 10:44:16, skipping insertion in model container [2025-03-16 22:44:16,450 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 10:44:16" (3/3) ... [2025-03-16 22:44:16,451 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.v_non-pipelined-microprocessor.c [2025-03-16 22:44:16,462 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 22:44:16,464 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.v_non-pipelined-microprocessor.c that has 1 procedures, 253 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 22:44:16,513 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 22:44:16,522 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;@73920485, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 22:44:16,523 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 22:44:16,528 INFO L276 IsEmpty]: Start isEmpty. Operand has 253 states, 251 states have (on average 1.50199203187251) internal successors, (377), 252 states have internal predecessors, (377), 0 states have call successors, (0), 0 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 22:44:16,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-16 22:44:16,534 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:44:16,534 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:44:16,536 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:44:16,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:44:16,541 INFO L85 PathProgramCache]: Analyzing trace with hash 377782611, now seen corresponding path program 1 times [2025-03-16 22:44:16,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:44:16,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46730762] [2025-03-16 22:44:16,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:44:16,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:44:16,644 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-16 22:44:17,038 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-16 22:44:17,038 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:44:17,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:44:17,912 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 22:44:17,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:44:17,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46730762] [2025-03-16 22:44:17,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46730762] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:44:17,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:44:17,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 22:44:17,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565266609] [2025-03-16 22:44:17,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:44:17,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 22:44:17,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:44:17,935 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 22:44:17,935 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 22:44:17,938 INFO L87 Difference]: Start difference. First operand has 253 states, 251 states have (on average 1.50199203187251) internal successors, (377), 252 states have internal predecessors, (377), 0 states have call successors, (0), 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 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:44:18,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:44:18,141 INFO L93 Difference]: Finished difference Result 475 states and 710 transitions. [2025-03-16 22:44:18,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 22:44:18,143 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2025-03-16 22:44:18,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:44:18,150 INFO L225 Difference]: With dead ends: 475 [2025-03-16 22:44:18,152 INFO L226 Difference]: Without dead ends: 255 [2025-03-16 22:44:18,154 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-16 22:44:18,157 INFO L435 NwaCegarLoop]: 310 mSDtfsCounter, 311 mSDsluCounter, 613 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 311 SdHoareTripleChecker+Valid, 923 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 22:44:18,159 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [311 Valid, 923 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 22:44:18,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2025-03-16 22:44:18,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 254. [2025-03-16 22:44:18,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 253 states have (on average 1.4901185770750989) internal successors, (377), 253 states have internal predecessors, (377), 0 states have call successors, (0), 0 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 22:44:18,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 377 transitions. [2025-03-16 22:44:18,199 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 377 transitions. Word has length 76 [2025-03-16 22:44:18,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:44:18,199 INFO L471 AbstractCegarLoop]: Abstraction has 254 states and 377 transitions. [2025-03-16 22:44:18,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:44:18,200 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 377 transitions. [2025-03-16 22:44:18,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-16 22:44:18,201 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:44:18,201 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:44:18,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 22:44:18,202 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:44:18,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:44:18,202 INFO L85 PathProgramCache]: Analyzing trace with hash -1366068305, now seen corresponding path program 1 times [2025-03-16 22:44:18,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:44:18,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510155692] [2025-03-16 22:44:18,203 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:44:18,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:44:18,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-16 22:44:18,275 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-16 22:44:18,276 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:44:18,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:44:18,639 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 22:44:18,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:44:18,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510155692] [2025-03-16 22:44:18,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510155692] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:44:18,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:44:18,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 22:44:18,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408655614] [2025-03-16 22:44:18,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:44:18,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 22:44:18,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:44:18,641 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 22:44:18,641 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 22:44:18,642 INFO L87 Difference]: Start difference. First operand 254 states and 377 transitions. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 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 22:44:18,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:44:18,770 INFO L93 Difference]: Finished difference Result 258 states and 381 transitions. [2025-03-16 22:44:18,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 22:44:18,771 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 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 77 [2025-03-16 22:44:18,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:44:18,772 INFO L225 Difference]: With dead ends: 258 [2025-03-16 22:44:18,772 INFO L226 Difference]: Without dead ends: 256 [2025-03-16 22:44:18,772 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 22:44:18,773 INFO L435 NwaCegarLoop]: 311 mSDtfsCounter, 0 mSDsluCounter, 617 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 928 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 22:44:18,777 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 928 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 22:44:18,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2025-03-16 22:44:18,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 256. [2025-03-16 22:44:18,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 255 states have (on average 1.4862745098039216) internal successors, (379), 255 states have internal predecessors, (379), 0 states have call successors, (0), 0 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 22:44:18,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 379 transitions. [2025-03-16 22:44:18,791 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 379 transitions. Word has length 77 [2025-03-16 22:44:18,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:44:18,792 INFO L471 AbstractCegarLoop]: Abstraction has 256 states and 379 transitions. [2025-03-16 22:44:18,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 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 22:44:18,793 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 379 transitions. [2025-03-16 22:44:18,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-16 22:44:18,794 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:44:18,794 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:44:18,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 22:44:18,794 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:44:18,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:44:18,794 INFO L85 PathProgramCache]: Analyzing trace with hash 606234825, now seen corresponding path program 1 times [2025-03-16 22:44:18,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:44:18,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029922135] [2025-03-16 22:44:18,795 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:44:18,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:44:18,832 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-16 22:44:18,863 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-16 22:44:18,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:44:18,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:44:19,059 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 22:44:19,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:44:19,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029922135] [2025-03-16 22:44:19,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029922135] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:44:19,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:44:19,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 22:44:19,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255680461] [2025-03-16 22:44:19,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:44:19,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 22:44:19,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:44:19,061 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 22:44:19,061 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 22:44:19,061 INFO L87 Difference]: Start difference. First operand 256 states and 379 transitions. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 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 22:44:19,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:44:19,173 INFO L93 Difference]: Finished difference Result 481 states and 712 transitions. [2025-03-16 22:44:19,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 22:44:19,174 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 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 22:44:19,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:44:19,175 INFO L225 Difference]: With dead ends: 481 [2025-03-16 22:44:19,175 INFO L226 Difference]: Without dead ends: 258 [2025-03-16 22:44:19,176 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 22:44:19,176 INFO L435 NwaCegarLoop]: 311 mSDtfsCounter, 0 mSDsluCounter, 614 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 925 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 22:44:19,176 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 925 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 22:44:19,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2025-03-16 22:44:19,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 258. [2025-03-16 22:44:19,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 257 states have (on average 1.482490272373541) internal successors, (381), 257 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:44:19,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 381 transitions. [2025-03-16 22:44:19,192 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 381 transitions. Word has length 78 [2025-03-16 22:44:19,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:44:19,192 INFO L471 AbstractCegarLoop]: Abstraction has 258 states and 381 transitions. [2025-03-16 22:44:19,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 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 22:44:19,193 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 381 transitions. [2025-03-16 22:44:19,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-16 22:44:19,193 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:44:19,193 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:44:19,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 22:44:19,194 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:44:19,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:44:19,194 INFO L85 PathProgramCache]: Analyzing trace with hash -932279984, now seen corresponding path program 1 times [2025-03-16 22:44:19,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:44:19,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279860679] [2025-03-16 22:44:19,194 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:44:19,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:44:19,232 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-16 22:44:19,758 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-16 22:44:19,758 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:44:19,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:44:23,702 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 22:44:23,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:44:23,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279860679] [2025-03-16 22:44:23,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279860679] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:44:23,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:44:23,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-16 22:44:23,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612087058] [2025-03-16 22:44:23,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:44:23,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-16 22:44:23,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:44:23,703 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-16 22:44:23,703 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2025-03-16 22:44:23,703 INFO L87 Difference]: Start difference. First operand 258 states and 381 transitions. Second operand has 15 states, 15 states have (on average 5.266666666666667) internal successors, (79), 14 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 22:44:29,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:44:29,002 INFO L93 Difference]: Finished difference Result 650 states and 956 transitions. [2025-03-16 22:44:29,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-16 22:44:29,002 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.266666666666667) internal successors, (79), 14 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 22:44:29,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:44:29,004 INFO L225 Difference]: With dead ends: 650 [2025-03-16 22:44:29,005 INFO L226 Difference]: Without dead ends: 425 [2025-03-16 22:44:29,006 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=87, Invalid=465, Unknown=0, NotChecked=0, Total=552 [2025-03-16 22:44:29,008 INFO L435 NwaCegarLoop]: 193 mSDtfsCounter, 649 mSDsluCounter, 2045 mSDsCounter, 0 mSdLazyCounter, 4076 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 649 SdHoareTripleChecker+Valid, 2238 SdHoareTripleChecker+Invalid, 4079 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4076 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2025-03-16 22:44:29,008 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [649 Valid, 2238 Invalid, 4079 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4076 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2025-03-16 22:44:29,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2025-03-16 22:44:29,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 280. [2025-03-16 22:44:29,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 279 states have (on average 1.4802867383512546) internal successors, (413), 279 states have internal predecessors, (413), 0 states have call successors, (0), 0 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 22:44:29,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 413 transitions. [2025-03-16 22:44:29,025 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 413 transitions. Word has length 79 [2025-03-16 22:44:29,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:44:29,025 INFO L471 AbstractCegarLoop]: Abstraction has 280 states and 413 transitions. [2025-03-16 22:44:29,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.266666666666667) internal successors, (79), 14 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 22:44:29,025 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 413 transitions. [2025-03-16 22:44:29,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-16 22:44:29,029 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:44:29,030 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:44:29,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 22:44:29,030 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:44:29,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:44:29,031 INFO L85 PathProgramCache]: Analyzing trace with hash -152884228, now seen corresponding path program 1 times [2025-03-16 22:44:29,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:44:29,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083768736] [2025-03-16 22:44:29,032 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:44:29,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:44:29,062 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-16 22:44:29,241 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-16 22:44:29,242 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:44:29,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:44:29,383 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 22:44:29,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:44:29,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083768736] [2025-03-16 22:44:29,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083768736] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:44:29,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:44:29,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 22:44:29,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261655653] [2025-03-16 22:44:29,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:44:29,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 22:44:29,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:44:29,386 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 22:44:29,386 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 22:44:29,386 INFO L87 Difference]: Start difference. First operand 280 states and 413 transitions. Second operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:44:29,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:44:29,918 INFO L93 Difference]: Finished difference Result 689 states and 1013 transitions. [2025-03-16 22:44:29,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 22:44:29,918 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2025-03-16 22:44:29,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:44:29,920 INFO L225 Difference]: With dead ends: 689 [2025-03-16 22:44:29,921 INFO L226 Difference]: Without dead ends: 442 [2025-03-16 22:44:29,922 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 22:44:29,922 INFO L435 NwaCegarLoop]: 204 mSDtfsCounter, 226 mSDsluCounter, 413 mSDsCounter, 0 mSdLazyCounter, 830 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 617 SdHoareTripleChecker+Invalid, 830 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 830 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 22:44:29,922 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 617 Invalid, 830 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 830 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 22:44:29,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2025-03-16 22:44:29,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 287. [2025-03-16 22:44:29,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 286 states have (on average 1.479020979020979) internal successors, (423), 286 states have internal predecessors, (423), 0 states have call successors, (0), 0 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 22:44:29,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 423 transitions. [2025-03-16 22:44:29,935 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 423 transitions. Word has length 80 [2025-03-16 22:44:29,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:44:29,935 INFO L471 AbstractCegarLoop]: Abstraction has 287 states and 423 transitions. [2025-03-16 22:44:29,935 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:44:29,936 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 423 transitions. [2025-03-16 22:44:29,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-16 22:44:29,937 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:44:29,938 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:44:29,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 22:44:29,938 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:44:29,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:44:29,938 INFO L85 PathProgramCache]: Analyzing trace with hash -90890529, now seen corresponding path program 1 times [2025-03-16 22:44:29,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:44:29,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166088204] [2025-03-16 22:44:29,938 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:44:29,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:44:29,965 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-16 22:44:30,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-16 22:44:30,118 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:44:30,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:44:30,319 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 22:44:30,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:44:30,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166088204] [2025-03-16 22:44:30,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166088204] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:44:30,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:44:30,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 22:44:30,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253270919] [2025-03-16 22:44:30,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:44:30,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 22:44:30,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:44:30,322 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 22:44:30,322 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 22:44:30,322 INFO L87 Difference]: Start difference. First operand 287 states and 423 transitions. Second operand has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 5 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:44:30,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:44:30,793 INFO L93 Difference]: Finished difference Result 555 states and 818 transitions. [2025-03-16 22:44:30,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 22:44:30,793 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 5 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2025-03-16 22:44:30,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:44:30,794 INFO L225 Difference]: With dead ends: 555 [2025-03-16 22:44:30,794 INFO L226 Difference]: Without dead ends: 308 [2025-03-16 22:44:30,795 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-03-16 22:44:30,795 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 375 mSDsluCounter, 462 mSDsCounter, 0 mSdLazyCounter, 946 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 375 SdHoareTripleChecker+Valid, 622 SdHoareTripleChecker+Invalid, 946 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 946 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 22:44:30,795 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [375 Valid, 622 Invalid, 946 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 946 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 22:44:30,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2025-03-16 22:44:30,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 289. [2025-03-16 22:44:30,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 288 states have (on average 1.4756944444444444) internal successors, (425), 288 states have internal predecessors, (425), 0 states have call successors, (0), 0 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 22:44:30,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 425 transitions. [2025-03-16 22:44:30,805 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 425 transitions. Word has length 80 [2025-03-16 22:44:30,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:44:30,805 INFO L471 AbstractCegarLoop]: Abstraction has 289 states and 425 transitions. [2025-03-16 22:44:30,805 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 5 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:44:30,806 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 425 transitions. [2025-03-16 22:44:30,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-16 22:44:30,806 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:44:30,806 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:44:30,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 22:44:30,806 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:44:30,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:44:30,807 INFO L85 PathProgramCache]: Analyzing trace with hash 626352090, now seen corresponding path program 1 times [2025-03-16 22:44:30,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:44:30,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181978152] [2025-03-16 22:44:30,807 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:44:30,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:44:30,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-16 22:44:31,034 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-16 22:44:31,035 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:44:31,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:44:33,412 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 22:44:33,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:44:33,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181978152] [2025-03-16 22:44:33,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181978152] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:44:33,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:44:33,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-16 22:44:33,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691357682] [2025-03-16 22:44:33,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:44:33,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-16 22:44:33,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:44:33,414 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-16 22:44:33,414 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2025-03-16 22:44:33,415 INFO L87 Difference]: Start difference. First operand 289 states and 425 transitions. Second operand has 15 states, 15 states have (on average 5.333333333333333) internal successors, (80), 14 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:44:34,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:44:34,904 INFO L93 Difference]: Finished difference Result 823 states and 1201 transitions. [2025-03-16 22:44:34,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-16 22:44:34,905 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.333333333333333) internal successors, (80), 14 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2025-03-16 22:44:34,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:44:34,906 INFO L225 Difference]: With dead ends: 823 [2025-03-16 22:44:34,907 INFO L226 Difference]: Without dead ends: 574 [2025-03-16 22:44:34,907 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=115, Invalid=535, Unknown=0, NotChecked=0, Total=650 [2025-03-16 22:44:34,908 INFO L435 NwaCegarLoop]: 416 mSDtfsCounter, 865 mSDsluCounter, 3478 mSDsCounter, 0 mSdLazyCounter, 2367 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 865 SdHoareTripleChecker+Valid, 3894 SdHoareTripleChecker+Invalid, 2388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 2367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-16 22:44:34,908 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [865 Valid, 3894 Invalid, 2388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 2367 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-16 22:44:34,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2025-03-16 22:44:34,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 317. [2025-03-16 22:44:34,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 317 states, 316 states have (on average 1.4778481012658229) internal successors, (467), 316 states have internal predecessors, (467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:44:34,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 467 transitions. [2025-03-16 22:44:34,920 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 467 transitions. Word has length 80 [2025-03-16 22:44:34,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:44:34,920 INFO L471 AbstractCegarLoop]: Abstraction has 317 states and 467 transitions. [2025-03-16 22:44:34,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.333333333333333) internal successors, (80), 14 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:44:34,920 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 467 transitions. [2025-03-16 22:44:34,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-16 22:44:34,920 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:44:34,921 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:44:34,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 22:44:34,921 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:44:34,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:44:34,921 INFO L85 PathProgramCache]: Analyzing trace with hash 1342933889, now seen corresponding path program 1 times [2025-03-16 22:44:34,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:44:34,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065433401] [2025-03-16 22:44:34,921 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:44:34,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:44:34,949 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-16 22:44:35,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-16 22:44:35,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:44:35,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:44:35,172 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 22:44:35,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:44:35,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065433401] [2025-03-16 22:44:35,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065433401] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:44:35,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:44:35,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 22:44:35,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450736827] [2025-03-16 22:44:35,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:44:35,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 22:44:35,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:44:35,174 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 22:44:35,174 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 22:44:35,175 INFO L87 Difference]: Start difference. First operand 317 states and 467 transitions. Second operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:44:35,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:44:35,643 INFO L93 Difference]: Finished difference Result 779 states and 1144 transitions. [2025-03-16 22:44:35,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 22:44:35,643 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2025-03-16 22:44:35,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:44:35,645 INFO L225 Difference]: With dead ends: 779 [2025-03-16 22:44:35,645 INFO L226 Difference]: Without dead ends: 502 [2025-03-16 22:44:35,646 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 22:44:35,646 INFO L435 NwaCegarLoop]: 205 mSDtfsCounter, 223 mSDsluCounter, 413 mSDsCounter, 0 mSdLazyCounter, 829 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 618 SdHoareTripleChecker+Invalid, 829 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 829 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 22:44:35,646 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 618 Invalid, 829 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 829 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 22:44:35,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2025-03-16 22:44:35,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 323. [2025-03-16 22:44:35,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 322 states have (on average 1.4751552795031055) internal successors, (475), 322 states have internal predecessors, (475), 0 states have call successors, (0), 0 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 22:44:35,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 475 transitions. [2025-03-16 22:44:35,661 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 475 transitions. Word has length 80 [2025-03-16 22:44:35,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:44:35,661 INFO L471 AbstractCegarLoop]: Abstraction has 323 states and 475 transitions. [2025-03-16 22:44:35,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:44:35,661 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 475 transitions. [2025-03-16 22:44:35,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-16 22:44:35,664 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:44:35,664 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:44:35,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 22:44:35,665 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:44:35,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:44:35,665 INFO L85 PathProgramCache]: Analyzing trace with hash -1279245745, now seen corresponding path program 1 times [2025-03-16 22:44:35,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:44:35,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713448452] [2025-03-16 22:44:35,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:44:35,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:44:35,693 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-16 22:44:35,751 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-16 22:44:35,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:44:35,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:44:35,904 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 22:44:35,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:44:35,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713448452] [2025-03-16 22:44:35,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713448452] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:44:35,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:44:35,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 22:44:35,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538811774] [2025-03-16 22:44:35,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:44:35,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 22:44:35,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:44:35,906 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 22:44:35,907 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 22:44:35,907 INFO L87 Difference]: Start difference. First operand 323 states and 475 transitions. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 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 22:44:36,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:44:36,066 INFO L93 Difference]: Finished difference Result 766 states and 1123 transitions. [2025-03-16 22:44:36,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 22:44:36,066 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 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 81 [2025-03-16 22:44:36,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:44:36,068 INFO L225 Difference]: With dead ends: 766 [2025-03-16 22:44:36,068 INFO L226 Difference]: Without dead ends: 484 [2025-03-16 22:44:36,068 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 22:44:36,069 INFO L435 NwaCegarLoop]: 302 mSDtfsCounter, 221 mSDsluCounter, 860 mSDsCounter, 0 mSdLazyCounter, 285 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 1162 SdHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 22:44:36,069 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 1162 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 285 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 22:44:36,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2025-03-16 22:44:36,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 319. [2025-03-16 22:44:36,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 318 states have (on average 1.4748427672955975) internal successors, (469), 318 states have internal predecessors, (469), 0 states have call successors, (0), 0 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 22:44:36,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 469 transitions. [2025-03-16 22:44:36,076 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 469 transitions. Word has length 81 [2025-03-16 22:44:36,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:44:36,076 INFO L471 AbstractCegarLoop]: Abstraction has 319 states and 469 transitions. [2025-03-16 22:44:36,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 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 22:44:36,076 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 469 transitions. [2025-03-16 22:44:36,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-16 22:44:36,077 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:44:36,077 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:44:36,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 22:44:36,077 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:44:36,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:44:36,077 INFO L85 PathProgramCache]: Analyzing trace with hash 708607614, now seen corresponding path program 1 times [2025-03-16 22:44:36,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:44:36,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400738750] [2025-03-16 22:44:36,078 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:44:36,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:44:36,100 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-16 22:44:36,154 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-16 22:44:36,155 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:44:36,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:44:36,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:44:36,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:44:36,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400738750] [2025-03-16 22:44:36,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400738750] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:44:36,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:44:36,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 22:44:36,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406623507] [2025-03-16 22:44:36,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:44:36,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 22:44:36,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:44:36,305 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 22:44:36,305 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 22:44:36,305 INFO L87 Difference]: Start difference. First operand 319 states and 469 transitions. Second operand has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 0 states have call successors, (0), 0 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 22:44:36,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:44:36,619 INFO L93 Difference]: Finished difference Result 617 states and 908 transitions. [2025-03-16 22:44:36,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 22:44:36,619 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 0 states have call successors, (0), 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 81 [2025-03-16 22:44:36,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:44:36,621 INFO L225 Difference]: With dead ends: 617 [2025-03-16 22:44:36,621 INFO L226 Difference]: Without dead ends: 340 [2025-03-16 22:44:36,621 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-16 22:44:36,622 INFO L435 NwaCegarLoop]: 284 mSDtfsCounter, 33 mSDsluCounter, 586 mSDsCounter, 0 mSdLazyCounter, 618 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 870 SdHoareTripleChecker+Invalid, 619 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 618 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 22:44:36,622 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 870 Invalid, 619 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 618 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 22:44:36,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2025-03-16 22:44:36,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 319. [2025-03-16 22:44:36,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 318 states have (on average 1.4748427672955975) internal successors, (469), 318 states have internal predecessors, (469), 0 states have call successors, (0), 0 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 22:44:36,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 469 transitions. [2025-03-16 22:44:36,630 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 469 transitions. Word has length 81 [2025-03-16 22:44:36,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:44:36,630 INFO L471 AbstractCegarLoop]: Abstraction has 319 states and 469 transitions. [2025-03-16 22:44:36,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 0 states have call successors, (0), 0 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 22:44:36,630 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 469 transitions. [2025-03-16 22:44:36,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-16 22:44:36,631 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:44:36,631 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:44:36,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 22:44:36,631 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:44:36,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:44:36,632 INFO L85 PathProgramCache]: Analyzing trace with hash 1526658933, now seen corresponding path program 1 times [2025-03-16 22:44:36,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:44:36,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410048430] [2025-03-16 22:44:36,633 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:44:36,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:44:36,660 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-16 22:44:36,848 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-16 22:44:36,848 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:44:36,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:44:37,083 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 22:44:37,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:44:37,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410048430] [2025-03-16 22:44:37,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410048430] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:44:37,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:44:37,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 22:44:37,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243261272] [2025-03-16 22:44:37,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:44:37,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 22:44:37,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:44:37,084 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 22:44:37,084 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-16 22:44:37,084 INFO L87 Difference]: Start difference. First operand 319 states and 469 transitions. Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 6 states have internal predecessors, (81), 0 states have call successors, (0), 0 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 22:44:37,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:44:37,741 INFO L93 Difference]: Finished difference Result 720 states and 1055 transitions. [2025-03-16 22:44:37,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 22:44:37,742 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 6 states have internal predecessors, (81), 0 states have call successors, (0), 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 81 [2025-03-16 22:44:37,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:44:37,743 INFO L225 Difference]: With dead ends: 720 [2025-03-16 22:44:37,743 INFO L226 Difference]: Without dead ends: 443 [2025-03-16 22:44:37,744 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-16 22:44:37,744 INFO L435 NwaCegarLoop]: 220 mSDtfsCounter, 520 mSDsluCounter, 806 mSDsCounter, 0 mSdLazyCounter, 1469 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 520 SdHoareTripleChecker+Valid, 1026 SdHoareTripleChecker+Invalid, 1470 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1469 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 22:44:37,744 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [520 Valid, 1026 Invalid, 1470 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1469 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 22:44:37,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2025-03-16 22:44:37,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 324. [2025-03-16 22:44:37,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 324 states, 323 states have (on average 1.4705882352941178) internal successors, (475), 323 states have internal predecessors, (475), 0 states have call successors, (0), 0 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 22:44:37,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 475 transitions. [2025-03-16 22:44:37,750 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 475 transitions. Word has length 81 [2025-03-16 22:44:37,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:44:37,750 INFO L471 AbstractCegarLoop]: Abstraction has 324 states and 475 transitions. [2025-03-16 22:44:37,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 6 states have internal predecessors, (81), 0 states have call successors, (0), 0 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 22:44:37,750 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 475 transitions. [2025-03-16 22:44:37,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-16 22:44:37,752 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:44:37,752 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:44:37,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 22:44:37,753 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:44:37,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:44:37,753 INFO L85 PathProgramCache]: Analyzing trace with hash 839521855, now seen corresponding path program 1 times [2025-03-16 22:44:37,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:44:37,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254557047] [2025-03-16 22:44:37,754 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:44:37,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:44:37,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-16 22:44:37,793 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-16 22:44:37,794 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:44:37,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:44:38,018 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 22:44:38,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:44:38,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254557047] [2025-03-16 22:44:38,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254557047] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:44:38,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:44:38,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 22:44:38,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377405195] [2025-03-16 22:44:38,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:44:38,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 22:44:38,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:44:38,019 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 22:44:38,019 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-16 22:44:38,019 INFO L87 Difference]: Start difference. First operand 324 states and 475 transitions. Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 6 states have internal predecessors, (81), 0 states have call successors, (0), 0 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 22:44:38,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:44:38,636 INFO L93 Difference]: Finished difference Result 776 states and 1134 transitions. [2025-03-16 22:44:38,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 22:44:38,636 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 6 states have internal predecessors, (81), 0 states have call successors, (0), 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 81 [2025-03-16 22:44:38,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:44:38,638 INFO L225 Difference]: With dead ends: 776 [2025-03-16 22:44:38,638 INFO L226 Difference]: Without dead ends: 494 [2025-03-16 22:44:38,639 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-03-16 22:44:38,640 INFO L435 NwaCegarLoop]: 208 mSDtfsCounter, 262 mSDsluCounter, 562 mSDsCounter, 0 mSdLazyCounter, 1051 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 770 SdHoareTripleChecker+Invalid, 1051 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1051 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 22:44:38,640 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [262 Valid, 770 Invalid, 1051 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1051 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 22:44:38,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2025-03-16 22:44:38,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 341. [2025-03-16 22:44:38,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 340 states have (on average 1.4676470588235293) internal successors, (499), 340 states have internal predecessors, (499), 0 states have call successors, (0), 0 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 22:44:38,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 499 transitions. [2025-03-16 22:44:38,646 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 499 transitions. Word has length 81 [2025-03-16 22:44:38,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:44:38,646 INFO L471 AbstractCegarLoop]: Abstraction has 341 states and 499 transitions. [2025-03-16 22:44:38,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 6 states have internal predecessors, (81), 0 states have call successors, (0), 0 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 22:44:38,647 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 499 transitions. [2025-03-16 22:44:38,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-16 22:44:38,648 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:44:38,648 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:44:38,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 22:44:38,649 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:44:38,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:44:38,649 INFO L85 PathProgramCache]: Analyzing trace with hash -7094364, now seen corresponding path program 1 times [2025-03-16 22:44:38,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:44:38,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797732753] [2025-03-16 22:44:38,649 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:44:38,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:44:38,675 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-16 22:44:38,688 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-16 22:44:38,688 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:44:38,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:44:38,869 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 22:44:38,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:44:38,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797732753] [2025-03-16 22:44:38,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797732753] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:44:38,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:44:38,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 22:44:38,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240259484] [2025-03-16 22:44:38,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:44:38,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 22:44:38,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:44:38,871 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 22:44:38,871 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-16 22:44:38,871 INFO L87 Difference]: Start difference. First operand 341 states and 499 transitions. Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 6 states have internal predecessors, (81), 0 states have call successors, (0), 0 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 22:44:39,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:44:39,401 INFO L93 Difference]: Finished difference Result 782 states and 1140 transitions. [2025-03-16 22:44:39,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 22:44:39,402 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 6 states have internal predecessors, (81), 0 states have call successors, (0), 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 81 [2025-03-16 22:44:39,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:44:39,403 INFO L225 Difference]: With dead ends: 782 [2025-03-16 22:44:39,403 INFO L226 Difference]: Without dead ends: 494 [2025-03-16 22:44:39,404 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-03-16 22:44:39,404 INFO L435 NwaCegarLoop]: 209 mSDtfsCounter, 232 mSDsluCounter, 528 mSDsCounter, 0 mSdLazyCounter, 1037 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 737 SdHoareTripleChecker+Invalid, 1037 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1037 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 22:44:39,404 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [232 Valid, 737 Invalid, 1037 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1037 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 22:44:39,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2025-03-16 22:44:39,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 341. [2025-03-16 22:44:39,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 340 states have (on average 1.4617647058823529) internal successors, (497), 340 states have internal predecessors, (497), 0 states have call successors, (0), 0 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 22:44:39,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 497 transitions. [2025-03-16 22:44:39,410 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 497 transitions. Word has length 81 [2025-03-16 22:44:39,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:44:39,410 INFO L471 AbstractCegarLoop]: Abstraction has 341 states and 497 transitions. [2025-03-16 22:44:39,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 6 states have internal predecessors, (81), 0 states have call successors, (0), 0 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 22:44:39,410 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 497 transitions. [2025-03-16 22:44:39,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-16 22:44:39,411 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:44:39,411 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:44:39,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 22:44:39,411 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:44:39,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:44:39,412 INFO L85 PathProgramCache]: Analyzing trace with hash -666907764, now seen corresponding path program 1 times [2025-03-16 22:44:39,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:44:39,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961820119] [2025-03-16 22:44:39,412 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:44:39,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:44:39,435 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-16 22:44:39,476 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-16 22:44:39,477 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:44:39,477 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:44:39,617 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 22:44:39,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:44:39,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961820119] [2025-03-16 22:44:39,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961820119] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:44:39,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:44:39,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 22:44:39,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100098302] [2025-03-16 22:44:39,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:44:39,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 22:44:39,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:44:39,618 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 22:44:39,618 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 22:44:39,618 INFO L87 Difference]: Start difference. First operand 341 states and 497 transitions. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 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 22:44:39,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:44:39,750 INFO L93 Difference]: Finished difference Result 763 states and 1111 transitions. [2025-03-16 22:44:39,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 22:44:39,750 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 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 81 [2025-03-16 22:44:39,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:44:39,752 INFO L225 Difference]: With dead ends: 763 [2025-03-16 22:44:39,752 INFO L226 Difference]: Without dead ends: 472 [2025-03-16 22:44:39,752 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 22:44:39,752 INFO L435 NwaCegarLoop]: 302 mSDtfsCounter, 214 mSDsluCounter, 860 mSDsCounter, 0 mSdLazyCounter, 285 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 1162 SdHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 22:44:39,752 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 1162 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 285 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 22:44:39,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2025-03-16 22:44:39,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 332. [2025-03-16 22:44:39,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 331 states have (on average 1.4652567975830815) internal successors, (485), 331 states have internal predecessors, (485), 0 states have call successors, (0), 0 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 22:44:39,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 485 transitions. [2025-03-16 22:44:39,758 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 485 transitions. Word has length 81 [2025-03-16 22:44:39,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:44:39,758 INFO L471 AbstractCegarLoop]: Abstraction has 332 states and 485 transitions. [2025-03-16 22:44:39,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 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 22:44:39,758 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 485 transitions. [2025-03-16 22:44:39,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-16 22:44:39,758 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:44:39,759 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:44:39,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 22:44:39,759 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:44:39,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:44:39,759 INFO L85 PathProgramCache]: Analyzing trace with hash 541297590, now seen corresponding path program 1 times [2025-03-16 22:44:39,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:44:39,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350624803] [2025-03-16 22:44:39,759 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:44:39,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:44:39,783 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-16 22:44:39,854 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-16 22:44:39,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:44:39,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:44:40,010 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 22:44:40,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:44:40,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350624803] [2025-03-16 22:44:40,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350624803] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:44:40,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:44:40,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 22:44:40,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935305625] [2025-03-16 22:44:40,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:44:40,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 22:44:40,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:44:40,012 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 22:44:40,012 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 22:44:40,012 INFO L87 Difference]: Start difference. First operand 332 states and 485 transitions. Second operand has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:44:40,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:44:40,287 INFO L93 Difference]: Finished difference Result 633 states and 927 transitions. [2025-03-16 22:44:40,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 22:44:40,287 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2025-03-16 22:44:40,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:44:40,288 INFO L225 Difference]: With dead ends: 633 [2025-03-16 22:44:40,288 INFO L226 Difference]: Without dead ends: 351 [2025-03-16 22:44:40,289 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-16 22:44:40,289 INFO L435 NwaCegarLoop]: 301 mSDtfsCounter, 29 mSDsluCounter, 603 mSDsCounter, 0 mSdLazyCounter, 641 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 904 SdHoareTripleChecker+Invalid, 642 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 641 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 22:44:40,289 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 904 Invalid, 642 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 641 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 22:44:40,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2025-03-16 22:44:40,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 336. [2025-03-16 22:44:40,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 336 states, 335 states have (on average 1.462686567164179) internal successors, (490), 335 states have internal predecessors, (490), 0 states have call successors, (0), 0 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 22:44:40,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 490 transitions. [2025-03-16 22:44:40,294 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 490 transitions. Word has length 82 [2025-03-16 22:44:40,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:44:40,294 INFO L471 AbstractCegarLoop]: Abstraction has 336 states and 490 transitions. [2025-03-16 22:44:40,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:44:40,295 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 490 transitions. [2025-03-16 22:44:40,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-16 22:44:40,295 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:44:40,295 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:44:40,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 22:44:40,295 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:44:40,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:44:40,296 INFO L85 PathProgramCache]: Analyzing trace with hash -1690028925, now seen corresponding path program 1 times [2025-03-16 22:44:40,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:44:40,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405738384] [2025-03-16 22:44:40,296 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:44:40,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:44:40,322 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-16 22:44:40,369 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-16 22:44:40,369 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:44:40,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:44:40,493 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 22:44:40,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:44:40,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405738384] [2025-03-16 22:44:40,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405738384] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:44:40,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:44:40,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 22:44:40,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098647247] [2025-03-16 22:44:40,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:44:40,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 22:44:40,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:44:40,494 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 22:44:40,494 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 22:44:40,494 INFO L87 Difference]: Start difference. First operand 336 states and 490 transitions. Second operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:44:40,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:44:40,618 INFO L93 Difference]: Finished difference Result 765 states and 1113 transitions. [2025-03-16 22:44:40,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 22:44:40,618 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2025-03-16 22:44:40,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:44:40,620 INFO L225 Difference]: With dead ends: 765 [2025-03-16 22:44:40,620 INFO L226 Difference]: Without dead ends: 478 [2025-03-16 22:44:40,620 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 22:44:40,621 INFO L435 NwaCegarLoop]: 302 mSDtfsCounter, 207 mSDsluCounter, 860 mSDsCounter, 0 mSdLazyCounter, 285 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 1162 SdHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 22:44:40,621 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 1162 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 285 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 22:44:40,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2025-03-16 22:44:40,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 335. [2025-03-16 22:44:40,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 334 states have (on average 1.4580838323353293) internal successors, (487), 334 states have internal predecessors, (487), 0 states have call successors, (0), 0 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 22:44:40,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 487 transitions. [2025-03-16 22:44:40,626 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 487 transitions. Word has length 82 [2025-03-16 22:44:40,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:44:40,626 INFO L471 AbstractCegarLoop]: Abstraction has 335 states and 487 transitions. [2025-03-16 22:44:40,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:44:40,626 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 487 transitions. [2025-03-16 22:44:40,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-16 22:44:40,627 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:44:40,627 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:44:40,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-16 22:44:40,627 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:44:40,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:44:40,628 INFO L85 PathProgramCache]: Analyzing trace with hash -1203148004, now seen corresponding path program 1 times [2025-03-16 22:44:40,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:44:40,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219197595] [2025-03-16 22:44:40,628 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:44:40,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:44:40,652 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-16 22:44:40,698 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-16 22:44:40,698 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:44:40,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:44:40,884 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 22:44:40,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:44:40,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219197595] [2025-03-16 22:44:40,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219197595] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:44:40,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:44:40,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 22:44:40,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743641938] [2025-03-16 22:44:40,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:44:40,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 22:44:40,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:44:40,885 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 22:44:40,885 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 22:44:40,885 INFO L87 Difference]: Start difference. First operand 335 states and 487 transitions. Second operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:44:41,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:44:41,039 INFO L93 Difference]: Finished difference Result 744 states and 1080 transitions. [2025-03-16 22:44:41,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 22:44:41,039 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2025-03-16 22:44:41,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:44:41,041 INFO L225 Difference]: With dead ends: 744 [2025-03-16 22:44:41,041 INFO L226 Difference]: Without dead ends: 454 [2025-03-16 22:44:41,041 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 22:44:41,041 INFO L435 NwaCegarLoop]: 302 mSDtfsCounter, 203 mSDsluCounter, 860 mSDsCounter, 0 mSdLazyCounter, 285 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 1162 SdHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 22:44:41,041 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 1162 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 285 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 22:44:41,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2025-03-16 22:44:41,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 331. [2025-03-16 22:44:41,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 331 states, 330 states have (on average 1.4606060606060607) internal successors, (482), 330 states have internal predecessors, (482), 0 states have call successors, (0), 0 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 22:44:41,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 482 transitions. [2025-03-16 22:44:41,046 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 482 transitions. Word has length 82 [2025-03-16 22:44:41,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:44:41,046 INFO L471 AbstractCegarLoop]: Abstraction has 331 states and 482 transitions. [2025-03-16 22:44:41,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:44:41,046 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 482 transitions. [2025-03-16 22:44:41,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-03-16 22:44:41,047 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:44:41,047 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:44:41,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-16 22:44:41,047 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:44:41,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:44:41,048 INFO L85 PathProgramCache]: Analyzing trace with hash -684183805, now seen corresponding path program 1 times [2025-03-16 22:44:41,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:44:41,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976138001] [2025-03-16 22:44:41,048 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:44:41,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:44:41,073 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-16 22:44:41,236 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-16 22:44:41,236 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:44:41,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:44:41,538 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 22:44:41,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:44:41,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976138001] [2025-03-16 22:44:41,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976138001] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:44:41,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:44:41,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 22:44:41,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055252228] [2025-03-16 22:44:41,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:44:41,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 22:44:41,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:44:41,540 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 22:44:41,540 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-16 22:44:41,540 INFO L87 Difference]: Start difference. First operand 331 states and 482 transitions. Second operand has 9 states, 9 states have (on average 9.222222222222221) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 0 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 22:44:42,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:44:42,347 INFO L93 Difference]: Finished difference Result 740 states and 1077 transitions. [2025-03-16 22:44:42,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 22:44:42,347 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.222222222222221) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 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 83 [2025-03-16 22:44:42,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:44:42,348 INFO L225 Difference]: With dead ends: 740 [2025-03-16 22:44:42,348 INFO L226 Difference]: Without dead ends: 454 [2025-03-16 22:44:42,349 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2025-03-16 22:44:42,349 INFO L435 NwaCegarLoop]: 214 mSDtfsCounter, 551 mSDsluCounter, 1197 mSDsCounter, 0 mSdLazyCounter, 2105 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 551 SdHoareTripleChecker+Valid, 1411 SdHoareTripleChecker+Invalid, 2106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-16 22:44:42,349 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [551 Valid, 1411 Invalid, 2106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2105 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-16 22:44:42,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2025-03-16 22:44:42,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 338. [2025-03-16 22:44:42,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 337 states have (on average 1.454005934718101) internal successors, (490), 337 states have internal predecessors, (490), 0 states have call successors, (0), 0 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 22:44:42,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 490 transitions. [2025-03-16 22:44:42,354 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 490 transitions. Word has length 83 [2025-03-16 22:44:42,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:44:42,355 INFO L471 AbstractCegarLoop]: Abstraction has 338 states and 490 transitions. [2025-03-16 22:44:42,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.222222222222221) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 0 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 22:44:42,355 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 490 transitions. [2025-03-16 22:44:42,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-03-16 22:44:42,355 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:44:42,355 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:44:42,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-16 22:44:42,356 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:44:42,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:44:42,356 INFO L85 PathProgramCache]: Analyzing trace with hash 113926234, now seen corresponding path program 1 times [2025-03-16 22:44:42,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:44:42,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307391833] [2025-03-16 22:44:42,356 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:44:42,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:44:42,380 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-16 22:44:42,490 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-16 22:44:42,490 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:44:42,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:44:42,712 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 22:44:42,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:44:42,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307391833] [2025-03-16 22:44:42,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307391833] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:44:42,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:44:42,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 22:44:42,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171626291] [2025-03-16 22:44:42,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:44:42,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 22:44:42,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:44:42,714 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 22:44:42,714 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 22:44:42,714 INFO L87 Difference]: Start difference. First operand 338 states and 490 transitions. Second operand has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 5 states have internal predecessors, (83), 0 states have call successors, (0), 0 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 22:44:43,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:44:43,296 INFO L93 Difference]: Finished difference Result 759 states and 1100 transitions. [2025-03-16 22:44:43,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 22:44:43,296 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 5 states have internal predecessors, (83), 0 states have call successors, (0), 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 83 [2025-03-16 22:44:43,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:44:43,298 INFO L225 Difference]: With dead ends: 759 [2025-03-16 22:44:43,298 INFO L226 Difference]: Without dead ends: 466 [2025-03-16 22:44:43,298 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-03-16 22:44:43,298 INFO L435 NwaCegarLoop]: 222 mSDtfsCounter, 511 mSDsluCounter, 590 mSDsCounter, 0 mSdLazyCounter, 1173 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 511 SdHoareTripleChecker+Valid, 812 SdHoareTripleChecker+Invalid, 1173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 22:44:43,299 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [511 Valid, 812 Invalid, 1173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1173 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 22:44:43,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2025-03-16 22:44:43,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 343. [2025-03-16 22:44:43,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 342 states have (on average 1.4502923976608186) internal successors, (496), 342 states have internal predecessors, (496), 0 states have call successors, (0), 0 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 22:44:43,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 496 transitions. [2025-03-16 22:44:43,303 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 496 transitions. Word has length 83 [2025-03-16 22:44:43,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:44:43,304 INFO L471 AbstractCegarLoop]: Abstraction has 343 states and 496 transitions. [2025-03-16 22:44:43,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 5 states have internal predecessors, (83), 0 states have call successors, (0), 0 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 22:44:43,304 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 496 transitions. [2025-03-16 22:44:43,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-03-16 22:44:43,304 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:44:43,304 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:44:43,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-16 22:44:43,305 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:44:43,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:44:43,305 INFO L85 PathProgramCache]: Analyzing trace with hash 692458765, now seen corresponding path program 1 times [2025-03-16 22:44:43,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:44:43,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066601828] [2025-03-16 22:44:43,306 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:44:43,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:44:43,333 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-16 22:44:43,477 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-16 22:44:43,477 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:44:43,477 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:44:43,635 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 22:44:43,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:44:43,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066601828] [2025-03-16 22:44:43,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066601828] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:44:43,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:44:43,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 22:44:43,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420933746] [2025-03-16 22:44:43,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:44:43,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 22:44:43,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:44:43,636 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 22:44:43,636 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 22:44:43,637 INFO L87 Difference]: Start difference. First operand 343 states and 496 transitions. Second operand has 6 states, 6 states have (on average 14.0) internal successors, (84), 6 states have internal predecessors, (84), 0 states have call successors, (0), 0 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 22:44:43,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:44:43,937 INFO L93 Difference]: Finished difference Result 656 states and 951 transitions. [2025-03-16 22:44:43,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 22:44:43,937 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.0) internal successors, (84), 6 states have internal predecessors, (84), 0 states have call successors, (0), 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 84 [2025-03-16 22:44:43,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:44:43,938 INFO L225 Difference]: With dead ends: 656 [2025-03-16 22:44:43,938 INFO L226 Difference]: Without dead ends: 358 [2025-03-16 22:44:43,938 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-16 22:44:43,939 INFO L435 NwaCegarLoop]: 286 mSDtfsCounter, 24 mSDsluCounter, 588 mSDsCounter, 0 mSdLazyCounter, 614 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 874 SdHoareTripleChecker+Invalid, 615 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 614 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 22:44:43,939 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 874 Invalid, 615 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 614 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 22:44:43,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2025-03-16 22:44:43,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 347. [2025-03-16 22:44:43,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 347 states, 346 states have (on average 1.4479768786127167) internal successors, (501), 346 states have internal predecessors, (501), 0 states have call successors, (0), 0 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 22:44:43,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 501 transitions. [2025-03-16 22:44:43,943 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 501 transitions. Word has length 84 [2025-03-16 22:44:43,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:44:43,943 INFO L471 AbstractCegarLoop]: Abstraction has 347 states and 501 transitions. [2025-03-16 22:44:43,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.0) internal successors, (84), 6 states have internal predecessors, (84), 0 states have call successors, (0), 0 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 22:44:43,944 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 501 transitions. [2025-03-16 22:44:43,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-03-16 22:44:43,944 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:44:43,944 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:44:43,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-16 22:44:43,944 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:44:43,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:44:43,945 INFO L85 PathProgramCache]: Analyzing trace with hash 573536081, now seen corresponding path program 1 times [2025-03-16 22:44:43,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:44:43,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875070735] [2025-03-16 22:44:43,945 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:44:43,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:44:43,970 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-16 22:44:44,112 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-16 22:44:44,113 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:44:44,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:44:44,429 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 22:44:44,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:44:44,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875070735] [2025-03-16 22:44:44,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875070735] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:44:44,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:44:44,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 22:44:44,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005239568] [2025-03-16 22:44:44,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:44:44,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 22:44:44,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:44:44,430 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 22:44:44,430 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-16 22:44:44,430 INFO L87 Difference]: Start difference. First operand 347 states and 501 transitions. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 0 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 22:44:45,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:44:45,118 INFO L93 Difference]: Finished difference Result 769 states and 1110 transitions. [2025-03-16 22:44:45,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 22:44:45,118 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 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 85 [2025-03-16 22:44:45,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:44:45,119 INFO L225 Difference]: With dead ends: 769 [2025-03-16 22:44:45,119 INFO L226 Difference]: Without dead ends: 467 [2025-03-16 22:44:45,120 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2025-03-16 22:44:45,120 INFO L435 NwaCegarLoop]: 213 mSDtfsCounter, 550 mSDsluCounter, 988 mSDsCounter, 0 mSdLazyCounter, 1763 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 550 SdHoareTripleChecker+Valid, 1201 SdHoareTripleChecker+Invalid, 1765 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1763 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 22:44:45,120 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [550 Valid, 1201 Invalid, 1765 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1763 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 22:44:45,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2025-03-16 22:44:45,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 355. [2025-03-16 22:44:45,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 355 states, 354 states have (on average 1.4406779661016949) internal successors, (510), 354 states have internal predecessors, (510), 0 states have call successors, (0), 0 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 22:44:45,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 510 transitions. [2025-03-16 22:44:45,125 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 510 transitions. Word has length 85 [2025-03-16 22:44:45,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:44:45,125 INFO L471 AbstractCegarLoop]: Abstraction has 355 states and 510 transitions. [2025-03-16 22:44:45,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 0 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 22:44:45,125 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 510 transitions. [2025-03-16 22:44:45,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-03-16 22:44:45,126 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:44:45,126 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:44:45,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-16 22:44:45,126 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:44:45,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:44:45,126 INFO L85 PathProgramCache]: Analyzing trace with hash 233589713, now seen corresponding path program 1 times [2025-03-16 22:44:45,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:44:45,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34466614] [2025-03-16 22:44:45,127 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:44:45,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:44:45,152 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-16 22:44:45,317 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-16 22:44:45,317 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:44:45,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:44:45,574 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 22:44:45,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:44:45,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34466614] [2025-03-16 22:44:45,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34466614] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:44:45,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:44:45,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 22:44:45,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534076935] [2025-03-16 22:44:45,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:44:45,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 22:44:45,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:44:45,575 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 22:44:45,576 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-16 22:44:45,576 INFO L87 Difference]: Start difference. First operand 355 states and 510 transitions. Second operand has 8 states, 8 states have (on average 10.625) internal successors, (85), 7 states have internal predecessors, (85), 0 states have call successors, (0), 0 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 22:44:46,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:44:46,254 INFO L93 Difference]: Finished difference Result 792 states and 1138 transitions. [2025-03-16 22:44:46,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 22:44:46,254 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.625) internal successors, (85), 7 states have internal predecessors, (85), 0 states have call successors, (0), 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 85 [2025-03-16 22:44:46,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:44:46,255 INFO L225 Difference]: With dead ends: 792 [2025-03-16 22:44:46,255 INFO L226 Difference]: Without dead ends: 482 [2025-03-16 22:44:46,256 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2025-03-16 22:44:46,257 INFO L435 NwaCegarLoop]: 216 mSDtfsCounter, 539 mSDsluCounter, 785 mSDsCounter, 0 mSdLazyCounter, 1520 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 539 SdHoareTripleChecker+Valid, 1001 SdHoareTripleChecker+Invalid, 1520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1520 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 22:44:46,257 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [539 Valid, 1001 Invalid, 1520 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1520 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 22:44:46,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2025-03-16 22:44:46,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 362. [2025-03-16 22:44:46,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 361 states have (on average 1.4349030470914128) internal successors, (518), 361 states have internal predecessors, (518), 0 states have call successors, (0), 0 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 22:44:46,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 518 transitions. [2025-03-16 22:44:46,262 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 518 transitions. Word has length 85 [2025-03-16 22:44:46,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:44:46,262 INFO L471 AbstractCegarLoop]: Abstraction has 362 states and 518 transitions. [2025-03-16 22:44:46,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.625) internal successors, (85), 7 states have internal predecessors, (85), 0 states have call successors, (0), 0 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 22:44:46,262 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 518 transitions. [2025-03-16 22:44:46,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-03-16 22:44:46,263 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:44:46,263 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:44:46,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-16 22:44:46,263 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:44:46,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:44:46,263 INFO L85 PathProgramCache]: Analyzing trace with hash 1092901826, now seen corresponding path program 1 times [2025-03-16 22:44:46,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:44:46,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727986940] [2025-03-16 22:44:46,263 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:44:46,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:44:46,288 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-16 22:44:46,401 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-16 22:44:46,401 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:44:46,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:44:46,546 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 22:44:46,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:44:46,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727986940] [2025-03-16 22:44:46,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727986940] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:44:46,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:44:46,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 22:44:46,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624717434] [2025-03-16 22:44:46,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:44:46,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 22:44:46,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:44:46,548 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 22:44:46,548 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 22:44:46,548 INFO L87 Difference]: Start difference. First operand 362 states and 518 transitions. Second operand has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 5 states have internal predecessors, (85), 0 states have call successors, (0), 0 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 22:44:46,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:44:46,918 INFO L93 Difference]: Finished difference Result 700 states and 1001 transitions. [2025-03-16 22:44:46,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 22:44:46,919 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 5 states have internal predecessors, (85), 0 states have call successors, (0), 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 85 [2025-03-16 22:44:46,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:44:46,920 INFO L225 Difference]: With dead ends: 700 [2025-03-16 22:44:46,920 INFO L226 Difference]: Without dead ends: 383 [2025-03-16 22:44:46,920 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-03-16 22:44:46,921 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 369 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 918 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 369 SdHoareTripleChecker+Valid, 620 SdHoareTripleChecker+Invalid, 918 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 918 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 22:44:46,921 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [369 Valid, 620 Invalid, 918 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 918 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 22:44:46,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2025-03-16 22:44:46,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 376. [2025-03-16 22:44:46,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 376 states, 375 states have (on average 1.4266666666666667) internal successors, (535), 375 states have internal predecessors, (535), 0 states have call successors, (0), 0 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 22:44:46,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 535 transitions. [2025-03-16 22:44:46,925 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 535 transitions. Word has length 85 [2025-03-16 22:44:46,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:44:46,925 INFO L471 AbstractCegarLoop]: Abstraction has 376 states and 535 transitions. [2025-03-16 22:44:46,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 5 states have internal predecessors, (85), 0 states have call successors, (0), 0 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 22:44:46,926 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 535 transitions. [2025-03-16 22:44:46,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-16 22:44:46,926 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:44:46,926 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:44:46,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-16 22:44:46,926 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:44:46,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:44:46,927 INFO L85 PathProgramCache]: Analyzing trace with hash 923922662, now seen corresponding path program 1 times [2025-03-16 22:44:46,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:44:46,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640818186] [2025-03-16 22:44:46,927 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:44:46,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:44:46,950 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-16 22:44:47,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-16 22:44:47,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:44:47,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:44:47,243 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 22:44:47,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:44:47,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640818186] [2025-03-16 22:44:47,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640818186] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:44:47,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:44:47,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 22:44:47,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664514470] [2025-03-16 22:44:47,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:44:47,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 22:44:47,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:44:47,244 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 22:44:47,244 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 22:44:47,244 INFO L87 Difference]: Start difference. First operand 376 states and 535 transitions. Second operand has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 6 states have internal predecessors, (86), 0 states have call successors, (0), 0 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 22:44:47,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:44:47,516 INFO L93 Difference]: Finished difference Result 718 states and 1023 transitions. [2025-03-16 22:44:47,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 22:44:47,516 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 6 states have internal predecessors, (86), 0 states have call successors, (0), 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 86 [2025-03-16 22:44:47,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:44:47,517 INFO L225 Difference]: With dead ends: 718 [2025-03-16 22:44:47,517 INFO L226 Difference]: Without dead ends: 387 [2025-03-16 22:44:47,518 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-16 22:44:47,518 INFO L435 NwaCegarLoop]: 287 mSDtfsCounter, 19 mSDsluCounter, 589 mSDsCounter, 0 mSdLazyCounter, 611 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 876 SdHoareTripleChecker+Invalid, 612 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 611 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 22:44:47,518 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 876 Invalid, 612 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 611 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 22:44:47,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2025-03-16 22:44:47,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 366. [2025-03-16 22:44:47,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366 states, 365 states have (on average 1.4328767123287671) internal successors, (523), 365 states have internal predecessors, (523), 0 states have call successors, (0), 0 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 22:44:47,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 523 transitions. [2025-03-16 22:44:47,523 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 523 transitions. Word has length 86 [2025-03-16 22:44:47,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:44:47,523 INFO L471 AbstractCegarLoop]: Abstraction has 366 states and 523 transitions. [2025-03-16 22:44:47,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 6 states have internal predecessors, (86), 0 states have call successors, (0), 0 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 22:44:47,523 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 523 transitions. [2025-03-16 22:44:47,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-16 22:44:47,524 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:44:47,524 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:44:47,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-16 22:44:47,524 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:44:47,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:44:47,524 INFO L85 PathProgramCache]: Analyzing trace with hash 1926732609, now seen corresponding path program 1 times [2025-03-16 22:44:47,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:44:47,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168867668] [2025-03-16 22:44:47,524 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:44:47,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:44:47,549 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-16 22:44:47,704 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-16 22:44:47,705 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:44:47,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:44:47,838 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 22:44:47,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:44:47,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168867668] [2025-03-16 22:44:47,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168867668] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:44:47,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:44:47,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 22:44:47,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263947140] [2025-03-16 22:44:47,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:44:47,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 22:44:47,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:44:47,839 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 22:44:47,839 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 22:44:47,839 INFO L87 Difference]: Start difference. First operand 366 states and 523 transitions. Second operand has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 5 states have internal predecessors, (86), 0 states have call successors, (0), 0 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 22:44:48,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:44:48,180 INFO L93 Difference]: Finished difference Result 708 states and 1010 transitions. [2025-03-16 22:44:48,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 22:44:48,180 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 5 states have internal predecessors, (86), 0 states have call successors, (0), 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 86 [2025-03-16 22:44:48,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:44:48,181 INFO L225 Difference]: With dead ends: 708 [2025-03-16 22:44:48,181 INFO L226 Difference]: Without dead ends: 387 [2025-03-16 22:44:48,182 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-03-16 22:44:48,182 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 370 mSDsluCounter, 460 mSDsCounter, 0 mSdLazyCounter, 902 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 370 SdHoareTripleChecker+Valid, 618 SdHoareTripleChecker+Invalid, 902 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 902 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 22:44:48,182 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [370 Valid, 618 Invalid, 902 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 902 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 22:44:48,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2025-03-16 22:44:48,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 384. [2025-03-16 22:44:48,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 384 states, 383 states have (on average 1.422976501305483) internal successors, (545), 383 states have internal predecessors, (545), 0 states have call successors, (0), 0 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 22:44:48,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 545 transitions. [2025-03-16 22:44:48,187 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 545 transitions. Word has length 86 [2025-03-16 22:44:48,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:44:48,187 INFO L471 AbstractCegarLoop]: Abstraction has 384 states and 545 transitions. [2025-03-16 22:44:48,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 5 states have internal predecessors, (86), 0 states have call successors, (0), 0 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 22:44:48,188 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 545 transitions. [2025-03-16 22:44:48,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-16 22:44:48,188 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:44:48,188 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:44:48,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-16 22:44:48,188 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:44:48,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:44:48,189 INFO L85 PathProgramCache]: Analyzing trace with hash 983345821, now seen corresponding path program 1 times [2025-03-16 22:44:48,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:44:48,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442103793] [2025-03-16 22:44:48,189 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:44:48,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:44:48,214 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-16 22:44:48,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-16 22:44:48,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:44:48,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:44:48,660 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 22:44:48,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:44:48,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442103793] [2025-03-16 22:44:48,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442103793] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:44:48,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:44:48,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 22:44:48,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777608935] [2025-03-16 22:44:48,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:44:48,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 22:44:48,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:44:48,661 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 22:44:48,661 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-16 22:44:48,661 INFO L87 Difference]: Start difference. First operand 384 states and 545 transitions. Second operand has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 8 states have internal predecessors, (87), 0 states have call successors, (0), 0 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 22:44:49,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:44:49,317 INFO L93 Difference]: Finished difference Result 839 states and 1192 transitions. [2025-03-16 22:44:49,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 22:44:49,317 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 8 states have internal predecessors, (87), 0 states have call successors, (0), 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 87 [2025-03-16 22:44:49,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:44:49,318 INFO L225 Difference]: With dead ends: 839 [2025-03-16 22:44:49,318 INFO L226 Difference]: Without dead ends: 500 [2025-03-16 22:44:49,319 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2025-03-16 22:44:49,319 INFO L435 NwaCegarLoop]: 213 mSDtfsCounter, 545 mSDsluCounter, 987 mSDsCounter, 0 mSdLazyCounter, 1753 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 545 SdHoareTripleChecker+Valid, 1200 SdHoareTripleChecker+Invalid, 1755 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1753 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 22:44:49,319 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [545 Valid, 1200 Invalid, 1755 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1753 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 22:44:49,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2025-03-16 22:44:49,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 392. [2025-03-16 22:44:49,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 391 states have (on average 1.4168797953964194) internal successors, (554), 391 states have internal predecessors, (554), 0 states have call successors, (0), 0 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 22:44:49,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 554 transitions. [2025-03-16 22:44:49,324 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 554 transitions. Word has length 87 [2025-03-16 22:44:49,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:44:49,324 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 554 transitions. [2025-03-16 22:44:49,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 8 states have internal predecessors, (87), 0 states have call successors, (0), 0 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 22:44:49,324 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 554 transitions. [2025-03-16 22:44:49,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-16 22:44:49,324 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:44:49,324 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:44:49,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-16 22:44:49,325 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:44:49,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:44:49,325 INFO L85 PathProgramCache]: Analyzing trace with hash 1651411912, now seen corresponding path program 1 times [2025-03-16 22:44:49,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:44:49,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341866320] [2025-03-16 22:44:49,325 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:44:49,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:44:49,353 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-16 22:44:49,481 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-16 22:44:49,481 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:44:49,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:44:49,641 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 22:44:49,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:44:49,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341866320] [2025-03-16 22:44:49,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341866320] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:44:49,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:44:49,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 22:44:49,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178836897] [2025-03-16 22:44:49,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:44:49,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 22:44:49,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:44:49,642 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 22:44:49,642 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-16 22:44:49,642 INFO L87 Difference]: Start difference. First operand 392 states and 554 transitions. Second operand has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 7 states have internal predecessors, (87), 0 states have call successors, (0), 0 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 22:44:50,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:44:50,036 INFO L93 Difference]: Finished difference Result 746 states and 1055 transitions. [2025-03-16 22:44:50,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 22:44:50,037 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 7 states have internal predecessors, (87), 0 states have call successors, (0), 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 87 [2025-03-16 22:44:50,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:44:50,038 INFO L225 Difference]: With dead ends: 746 [2025-03-16 22:44:50,038 INFO L226 Difference]: Without dead ends: 399 [2025-03-16 22:44:50,038 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-16 22:44:50,038 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 381 mSDsluCounter, 609 mSDsCounter, 0 mSdLazyCounter, 1095 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 381 SdHoareTripleChecker+Valid, 764 SdHoareTripleChecker+Invalid, 1097 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1095 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 22:44:50,039 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [381 Valid, 764 Invalid, 1097 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1095 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 22:44:50,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2025-03-16 22:44:50,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 378. [2025-03-16 22:44:50,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 378 states, 377 states have (on average 1.4244031830238726) internal successors, (537), 377 states have internal predecessors, (537), 0 states have call successors, (0), 0 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 22:44:50,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 537 transitions. [2025-03-16 22:44:50,043 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 537 transitions. Word has length 87 [2025-03-16 22:44:50,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:44:50,043 INFO L471 AbstractCegarLoop]: Abstraction has 378 states and 537 transitions. [2025-03-16 22:44:50,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 7 states have internal predecessors, (87), 0 states have call successors, (0), 0 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 22:44:50,043 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 537 transitions. [2025-03-16 22:44:50,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-16 22:44:50,043 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:44:50,043 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:44:50,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-16 22:44:50,043 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:44:50,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:44:50,044 INFO L85 PathProgramCache]: Analyzing trace with hash 1547246823, now seen corresponding path program 1 times [2025-03-16 22:44:50,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:44:50,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518757619] [2025-03-16 22:44:50,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:44:50,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:44:50,069 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-16 22:44:50,218 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-16 22:44:50,218 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:44:50,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:44:50,370 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 22:44:50,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:44:50,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518757619] [2025-03-16 22:44:50,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518757619] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:44:50,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:44:50,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 22:44:50,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088049629] [2025-03-16 22:44:50,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:44:50,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 22:44:50,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:44:50,372 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 22:44:50,372 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 22:44:50,372 INFO L87 Difference]: Start difference. First operand 378 states and 537 transitions. Second operand has 6 states, 6 states have (on average 14.5) internal successors, (87), 5 states have internal predecessors, (87), 0 states have call successors, (0), 0 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 22:44:50,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:44:50,732 INFO L93 Difference]: Finished difference Result 735 states and 1042 transitions. [2025-03-16 22:44:50,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 22:44:50,732 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.5) internal successors, (87), 5 states have internal predecessors, (87), 0 states have call successors, (0), 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 87 [2025-03-16 22:44:50,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:44:50,734 INFO L225 Difference]: With dead ends: 735 [2025-03-16 22:44:50,734 INFO L226 Difference]: Without dead ends: 402 [2025-03-16 22:44:50,734 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-16 22:44:50,734 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 372 mSDsluCounter, 459 mSDsCounter, 0 mSdLazyCounter, 900 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 372 SdHoareTripleChecker+Valid, 616 SdHoareTripleChecker+Invalid, 900 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 900 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 22:44:50,735 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [372 Valid, 616 Invalid, 900 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 900 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 22:44:50,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2025-03-16 22:44:50,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 400. [2025-03-16 22:44:50,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 400 states, 399 states have (on average 1.413533834586466) internal successors, (564), 399 states have internal predecessors, (564), 0 states have call successors, (0), 0 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 22:44:50,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 564 transitions. [2025-03-16 22:44:50,739 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 564 transitions. Word has length 87 [2025-03-16 22:44:50,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:44:50,739 INFO L471 AbstractCegarLoop]: Abstraction has 400 states and 564 transitions. [2025-03-16 22:44:50,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.5) internal successors, (87), 5 states have internal predecessors, (87), 0 states have call successors, (0), 0 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 22:44:50,739 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 564 transitions. [2025-03-16 22:44:50,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-16 22:44:50,739 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:44:50,739 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:44:50,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-16 22:44:50,740 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:44:50,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:44:50,740 INFO L85 PathProgramCache]: Analyzing trace with hash 1602239808, now seen corresponding path program 1 times [2025-03-16 22:44:50,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:44:50,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805232017] [2025-03-16 22:44:50,740 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:44:50,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:44:50,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-16 22:44:50,867 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-16 22:44:50,867 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:44:50,867 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:44:51,125 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 22:44:51,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:44:51,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805232017] [2025-03-16 22:44:51,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805232017] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:44:51,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:44:51,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 22:44:51,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787518410] [2025-03-16 22:44:51,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:44:51,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 22:44:51,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:44:51,126 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 22:44:51,126 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-16 22:44:51,126 INFO L87 Difference]: Start difference. First operand 400 states and 564 transitions. Second operand has 8 states, 8 states have (on average 11.0) internal successors, (88), 7 states have internal predecessors, (88), 0 states have call successors, (0), 0 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 22:44:51,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:44:51,851 INFO L93 Difference]: Finished difference Result 883 states and 1246 transitions. [2025-03-16 22:44:51,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 22:44:51,851 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.0) internal successors, (88), 7 states have internal predecessors, (88), 0 states have call successors, (0), 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 88 [2025-03-16 22:44:51,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:44:51,852 INFO L225 Difference]: With dead ends: 883 [2025-03-16 22:44:51,852 INFO L226 Difference]: Without dead ends: 528 [2025-03-16 22:44:51,853 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2025-03-16 22:44:51,853 INFO L435 NwaCegarLoop]: 216 mSDtfsCounter, 533 mSDsluCounter, 785 mSDsCounter, 0 mSdLazyCounter, 1516 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 533 SdHoareTripleChecker+Valid, 1001 SdHoareTripleChecker+Invalid, 1516 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1516 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-16 22:44:51,853 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [533 Valid, 1001 Invalid, 1516 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1516 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-16 22:44:51,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2025-03-16 22:44:51,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 408. [2025-03-16 22:44:51,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 408 states, 407 states have (on average 1.4078624078624078) internal successors, (573), 407 states have internal predecessors, (573), 0 states have call successors, (0), 0 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 22:44:51,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 573 transitions. [2025-03-16 22:44:51,860 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 573 transitions. Word has length 88 [2025-03-16 22:44:51,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:44:51,860 INFO L471 AbstractCegarLoop]: Abstraction has 408 states and 573 transitions. [2025-03-16 22:44:51,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.0) internal successors, (88), 7 states have internal predecessors, (88), 0 states have call successors, (0), 0 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 22:44:51,860 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 573 transitions. [2025-03-16 22:44:51,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-16 22:44:51,861 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:44:51,861 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:44:51,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-16 22:44:51,861 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:44:51,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:44:51,861 INFO L85 PathProgramCache]: Analyzing trace with hash -360357288, now seen corresponding path program 1 times [2025-03-16 22:44:51,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:44:51,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132681943] [2025-03-16 22:44:51,861 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:44:51,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:44:51,885 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-16 22:44:51,974 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-16 22:44:51,974 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:44:51,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:44:52,199 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 22:44:52,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:44:52,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132681943] [2025-03-16 22:44:52,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132681943] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:44:52,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:44:52,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 22:44:52,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422242771] [2025-03-16 22:44:52,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:44:52,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 22:44:52,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:44:52,200 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 22:44:52,201 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-16 22:44:52,201 INFO L87 Difference]: Start difference. First operand 408 states and 573 transitions. Second operand has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 6 states have internal predecessors, (88), 0 states have call successors, (0), 0 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 22:44:52,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:44:52,635 INFO L93 Difference]: Finished difference Result 804 states and 1129 transitions. [2025-03-16 22:44:52,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 22:44:52,636 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 6 states have internal predecessors, (88), 0 states have call successors, (0), 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 88 [2025-03-16 22:44:52,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:44:52,637 INFO L225 Difference]: With dead ends: 804 [2025-03-16 22:44:52,637 INFO L226 Difference]: Without dead ends: 441 [2025-03-16 22:44:52,638 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-03-16 22:44:52,638 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 374 mSDsluCounter, 611 mSDsCounter, 0 mSdLazyCounter, 1132 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 374 SdHoareTripleChecker+Valid, 768 SdHoareTripleChecker+Invalid, 1134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 22:44:52,638 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [374 Valid, 768 Invalid, 1134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1132 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 22:44:52,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2025-03-16 22:44:52,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 421. [2025-03-16 22:44:52,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 420 states have (on average 1.4095238095238096) internal successors, (592), 420 states have internal predecessors, (592), 0 states have call successors, (0), 0 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 22:44:52,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 592 transitions. [2025-03-16 22:44:52,643 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 592 transitions. Word has length 88 [2025-03-16 22:44:52,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:44:52,643 INFO L471 AbstractCegarLoop]: Abstraction has 421 states and 592 transitions. [2025-03-16 22:44:52,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 6 states have internal predecessors, (88), 0 states have call successors, (0), 0 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 22:44:52,644 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 592 transitions. [2025-03-16 22:44:52,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-16 22:44:52,644 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:44:52,644 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:44:52,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-16 22:44:52,644 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:44:52,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:44:52,645 INFO L85 PathProgramCache]: Analyzing trace with hash -858640762, now seen corresponding path program 1 times [2025-03-16 22:44:52,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:44:52,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839284758] [2025-03-16 22:44:52,645 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:44:52,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:44:52,672 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-16 22:44:52,878 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-16 22:44:52,878 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:44:52,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:44:55,305 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 22:44:55,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:44:55,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839284758] [2025-03-16 22:44:55,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839284758] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:44:55,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:44:55,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-16 22:44:55,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025342836] [2025-03-16 22:44:55,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:44:55,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-16 22:44:55,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:44:55,307 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-16 22:44:55,307 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2025-03-16 22:44:55,307 INFO L87 Difference]: Start difference. First operand 421 states and 592 transitions. Second operand has 15 states, 15 states have (on average 5.866666666666666) internal successors, (88), 14 states have internal predecessors, (88), 0 states have call successors, (0), 0 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 22:44:56,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:44:56,736 INFO L93 Difference]: Finished difference Result 1047 states and 1463 transitions. [2025-03-16 22:44:56,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-16 22:44:56,737 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.866666666666666) internal successors, (88), 14 states have internal predecessors, (88), 0 states have call successors, (0), 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 88 [2025-03-16 22:44:56,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:44:56,739 INFO L225 Difference]: With dead ends: 1047 [2025-03-16 22:44:56,739 INFO L226 Difference]: Without dead ends: 671 [2025-03-16 22:44:56,739 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=103, Invalid=497, Unknown=0, NotChecked=0, Total=600 [2025-03-16 22:44:56,740 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 854 mSDsluCounter, 1286 mSDsCounter, 0 mSdLazyCounter, 2585 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 854 SdHoareTripleChecker+Valid, 1425 SdHoareTripleChecker+Invalid, 2588 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 2585 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-16 22:44:56,740 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [854 Valid, 1425 Invalid, 2588 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 2585 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-16 22:44:56,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 671 states. [2025-03-16 22:44:56,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 671 to 440. [2025-03-16 22:44:56,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 440 states, 439 states have (on average 1.4100227790432802) internal successors, (619), 439 states have internal predecessors, (619), 0 states have call successors, (0), 0 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 22:44:56,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 619 transitions. [2025-03-16 22:44:56,746 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 619 transitions. Word has length 88 [2025-03-16 22:44:56,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:44:56,746 INFO L471 AbstractCegarLoop]: Abstraction has 440 states and 619 transitions. [2025-03-16 22:44:56,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.866666666666666) internal successors, (88), 14 states have internal predecessors, (88), 0 states have call successors, (0), 0 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 22:44:56,746 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 619 transitions. [2025-03-16 22:44:56,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-16 22:44:56,747 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:44:56,747 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:44:56,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-16 22:44:56,747 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:44:56,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:44:56,748 INFO L85 PathProgramCache]: Analyzing trace with hash -968756571, now seen corresponding path program 1 times [2025-03-16 22:44:56,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:44:56,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608003968] [2025-03-16 22:44:56,748 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:44:56,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:44:56,775 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-16 22:44:56,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-16 22:44:56,931 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:44:56,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:44:57,229 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 22:44:57,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:44:57,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608003968] [2025-03-16 22:44:57,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608003968] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:44:57,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:44:57,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 22:44:57,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122302064] [2025-03-16 22:44:57,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:44:57,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 22:44:57,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:44:57,231 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 22:44:57,231 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-16 22:44:57,231 INFO L87 Difference]: Start difference. First operand 440 states and 619 transitions. Second operand has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 8 states have internal predecessors, (89), 0 states have call successors, (0), 0 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 22:44:57,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:44:57,964 INFO L93 Difference]: Finished difference Result 947 states and 1334 transitions. [2025-03-16 22:44:57,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 22:44:57,965 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 8 states have internal predecessors, (89), 0 states have call successors, (0), 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 89 [2025-03-16 22:44:57,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:44:57,966 INFO L225 Difference]: With dead ends: 947 [2025-03-16 22:44:57,966 INFO L226 Difference]: Without dead ends: 552 [2025-03-16 22:44:57,967 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2025-03-16 22:44:57,967 INFO L435 NwaCegarLoop]: 212 mSDtfsCounter, 544 mSDsluCounter, 1192 mSDsCounter, 0 mSdLazyCounter, 2039 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 544 SdHoareTripleChecker+Valid, 1404 SdHoareTripleChecker+Invalid, 2040 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2039 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-16 22:44:57,967 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [544 Valid, 1404 Invalid, 2040 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2039 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-16 22:44:57,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2025-03-16 22:44:57,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 448. [2025-03-16 22:44:57,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 448 states, 447 states have (on average 1.4049217002237135) internal successors, (628), 447 states have internal predecessors, (628), 0 states have call successors, (0), 0 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 22:44:57,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 628 transitions. [2025-03-16 22:44:57,978 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 628 transitions. Word has length 89 [2025-03-16 22:44:57,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:44:57,978 INFO L471 AbstractCegarLoop]: Abstraction has 448 states and 628 transitions. [2025-03-16 22:44:57,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 8 states have internal predecessors, (89), 0 states have call successors, (0), 0 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 22:44:57,978 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 628 transitions. [2025-03-16 22:44:57,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-16 22:44:57,979 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:44:57,979 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:44:57,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-16 22:44:57,979 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:44:57,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:44:57,979 INFO L85 PathProgramCache]: Analyzing trace with hash 1729551809, now seen corresponding path program 1 times [2025-03-16 22:44:57,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:44:57,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421708613] [2025-03-16 22:44:57,980 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:44:57,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:44:58,003 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-16 22:44:58,051 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-16 22:44:58,052 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:44:58,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:44:58,294 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 22:44:58,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:44:58,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421708613] [2025-03-16 22:44:58,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421708613] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:44:58,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:44:58,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 22:44:58,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353864322] [2025-03-16 22:44:58,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:44:58,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 22:44:58,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:44:58,295 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 22:44:58,295 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-16 22:44:58,295 INFO L87 Difference]: Start difference. First operand 448 states and 628 transitions. Second operand has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 6 states have internal predecessors, (89), 0 states have call successors, (0), 0 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 22:44:58,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:44:58,971 INFO L93 Difference]: Finished difference Result 971 states and 1363 transitions. [2025-03-16 22:44:58,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 22:44:58,971 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 6 states have internal predecessors, (89), 0 states have call successors, (0), 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 89 [2025-03-16 22:44:58,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:44:58,972 INFO L225 Difference]: With dead ends: 971 [2025-03-16 22:44:58,972 INFO L226 Difference]: Without dead ends: 568 [2025-03-16 22:44:58,973 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-03-16 22:44:58,973 INFO L435 NwaCegarLoop]: 216 mSDtfsCounter, 527 mSDsluCounter, 785 mSDsCounter, 0 mSdLazyCounter, 1483 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 527 SdHoareTripleChecker+Valid, 1001 SdHoareTripleChecker+Invalid, 1483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1483 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 22:44:58,973 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [527 Valid, 1001 Invalid, 1483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1483 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 22:44:58,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2025-03-16 22:44:58,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 456. [2025-03-16 22:44:58,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 456 states, 455 states have (on average 1.4) internal successors, (637), 455 states have internal predecessors, (637), 0 states have call successors, (0), 0 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 22:44:58,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 637 transitions. [2025-03-16 22:44:58,978 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 637 transitions. Word has length 89 [2025-03-16 22:44:58,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:44:58,978 INFO L471 AbstractCegarLoop]: Abstraction has 456 states and 637 transitions. [2025-03-16 22:44:58,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 6 states have internal predecessors, (89), 0 states have call successors, (0), 0 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 22:44:58,978 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 637 transitions. [2025-03-16 22:44:58,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-16 22:44:58,978 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:44:58,978 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:44:58,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-16 22:44:58,979 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:44:58,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:44:58,979 INFO L85 PathProgramCache]: Analyzing trace with hash 135173941, now seen corresponding path program 1 times [2025-03-16 22:44:58,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:44:58,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990293960] [2025-03-16 22:44:58,979 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:44:58,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:44:59,003 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-16 22:44:59,177 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-16 22:44:59,177 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:44:59,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:44:59,449 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 22:44:59,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:44:59,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990293960] [2025-03-16 22:44:59,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1990293960] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:44:59,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:44:59,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 22:44:59,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721161850] [2025-03-16 22:44:59,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:44:59,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 22:44:59,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:44:59,450 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 22:44:59,450 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-16 22:44:59,450 INFO L87 Difference]: Start difference. First operand 456 states and 637 transitions. Second operand has 8 states, 8 states have (on average 11.125) internal successors, (89), 7 states have internal predecessors, (89), 0 states have call successors, (0), 0 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 22:44:59,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:44:59,843 INFO L93 Difference]: Finished difference Result 853 states and 1190 transitions. [2025-03-16 22:44:59,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 22:44:59,844 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.125) internal successors, (89), 7 states have internal predecessors, (89), 0 states have call successors, (0), 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 89 [2025-03-16 22:44:59,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:44:59,845 INFO L225 Difference]: With dead ends: 853 [2025-03-16 22:44:59,845 INFO L226 Difference]: Without dead ends: 442 [2025-03-16 22:44:59,845 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-03-16 22:44:59,846 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 393 mSDsluCounter, 457 mSDsCounter, 0 mSdLazyCounter, 870 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 393 SdHoareTripleChecker+Valid, 612 SdHoareTripleChecker+Invalid, 871 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 870 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 22:44:59,846 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [393 Valid, 612 Invalid, 871 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 870 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 22:44:59,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2025-03-16 22:44:59,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 442. [2025-03-16 22:44:59,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 442 states, 441 states have (on average 1.3922902494331066) internal successors, (614), 441 states have internal predecessors, (614), 0 states have call successors, (0), 0 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 22:44:59,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 614 transitions. [2025-03-16 22:44:59,850 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 614 transitions. Word has length 89 [2025-03-16 22:44:59,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:44:59,850 INFO L471 AbstractCegarLoop]: Abstraction has 442 states and 614 transitions. [2025-03-16 22:44:59,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.125) internal successors, (89), 7 states have internal predecessors, (89), 0 states have call successors, (0), 0 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 22:44:59,850 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 614 transitions. [2025-03-16 22:44:59,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-16 22:44:59,850 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:44:59,850 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:44:59,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-16 22:44:59,850 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:44:59,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:44:59,851 INFO L85 PathProgramCache]: Analyzing trace with hash 63161438, now seen corresponding path program 1 times [2025-03-16 22:44:59,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:44:59,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960259158] [2025-03-16 22:44:59,851 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:44:59,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:44:59,875 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-16 22:44:59,995 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-16 22:44:59,995 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:44:59,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:45:00,181 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 22:45:00,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:45:00,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960259158] [2025-03-16 22:45:00,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960259158] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:45:00,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:45:00,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 22:45:00,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205520453] [2025-03-16 22:45:00,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:45:00,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 22:45:00,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:45:00,182 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 22:45:00,182 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-16 22:45:00,182 INFO L87 Difference]: Start difference. First operand 442 states and 614 transitions. Second operand has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 7 states have internal predecessors, (89), 0 states have call successors, (0), 0 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 22:45:00,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:45:00,497 INFO L93 Difference]: Finished difference Result 843 states and 1171 transitions. [2025-03-16 22:45:00,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 22:45:00,497 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 7 states have internal predecessors, (89), 0 states have call successors, (0), 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 89 [2025-03-16 22:45:00,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:45:00,498 INFO L225 Difference]: With dead ends: 843 [2025-03-16 22:45:00,498 INFO L226 Difference]: Without dead ends: 446 [2025-03-16 22:45:00,499 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-16 22:45:00,499 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 374 mSDsluCounter, 457 mSDsCounter, 0 mSdLazyCounter, 874 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 374 SdHoareTripleChecker+Valid, 612 SdHoareTripleChecker+Invalid, 876 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 874 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 22:45:00,499 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [374 Valid, 612 Invalid, 876 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 874 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 22:45:00,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2025-03-16 22:45:00,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 428. [2025-03-16 22:45:00,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 428 states, 427 states have (on average 1.3981264637002342) internal successors, (597), 427 states have internal predecessors, (597), 0 states have call successors, (0), 0 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 22:45:00,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 597 transitions. [2025-03-16 22:45:00,503 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 597 transitions. Word has length 89 [2025-03-16 22:45:00,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:45:00,504 INFO L471 AbstractCegarLoop]: Abstraction has 428 states and 597 transitions. [2025-03-16 22:45:00,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 7 states have internal predecessors, (89), 0 states have call successors, (0), 0 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 22:45:00,504 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 597 transitions. [2025-03-16 22:45:00,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-16 22:45:00,504 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:45:00,504 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:45:00,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-03-16 22:45:00,504 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:45:00,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:45:00,505 INFO L85 PathProgramCache]: Analyzing trace with hash 379352559, now seen corresponding path program 1 times [2025-03-16 22:45:00,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:45:00,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142886495] [2025-03-16 22:45:00,505 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:45:00,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:45:00,531 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-16 22:45:00,679 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-16 22:45:00,679 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:45:00,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:45:00,949 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 22:45:00,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:45:00,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142886495] [2025-03-16 22:45:00,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142886495] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:45:00,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:45:00,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 22:45:00,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680512083] [2025-03-16 22:45:00,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:45:00,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 22:45:00,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:45:00,950 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 22:45:00,950 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-16 22:45:00,950 INFO L87 Difference]: Start difference. First operand 428 states and 597 transitions. Second operand has 8 states, 8 states have (on average 11.25) internal successors, (90), 7 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:45:01,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:45:01,516 INFO L93 Difference]: Finished difference Result 828 states and 1152 transitions. [2025-03-16 22:45:01,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 22:45:01,516 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.25) internal successors, (90), 7 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 90 [2025-03-16 22:45:01,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:45:01,517 INFO L225 Difference]: With dead ends: 828 [2025-03-16 22:45:01,517 INFO L226 Difference]: Without dead ends: 445 [2025-03-16 22:45:01,518 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2025-03-16 22:45:01,518 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 387 mSDsluCounter, 761 mSDsCounter, 0 mSdLazyCounter, 1310 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 387 SdHoareTripleChecker+Valid, 916 SdHoareTripleChecker+Invalid, 1312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 22:45:01,518 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [387 Valid, 916 Invalid, 1312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1310 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 22:45:01,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2025-03-16 22:45:01,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 431. [2025-03-16 22:45:01,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 431 states, 430 states have (on average 1.3930232558139535) internal successors, (599), 430 states have internal predecessors, (599), 0 states have call successors, (0), 0 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 22:45:01,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 599 transitions. [2025-03-16 22:45:01,522 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 599 transitions. Word has length 90 [2025-03-16 22:45:01,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:45:01,523 INFO L471 AbstractCegarLoop]: Abstraction has 431 states and 599 transitions. [2025-03-16 22:45:01,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.25) internal successors, (90), 7 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:45:01,523 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 599 transitions. [2025-03-16 22:45:01,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-16 22:45:01,523 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:45:01,523 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:45:01,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-03-16 22:45:01,523 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:45:01,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:45:01,524 INFO L85 PathProgramCache]: Analyzing trace with hash 1254753133, now seen corresponding path program 1 times [2025-03-16 22:45:01,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:45:01,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955224131] [2025-03-16 22:45:01,524 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:45:01,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:45:01,548 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-16 22:45:01,683 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-16 22:45:01,683 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:45:01,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:45:01,980 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 22:45:01,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:45:01,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955224131] [2025-03-16 22:45:01,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955224131] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:45:01,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:45:01,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 22:45:01,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431477237] [2025-03-16 22:45:01,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:45:01,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 22:45:01,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:45:01,981 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 22:45:01,981 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-16 22:45:01,981 INFO L87 Difference]: Start difference. First operand 431 states and 599 transitions. Second operand has 9 states, 9 states have (on average 10.11111111111111) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 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 22:45:02,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:45:02,636 INFO L93 Difference]: Finished difference Result 925 states and 1288 transitions. [2025-03-16 22:45:02,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 22:45:02,637 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.11111111111111) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 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 91 [2025-03-16 22:45:02,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:45:02,638 INFO L225 Difference]: With dead ends: 925 [2025-03-16 22:45:02,638 INFO L226 Difference]: Without dead ends: 539 [2025-03-16 22:45:02,639 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2025-03-16 22:45:02,639 INFO L435 NwaCegarLoop]: 210 mSDtfsCounter, 547 mSDsluCounter, 982 mSDsCounter, 0 mSdLazyCounter, 1699 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 547 SdHoareTripleChecker+Valid, 1192 SdHoareTripleChecker+Invalid, 1701 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1699 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 22:45:02,639 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [547 Valid, 1192 Invalid, 1701 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1699 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 22:45:02,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2025-03-16 22:45:02,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 439. [2025-03-16 22:45:02,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 439 states, 438 states have (on average 1.3881278538812785) internal successors, (608), 438 states have internal predecessors, (608), 0 states have call successors, (0), 0 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 22:45:02,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 608 transitions. [2025-03-16 22:45:02,644 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 608 transitions. Word has length 91 [2025-03-16 22:45:02,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:45:02,644 INFO L471 AbstractCegarLoop]: Abstraction has 439 states and 608 transitions. [2025-03-16 22:45:02,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.11111111111111) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 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 22:45:02,644 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 608 transitions. [2025-03-16 22:45:02,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-16 22:45:02,644 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:45:02,644 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:45:02,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-03-16 22:45:02,645 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:45:02,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:45:02,645 INFO L85 PathProgramCache]: Analyzing trace with hash 20881342, now seen corresponding path program 1 times [2025-03-16 22:45:02,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:45:02,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939198409] [2025-03-16 22:45:02,645 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:45:02,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:45:02,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-16 22:45:02,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-16 22:45:02,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:45:02,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:45:03,059 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 22:45:03,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:45:03,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939198409] [2025-03-16 22:45:03,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939198409] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:45:03,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:45:03,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 22:45:03,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129802617] [2025-03-16 22:45:03,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:45:03,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 22:45:03,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:45:03,060 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 22:45:03,060 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-16 22:45:03,060 INFO L87 Difference]: Start difference. First operand 439 states and 608 transitions. Second operand has 8 states, 8 states have (on average 11.375) internal successors, (91), 7 states have internal predecessors, (91), 0 states have call successors, (0), 0 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 22:45:03,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:45:03,500 INFO L93 Difference]: Finished difference Result 847 states and 1170 transitions. [2025-03-16 22:45:03,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 22:45:03,500 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 7 states have internal predecessors, (91), 0 states have call successors, (0), 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 91 [2025-03-16 22:45:03,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:45:03,502 INFO L225 Difference]: With dead ends: 847 [2025-03-16 22:45:03,502 INFO L226 Difference]: Without dead ends: 453 [2025-03-16 22:45:03,502 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2025-03-16 22:45:03,502 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 376 mSDsluCounter, 609 mSDsCounter, 0 mSdLazyCounter, 1118 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 376 SdHoareTripleChecker+Valid, 764 SdHoareTripleChecker+Invalid, 1120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 22:45:03,502 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [376 Valid, 764 Invalid, 1120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1118 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 22:45:03,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2025-03-16 22:45:03,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 447. [2025-03-16 22:45:03,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 447 states, 446 states have (on average 1.3811659192825112) internal successors, (616), 446 states have internal predecessors, (616), 0 states have call successors, (0), 0 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 22:45:03,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 616 transitions. [2025-03-16 22:45:03,507 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 616 transitions. Word has length 91 [2025-03-16 22:45:03,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:45:03,507 INFO L471 AbstractCegarLoop]: Abstraction has 447 states and 616 transitions. [2025-03-16 22:45:03,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 7 states have internal predecessors, (91), 0 states have call successors, (0), 0 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 22:45:03,507 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 616 transitions. [2025-03-16 22:45:03,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-16 22:45:03,507 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:45:03,507 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:45:03,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-03-16 22:45:03,507 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:45:03,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:45:03,508 INFO L85 PathProgramCache]: Analyzing trace with hash -1920029759, now seen corresponding path program 1 times [2025-03-16 22:45:03,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:45:03,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561620752] [2025-03-16 22:45:03,508 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:45:03,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:45:03,531 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-16 22:45:03,680 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-16 22:45:03,680 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:45:03,680 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:45:03,976 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 22:45:03,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:45:03,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561620752] [2025-03-16 22:45:03,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561620752] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:45:03,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:45:03,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 22:45:03,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911403679] [2025-03-16 22:45:03,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:45:03,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 22:45:03,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:45:03,977 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 22:45:03,977 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-16 22:45:03,977 INFO L87 Difference]: Start difference. First operand 447 states and 616 transitions. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 7 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:45:04,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:45:04,418 INFO L93 Difference]: Finished difference Result 857 states and 1179 transitions. [2025-03-16 22:45:04,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 22:45:04,419 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 7 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 92 [2025-03-16 22:45:04,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:45:04,420 INFO L225 Difference]: With dead ends: 857 [2025-03-16 22:45:04,420 INFO L226 Difference]: Without dead ends: 455 [2025-03-16 22:45:04,420 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-03-16 22:45:04,420 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 373 mSDsluCounter, 457 mSDsCounter, 0 mSdLazyCounter, 870 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 373 SdHoareTripleChecker+Valid, 612 SdHoareTripleChecker+Invalid, 872 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 870 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 22:45:04,420 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [373 Valid, 612 Invalid, 872 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 870 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 22:45:04,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2025-03-16 22:45:04,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 455. [2025-03-16 22:45:04,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 455 states, 454 states have (on average 1.3766519823788546) internal successors, (625), 454 states have internal predecessors, (625), 0 states have call successors, (0), 0 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 22:45:04,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 625 transitions. [2025-03-16 22:45:04,424 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 625 transitions. Word has length 92 [2025-03-16 22:45:04,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:45:04,425 INFO L471 AbstractCegarLoop]: Abstraction has 455 states and 625 transitions. [2025-03-16 22:45:04,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 7 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:45:04,425 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 625 transitions. [2025-03-16 22:45:04,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-16 22:45:04,425 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:45:04,425 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:45:04,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-03-16 22:45:04,425 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:45:04,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:45:04,425 INFO L85 PathProgramCache]: Analyzing trace with hash 658712433, now seen corresponding path program 1 times [2025-03-16 22:45:04,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:45:04,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108857522] [2025-03-16 22:45:04,426 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:45:04,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:45:04,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-16 22:45:04,605 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-16 22:45:04,606 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:45:04,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:45:05,561 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 22:45:05,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:45:05,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108857522] [2025-03-16 22:45:05,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108857522] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:45:05,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:45:05,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-16 22:45:05,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26790252] [2025-03-16 22:45:05,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:45:05,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-16 22:45:05,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:45:05,562 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-16 22:45:05,562 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-03-16 22:45:05,562 INFO L87 Difference]: Start difference. First operand 455 states and 625 transitions. Second operand has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:45:08,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:45:08,378 INFO L93 Difference]: Finished difference Result 1059 states and 1462 transitions. [2025-03-16 22:45:08,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-16 22:45:08,379 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 93 [2025-03-16 22:45:08,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:45:08,381 INFO L225 Difference]: With dead ends: 1059 [2025-03-16 22:45:08,381 INFO L226 Difference]: Without dead ends: 649 [2025-03-16 22:45:08,381 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2025-03-16 22:45:08,381 INFO L435 NwaCegarLoop]: 322 mSDtfsCounter, 431 mSDsluCounter, 1328 mSDsCounter, 0 mSdLazyCounter, 1833 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 431 SdHoareTripleChecker+Valid, 1650 SdHoareTripleChecker+Invalid, 1835 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1833 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-16 22:45:08,382 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [431 Valid, 1650 Invalid, 1835 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1833 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-16 22:45:08,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2025-03-16 22:45:08,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 470. [2025-03-16 22:45:08,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 470 states, 469 states have (on average 1.373134328358209) internal successors, (644), 469 states have internal predecessors, (644), 0 states have call successors, (0), 0 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 22:45:08,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 644 transitions. [2025-03-16 22:45:08,386 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 644 transitions. Word has length 93 [2025-03-16 22:45:08,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:45:08,386 INFO L471 AbstractCegarLoop]: Abstraction has 470 states and 644 transitions. [2025-03-16 22:45:08,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:45:08,386 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 644 transitions. [2025-03-16 22:45:08,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-16 22:45:08,386 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:45:08,386 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:45:08,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-03-16 22:45:08,386 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:45:08,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:45:08,387 INFO L85 PathProgramCache]: Analyzing trace with hash -2107220229, now seen corresponding path program 1 times [2025-03-16 22:45:08,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:45:08,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402980908] [2025-03-16 22:45:08,387 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:45:08,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:45:08,410 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-16 22:45:08,554 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-16 22:45:08,554 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:45:08,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:45:10,202 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 22:45:10,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:45:10,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402980908] [2025-03-16 22:45:10,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402980908] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:45:10,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:45:10,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-16 22:45:10,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053832246] [2025-03-16 22:45:10,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:45:10,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-16 22:45:10,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:45:10,203 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-16 22:45:10,203 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-03-16 22:45:10,203 INFO L87 Difference]: Start difference. First operand 470 states and 644 transitions. Second operand has 11 states, 11 states have (on average 8.454545454545455) internal successors, (93), 10 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:45:11,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:45:11,008 INFO L93 Difference]: Finished difference Result 916 states and 1255 transitions. [2025-03-16 22:45:11,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-16 22:45:11,008 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.454545454545455) internal successors, (93), 10 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 93 [2025-03-16 22:45:11,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:45:11,010 INFO L225 Difference]: With dead ends: 916 [2025-03-16 22:45:11,010 INFO L226 Difference]: Without dead ends: 491 [2025-03-16 22:45:11,010 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=237, Unknown=0, NotChecked=0, Total=306 [2025-03-16 22:45:11,010 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 493 mSDsluCounter, 835 mSDsCounter, 0 mSdLazyCounter, 1713 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 493 SdHoareTripleChecker+Valid, 975 SdHoareTripleChecker+Invalid, 1715 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1713 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-16 22:45:11,011 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [493 Valid, 975 Invalid, 1715 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1713 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-16 22:45:11,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2025-03-16 22:45:11,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 470. [2025-03-16 22:45:11,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 470 states, 469 states have (on average 1.3646055437100213) internal successors, (640), 469 states have internal predecessors, (640), 0 states have call successors, (0), 0 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 22:45:11,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 640 transitions. [2025-03-16 22:45:11,015 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 640 transitions. Word has length 93 [2025-03-16 22:45:11,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:45:11,015 INFO L471 AbstractCegarLoop]: Abstraction has 470 states and 640 transitions. [2025-03-16 22:45:11,015 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.454545454545455) internal successors, (93), 10 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:45:11,015 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 640 transitions. [2025-03-16 22:45:11,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-16 22:45:11,016 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:45:11,016 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:45:11,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-03-16 22:45:11,016 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:45:11,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:45:11,017 INFO L85 PathProgramCache]: Analyzing trace with hash 1976401095, now seen corresponding path program 1 times [2025-03-16 22:45:11,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:45:11,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119547802] [2025-03-16 22:45:11,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:45:11,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:45:11,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-16 22:45:11,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-16 22:45:11,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:45:11,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:45:13,581 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 22:45:13,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:45:13,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119547802] [2025-03-16 22:45:13,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119547802] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:45:13,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:45:13,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-16 22:45:13,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535463422] [2025-03-16 22:45:13,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:45:13,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-16 22:45:13,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:45:13,582 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-16 22:45:13,582 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2025-03-16 22:45:13,582 INFO L87 Difference]: Start difference. First operand 470 states and 640 transitions. Second operand has 14 states, 14 states have (on average 6.642857142857143) internal successors, (93), 13 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:45:15,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:45:15,173 INFO L93 Difference]: Finished difference Result 1117 states and 1510 transitions. [2025-03-16 22:45:15,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-16 22:45:15,173 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.642857142857143) internal successors, (93), 13 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 93 [2025-03-16 22:45:15,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:45:15,175 INFO L225 Difference]: With dead ends: 1117 [2025-03-16 22:45:15,175 INFO L226 Difference]: Without dead ends: 692 [2025-03-16 22:45:15,175 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=98, Invalid=454, Unknown=0, NotChecked=0, Total=552 [2025-03-16 22:45:15,176 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 780 mSDsluCounter, 1221 mSDsCounter, 0 mSdLazyCounter, 2452 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 780 SdHoareTripleChecker+Valid, 1358 SdHoareTripleChecker+Invalid, 2456 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 2452 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-16 22:45:15,176 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [780 Valid, 1358 Invalid, 2456 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 2452 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-16 22:45:15,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 692 states. [2025-03-16 22:45:15,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 692 to 470. [2025-03-16 22:45:15,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 470 states, 469 states have (on average 1.373134328358209) internal successors, (644), 469 states have internal predecessors, (644), 0 states have call successors, (0), 0 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 22:45:15,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 644 transitions. [2025-03-16 22:45:15,180 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 644 transitions. Word has length 93 [2025-03-16 22:45:15,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:45:15,181 INFO L471 AbstractCegarLoop]: Abstraction has 470 states and 644 transitions. [2025-03-16 22:45:15,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.642857142857143) internal successors, (93), 13 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:45:15,181 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 644 transitions. [2025-03-16 22:45:15,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-16 22:45:15,181 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:45:15,181 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:45:15,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2025-03-16 22:45:15,182 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:45:15,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:45:15,182 INFO L85 PathProgramCache]: Analyzing trace with hash -1586455907, now seen corresponding path program 1 times [2025-03-16 22:45:15,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:45:15,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637391936] [2025-03-16 22:45:15,182 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:45:15,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:45:15,206 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-16 22:45:15,378 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-16 22:45:15,378 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:45:15,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:45:17,636 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 22:45:17,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:45:17,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637391936] [2025-03-16 22:45:17,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637391936] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:45:17,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:45:17,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2025-03-16 22:45:17,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930753612] [2025-03-16 22:45:17,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:45:17,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-16 22:45:17,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:45:17,637 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-16 22:45:17,637 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=331, Unknown=0, NotChecked=0, Total=380 [2025-03-16 22:45:17,637 INFO L87 Difference]: Start difference. First operand 470 states and 644 transitions. Second operand has 20 states, 20 states have (on average 4.7) internal successors, (94), 19 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:45:19,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:45:19,560 INFO L93 Difference]: Finished difference Result 1152 states and 1580 transitions. [2025-03-16 22:45:19,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-16 22:45:19,561 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 4.7) internal successors, (94), 19 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2025-03-16 22:45:19,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:45:19,563 INFO L225 Difference]: With dead ends: 1152 [2025-03-16 22:45:19,563 INFO L226 Difference]: Without dead ends: 727 [2025-03-16 22:45:19,564 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 215 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=193, Invalid=1067, Unknown=0, NotChecked=0, Total=1260 [2025-03-16 22:45:19,564 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 1392 mSDsluCounter, 1983 mSDsCounter, 0 mSdLazyCounter, 3956 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1392 SdHoareTripleChecker+Valid, 2117 SdHoareTripleChecker+Invalid, 3957 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3956 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-16 22:45:19,564 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1392 Valid, 2117 Invalid, 3957 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3956 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-16 22:45:19,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 727 states. [2025-03-16 22:45:19,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 727 to 507. [2025-03-16 22:45:19,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 507 states, 506 states have (on average 1.3577075098814229) internal successors, (687), 506 states have internal predecessors, (687), 0 states have call successors, (0), 0 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 22:45:19,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 687 transitions. [2025-03-16 22:45:19,569 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 687 transitions. Word has length 94 [2025-03-16 22:45:19,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:45:19,569 INFO L471 AbstractCegarLoop]: Abstraction has 507 states and 687 transitions. [2025-03-16 22:45:19,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 4.7) internal successors, (94), 19 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:45:19,569 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 687 transitions. [2025-03-16 22:45:19,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-16 22:45:19,569 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:45:19,569 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:45:19,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2025-03-16 22:45:19,570 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:45:19,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:45:19,570 INFO L85 PathProgramCache]: Analyzing trace with hash -699010401, now seen corresponding path program 1 times [2025-03-16 22:45:19,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:45:19,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82212456] [2025-03-16 22:45:19,570 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:45:19,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:45:19,596 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-16 22:45:19,753 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-16 22:45:19,753 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:45:19,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:45:19,999 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 22:45:19,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:45:19,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82212456] [2025-03-16 22:45:19,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82212456] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:45:19,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:45:19,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 22:45:19,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350450125] [2025-03-16 22:45:20,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:45:20,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 22:45:20,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:45:20,000 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 22:45:20,000 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 22:45:20,000 INFO L87 Difference]: Start difference. First operand 507 states and 687 transitions. Second operand has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 5 states have internal predecessors, (95), 0 states have call successors, (0), 0 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 22:45:20,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:45:20,402 INFO L93 Difference]: Finished difference Result 990 states and 1342 transitions. [2025-03-16 22:45:20,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 22:45:20,402 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 5 states have internal predecessors, (95), 0 states have call successors, (0), 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 95 [2025-03-16 22:45:20,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:45:20,404 INFO L225 Difference]: With dead ends: 990 [2025-03-16 22:45:20,404 INFO L226 Difference]: Without dead ends: 528 [2025-03-16 22:45:20,404 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-03-16 22:45:20,404 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 345 mSDsluCounter, 462 mSDsCounter, 0 mSdLazyCounter, 946 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 345 SdHoareTripleChecker+Valid, 622 SdHoareTripleChecker+Invalid, 946 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 946 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 22:45:20,405 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [345 Valid, 622 Invalid, 946 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 946 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 22:45:20,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2025-03-16 22:45:20,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 509. [2025-03-16 22:45:20,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 509 states, 508 states have (on average 1.3562992125984252) internal successors, (689), 508 states have internal predecessors, (689), 0 states have call successors, (0), 0 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 22:45:20,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 689 transitions. [2025-03-16 22:45:20,409 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 689 transitions. Word has length 95 [2025-03-16 22:45:20,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:45:20,409 INFO L471 AbstractCegarLoop]: Abstraction has 509 states and 689 transitions. [2025-03-16 22:45:20,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 5 states have internal predecessors, (95), 0 states have call successors, (0), 0 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 22:45:20,409 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 689 transitions. [2025-03-16 22:45:20,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-16 22:45:20,410 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:45:20,410 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:45:20,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2025-03-16 22:45:20,410 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:45:20,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:45:20,410 INFO L85 PathProgramCache]: Analyzing trace with hash -1761608423, now seen corresponding path program 1 times [2025-03-16 22:45:20,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:45:20,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446290014] [2025-03-16 22:45:20,410 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:45:20,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:45:20,434 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-16 22:45:20,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-16 22:45:20,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:45:20,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:45:21,245 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 22:45:21,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:45:21,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446290014] [2025-03-16 22:45:21,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446290014] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:45:21,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:45:21,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 22:45:21,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343073297] [2025-03-16 22:45:21,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:45:21,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 22:45:21,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:45:21,246 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 22:45:21,246 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-16 22:45:21,246 INFO L87 Difference]: Start difference. First operand 509 states and 689 transitions. Second operand has 8 states, 8 states have (on average 11.875) internal successors, (95), 7 states have internal predecessors, (95), 0 states have call successors, (0), 0 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 22:45:21,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:45:21,684 INFO L93 Difference]: Finished difference Result 1234 states and 1677 transitions. [2025-03-16 22:45:21,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 22:45:21,685 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.875) internal successors, (95), 7 states have internal predecessors, (95), 0 states have call successors, (0), 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 95 [2025-03-16 22:45:21,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:45:21,687 INFO L225 Difference]: With dead ends: 1234 [2025-03-16 22:45:21,687 INFO L226 Difference]: Without dead ends: 770 [2025-03-16 22:45:21,687 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-03-16 22:45:21,687 INFO L435 NwaCegarLoop]: 198 mSDtfsCounter, 617 mSDsluCounter, 885 mSDsCounter, 0 mSdLazyCounter, 1129 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 617 SdHoareTripleChecker+Valid, 1083 SdHoareTripleChecker+Invalid, 1134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 22:45:21,687 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [617 Valid, 1083 Invalid, 1134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1129 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 22:45:21,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 770 states. [2025-03-16 22:45:21,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 770 to 585. [2025-03-16 22:45:21,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 585 states, 584 states have (on average 1.3476027397260273) internal successors, (787), 584 states have internal predecessors, (787), 0 states have call successors, (0), 0 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 22:45:21,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 787 transitions. [2025-03-16 22:45:21,693 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 787 transitions. Word has length 95 [2025-03-16 22:45:21,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:45:21,693 INFO L471 AbstractCegarLoop]: Abstraction has 585 states and 787 transitions. [2025-03-16 22:45:21,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.875) internal successors, (95), 7 states have internal predecessors, (95), 0 states have call successors, (0), 0 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 22:45:21,693 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 787 transitions. [2025-03-16 22:45:21,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-16 22:45:21,693 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:45:21,693 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:45:21,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2025-03-16 22:45:21,693 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:45:21,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:45:21,694 INFO L85 PathProgramCache]: Analyzing trace with hash 1113847468, now seen corresponding path program 1 times [2025-03-16 22:45:21,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:45:21,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686111039] [2025-03-16 22:45:21,694 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:45:21,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:45:21,722 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-16 22:45:21,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-16 22:45:21,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:45:21,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:45:24,129 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 22:45:24,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:45:24,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686111039] [2025-03-16 22:45:24,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686111039] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:45:24,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:45:24,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-16 22:45:24,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906906781] [2025-03-16 22:45:24,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:45:24,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-16 22:45:24,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:45:24,130 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-16 22:45:24,130 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2025-03-16 22:45:24,130 INFO L87 Difference]: Start difference. First operand 585 states and 787 transitions. Second operand has 15 states, 15 states have (on average 6.4) internal successors, (96), 14 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:45:25,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:45:25,790 INFO L93 Difference]: Finished difference Result 1271 states and 1708 transitions. [2025-03-16 22:45:25,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-16 22:45:25,791 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 6.4) internal successors, (96), 14 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 96 [2025-03-16 22:45:25,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:45:25,793 INFO L225 Difference]: With dead ends: 1271 [2025-03-16 22:45:25,793 INFO L226 Difference]: Without dead ends: 807 [2025-03-16 22:45:25,793 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=110, Invalid=540, Unknown=0, NotChecked=0, Total=650 [2025-03-16 22:45:25,794 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 822 mSDsluCounter, 1364 mSDsCounter, 0 mSdLazyCounter, 2703 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 822 SdHoareTripleChecker+Valid, 1502 SdHoareTripleChecker+Invalid, 2704 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2703 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-16 22:45:25,794 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [822 Valid, 1502 Invalid, 2704 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2703 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-16 22:45:25,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 807 states. [2025-03-16 22:45:25,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 807 to 598. [2025-03-16 22:45:25,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 598 states, 597 states have (on average 1.3484087102177555) internal successors, (805), 597 states have internal predecessors, (805), 0 states have call successors, (0), 0 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 22:45:25,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 805 transitions. [2025-03-16 22:45:25,799 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 805 transitions. Word has length 96 [2025-03-16 22:45:25,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:45:25,800 INFO L471 AbstractCegarLoop]: Abstraction has 598 states and 805 transitions. [2025-03-16 22:45:25,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 6.4) internal successors, (96), 14 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:45:25,800 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 805 transitions. [2025-03-16 22:45:25,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-16 22:45:25,800 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:45:25,800 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:45:25,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2025-03-16 22:45:25,801 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:45:25,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:45:25,801 INFO L85 PathProgramCache]: Analyzing trace with hash -1198449018, now seen corresponding path program 1 times [2025-03-16 22:45:25,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:45:25,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129339795] [2025-03-16 22:45:25,801 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:45:25,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:45:25,826 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-16 22:45:26,049 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-16 22:45:26,049 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:45:26,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:45:27,663 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 22:45:27,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:45:27,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129339795] [2025-03-16 22:45:27,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129339795] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:45:27,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:45:27,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-16 22:45:27,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856500092] [2025-03-16 22:45:27,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:45:27,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-16 22:45:27,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:45:27,664 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-16 22:45:27,665 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-03-16 22:45:27,665 INFO L87 Difference]: Start difference. First operand 598 states and 805 transitions. Second operand has 11 states, 11 states have (on average 8.727272727272727) internal successors, (96), 10 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:45:28,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:45:28,468 INFO L93 Difference]: Finished difference Result 1266 states and 1727 transitions. [2025-03-16 22:45:28,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-16 22:45:28,468 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.727272727272727) internal successors, (96), 10 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 96 [2025-03-16 22:45:28,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:45:28,470 INFO L225 Difference]: With dead ends: 1266 [2025-03-16 22:45:28,470 INFO L226 Difference]: Without dead ends: 789 [2025-03-16 22:45:28,471 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2025-03-16 22:45:28,471 INFO L435 NwaCegarLoop]: 197 mSDtfsCounter, 328 mSDsluCounter, 907 mSDsCounter, 0 mSdLazyCounter, 1749 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 328 SdHoareTripleChecker+Valid, 1104 SdHoareTripleChecker+Invalid, 1749 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1749 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-16 22:45:28,471 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [328 Valid, 1104 Invalid, 1749 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1749 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-16 22:45:28,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 789 states. [2025-03-16 22:45:28,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 789 to 633. [2025-03-16 22:45:28,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 633 states, 632 states have (on average 1.3528481012658229) internal successors, (855), 632 states have internal predecessors, (855), 0 states have call successors, (0), 0 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 22:45:28,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 633 states and 855 transitions. [2025-03-16 22:45:28,477 INFO L78 Accepts]: Start accepts. Automaton has 633 states and 855 transitions. Word has length 96 [2025-03-16 22:45:28,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:45:28,477 INFO L471 AbstractCegarLoop]: Abstraction has 633 states and 855 transitions. [2025-03-16 22:45:28,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.727272727272727) internal successors, (96), 10 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:45:28,477 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 855 transitions. [2025-03-16 22:45:28,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-16 22:45:28,478 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:45:28,478 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:45:28,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2025-03-16 22:45:28,478 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:45:28,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:45:28,478 INFO L85 PathProgramCache]: Analyzing trace with hash 296004136, now seen corresponding path program 1 times [2025-03-16 22:45:28,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:45:28,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534627053] [2025-03-16 22:45:28,478 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:45:28,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:45:28,504 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-16 22:45:28,589 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-16 22:45:28,589 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:45:28,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:45:28,751 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 22:45:28,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:45:28,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534627053] [2025-03-16 22:45:28,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534627053] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:45:28,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:45:28,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 22:45:28,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295352089] [2025-03-16 22:45:28,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:45:28,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 22:45:28,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:45:28,752 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 22:45:28,752 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-16 22:45:28,752 INFO L87 Difference]: Start difference. First operand 633 states and 855 transitions. Second operand has 7 states, 7 states have (on average 13.857142857142858) internal successors, (97), 7 states have internal predecessors, (97), 0 states have call successors, (0), 0 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 22:45:29,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:45:29,099 INFO L93 Difference]: Finished difference Result 1148 states and 1556 transitions. [2025-03-16 22:45:29,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 22:45:29,100 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.857142857142858) internal successors, (97), 7 states have internal predecessors, (97), 0 states have call successors, (0), 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 97 [2025-03-16 22:45:29,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:45:29,101 INFO L225 Difference]: With dead ends: 1148 [2025-03-16 22:45:29,101 INFO L226 Difference]: Without dead ends: 654 [2025-03-16 22:45:29,102 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-16 22:45:29,102 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 365 mSDsluCounter, 462 mSDsCounter, 0 mSdLazyCounter, 953 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 365 SdHoareTripleChecker+Valid, 623 SdHoareTripleChecker+Invalid, 955 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 953 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 22:45:29,102 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [365 Valid, 623 Invalid, 955 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 953 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 22:45:29,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 654 states. [2025-03-16 22:45:29,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 654 to 631. [2025-03-16 22:45:29,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 631 states, 630 states have (on average 1.3523809523809525) internal successors, (852), 630 states have internal predecessors, (852), 0 states have call successors, (0), 0 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 22:45:29,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 631 states to 631 states and 852 transitions. [2025-03-16 22:45:29,108 INFO L78 Accepts]: Start accepts. Automaton has 631 states and 852 transitions. Word has length 97 [2025-03-16 22:45:29,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:45:29,108 INFO L471 AbstractCegarLoop]: Abstraction has 631 states and 852 transitions. [2025-03-16 22:45:29,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.857142857142858) internal successors, (97), 7 states have internal predecessors, (97), 0 states have call successors, (0), 0 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 22:45:29,108 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states and 852 transitions. [2025-03-16 22:45:29,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-16 22:45:29,108 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:45:29,109 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:45:29,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2025-03-16 22:45:29,109 INFO L396 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:45:29,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:45:29,109 INFO L85 PathProgramCache]: Analyzing trace with hash 1761346014, now seen corresponding path program 1 times [2025-03-16 22:45:29,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:45:29,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488607914] [2025-03-16 22:45:29,109 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:45:29,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:45:29,137 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-16 22:45:29,297 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-16 22:45:29,298 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:45:29,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:45:29,438 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 22:45:29,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:45:29,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488607914] [2025-03-16 22:45:29,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488607914] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:45:29,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:45:29,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 22:45:29,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634568179] [2025-03-16 22:45:29,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:45:29,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 22:45:29,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:45:29,439 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 22:45:29,439 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 22:45:29,439 INFO L87 Difference]: Start difference. First operand 631 states and 852 transitions. Second operand has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 5 states have internal predecessors, (97), 0 states have call successors, (0), 0 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 22:45:29,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:45:29,797 INFO L93 Difference]: Finished difference Result 1157 states and 1567 transitions. [2025-03-16 22:45:29,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 22:45:29,797 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 5 states have internal predecessors, (97), 0 states have call successors, (0), 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 97 [2025-03-16 22:45:29,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:45:29,799 INFO L225 Difference]: With dead ends: 1157 [2025-03-16 22:45:29,799 INFO L226 Difference]: Without dead ends: 667 [2025-03-16 22:45:29,799 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-03-16 22:45:29,800 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 332 mSDsluCounter, 462 mSDsCounter, 0 mSdLazyCounter, 954 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 332 SdHoareTripleChecker+Valid, 623 SdHoareTripleChecker+Invalid, 954 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 954 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 22:45:29,800 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [332 Valid, 623 Invalid, 954 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 954 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 22:45:29,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 667 states. [2025-03-16 22:45:29,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 667 to 643. [2025-03-16 22:45:29,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 643 states, 642 states have (on average 1.3489096573208723) internal successors, (866), 642 states have internal predecessors, (866), 0 states have call successors, (0), 0 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 22:45:29,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 866 transitions. [2025-03-16 22:45:29,805 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 866 transitions. Word has length 97 [2025-03-16 22:45:29,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:45:29,805 INFO L471 AbstractCegarLoop]: Abstraction has 643 states and 866 transitions. [2025-03-16 22:45:29,805 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 5 states have internal predecessors, (97), 0 states have call successors, (0), 0 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 22:45:29,805 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 866 transitions. [2025-03-16 22:45:29,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-16 22:45:29,805 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:45:29,806 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:45:29,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2025-03-16 22:45:29,806 INFO L396 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:45:29,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:45:29,806 INFO L85 PathProgramCache]: Analyzing trace with hash -1809413565, now seen corresponding path program 1 times [2025-03-16 22:45:29,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:45:29,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023909623] [2025-03-16 22:45:29,806 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:45:29,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:45:29,832 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-16 22:45:30,003 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-16 22:45:30,003 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:45:30,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:45:30,176 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 22:45:30,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:45:30,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023909623] [2025-03-16 22:45:30,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023909623] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:45:30,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:45:30,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 22:45:30,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460575397] [2025-03-16 22:45:30,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:45:30,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 22:45:30,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:45:30,177 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 22:45:30,177 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 22:45:30,177 INFO L87 Difference]: Start difference. First operand 643 states and 866 transitions. Second operand has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 5 states have internal predecessors, (97), 0 states have call successors, (0), 0 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 22:45:30,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:45:30,534 INFO L93 Difference]: Finished difference Result 1149 states and 1551 transitions. [2025-03-16 22:45:30,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 22:45:30,534 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 5 states have internal predecessors, (97), 0 states have call successors, (0), 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 97 [2025-03-16 22:45:30,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:45:30,536 INFO L225 Difference]: With dead ends: 1149 [2025-03-16 22:45:30,536 INFO L226 Difference]: Without dead ends: 658 [2025-03-16 22:45:30,536 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-03-16 22:45:30,536 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 353 mSDsluCounter, 457 mSDsCounter, 0 mSdLazyCounter, 879 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 353 SdHoareTripleChecker+Valid, 612 SdHoareTripleChecker+Invalid, 880 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 879 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 22:45:30,537 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [353 Valid, 612 Invalid, 880 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 879 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 22:45:30,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 658 states. [2025-03-16 22:45:30,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 658 to 657. [2025-03-16 22:45:30,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 657 states, 656 states have (on average 1.3475609756097562) internal successors, (884), 656 states have internal predecessors, (884), 0 states have call successors, (0), 0 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 22:45:30,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 884 transitions. [2025-03-16 22:45:30,542 INFO L78 Accepts]: Start accepts. Automaton has 657 states and 884 transitions. Word has length 97 [2025-03-16 22:45:30,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:45:30,542 INFO L471 AbstractCegarLoop]: Abstraction has 657 states and 884 transitions. [2025-03-16 22:45:30,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 5 states have internal predecessors, (97), 0 states have call successors, (0), 0 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 22:45:30,542 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 884 transitions. [2025-03-16 22:45:30,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-16 22:45:30,543 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:45:30,543 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:45:30,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2025-03-16 22:45:30,543 INFO L396 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:45:30,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:45:30,543 INFO L85 PathProgramCache]: Analyzing trace with hash 1302695309, now seen corresponding path program 1 times [2025-03-16 22:45:30,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:45:30,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541379229] [2025-03-16 22:45:30,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:45:30,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:45:30,572 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-16 22:45:30,762 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-16 22:45:30,762 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:45:30,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-16 22:45:30,762 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-16 22:45:30,772 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-16 22:45:31,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-16 22:45:31,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:45:31,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-16 22:45:31,106 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-16 22:45:31,106 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-16 22:45:31,107 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-16 22:45:31,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2025-03-16 22:45:31,110 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:45:31,163 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-03-16 22:45:31,182 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-16 22:45:31,184 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.03 10:45:31 BoogieIcfgContainer [2025-03-16 22:45:31,184 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-16 22:45:31,185 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-16 22:45:31,185 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-16 22:45:31,185 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-16 22:45:31,186 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 10:44:16" (3/4) ... [2025-03-16 22:45:31,187 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-16 22:45:31,188 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-16 22:45:31,188 INFO L158 Benchmark]: Toolchain (without parser) took 76456.77ms. Allocated memory was 142.6MB in the beginning and 1.3GB in the end (delta: 1.2GB). Free memory was 104.3MB in the beginning and 1.0GB in the end (delta: -933.2MB). Peak memory consumption was 225.3MB. Max. memory is 16.1GB. [2025-03-16 22:45:31,188 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 127.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 22:45:31,188 INFO L158 Benchmark]: CACSL2BoogieTranslator took 300.83ms. Allocated memory is still 142.6MB. Free memory was 104.3MB in the beginning and 77.4MB in the end (delta: 27.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-16 22:45:31,188 INFO L158 Benchmark]: Boogie Procedure Inliner took 96.97ms. Allocated memory is still 142.6MB. Free memory was 77.4MB in the beginning and 55.8MB in the end (delta: 21.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-16 22:45:31,189 INFO L158 Benchmark]: Boogie Preprocessor took 140.59ms. Allocated memory is still 142.6MB. Free memory was 55.8MB in the beginning and 43.7MB in the end (delta: 12.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-16 22:45:31,189 INFO L158 Benchmark]: IcfgBuilder took 1169.14ms. Allocated memory is still 142.6MB. Free memory was 43.7MB in the beginning and 63.5MB in the end (delta: -19.8MB). Peak memory consumption was 44.3MB. Max. memory is 16.1GB. [2025-03-16 22:45:31,189 INFO L158 Benchmark]: TraceAbstraction took 74740.40ms. Allocated memory was 142.6MB in the beginning and 1.3GB in the end (delta: 1.2GB). Free memory was 62.7MB in the beginning and 1.0GB in the end (delta: -975.0MB). Peak memory consumption was 755.9MB. Max. memory is 16.1GB. [2025-03-16 22:45:31,189 INFO L158 Benchmark]: Witness Printer took 2.96ms. Allocated memory is still 1.3GB. Free memory was 1.0GB in the beginning and 1.0GB in the end (delta: 273.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 22:45:31,189 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 127.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 300.83ms. Allocated memory is still 142.6MB. Free memory was 104.3MB in the beginning and 77.4MB in the end (delta: 27.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 96.97ms. Allocated memory is still 142.6MB. Free memory was 77.4MB in the beginning and 55.8MB in the end (delta: 21.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 140.59ms. Allocated memory is still 142.6MB. Free memory was 55.8MB in the beginning and 43.7MB in the end (delta: 12.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 1169.14ms. Allocated memory is still 142.6MB. Free memory was 43.7MB in the beginning and 63.5MB in the end (delta: -19.8MB). Peak memory consumption was 44.3MB. Max. memory is 16.1GB. * TraceAbstraction took 74740.40ms. Allocated memory was 142.6MB in the beginning and 1.3GB in the end (delta: 1.2GB). Free memory was 62.7MB in the beginning and 1.0GB in the end (delta: -975.0MB). Peak memory consumption was 755.9MB. Max. memory is 16.1GB. * Witness Printer took 2.96ms. Allocated memory is still 1.3GB. Free memory was 1.0GB in the beginning and 1.0GB in the end (delta: 273.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 21]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of bitwiseAnd at line 181, overapproximation of bitwiseAnd at line 343, overapproximation of bitwiseAnd at line 195, overapproximation of bitwiseAnd at line 201, overapproximation of bitwiseAnd at line 189, overapproximation of bitwiseAnd at line 219, overapproximation of bitwiseAnd at line 213, overapproximation of bitwiseAnd at line 225, overapproximation of bitwiseAnd at line 207, overapproximation of bitwiseAnd at line 354. Possible FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 1); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (1 - 1); [L29] const SORT_3 mask_SORT_3 = (SORT_3)-1 >> (sizeof(SORT_3) * 8 - 12); [L30] const SORT_3 msb_SORT_3 = (SORT_3)1 << (12 - 1); [L32] const SORT_5 mask_SORT_5 = (SORT_5)-1 >> (sizeof(SORT_5) * 8 - 3); [L33] const SORT_5 msb_SORT_5 = (SORT_5)1 << (3 - 1); [L35] const SORT_9 mask_SORT_9 = (SORT_9)-1 >> (sizeof(SORT_9) * 8 - 32); [L36] const SORT_9 msb_SORT_9 = (SORT_9)1 << (32 - 1); [L38] const SORT_46 mask_SORT_46 = (SORT_46)-1 >> (sizeof(SORT_46) * 8 - 5); [L39] const SORT_46 msb_SORT_46 = (SORT_46)1 << (5 - 1); [L41] const SORT_3 var_4 = 576; [L42] const SORT_5 var_6 = 0; [L43] const SORT_9 var_11 = 6; [L44] const SORT_3 var_14 = 36; [L45] const SORT_9 var_16 = 5; [L46] const SORT_3 var_19 = 2544; [L47] const SORT_9 var_21 = 4; [L48] const SORT_3 var_24 = 9; [L49] const SORT_9 var_26 = 3; [L50] const SORT_3 var_29 = 54; [L51] const SORT_9 var_31 = 2; [L52] const SORT_3 var_34 = 18; [L53] const SORT_9 var_36 = 1; [L54] const SORT_9 var_40 = 0; [L55] const SORT_46 var_47 = 0; [L56] const SORT_46 var_79 = 1; [L57] const SORT_1 var_116 = 1; [L58] const SORT_9 var_159 = 7; [L60] SORT_1 input_2; [L61] SORT_46 input_143; [L62] SORT_46 input_156; [L63] SORT_46 input_167; [L64] SORT_46 input_174; [L65] SORT_46 input_181; [L66] SORT_46 input_188; [L67] SORT_46 input_195; [L68] SORT_46 input_202; [L70] EXPR __VERIFIER_nondet_uchar() & mask_SORT_5 VAL [mask_SORT_1=1, mask_SORT_46=31, mask_SORT_5=7, var_116=1, var_11=6, var_14=36, var_159=7, var_16=5, var_19=2544, var_21=4, var_24=9, var_26=3, var_29=54, var_31=2, var_34=18, var_36=1, var_40=0, var_47=0, var_4=576, var_6=0, var_79=1] [L70] SORT_5 state_7 = __VERIFIER_nondet_uchar() & mask_SORT_5; [L71] EXPR __VERIFIER_nondet_uchar() & mask_SORT_46 VAL [mask_SORT_1=1, mask_SORT_46=31, mask_SORT_5=7, var_116=1, var_11=6, var_14=36, var_159=7, var_16=5, var_19=2544, var_21=4, var_24=9, var_26=3, var_29=54, var_31=2, var_34=18, var_36=1, var_40=0, var_47=0, var_4=576, var_6=0, var_79=1] [L71] SORT_46 state_48 = __VERIFIER_nondet_uchar() & mask_SORT_46; [L72] EXPR __VERIFIER_nondet_uchar() & mask_SORT_46 VAL [mask_SORT_1=1, mask_SORT_46=31, mask_SORT_5=7, var_116=1, var_11=6, var_14=36, var_159=7, var_16=5, var_19=2544, var_21=4, var_24=9, var_26=3, var_29=54, var_31=2, var_34=18, var_36=1, var_40=0, var_47=0, var_4=576, var_6=0, var_79=1] [L72] SORT_46 state_50 = __VERIFIER_nondet_uchar() & mask_SORT_46; [L73] EXPR __VERIFIER_nondet_uchar() & mask_SORT_46 VAL [mask_SORT_1=1, mask_SORT_46=31, mask_SORT_5=7, var_116=1, var_11=6, var_14=36, var_159=7, var_16=5, var_19=2544, var_21=4, var_24=9, var_26=3, var_29=54, var_31=2, var_34=18, var_36=1, var_40=0, var_47=0, var_4=576, var_6=0, var_79=1] [L73] SORT_46 state_56 = __VERIFIER_nondet_uchar() & mask_SORT_46; [L74] EXPR __VERIFIER_nondet_uchar() & mask_SORT_46 VAL [mask_SORT_1=1, mask_SORT_46=31, mask_SORT_5=7, var_116=1, var_11=6, var_14=36, var_159=7, var_16=5, var_19=2544, var_21=4, var_24=9, var_26=3, var_29=54, var_31=2, var_34=18, var_36=1, var_40=0, var_47=0, var_4=576, var_6=0, var_79=1] [L74] SORT_46 state_64 = __VERIFIER_nondet_uchar() & mask_SORT_46; [L75] EXPR __VERIFIER_nondet_uchar() & mask_SORT_46 VAL [mask_SORT_1=1, mask_SORT_46=31, mask_SORT_5=7, var_116=1, var_11=6, var_14=36, var_159=7, var_16=5, var_19=2544, var_21=4, var_24=9, var_26=3, var_29=54, var_31=2, var_34=18, var_36=1, var_40=0, var_47=0, var_4=576, var_6=0, var_79=1] [L75] SORT_46 state_69 = __VERIFIER_nondet_uchar() & mask_SORT_46; [L76] EXPR __VERIFIER_nondet_uchar() & mask_SORT_46 VAL [mask_SORT_1=1, mask_SORT_46=31, mask_SORT_5=7, var_116=1, var_11=6, var_14=36, var_159=7, var_16=5, var_19=2544, var_21=4, var_24=9, var_26=3, var_29=54, var_31=2, var_34=18, var_36=1, var_40=0, var_47=0, var_4=576, var_6=0, var_79=1] [L76] SORT_46 state_74 = __VERIFIER_nondet_uchar() & mask_SORT_46; [L77] EXPR __VERIFIER_nondet_uchar() & mask_SORT_46 VAL [mask_SORT_1=1, mask_SORT_46=31, mask_SORT_5=7, var_116=1, var_11=6, var_14=36, var_159=7, var_16=5, var_19=2544, var_21=4, var_24=9, var_26=3, var_29=54, var_31=2, var_34=18, var_36=1, var_40=0, var_47=0, var_4=576, var_6=0, var_79=1] [L77] SORT_46 state_80 = __VERIFIER_nondet_uchar() & mask_SORT_46; [L79] SORT_5 init_8_arg_1 = var_6; [L80] state_7 = init_8_arg_1 [L81] SORT_46 init_49_arg_1 = var_47; [L82] state_48 = init_49_arg_1 [L83] SORT_46 init_51_arg_1 = var_47; [L84] state_50 = init_51_arg_1 [L85] SORT_46 init_57_arg_1 = var_47; [L86] state_56 = init_57_arg_1 [L87] SORT_46 init_65_arg_1 = var_47; [L88] state_64 = init_65_arg_1 [L89] SORT_46 init_70_arg_1 = var_47; [L90] state_69 = init_70_arg_1 [L91] SORT_46 init_75_arg_1 = var_47; [L92] state_74 = init_75_arg_1 [L93] SORT_46 init_81_arg_1 = var_79; [L94] state_80 = init_81_arg_1 VAL [mask_SORT_1=1, mask_SORT_46=31, mask_SORT_5=7, state_48=0, state_50=0, state_56=0, state_64=0, state_69=0, state_74=0, state_7=0, state_80=1, var_116=1, var_11=6, var_14=36, var_159=7, var_16=5, var_19=2544, var_21=4, var_24=9, var_26=3, var_29=54, var_31=2, var_34=18, var_36=1, var_40=0, var_4=576] [L97] input_2 = __VERIFIER_nondet_uchar() [L98] input_143 = __VERIFIER_nondet_uchar() [L99] input_156 = __VERIFIER_nondet_uchar() [L100] input_167 = __VERIFIER_nondet_uchar() [L101] input_174 = __VERIFIER_nondet_uchar() [L102] input_181 = __VERIFIER_nondet_uchar() [L103] input_188 = __VERIFIER_nondet_uchar() [L104] input_195 = __VERIFIER_nondet_uchar() [L105] input_202 = __VERIFIER_nondet_uchar() [L108] SORT_5 var_39_arg_0 = state_7; VAL [mask_SORT_1=1, mask_SORT_46=31, mask_SORT_5=7, state_48=0, state_50=0, state_56=0, state_64=0, state_69=0, state_74=0, state_7=0, state_80=1, var_116=1, var_11=6, var_14=36, var_159=7, var_16=5, var_19=2544, var_21=4, var_24=9, var_26=3, var_29=54, var_31=2, var_34=18, var_36=1, var_39_arg_0=0, var_40=0, var_4=576] [L109] EXPR var_39_arg_0 & mask_SORT_5 VAL [mask_SORT_1=1, mask_SORT_46=31, mask_SORT_5=7, state_48=0, state_50=0, state_56=0, state_64=0, state_69=0, state_74=0, state_7=0, state_80=1, var_116=1, var_11=6, var_14=36, var_159=7, var_16=5, var_19=2544, var_21=4, var_24=9, var_26=3, var_29=54, var_31=2, var_34=18, var_36=1, var_40=0, var_4=576] [L109] var_39_arg_0 = var_39_arg_0 & mask_SORT_5 [L110] SORT_9 var_39 = var_39_arg_0; [L111] SORT_9 var_41_arg_0 = var_39; [L112] SORT_9 var_41_arg_1 = var_40; [L113] SORT_1 var_41 = var_41_arg_0 == var_41_arg_1; [L114] SORT_5 var_35_arg_0 = state_7; VAL [mask_SORT_1=1, mask_SORT_46=31, mask_SORT_5=7, state_48=0, state_50=0, state_56=0, state_64=0, state_69=0, state_74=0, state_7=0, state_80=1, var_116=1, var_11=6, var_14=36, var_159=7, var_16=5, var_19=2544, var_21=4, var_24=9, var_26=3, var_29=54, var_31=2, var_34=18, var_35_arg_0=0, var_36=1, var_40=0, var_41=1, var_4=576] [L115] EXPR var_35_arg_0 & mask_SORT_5 VAL [mask_SORT_1=1, mask_SORT_46=31, mask_SORT_5=7, state_48=0, state_50=0, state_56=0, state_64=0, state_69=0, state_74=0, state_7=0, state_80=1, var_116=1, var_11=6, var_14=36, var_159=7, var_16=5, var_19=2544, var_21=4, var_24=9, var_26=3, var_29=54, var_31=2, var_34=18, var_36=1, var_40=0, var_41=1, var_4=576] [L115] var_35_arg_0 = var_35_arg_0 & mask_SORT_5 [L116] SORT_9 var_35 = var_35_arg_0; [L117] SORT_9 var_37_arg_0 = var_35; [L118] SORT_9 var_37_arg_1 = var_36; [L119] SORT_1 var_37 = var_37_arg_0 == var_37_arg_1; [L120] SORT_5 var_30_arg_0 = state_7; VAL [mask_SORT_1=1, mask_SORT_46=31, mask_SORT_5=7, state_48=0, state_50=0, state_56=0, state_64=0, state_69=0, state_74=0, state_7=0, state_80=1, var_116=1, var_11=6, var_14=36, var_159=7, var_16=5, var_19=2544, var_21=4, var_24=9, var_26=3, var_29=54, var_30_arg_0=0, var_31=2, var_34=18, var_36=1, var_37=0, var_40=0, var_41=1, var_4=576] [L121] EXPR var_30_arg_0 & mask_SORT_5 VAL [mask_SORT_1=1, mask_SORT_46=31, mask_SORT_5=7, state_48=0, state_50=0, state_56=0, state_64=0, state_69=0, state_74=0, state_7=0, state_80=1, var_116=1, var_11=6, var_14=36, var_159=7, var_16=5, var_19=2544, var_21=4, var_24=9, var_26=3, var_29=54, var_31=2, var_34=18, var_36=1, var_37=0, var_40=0, var_41=1, var_4=576] [L121] var_30_arg_0 = var_30_arg_0 & mask_SORT_5 [L122] SORT_9 var_30 = var_30_arg_0; [L123] SORT_9 var_32_arg_0 = var_30; [L124] SORT_9 var_32_arg_1 = var_31; [L125] SORT_1 var_32 = var_32_arg_0 == var_32_arg_1; [L126] SORT_5 var_25_arg_0 = state_7; VAL [mask_SORT_1=1, mask_SORT_46=31, mask_SORT_5=7, state_48=0, state_50=0, state_56=0, state_64=0, state_69=0, state_74=0, state_7=0, state_80=1, var_116=1, var_11=6, var_14=36, var_159=7, var_16=5, var_19=2544, var_21=4, var_24=9, var_25_arg_0=0, var_26=3, var_29=54, var_31=2, var_32=0, var_34=18, var_36=1, var_37=0, var_40=0, var_41=1, var_4=576] [L127] EXPR var_25_arg_0 & mask_SORT_5 VAL [mask_SORT_1=1, mask_SORT_46=31, mask_SORT_5=7, state_48=0, state_50=0, state_56=0, state_64=0, state_69=0, state_74=0, state_7=0, state_80=1, var_116=1, var_11=6, var_14=36, var_159=7, var_16=5, var_19=2544, var_21=4, var_24=9, var_26=3, var_29=54, var_31=2, var_32=0, var_34=18, var_36=1, var_37=0, var_40=0, var_41=1, var_4=576] [L127] var_25_arg_0 = var_25_arg_0 & mask_SORT_5 [L128] SORT_9 var_25 = var_25_arg_0; [L129] SORT_9 var_27_arg_0 = var_25; [L130] SORT_9 var_27_arg_1 = var_26; [L131] SORT_1 var_27 = var_27_arg_0 == var_27_arg_1; [L132] SORT_5 var_20_arg_0 = state_7; VAL [mask_SORT_1=1, mask_SORT_46=31, mask_SORT_5=7, state_48=0, state_50=0, state_56=0, state_64=0, state_69=0, state_74=0, state_7=0, state_80=1, var_116=1, var_11=6, var_14=36, var_159=7, var_16=5, var_19=2544, var_20_arg_0=0, var_21=4, var_24=9, var_26=3, var_27=0, var_29=54, var_31=2, var_32=0, var_34=18, var_36=1, var_37=0, var_40=0, var_41=1, var_4=576] [L133] EXPR var_20_arg_0 & mask_SORT_5 VAL [mask_SORT_1=1, mask_SORT_46=31, mask_SORT_5=7, state_48=0, state_50=0, state_56=0, state_64=0, state_69=0, state_74=0, state_7=0, state_80=1, var_116=1, var_11=6, var_14=36, var_159=7, var_16=5, var_19=2544, var_21=4, var_24=9, var_26=3, var_27=0, var_29=54, var_31=2, var_32=0, var_34=18, var_36=1, var_37=0, var_40=0, var_41=1, var_4=576] [L133] var_20_arg_0 = var_20_arg_0 & mask_SORT_5 [L134] SORT_9 var_20 = var_20_arg_0; [L135] SORT_9 var_22_arg_0 = var_20; [L136] SORT_9 var_22_arg_1 = var_21; [L137] SORT_1 var_22 = var_22_arg_0 == var_22_arg_1; [L138] SORT_5 var_15_arg_0 = state_7; VAL [mask_SORT_1=1, mask_SORT_46=31, mask_SORT_5=7, state_48=0, state_50=0, state_56=0, state_64=0, state_69=0, state_74=0, state_7=0, state_80=1, var_116=1, var_11=6, var_14=36, var_159=7, var_15_arg_0=0, var_16=5, var_19=2544, var_21=4, var_22=0, var_24=9, var_26=3, var_27=0, var_29=54, var_31=2, var_32=0, var_34=18, var_36=1, var_37=0, var_40=0, var_41=1, var_4=576] [L139] EXPR var_15_arg_0 & mask_SORT_5 VAL [mask_SORT_1=1, mask_SORT_46=31, mask_SORT_5=7, state_48=0, state_50=0, state_56=0, state_64=0, state_69=0, state_74=0, state_7=0, state_80=1, var_116=1, var_11=6, var_14=36, var_159=7, var_16=5, var_19=2544, var_21=4, var_22=0, var_24=9, var_26=3, var_27=0, var_29=54, var_31=2, var_32=0, var_34=18, var_36=1, var_37=0, var_40=0, var_41=1, var_4=576] [L139] var_15_arg_0 = var_15_arg_0 & mask_SORT_5 [L140] SORT_9 var_15 = var_15_arg_0; [L141] SORT_9 var_17_arg_0 = var_15; [L142] SORT_9 var_17_arg_1 = var_16; [L143] SORT_1 var_17 = var_17_arg_0 == var_17_arg_1; [L144] SORT_5 var_10_arg_0 = state_7; VAL [mask_SORT_1=1, mask_SORT_46=31, mask_SORT_5=7, state_48=0, state_50=0, state_56=0, state_64=0, state_69=0, state_74=0, state_7=0, state_80=1, var_10_arg_0=0, var_116=1, var_11=6, var_14=36, var_159=7, var_16=5, var_17=0, var_19=2544, var_21=4, var_22=0, var_24=9, var_26=3, var_27=0, var_29=54, var_31=2, var_32=0, var_34=18, var_36=1, var_37=0, var_40=0, var_41=1, var_4=576] [L145] EXPR var_10_arg_0 & mask_SORT_5 VAL [mask_SORT_1=1, mask_SORT_46=31, mask_SORT_5=7, state_48=0, state_50=0, state_56=0, state_64=0, state_69=0, state_74=0, state_7=0, state_80=1, var_116=1, var_11=6, var_14=36, var_159=7, var_16=5, var_17=0, var_19=2544, var_21=4, var_22=0, var_24=9, var_26=3, var_27=0, var_29=54, var_31=2, var_32=0, var_34=18, var_36=1, var_37=0, var_40=0, var_41=1, var_4=576] [L145] var_10_arg_0 = var_10_arg_0 & mask_SORT_5 [L146] SORT_9 var_10 = var_10_arg_0; [L147] SORT_9 var_12_arg_0 = var_10; [L148] SORT_9 var_12_arg_1 = var_11; [L149] SORT_1 var_12 = var_12_arg_0 == var_12_arg_1; [L150] SORT_1 var_13_arg_0 = var_12; [L151] SORT_3 var_13_arg_1 = var_4; [L152] SORT_3 var_13_arg_2 = var_4; [L153] SORT_3 var_13 = var_13_arg_0 ? var_13_arg_1 : var_13_arg_2; [L154] SORT_1 var_18_arg_0 = var_17; [L155] SORT_3 var_18_arg_1 = var_14; [L156] SORT_3 var_18_arg_2 = var_13; [L157] SORT_3 var_18 = var_18_arg_0 ? var_18_arg_1 : var_18_arg_2; [L158] SORT_1 var_23_arg_0 = var_22; [L159] SORT_3 var_23_arg_1 = var_19; [L160] SORT_3 var_23_arg_2 = var_18; [L161] SORT_3 var_23 = var_23_arg_0 ? var_23_arg_1 : var_23_arg_2; [L162] SORT_1 var_28_arg_0 = var_27; [L163] SORT_3 var_28_arg_1 = var_24; [L164] SORT_3 var_28_arg_2 = var_23; [L165] SORT_3 var_28 = var_28_arg_0 ? var_28_arg_1 : var_28_arg_2; [L166] SORT_1 var_33_arg_0 = var_32; [L167] SORT_3 var_33_arg_1 = var_29; [L168] SORT_3 var_33_arg_2 = var_28; [L169] SORT_3 var_33 = var_33_arg_0 ? var_33_arg_1 : var_33_arg_2; [L170] SORT_1 var_38_arg_0 = var_37; [L171] SORT_3 var_38_arg_1 = var_34; [L172] SORT_3 var_38_arg_2 = var_33; [L173] SORT_3 var_38 = var_38_arg_0 ? var_38_arg_1 : var_38_arg_2; [L174] SORT_1 var_42_arg_0 = var_41; [L175] SORT_3 var_42_arg_1 = var_14; [L176] SORT_3 var_42_arg_2 = var_38; [L177] SORT_3 var_42 = var_42_arg_0 ? var_42_arg_1 : var_42_arg_2; [L178] SORT_3 var_43_arg_0 = var_42; [L179] SORT_5 var_43 = var_43_arg_0 >> 0; [L180] SORT_5 var_44_arg_0 = var_43; VAL [mask_SORT_1=1, mask_SORT_46=31, mask_SORT_5=7, state_48=0, state_50=0, state_56=0, state_64=0, state_69=0, state_74=0, state_7=0, state_80=1, var_116=1, var_11=6, var_14=36, var_159=7, var_16=5, var_19=2544, var_21=4, var_24=9, var_26=3, var_29=54, var_31=2, var_34=18, var_36=1, var_40=0, var_42=36, var_43=36, var_44_arg_0=36, var_4=576] [L181] EXPR var_44_arg_0 & mask_SORT_5 VAL [mask_SORT_1=1, mask_SORT_46=31, mask_SORT_5=7, state_48=0, state_50=0, state_56=0, state_64=0, state_69=0, state_74=0, state_7=0, state_80=1, var_116=1, var_11=6, var_14=36, var_159=7, var_16=5, var_19=2544, var_21=4, var_24=9, var_26=3, var_29=54, var_31=2, var_34=18, var_36=1, var_40=0, var_42=36, var_43=36, var_4=576] [L181] var_44_arg_0 = var_44_arg_0 & mask_SORT_5 [L182] SORT_9 var_44 = var_44_arg_0; [L183] SORT_9 var_45_arg_0 = var_44; [L184] SORT_9 var_45_arg_1 = var_21; [L185] SORT_1 var_45 = var_45_arg_0 == var_45_arg_1; [L186] SORT_3 var_52_arg_0 = var_42; [L187] SORT_5 var_52 = var_52_arg_0 >> 3; [L188] SORT_5 var_82_arg_0 = var_52; VAL [mask_SORT_1=1, mask_SORT_46=31, mask_SORT_5=7, state_48=0, state_50=0, state_56=0, state_64=0, state_69=0, state_74=0, state_7=0, state_80=1, var_116=1, var_11=6, var_14=36, var_159=7, var_16=5, var_19=2544, var_21=4, var_24=9, var_26=3, var_29=54, var_31=2, var_34=18, var_36=1, var_40=0, var_42=36, var_43=36, var_45=0, var_4=576, var_52=4, var_82_arg_0=4] [L189] EXPR var_82_arg_0 & mask_SORT_5 VAL [mask_SORT_1=1, mask_SORT_46=31, mask_SORT_5=7, state_48=0, state_50=0, state_56=0, state_64=0, state_69=0, state_74=0, state_7=0, state_80=1, var_116=1, var_11=6, var_14=36, var_159=7, var_16=5, var_19=2544, var_21=4, var_24=9, var_26=3, var_29=54, var_31=2, var_34=18, var_36=1, var_40=0, var_42=36, var_43=36, var_45=0, var_4=576, var_52=4] [L189] var_82_arg_0 = var_82_arg_0 & mask_SORT_5 [L190] SORT_9 var_82 = var_82_arg_0; [L191] SORT_9 var_83_arg_0 = var_82; [L192] SORT_9 var_83_arg_1 = var_40; [L193] SORT_1 var_83 = var_83_arg_0 == var_83_arg_1; [L194] SORT_5 var_76_arg_0 = var_52; VAL [mask_SORT_1=1, mask_SORT_46=31, mask_SORT_5=7, state_48=0, state_50=0, state_56=0, state_64=0, state_69=0, state_74=0, state_7=0, state_80=1, var_116=1, var_11=6, var_14=36, var_159=7, var_16=5, var_19=2544, var_21=4, var_24=9, var_26=3, var_29=54, var_31=2, var_34=18, var_36=1, var_40=0, var_42=36, var_43=36, var_45=0, var_4=576, var_52=4, var_76_arg_0=4, var_83=0] [L195] EXPR var_76_arg_0 & mask_SORT_5 VAL [mask_SORT_1=1, mask_SORT_46=31, mask_SORT_5=7, state_48=0, state_50=0, state_56=0, state_64=0, state_69=0, state_74=0, state_7=0, state_80=1, var_116=1, var_11=6, var_14=36, var_159=7, var_16=5, var_19=2544, var_21=4, var_24=9, var_26=3, var_29=54, var_31=2, var_34=18, var_36=1, var_40=0, var_42=36, var_43=36, var_45=0, var_4=576, var_52=4, var_83=0] [L195] var_76_arg_0 = var_76_arg_0 & mask_SORT_5 [L196] SORT_9 var_76 = var_76_arg_0; [L197] SORT_9 var_77_arg_0 = var_76; [L198] SORT_9 var_77_arg_1 = var_36; [L199] SORT_1 var_77 = var_77_arg_0 == var_77_arg_1; [L200] SORT_5 var_71_arg_0 = var_52; VAL [mask_SORT_1=1, mask_SORT_46=31, mask_SORT_5=7, state_48=0, state_50=0, state_56=0, state_64=0, state_69=0, state_74=0, state_7=0, state_80=1, var_116=1, var_11=6, var_14=36, var_159=7, var_16=5, var_19=2544, var_21=4, var_24=9, var_26=3, var_29=54, var_31=2, var_34=18, var_36=1, var_40=0, var_42=36, var_43=36, var_45=0, var_4=576, var_52=4, var_71_arg_0=4, var_77=0, var_83=0] [L201] EXPR var_71_arg_0 & mask_SORT_5 VAL [mask_SORT_1=1, mask_SORT_46=31, mask_SORT_5=7, state_48=0, state_50=0, state_56=0, state_64=0, state_69=0, state_74=0, state_7=0, state_80=1, var_116=1, var_11=6, var_14=36, var_159=7, var_16=5, var_19=2544, var_21=4, var_24=9, var_26=3, var_29=54, var_31=2, var_34=18, var_36=1, var_40=0, var_42=36, var_43=36, var_45=0, var_4=576, var_52=4, var_77=0, var_83=0] [L201] var_71_arg_0 = var_71_arg_0 & mask_SORT_5 [L202] SORT_9 var_71 = var_71_arg_0; [L203] SORT_9 var_72_arg_0 = var_71; [L204] SORT_9 var_72_arg_1 = var_31; [L205] SORT_1 var_72 = var_72_arg_0 == var_72_arg_1; [L206] SORT_5 var_66_arg_0 = var_52; VAL [mask_SORT_1=1, mask_SORT_46=31, mask_SORT_5=7, state_48=0, state_50=0, state_56=0, state_64=0, state_69=0, state_74=0, state_7=0, state_80=1, var_116=1, var_11=6, var_14=36, var_159=7, var_16=5, var_19=2544, var_21=4, var_24=9, var_26=3, var_29=54, var_31=2, var_34=18, var_36=1, var_40=0, var_42=36, var_43=36, var_45=0, var_4=576, var_52=4, var_66_arg_0=4, var_72=1, var_77=0, var_83=0] [L207] EXPR var_66_arg_0 & mask_SORT_5 VAL [mask_SORT_1=1, mask_SORT_46=31, mask_SORT_5=7, state_48=0, state_50=0, state_56=0, state_64=0, state_69=0, state_74=0, state_7=0, state_80=1, var_116=1, var_11=6, var_14=36, var_159=7, var_16=5, var_19=2544, var_21=4, var_24=9, var_26=3, var_29=54, var_31=2, var_34=18, var_36=1, var_40=0, var_42=36, var_43=36, var_45=0, var_4=576, var_52=4, var_72=1, var_77=0, var_83=0] [L207] var_66_arg_0 = var_66_arg_0 & mask_SORT_5 [L208] SORT_9 var_66 = var_66_arg_0; [L209] SORT_9 var_67_arg_0 = var_66; [L210] SORT_9 var_67_arg_1 = var_26; [L211] SORT_1 var_67 = var_67_arg_0 == var_67_arg_1; [L212] SORT_5 var_61_arg_0 = var_52; VAL [mask_SORT_1=1, mask_SORT_46=31, mask_SORT_5=7, state_48=0, state_50=0, state_56=0, state_64=0, state_69=0, state_74=0, state_7=0, state_80=1, var_116=1, var_11=6, var_14=36, var_159=7, var_16=5, var_19=2544, var_21=4, var_24=9, var_26=3, var_29=54, var_31=2, var_34=18, var_36=1, var_40=0, var_42=36, var_43=36, var_45=0, var_4=576, var_52=4, var_61_arg_0=4, var_67=0, var_72=1, var_77=0, var_83=0] [L213] EXPR var_61_arg_0 & mask_SORT_5 VAL [mask_SORT_1=1, mask_SORT_46=31, mask_SORT_5=7, state_48=0, state_50=0, state_56=0, state_64=0, state_69=0, state_74=0, state_7=0, state_80=1, var_116=1, var_11=6, var_14=36, var_159=7, var_16=5, var_19=2544, var_21=4, var_24=9, var_26=3, var_29=54, var_31=2, var_34=18, var_36=1, var_40=0, var_42=36, var_43=36, var_45=0, var_4=576, var_52=4, var_67=0, var_72=1, var_77=0, var_83=0] [L213] var_61_arg_0 = var_61_arg_0 & mask_SORT_5 [L214] SORT_9 var_61 = var_61_arg_0; [L215] SORT_9 var_62_arg_0 = var_61; [L216] SORT_9 var_62_arg_1 = var_21; [L217] SORT_1 var_62 = var_62_arg_0 == var_62_arg_1; [L218] SORT_5 var_58_arg_0 = var_52; VAL [mask_SORT_1=1, mask_SORT_46=31, mask_SORT_5=7, state_48=0, state_50=0, state_56=0, state_64=0, state_69=0, state_74=0, state_7=0, state_80=1, var_116=1, var_11=6, var_14=36, var_159=7, var_16=5, var_19=2544, var_21=4, var_24=9, var_26=3, var_29=54, var_31=2, var_34=18, var_36=1, var_40=0, var_42=36, var_43=36, var_45=0, var_4=576, var_52=4, var_58_arg_0=4, var_62=0, var_67=0, var_72=1, var_77=0, var_83=0] [L219] EXPR var_58_arg_0 & mask_SORT_5 VAL [mask_SORT_1=1, mask_SORT_46=31, mask_SORT_5=7, state_48=0, state_50=0, state_56=0, state_64=0, state_69=0, state_74=0, state_7=0, state_80=1, var_116=1, var_11=6, var_14=36, var_159=7, var_16=5, var_19=2544, var_21=4, var_24=9, var_26=3, var_29=54, var_31=2, var_34=18, var_36=1, var_40=0, var_42=36, var_43=36, var_45=0, var_4=576, var_52=4, var_62=0, var_67=0, var_72=1, var_77=0, var_83=0] [L219] var_58_arg_0 = var_58_arg_0 & mask_SORT_5 [L220] SORT_9 var_58 = var_58_arg_0; [L221] SORT_9 var_59_arg_0 = var_58; [L222] SORT_9 var_59_arg_1 = var_16; [L223] SORT_1 var_59 = var_59_arg_0 == var_59_arg_1; [L224] SORT_5 var_53_arg_0 = var_52; VAL [mask_SORT_1=1, mask_SORT_46=31, mask_SORT_5=7, state_48=0, state_50=0, state_56=0, state_64=0, state_69=0, state_74=0, state_7=0, state_80=1, var_116=1, var_11=6, var_14=36, var_159=7, var_16=5, var_19=2544, var_21=4, var_24=9, var_26=3, var_29=54, var_31=2, var_34=18, var_36=1, var_40=0, var_42=36, var_43=36, var_45=0, var_4=576, var_53_arg_0=4, var_59=0, var_62=0, var_67=0, var_72=1, var_77=0, var_83=0] [L225] EXPR var_53_arg_0 & mask_SORT_5 VAL [mask_SORT_1=1, mask_SORT_46=31, mask_SORT_5=7, state_48=0, state_50=0, state_56=0, state_64=0, state_69=0, state_74=0, state_7=0, state_80=1, var_116=1, var_11=6, var_14=36, var_159=7, var_16=5, var_19=2544, var_21=4, var_24=9, var_26=3, var_29=54, var_31=2, var_34=18, var_36=1, var_40=0, var_42=36, var_43=36, var_45=0, var_4=576, var_59=0, var_62=0, var_67=0, var_72=1, var_77=0, var_83=0] [L225] var_53_arg_0 = var_53_arg_0 & mask_SORT_5 [L226] SORT_9 var_53 = var_53_arg_0; [L227] SORT_9 var_54_arg_0 = var_53; [L228] SORT_9 var_54_arg_1 = var_11; [L229] SORT_1 var_54 = var_54_arg_0 == var_54_arg_1; [L230] SORT_1 var_55_arg_0 = var_54; [L231] SORT_46 var_55_arg_1 = state_50; [L232] SORT_46 var_55_arg_2 = state_48; [L233] SORT_46 var_55 = var_55_arg_0 ? var_55_arg_1 : var_55_arg_2; [L234] SORT_1 var_60_arg_0 = var_59; [L235] SORT_46 var_60_arg_1 = state_56; [L236] SORT_46 var_60_arg_2 = var_55; [L237] SORT_46 var_60 = var_60_arg_0 ? var_60_arg_1 : var_60_arg_2; [L238] SORT_1 var_63_arg_0 = var_62; [L239] SORT_46 var_63_arg_1 = state_56; [L240] SORT_46 var_63_arg_2 = var_60; [L241] SORT_46 var_63 = var_63_arg_0 ? var_63_arg_1 : var_63_arg_2; [L242] SORT_1 var_68_arg_0 = var_67; [L243] SORT_46 var_68_arg_1 = state_64; [L244] SORT_46 var_68_arg_2 = var_63; [L245] SORT_46 var_68 = var_68_arg_0 ? var_68_arg_1 : var_68_arg_2; [L246] SORT_1 var_73_arg_0 = var_72; [L247] SORT_46 var_73_arg_1 = state_69; [L248] SORT_46 var_73_arg_2 = var_68; [L249] SORT_46 var_73 = var_73_arg_0 ? var_73_arg_1 : var_73_arg_2; [L250] SORT_1 var_78_arg_0 = var_77; [L251] SORT_46 var_78_arg_1 = state_74; [L252] SORT_46 var_78_arg_2 = var_73; [L253] SORT_46 var_78 = var_78_arg_0 ? var_78_arg_1 : var_78_arg_2; [L254] SORT_1 var_84_arg_0 = var_83; [L255] SORT_46 var_84_arg_1 = state_80; [L256] SORT_46 var_84_arg_2 = var_78; [L257] SORT_46 var_84 = var_84_arg_0 ? var_84_arg_1 : var_84_arg_2; [L258] SORT_46 var_85_arg_0 = var_84; VAL [mask_SORT_1=1, mask_SORT_46=31, mask_SORT_5=7, state_48=0, state_50=0, state_56=0, state_64=0, state_69=0, state_74=0, state_7=0, state_80=1, var_116=1, var_11=6, var_14=36, var_159=7, var_16=5, var_19=2544, var_21=4, var_24=9, var_26=3, var_29=54, var_31=2, var_34=18, var_36=1, var_40=0, var_42=36, var_43=36, var_45=0, var_4=576, var_84=0, var_85_arg_0=0] [L259] EXPR var_85_arg_0 & mask_SORT_46 VAL [mask_SORT_1=1, mask_SORT_46=31, mask_SORT_5=7, state_48=0, state_50=0, state_56=0, state_64=0, state_69=0, state_74=0, state_7=0, state_80=1, var_116=1, var_11=6, var_14=36, var_159=7, var_16=5, var_19=2544, var_21=4, var_24=9, var_26=3, var_29=54, var_31=2, var_34=18, var_36=1, var_40=0, var_42=36, var_43=36, var_45=0, var_4=576, var_84=0] [L259] var_85_arg_0 = var_85_arg_0 & mask_SORT_46 [L260] SORT_9 var_85 = var_85_arg_0; [L261] SORT_9 var_86_arg_0 = var_85; [L262] SORT_9 var_86_arg_1 = var_40; [L263] SORT_1 var_86 = var_86_arg_0 == var_86_arg_1; [L264] SORT_1 var_87_arg_0 = var_45; [L265] SORT_1 var_87_arg_1 = var_86; VAL [mask_SORT_1=1, mask_SORT_46=31, mask_SORT_5=7, state_48=0, state_50=0, state_56=0, state_64=0, state_69=0, state_74=0, state_7=0, state_80=1, var_116=1, var_11=6, var_14=36, var_159=7, var_16=5, var_19=2544, var_21=4, var_24=9, var_26=3, var_29=54, var_31=2, var_34=18, var_36=1, var_40=0, var_42=36, var_43=36, var_4=576, var_84=0, var_87_arg_0=0, var_87_arg_1=1] [L266] EXPR var_87_arg_0 & var_87_arg_1 VAL [mask_SORT_1=1, mask_SORT_46=31, mask_SORT_5=7, state_48=0, state_50=0, state_56=0, state_64=0, state_69=0, state_74=0, state_7=0, state_80=1, var_116=1, var_11=6, var_14=36, var_159=7, var_16=5, var_19=2544, var_21=4, var_24=9, var_26=3, var_29=54, var_31=2, var_34=18, var_36=1, var_40=0, var_42=36, var_43=36, var_4=576, var_84=0] [L266] SORT_1 var_87 = var_87_arg_0 & var_87_arg_1; [L267] SORT_1 var_88_arg_0 = var_87; [L268] SORT_1 var_88 = ~var_88_arg_0; [L269] SORT_3 var_89_arg_0 = var_42; [L270] SORT_5 var_89 = var_89_arg_0 >> 6; [L271] SORT_5 var_108_arg_0 = var_89; VAL [mask_SORT_1=1, mask_SORT_46=31, mask_SORT_5=7, state_48=0, state_50=0, state_56=0, state_64=0, state_69=0, state_74=0, state_7=0, state_80=1, var_108_arg_0=0, var_116=1, var_11=6, var_14=36, var_159=7, var_16=5, var_19=2544, var_21=4, var_24=9, var_26=3, var_29=54, var_31=2, var_34=18, var_36=1, var_40=0, var_42=36, var_43=36, var_4=576, var_84=0, var_88=-1, var_89=0] [L272] EXPR var_108_arg_0 & mask_SORT_5 VAL [mask_SORT_1=1, mask_SORT_46=31, mask_SORT_5=7, state_48=0, state_50=0, state_56=0, state_64=0, state_69=0, state_74=0, state_7=0, state_80=1, var_116=1, var_11=6, var_14=36, var_159=7, var_16=5, var_19=2544, var_21=4, var_24=9, var_26=3, var_29=54, var_31=2, var_34=18, var_36=1, var_40=0, var_42=36, var_43=36, var_4=576, var_84=0, var_88=-1, var_89=0] [L272] var_108_arg_0 = var_108_arg_0 & mask_SORT_5 [L273] SORT_9 var_108 = var_108_arg_0; [L274] SORT_9 var_109_arg_0 = var_108; [L275] SORT_9 var_109_arg_1 = var_40; [L276] SORT_1 var_109 = var_109_arg_0 == var_109_arg_1; [L277] SORT_5 var_105_arg_0 = var_89; VAL [mask_SORT_1=1, mask_SORT_46=31, mask_SORT_5=7, state_48=0, state_50=0, state_56=0, state_64=0, state_69=0, state_74=0, state_7=0, state_80=1, var_105_arg_0=0, var_109=1, var_116=1, var_11=6, var_14=36, var_159=7, var_16=5, var_19=2544, var_21=4, var_24=9, var_26=3, var_29=54, var_31=2, var_34=18, var_36=1, var_40=0, var_42=36, var_43=36, var_4=576, var_84=0, var_88=-1, var_89=0] [L278] EXPR var_105_arg_0 & mask_SORT_5 VAL [mask_SORT_1=1, mask_SORT_46=31, mask_SORT_5=7, state_48=0, state_50=0, state_56=0, state_64=0, state_69=0, state_74=0, state_7=0, state_80=1, var_109=1, var_116=1, var_11=6, var_14=36, var_159=7, var_16=5, var_19=2544, var_21=4, var_24=9, var_26=3, var_29=54, var_31=2, var_34=18, var_36=1, var_40=0, var_42=36, var_43=36, var_4=576, var_84=0, var_88=-1, var_89=0] [L278] var_105_arg_0 = var_105_arg_0 & mask_SORT_5 [L279] SORT_9 var_105 = var_105_arg_0; [L280] SORT_9 var_106_arg_0 = var_105; [L281] SORT_9 var_106_arg_1 = var_36; [L282] SORT_1 var_106 = var_106_arg_0 == var_106_arg_1; [L283] SORT_5 var_102_arg_0 = var_89; VAL [mask_SORT_1=1, mask_SORT_46=31, mask_SORT_5=7, state_48=0, state_50=0, state_56=0, state_64=0, state_69=0, state_74=0, state_7=0, state_80=1, var_102_arg_0=0, var_106=0, var_109=1, var_116=1, var_11=6, var_14=36, var_159=7, var_16=5, var_19=2544, var_21=4, var_24=9, var_26=3, var_29=54, var_31=2, var_34=18, var_36=1, var_40=0, var_42=36, var_43=36, var_4=576, var_84=0, var_88=-1, var_89=0] [L284] EXPR var_102_arg_0 & mask_SORT_5 VAL [mask_SORT_1=1, mask_SORT_46=31, mask_SORT_5=7, state_48=0, state_50=0, state_56=0, state_64=0, state_69=0, state_74=0, state_7=0, state_80=1, var_106=0, var_109=1, var_116=1, var_11=6, var_14=36, var_159=7, var_16=5, var_19=2544, var_21=4, var_24=9, var_26=3, var_29=54, var_31=2, var_34=18, var_36=1, var_40=0, var_42=36, var_43=36, var_4=576, var_84=0, var_88=-1, var_89=0] [L284] var_102_arg_0 = var_102_arg_0 & mask_SORT_5 [L285] SORT_9 var_102 = var_102_arg_0; [L286] SORT_9 var_103_arg_0 = var_102; [L287] SORT_9 var_103_arg_1 = var_31; [L288] SORT_1 var_103 = var_103_arg_0 == var_103_arg_1; [L289] SORT_5 var_99_arg_0 = var_89; VAL [mask_SORT_1=1, mask_SORT_46=31, mask_SORT_5=7, state_48=0, state_50=0, state_56=0, state_64=0, state_69=0, state_74=0, state_7=0, state_80=1, var_103=0, var_106=0, var_109=1, var_116=1, var_11=6, var_14=36, var_159=7, var_16=5, var_19=2544, var_21=4, var_24=9, var_26=3, var_29=54, var_31=2, var_34=18, var_36=1, var_40=0, var_42=36, var_43=36, var_4=576, var_84=0, var_88=-1, var_89=0, var_99_arg_0=0] [L290] EXPR var_99_arg_0 & mask_SORT_5 VAL [mask_SORT_1=1, mask_SORT_46=31, mask_SORT_5=7, state_48=0, state_50=0, state_56=0, state_64=0, state_69=0, state_74=0, state_7=0, state_80=1, var_103=0, var_106=0, var_109=1, var_116=1, var_11=6, var_14=36, var_159=7, var_16=5, var_19=2544, var_21=4, var_24=9, var_26=3, var_29=54, var_31=2, var_34=18, var_36=1, var_40=0, var_42=36, var_43=36, var_4=576, var_84=0, var_88=-1, var_89=0] [L290] var_99_arg_0 = var_99_arg_0 & mask_SORT_5 [L291] SORT_9 var_99 = var_99_arg_0; [L292] SORT_9 var_100_arg_0 = var_99; [L293] SORT_9 var_100_arg_1 = var_26; [L294] SORT_1 var_100 = var_100_arg_0 == var_100_arg_1; [L295] SORT_5 var_96_arg_0 = var_89; VAL [mask_SORT_1=1, mask_SORT_46=31, mask_SORT_5=7, state_48=0, state_50=0, state_56=0, state_64=0, state_69=0, state_74=0, state_7=0, state_80=1, var_100=0, var_103=0, var_106=0, var_109=1, var_116=1, var_11=6, var_14=36, var_159=7, var_16=5, var_19=2544, var_21=4, var_24=9, var_26=3, var_29=54, var_31=2, var_34=18, var_36=1, var_40=0, var_42=36, var_43=36, var_4=576, var_84=0, var_88=-1, var_89=0, var_96_arg_0=0] [L296] EXPR var_96_arg_0 & mask_SORT_5 VAL [mask_SORT_1=1, mask_SORT_46=31, mask_SORT_5=7, state_48=0, state_50=0, state_56=0, state_64=0, state_69=0, state_74=0, state_7=0, state_80=1, var_100=0, var_103=0, var_106=0, var_109=1, var_116=1, var_11=6, var_14=36, var_159=7, var_16=5, var_19=2544, var_21=4, var_24=9, var_26=3, var_29=54, var_31=2, var_34=18, var_36=1, var_40=0, var_42=36, var_43=36, var_4=576, var_84=0, var_88=-1, var_89=0] [L296] var_96_arg_0 = var_96_arg_0 & mask_SORT_5 [L297] SORT_9 var_96 = var_96_arg_0; [L298] SORT_9 var_97_arg_0 = var_96; [L299] SORT_9 var_97_arg_1 = var_21; [L300] SORT_1 var_97 = var_97_arg_0 == var_97_arg_1; [L301] SORT_5 var_93_arg_0 = var_89; VAL [mask_SORT_1=1, mask_SORT_46=31, mask_SORT_5=7, state_48=0, state_50=0, state_56=0, state_64=0, state_69=0, state_74=0, state_7=0, state_80=1, var_100=0, var_103=0, var_106=0, var_109=1, var_116=1, var_11=6, var_14=36, var_159=7, var_16=5, var_19=2544, var_21=4, var_24=9, var_26=3, var_29=54, var_31=2, var_34=18, var_36=1, var_40=0, var_42=36, var_43=36, var_4=576, var_84=0, var_88=-1, var_89=0, var_93_arg_0=0, var_97=0] [L302] EXPR var_93_arg_0 & mask_SORT_5 VAL [mask_SORT_1=1, mask_SORT_46=31, mask_SORT_5=7, state_48=0, state_50=0, state_56=0, state_64=0, state_69=0, state_74=0, state_7=0, state_80=1, var_100=0, var_103=0, var_106=0, var_109=1, var_116=1, var_11=6, var_14=36, var_159=7, var_16=5, var_19=2544, var_21=4, var_24=9, var_26=3, var_29=54, var_31=2, var_34=18, var_36=1, var_40=0, var_42=36, var_43=36, var_4=576, var_84=0, var_88=-1, var_89=0, var_97=0] [L302] var_93_arg_0 = var_93_arg_0 & mask_SORT_5 [L303] SORT_9 var_93 = var_93_arg_0; [L304] SORT_9 var_94_arg_0 = var_93; [L305] SORT_9 var_94_arg_1 = var_16; [L306] SORT_1 var_94 = var_94_arg_0 == var_94_arg_1; [L307] SORT_5 var_90_arg_0 = var_89; VAL [mask_SORT_1=1, mask_SORT_46=31, mask_SORT_5=7, state_48=0, state_50=0, state_56=0, state_64=0, state_69=0, state_74=0, state_7=0, state_80=1, var_100=0, var_103=0, var_106=0, var_109=1, var_116=1, var_11=6, var_14=36, var_159=7, var_16=5, var_19=2544, var_21=4, var_24=9, var_26=3, var_29=54, var_31=2, var_34=18, var_36=1, var_40=0, var_42=36, var_43=36, var_4=576, var_84=0, var_88=-1, var_90_arg_0=0, var_94=0, var_97=0] [L308] EXPR var_90_arg_0 & mask_SORT_5 VAL [mask_SORT_1=1, mask_SORT_46=31, mask_SORT_5=7, state_48=0, state_50=0, state_56=0, state_64=0, state_69=0, state_74=0, state_7=0, state_80=1, var_100=0, var_103=0, var_106=0, var_109=1, var_116=1, var_11=6, var_14=36, var_159=7, var_16=5, var_19=2544, var_21=4, var_24=9, var_26=3, var_29=54, var_31=2, var_34=18, var_36=1, var_40=0, var_42=36, var_43=36, var_4=576, var_84=0, var_88=-1, var_94=0, var_97=0] [L308] var_90_arg_0 = var_90_arg_0 & mask_SORT_5 [L309] SORT_9 var_90 = var_90_arg_0; [L310] SORT_9 var_91_arg_0 = var_90; [L311] SORT_9 var_91_arg_1 = var_11; [L312] SORT_1 var_91 = var_91_arg_0 == var_91_arg_1; [L313] SORT_1 var_92_arg_0 = var_91; [L314] SORT_46 var_92_arg_1 = state_50; [L315] SORT_46 var_92_arg_2 = state_48; [L316] SORT_46 var_92 = var_92_arg_0 ? var_92_arg_1 : var_92_arg_2; [L317] SORT_1 var_95_arg_0 = var_94; [L318] SORT_46 var_95_arg_1 = state_56; [L319] SORT_46 var_95_arg_2 = var_92; [L320] SORT_46 var_95 = var_95_arg_0 ? var_95_arg_1 : var_95_arg_2; [L321] SORT_1 var_98_arg_0 = var_97; [L322] SORT_46 var_98_arg_1 = state_56; [L323] SORT_46 var_98_arg_2 = var_95; [L324] SORT_46 var_98 = var_98_arg_0 ? var_98_arg_1 : var_98_arg_2; [L325] SORT_1 var_101_arg_0 = var_100; [L326] SORT_46 var_101_arg_1 = state_64; [L327] SORT_46 var_101_arg_2 = var_98; [L328] SORT_46 var_101 = var_101_arg_0 ? var_101_arg_1 : var_101_arg_2; [L329] SORT_1 var_104_arg_0 = var_103; [L330] SORT_46 var_104_arg_1 = state_69; [L331] SORT_46 var_104_arg_2 = var_101; [L332] SORT_46 var_104 = var_104_arg_0 ? var_104_arg_1 : var_104_arg_2; [L333] SORT_1 var_107_arg_0 = var_106; [L334] SORT_46 var_107_arg_1 = state_74; [L335] SORT_46 var_107_arg_2 = var_104; [L336] SORT_46 var_107 = var_107_arg_0 ? var_107_arg_1 : var_107_arg_2; [L337] SORT_1 var_110_arg_0 = var_109; [L338] SORT_46 var_110_arg_1 = state_80; [L339] SORT_46 var_110_arg_2 = var_107; [L340] SORT_46 var_110 = var_110_arg_0 ? var_110_arg_1 : var_110_arg_2; [L341] SORT_46 var_111_arg_0 = var_110; [L342] SORT_5 var_111 = var_111_arg_0 >> 0; VAL [mask_SORT_1=1, mask_SORT_46=31, mask_SORT_5=7, state_48=0, state_50=0, state_56=0, state_64=0, state_69=0, state_74=0, state_7=0, state_80=1, var_110=1, var_111=1, var_116=1, var_11=6, var_14=36, var_159=7, var_16=5, var_19=2544, var_21=4, var_24=9, var_26=3, var_29=54, var_31=2, var_34=18, var_36=1, var_40=0, var_42=36, var_43=36, var_4=576, var_84=0, var_88=-1] [L343] EXPR var_111 & mask_SORT_5 VAL [mask_SORT_1=1, mask_SORT_46=31, mask_SORT_5=7, state_48=0, state_50=0, state_56=0, state_64=0, state_69=0, state_74=0, state_7=0, state_80=1, var_110=1, var_116=1, var_11=6, var_14=36, var_159=7, var_16=5, var_19=2544, var_21=4, var_24=9, var_26=3, var_29=54, var_31=2, var_34=18, var_36=1, var_40=0, var_42=36, var_43=36, var_4=576, var_84=0, var_88=-1] [L343] var_111 = var_111 & mask_SORT_5 [L344] SORT_5 var_112_arg_0 = state_7; [L345] SORT_5 var_112_arg_1 = var_111; [L346] SORT_1 var_112 = var_112_arg_0 == var_112_arg_1; [L347] SORT_1 var_113_arg_0 = var_88; [L348] SORT_1 var_113_arg_1 = var_112; VAL [mask_SORT_1=1, mask_SORT_46=31, mask_SORT_5=7, state_48=0, state_50=0, state_56=0, state_64=0, state_69=0, state_74=0, state_7=0, state_80=1, var_110=1, var_111=1, var_113_arg_0=-1, var_113_arg_1=0, var_116=1, var_11=6, var_14=36, var_159=7, var_16=5, var_19=2544, var_21=4, var_24=9, var_26=3, var_29=54, var_31=2, var_34=18, var_36=1, var_40=0, var_42=36, var_43=36, var_4=576, var_84=0] [L349] EXPR var_113_arg_0 & var_113_arg_1 VAL [mask_SORT_1=1, mask_SORT_46=31, mask_SORT_5=7, state_48=0, state_50=0, state_56=0, state_64=0, state_69=0, state_74=0, state_7=0, state_80=1, var_110=1, var_111=1, var_116=1, var_11=6, var_14=36, var_159=7, var_16=5, var_19=2544, var_21=4, var_24=9, var_26=3, var_29=54, var_31=2, var_34=18, var_36=1, var_40=0, var_42=36, var_43=36, var_4=576, var_84=0] [L349] SORT_1 var_113 = var_113_arg_0 & var_113_arg_1; [L350] SORT_1 var_117_arg_0 = var_113; [L351] SORT_1 var_117 = ~var_117_arg_0; [L352] SORT_1 var_118_arg_0 = var_116; [L353] SORT_1 var_118_arg_1 = var_117; VAL [mask_SORT_1=1, mask_SORT_46=31, mask_SORT_5=7, state_48=0, state_50=0, state_56=0, state_64=0, state_69=0, state_74=0, state_7=0, state_80=1, var_110=1, var_111=1, var_116=1, var_118_arg_0=1, var_118_arg_1=-1, var_11=6, var_14=36, var_159=7, var_16=5, var_19=2544, var_21=4, var_24=9, var_26=3, var_29=54, var_31=2, var_34=18, var_36=1, var_40=0, var_42=36, var_43=36, var_4=576, var_84=0] [L354] EXPR var_118_arg_0 & var_118_arg_1 VAL [mask_SORT_1=1, mask_SORT_46=31, mask_SORT_5=7, state_48=0, state_50=0, state_56=0, state_64=0, state_69=0, state_74=0, state_7=0, state_80=1, var_110=1, var_111=1, var_116=1, var_11=6, var_14=36, var_159=7, var_16=5, var_19=2544, var_21=4, var_24=9, var_26=3, var_29=54, var_31=2, var_34=18, var_36=1, var_40=0, var_42=36, var_43=36, var_4=576, var_84=0] [L354] SORT_1 var_118 = var_118_arg_0 & var_118_arg_1; [L355] EXPR var_118 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_46=31, mask_SORT_5=7, state_48=0, state_50=0, state_56=0, state_64=0, state_69=0, state_74=0, state_7=0, state_80=1, var_110=1, var_111=1, var_116=1, var_11=6, var_14=36, var_159=7, var_16=5, var_19=2544, var_21=4, var_24=9, var_26=3, var_29=54, var_31=2, var_34=18, var_36=1, var_40=0, var_42=36, var_43=36, var_4=576, var_84=0] [L355] var_118 = var_118 & mask_SORT_1 [L356] SORT_1 bad_119_arg_0 = var_118; [L357] CALL __VERIFIER_assert(!(bad_119_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 253 locations, 377 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 74.6s, OverallIterations: 51, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 35.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 20341 SdHoareTripleChecker+Valid, 30.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 20341 mSDsluCounter, 52289 SdHoareTripleChecker+Invalid, 26.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 41641 mSDsCounter, 72 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 63708 IncrementalHoareTripleChecker+Invalid, 63780 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 72 mSolverCounterUnsat, 10648 mSDtfsCounter, 63708 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 573 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 482 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 950 ImplicationChecksByTransitivity, 7.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=657occurred in iteration=50, InterpolantAutomatonStates: 395, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 50 MinimizatonAttempts, 4416 StatesRemovedByMinimization, 46 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 7.3s SatisfiabilityAnalysisTime, 29.4s InterpolantComputationTime, 4427 NumberOfCodeBlocks, 4427 NumberOfCodeBlocksAsserted, 51 NumberOfCheckSat, 4280 ConstructedInterpolants, 0 QuantifiedInterpolants, 26642 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 50 InterpolantComputations, 50 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-16 22:45:31,211 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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/hardware-verification-bv/btor2c-lazyMod.v_non-pipelined-microprocessor.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.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 64bit --witnessprinter.graph.data.programhash 013fc4a889617293119ec23d82d2fd495e032e9bab1929da87247ff74d1355ed --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 22:45:33,129 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 22:45:33,208 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2025-03-16 22:45:33,215 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 22:45:33,218 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 22:45:33,243 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 22:45:33,243 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 22:45:33,243 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 22:45:33,244 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 22:45:33,244 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 22:45:33,244 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 22:45:33,244 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 22:45:33,244 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 22:45:33,244 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 22:45:33,244 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 22:45:33,244 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 22:45:33,244 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 22:45:33,244 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 22:45:33,244 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 22:45:33,244 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 22:45:33,245 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 22:45:33,245 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-16 22:45:33,245 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-16 22:45:33,245 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-16 22:45:33,245 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 22:45:33,245 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 22:45:33,245 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 22:45:33,245 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 22:45:33,245 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 22:45:33,245 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 22:45:33,245 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 22:45:33,245 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 22:45:33,245 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 22:45:33,245 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 22:45:33,245 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 22:45:33,245 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 22:45:33,245 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-16 22:45:33,245 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-16 22:45:33,245 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 22:45:33,245 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 22:45:33,246 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 22:45:33,246 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 22:45:33,246 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 013fc4a889617293119ec23d82d2fd495e032e9bab1929da87247ff74d1355ed [2025-03-16 22:45:33,497 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 22:45:33,504 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 22:45:33,506 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 22:45:33,507 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 22:45:33,508 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 22:45:33,509 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.v_non-pipelined-microprocessor.c