./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_rotate32.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_rotate32.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 d551f1abb3218eb8b1d4d4572d230d291d7b92b1901f2a1ff958c149ef6299de --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 18:29:00,827 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 18:29:00,878 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-03 18:29:00,882 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 18:29:00,882 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 18:29:00,907 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 18:29:00,908 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 18:29:00,908 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 18:29:00,909 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 18:29:00,909 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 18:29:00,910 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 18:29:00,910 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 18:29:00,910 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 18:29:00,910 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 18:29:00,911 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 18:29:00,911 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 18:29:00,911 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 18:29:00,911 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 18:29:00,911 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 18:29:00,911 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 18:29:00,911 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 18:29:00,911 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 18:29:00,911 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 18:29:00,911 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 18:29:00,912 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 18:29:00,912 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 18:29:00,912 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 18:29:00,912 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 18:29:00,912 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 18:29:00,912 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 18:29:00,912 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 18:29:00,912 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 18:29:00,912 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 18:29:00,913 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 18:29:00,913 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 18:29:00,913 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 18:29:00,913 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 18:29:00,913 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 18:29:00,913 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 18:29:00,913 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 18:29:00,913 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 -> d551f1abb3218eb8b1d4d4572d230d291d7b92b1901f2a1ff958c149ef6299de [2025-03-03 18:29:01,141 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 18:29:01,148 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 18:29:01,151 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 18:29:01,152 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 18:29:01,152 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 18:29:01,153 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_rotate32.c [2025-03-03 18:29:02,264 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f5f7f2bb/733fbf1458bc4b83a2556054578994fc/FLAG7e307b4e0 [2025-03-03 18:29:02,555 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 18:29:02,556 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_rotate32.c [2025-03-03 18:29:02,565 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f5f7f2bb/733fbf1458bc4b83a2556054578994fc/FLAG7e307b4e0 [2025-03-03 18:29:02,841 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f5f7f2bb/733fbf1458bc4b83a2556054578994fc [2025-03-03 18:29:02,843 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 18:29:02,844 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 18:29:02,845 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 18:29:02,845 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 18:29:02,848 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 18:29:02,849 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 06:29:02" (1/1) ... [2025-03-03 18:29:02,850 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@674a3414 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:29:02, skipping insertion in model container [2025-03-03 18:29:02,850 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 06:29:02" (1/1) ... [2025-03-03 18:29:02,864 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 18:29:02,963 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.vis_QF_BV_rotate32.c[1258,1271] [2025-03-03 18:29:03,006 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 18:29:03,013 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 18:29:03,020 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.vis_QF_BV_rotate32.c[1258,1271] [2025-03-03 18:29:03,051 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 18:29:03,065 INFO L204 MainTranslator]: Completed translation [2025-03-03 18:29:03,066 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:29:03 WrapperNode [2025-03-03 18:29:03,066 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 18:29:03,067 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 18:29:03,067 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 18:29:03,067 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 18:29:03,073 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:29:03" (1/1) ... [2025-03-03 18:29:03,080 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:29:03" (1/1) ... [2025-03-03 18:29:03,116 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 318 [2025-03-03 18:29:03,117 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 18:29:03,117 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 18:29:03,117 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 18:29:03,117 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 18:29:03,123 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:29:03" (1/1) ... [2025-03-03 18:29:03,123 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:29:03" (1/1) ... [2025-03-03 18:29:03,127 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:29:03" (1/1) ... [2025-03-03 18:29:03,139 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 18:29:03,139 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:29:03" (1/1) ... [2025-03-03 18:29:03,139 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:29:03" (1/1) ... [2025-03-03 18:29:03,146 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:29:03" (1/1) ... [2025-03-03 18:29:03,152 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:29:03" (1/1) ... [2025-03-03 18:29:03,154 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:29:03" (1/1) ... [2025-03-03 18:29:03,160 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:29:03" (1/1) ... [2025-03-03 18:29:03,164 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 18:29:03,167 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 18:29:03,167 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 18:29:03,167 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 18:29:03,168 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:29:03" (1/1) ... [2025-03-03 18:29:03,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 18:29:03,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 18:29:03,194 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 18:29:03,199 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 18:29:03,217 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 18:29:03,217 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 18:29:03,217 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 18:29:03,217 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 18:29:03,279 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 18:29:03,280 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 18:29:03,746 INFO L? ?]: Removed 172 outVars from TransFormulas that were not future-live. [2025-03-03 18:29:03,746 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 18:29:03,768 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 18:29:03,770 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 18:29:03,770 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 06:29:03 BoogieIcfgContainer [2025-03-03 18:29:03,770 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 18:29:03,772 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 18:29:03,772 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 18:29:03,775 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 18:29:03,775 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 06:29:02" (1/3) ... [2025-03-03 18:29:03,775 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28945f95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 06:29:03, skipping insertion in model container [2025-03-03 18:29:03,776 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:29:03" (2/3) ... [2025-03-03 18:29:03,776 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28945f95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 06:29:03, skipping insertion in model container [2025-03-03 18:29:03,777 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 06:29:03" (3/3) ... [2025-03-03 18:29:03,777 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_QF_BV_rotate32.c [2025-03-03 18:29:03,787 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 18:29:03,788 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.vis_QF_BV_rotate32.c that has 1 procedures, 90 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 18:29:03,836 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 18:29:03,846 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;@3407561e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 18:29:03,847 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 18:29:03,850 INFO L276 IsEmpty]: Start isEmpty. Operand has 90 states, 88 states have (on average 1.4886363636363635) internal successors, (131), 89 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:03,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-03 18:29:03,873 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:29:03,873 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:29:03,874 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:29:03,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:29:03,879 INFO L85 PathProgramCache]: Analyzing trace with hash -406527163, now seen corresponding path program 1 times [2025-03-03 18:29:03,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:29:03,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763542082] [2025-03-03 18:29:03,885 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:29:03,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:29:03,940 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-03 18:29:03,979 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-03 18:29:03,980 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:29:03,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:29:04,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:29:04,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:29:04,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763542082] [2025-03-03 18:29:04,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763542082] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:29:04,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:29:04,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 18:29:04,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618413763] [2025-03-03 18:29:04,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:29:04,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 18:29:04,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:29:04,265 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 18:29:04,265 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 18:29:04,266 INFO L87 Difference]: Start difference. First operand has 90 states, 88 states have (on average 1.4886363636363635) internal successors, (131), 89 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:04,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:29:04,350 INFO L93 Difference]: Finished difference Result 169 states and 249 transitions. [2025-03-03 18:29:04,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 18:29:04,353 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 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 13 [2025-03-03 18:29:04,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:29:04,357 INFO L225 Difference]: With dead ends: 169 [2025-03-03 18:29:04,358 INFO L226 Difference]: Without dead ends: 89 [2025-03-03 18:29:04,361 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 18:29:04,363 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 0 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 18:29:04,364 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 310 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 18:29:04,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2025-03-03 18:29:04,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2025-03-03 18:29:04,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 88 states have (on average 1.4659090909090908) internal successors, (129), 88 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:04,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 129 transitions. [2025-03-03 18:29:04,395 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 129 transitions. Word has length 13 [2025-03-03 18:29:04,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:29:04,395 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 129 transitions. [2025-03-03 18:29:04,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:04,395 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 129 transitions. [2025-03-03 18:29:04,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-03 18:29:04,396 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:29:04,396 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:29:04,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 18:29:04,396 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:29:04,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:29:04,397 INFO L85 PathProgramCache]: Analyzing trace with hash 287239092, now seen corresponding path program 1 times [2025-03-03 18:29:04,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:29:04,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333504946] [2025-03-03 18:29:04,397 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:29:04,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:29:04,409 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-03 18:29:04,428 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-03 18:29:04,428 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:29:04,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:29:04,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:29:04,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:29:04,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333504946] [2025-03-03 18:29:04,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333504946] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:29:04,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:29:04,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 18:29:04,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378392291] [2025-03-03 18:29:04,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:29:04,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 18:29:04,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:29:04,511 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 18:29:04,511 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 18:29:04,511 INFO L87 Difference]: Start difference. First operand 89 states and 129 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:04,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:29:04,577 INFO L93 Difference]: Finished difference Result 170 states and 247 transitions. [2025-03-03 18:29:04,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 18:29:04,578 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 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 14 [2025-03-03 18:29:04,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:29:04,579 INFO L225 Difference]: With dead ends: 170 [2025-03-03 18:29:04,579 INFO L226 Difference]: Without dead ends: 91 [2025-03-03 18:29:04,579 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-03 18:29:04,579 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 0 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 18:29:04,580 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 307 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 18:29:04,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-03-03 18:29:04,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2025-03-03 18:29:04,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 90 states have (on average 1.4555555555555555) internal successors, (131), 90 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:04,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 131 transitions. [2025-03-03 18:29:04,584 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 131 transitions. Word has length 14 [2025-03-03 18:29:04,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:29:04,584 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 131 transitions. [2025-03-03 18:29:04,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:04,585 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 131 transitions. [2025-03-03 18:29:04,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-03 18:29:04,585 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:29:04,585 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:29:04,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 18:29:04,585 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:29:04,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:29:04,586 INFO L85 PathProgramCache]: Analyzing trace with hash -2048980704, now seen corresponding path program 1 times [2025-03-03 18:29:04,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:29:04,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930184743] [2025-03-03 18:29:04,586 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:29:04,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:29:04,593 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-03 18:29:04,613 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-03 18:29:04,614 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:29:04,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:29:04,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:29:04,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:29:04,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930184743] [2025-03-03 18:29:04,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930184743] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:29:04,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:29:04,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 18:29:04,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830813594] [2025-03-03 18:29:04,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:29:04,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 18:29:04,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:29:04,852 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 18:29:04,852 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 18:29:04,852 INFO L87 Difference]: Start difference. First operand 91 states and 131 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:04,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:29:04,935 INFO L93 Difference]: Finished difference Result 174 states and 251 transitions. [2025-03-03 18:29:04,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 18:29:04,935 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 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 15 [2025-03-03 18:29:04,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:29:04,936 INFO L225 Difference]: With dead ends: 174 [2025-03-03 18:29:04,936 INFO L226 Difference]: Without dead ends: 93 [2025-03-03 18:29:04,936 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 18:29:04,937 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 8 mSDsluCounter, 394 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 498 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 18:29:04,937 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 498 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 18:29:04,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2025-03-03 18:29:04,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2025-03-03 18:29:04,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 92 states have (on average 1.4456521739130435) internal successors, (133), 92 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:04,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 133 transitions. [2025-03-03 18:29:04,941 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 133 transitions. Word has length 15 [2025-03-03 18:29:04,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:29:04,941 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 133 transitions. [2025-03-03 18:29:04,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:04,941 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 133 transitions. [2025-03-03 18:29:04,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-03-03 18:29:04,942 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:29:04,942 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:29:04,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 18:29:04,943 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:29:04,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:29:04,944 INFO L85 PathProgramCache]: Analyzing trace with hash 1460913900, now seen corresponding path program 1 times [2025-03-03 18:29:04,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:29:04,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655106336] [2025-03-03 18:29:04,945 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:29:04,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:29:04,972 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-03 18:29:05,048 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-03 18:29:05,048 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:29:05,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:29:05,414 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:29:05,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:29:05,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655106336] [2025-03-03 18:29:05,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655106336] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 18:29:05,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [935843494] [2025-03-03 18:29:05,415 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:29:05,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 18:29:05,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 18:29:05,418 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 18:29:05,420 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 18:29:05,503 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-03 18:29:05,567 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-03 18:29:05,567 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:29:05,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:29:05,571 INFO L256 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 56 conjuncts are in the unsatisfiable core [2025-03-03 18:29:05,579 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 18:29:06,016 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-03 18:29:06,017 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 18:29:07,079 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:29:07,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [935843494] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 18:29:07,081 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 18:29:07,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 10] total 20 [2025-03-03 18:29:07,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986566138] [2025-03-03 18:29:07,082 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 18:29:07,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-03 18:29:07,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:29:07,083 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-03 18:29:07,083 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=293, Unknown=0, NotChecked=0, Total=380 [2025-03-03 18:29:07,084 INFO L87 Difference]: Start difference. First operand 93 states and 133 transitions. Second operand has 20 states, 20 states have (on average 7.5) internal successors, (150), 20 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:07,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:29:07,327 INFO L93 Difference]: Finished difference Result 177 states and 254 transitions. [2025-03-03 18:29:07,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 18:29:07,328 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 7.5) internal successors, (150), 20 states have internal predecessors, (150), 0 states have call successors, (0), 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 54 [2025-03-03 18:29:07,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:29:07,329 INFO L225 Difference]: With dead ends: 177 [2025-03-03 18:29:07,329 INFO L226 Difference]: Without dead ends: 96 [2025-03-03 18:29:07,329 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=97, Invalid=323, Unknown=0, NotChecked=0, Total=420 [2025-03-03 18:29:07,330 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 342 mSDsluCounter, 530 mSDsCounter, 0 mSdLazyCounter, 393 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 342 SdHoareTripleChecker+Valid, 609 SdHoareTripleChecker+Invalid, 395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 393 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 18:29:07,330 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [342 Valid, 609 Invalid, 395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 393 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 18:29:07,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-03-03 18:29:07,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 94. [2025-03-03 18:29:07,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 93 states have (on average 1.4408602150537635) internal successors, (134), 93 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:07,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 134 transitions. [2025-03-03 18:29:07,335 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 134 transitions. Word has length 54 [2025-03-03 18:29:07,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:29:07,335 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 134 transitions. [2025-03-03 18:29:07,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 7.5) internal successors, (150), 20 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:07,335 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 134 transitions. [2025-03-03 18:29:07,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-03 18:29:07,336 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:29:07,336 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:29:07,346 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 18:29:07,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 18:29:07,537 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:29:07,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:29:07,538 INFO L85 PathProgramCache]: Analyzing trace with hash 2039846026, now seen corresponding path program 1 times [2025-03-03 18:29:07,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:29:07,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471054111] [2025-03-03 18:29:07,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:29:07,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:29:07,558 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-03 18:29:07,586 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-03 18:29:07,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:29:07,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:29:08,612 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:29:08,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:29:08,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471054111] [2025-03-03 18:29:08,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471054111] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:29:08,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:29:08,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2025-03-03 18:29:08,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271745963] [2025-03-03 18:29:08,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:29:08,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-03 18:29:08,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:29:08,614 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-03 18:29:08,614 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2025-03-03 18:29:08,614 INFO L87 Difference]: Start difference. First operand 94 states and 134 transitions. Second operand has 19 states, 19 states have (on average 2.8947368421052633) internal successors, (55), 19 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:09,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:29:09,027 INFO L93 Difference]: Finished difference Result 333 states and 481 transitions. [2025-03-03 18:29:09,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-03 18:29:09,028 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.8947368421052633) internal successors, (55), 19 states have internal predecessors, (55), 0 states have call successors, (0), 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 55 [2025-03-03 18:29:09,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:29:09,030 INFO L225 Difference]: With dead ends: 333 [2025-03-03 18:29:09,031 INFO L226 Difference]: Without dead ends: 249 [2025-03-03 18:29:09,032 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2025-03-03 18:29:09,032 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 205 mSDsluCounter, 1036 mSDsCounter, 0 mSdLazyCounter, 736 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 1121 SdHoareTripleChecker+Invalid, 736 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 736 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 18:29:09,033 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 1121 Invalid, 736 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 736 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 18:29:09,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2025-03-03 18:29:09,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 153. [2025-03-03 18:29:09,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 152 states have (on average 1.4407894736842106) internal successors, (219), 152 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:09,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 219 transitions. [2025-03-03 18:29:09,047 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 219 transitions. Word has length 55 [2025-03-03 18:29:09,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:29:09,047 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 219 transitions. [2025-03-03 18:29:09,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.8947368421052633) internal successors, (55), 19 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:09,047 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 219 transitions. [2025-03-03 18:29:09,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-03 18:29:09,050 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:29:09,051 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:29:09,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 18:29:09,051 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:29:09,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:29:09,051 INFO L85 PathProgramCache]: Analyzing trace with hash -2101074409, now seen corresponding path program 1 times [2025-03-03 18:29:09,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:29:09,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844096452] [2025-03-03 18:29:09,051 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:29:09,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:29:09,067 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-03 18:29:09,095 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-03 18:29:09,096 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:29:09,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:29:10,069 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:29:10,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:29:10,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844096452] [2025-03-03 18:29:10,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844096452] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:29:10,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:29:10,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2025-03-03 18:29:10,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346947174] [2025-03-03 18:29:10,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:29:10,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-03 18:29:10,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:29:10,070 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-03 18:29:10,070 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2025-03-03 18:29:10,071 INFO L87 Difference]: Start difference. First operand 153 states and 219 transitions. Second operand has 19 states, 19 states have (on average 2.9473684210526314) internal successors, (56), 19 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:10,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:29:10,478 INFO L93 Difference]: Finished difference Result 363 states and 525 transitions. [2025-03-03 18:29:10,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-03 18:29:10,479 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.9473684210526314) internal successors, (56), 19 states have internal predecessors, (56), 0 states have call successors, (0), 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 56 [2025-03-03 18:29:10,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:29:10,480 INFO L225 Difference]: With dead ends: 363 [2025-03-03 18:29:10,481 INFO L226 Difference]: Without dead ends: 279 [2025-03-03 18:29:10,481 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=60, Invalid=320, Unknown=0, NotChecked=0, Total=380 [2025-03-03 18:29:10,482 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 205 mSDsluCounter, 1092 mSDsCounter, 0 mSdLazyCounter, 711 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 1178 SdHoareTripleChecker+Invalid, 712 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 711 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 18:29:10,483 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 1178 Invalid, 712 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 711 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 18:29:10,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2025-03-03 18:29:10,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 201. [2025-03-03 18:29:10,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 200 states have (on average 1.455) internal successors, (291), 200 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:10,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 291 transitions. [2025-03-03 18:29:10,489 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 291 transitions. Word has length 56 [2025-03-03 18:29:10,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:29:10,490 INFO L471 AbstractCegarLoop]: Abstraction has 201 states and 291 transitions. [2025-03-03 18:29:10,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.9473684210526314) internal successors, (56), 19 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:10,490 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 291 transitions. [2025-03-03 18:29:10,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-03 18:29:10,491 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:29:10,491 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:29:10,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 18:29:10,491 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:29:10,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:29:10,492 INFO L85 PathProgramCache]: Analyzing trace with hash -282770291, now seen corresponding path program 1 times [2025-03-03 18:29:10,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:29:10,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333276169] [2025-03-03 18:29:10,492 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:29:10,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:29:10,505 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-03 18:29:10,528 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-03 18:29:10,528 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:29:10,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:29:11,283 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:29:11,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:29:11,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333276169] [2025-03-03 18:29:11,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333276169] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:29:11,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:29:11,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2025-03-03 18:29:11,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580579973] [2025-03-03 18:29:11,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:29:11,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-03 18:29:11,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:29:11,284 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-03 18:29:11,285 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=320, Unknown=0, NotChecked=0, Total=380 [2025-03-03 18:29:11,285 INFO L87 Difference]: Start difference. First operand 201 states and 291 transitions. Second operand has 20 states, 20 states have (on average 2.8) internal successors, (56), 20 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:11,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:29:11,637 INFO L93 Difference]: Finished difference Result 453 states and 660 transitions. [2025-03-03 18:29:11,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-03 18:29:11,638 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.8) internal successors, (56), 20 states have internal predecessors, (56), 0 states have call successors, (0), 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 56 [2025-03-03 18:29:11,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:29:11,639 INFO L225 Difference]: With dead ends: 453 [2025-03-03 18:29:11,639 INFO L226 Difference]: Without dead ends: 349 [2025-03-03 18:29:11,639 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=320, Unknown=0, NotChecked=0, Total=380 [2025-03-03 18:29:11,640 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 233 mSDsluCounter, 892 mSDsCounter, 0 mSdLazyCounter, 676 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 975 SdHoareTripleChecker+Invalid, 677 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 676 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 18:29:11,640 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 975 Invalid, 677 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 676 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 18:29:11,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2025-03-03 18:29:11,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 231. [2025-03-03 18:29:11,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 230 states have (on average 1.4565217391304348) internal successors, (335), 230 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:11,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 335 transitions. [2025-03-03 18:29:11,658 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 335 transitions. Word has length 56 [2025-03-03 18:29:11,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:29:11,658 INFO L471 AbstractCegarLoop]: Abstraction has 231 states and 335 transitions. [2025-03-03 18:29:11,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.8) internal successors, (56), 20 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:11,658 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 335 transitions. [2025-03-03 18:29:11,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-03 18:29:11,663 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:29:11,663 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:29:11,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 18:29:11,663 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:29:11,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:29:11,663 INFO L85 PathProgramCache]: Analyzing trace with hash -706024188, now seen corresponding path program 1 times [2025-03-03 18:29:11,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:29:11,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010094396] [2025-03-03 18:29:11,664 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:29:11,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:29:11,678 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-03 18:29:11,701 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-03 18:29:11,701 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:29:11,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:29:12,481 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:29:12,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:29:12,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010094396] [2025-03-03 18:29:12,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010094396] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:29:12,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:29:12,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2025-03-03 18:29:12,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296358049] [2025-03-03 18:29:12,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:29:12,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-03 18:29:12,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:29:12,483 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-03 18:29:12,483 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2025-03-03 18:29:12,483 INFO L87 Difference]: Start difference. First operand 231 states and 335 transitions. Second operand has 19 states, 19 states have (on average 2.9473684210526314) internal successors, (56), 19 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:12,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:29:12,736 INFO L93 Difference]: Finished difference Result 421 states and 611 transitions. [2025-03-03 18:29:12,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-03 18:29:12,736 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.9473684210526314) internal successors, (56), 19 states have internal predecessors, (56), 0 states have call successors, (0), 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 56 [2025-03-03 18:29:12,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:29:12,737 INFO L225 Difference]: With dead ends: 421 [2025-03-03 18:29:12,737 INFO L226 Difference]: Without dead ends: 336 [2025-03-03 18:29:12,738 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2025-03-03 18:29:12,738 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 220 mSDsluCounter, 1017 mSDsCounter, 0 mSdLazyCounter, 530 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 1113 SdHoareTripleChecker+Invalid, 530 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 530 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 18:29:12,738 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 1113 Invalid, 530 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 530 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 18:29:12,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2025-03-03 18:29:12,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 249. [2025-03-03 18:29:12,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 248 states have (on average 1.4556451612903225) internal successors, (361), 248 states have internal predecessors, (361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:12,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 361 transitions. [2025-03-03 18:29:12,747 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 361 transitions. Word has length 56 [2025-03-03 18:29:12,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:29:12,747 INFO L471 AbstractCegarLoop]: Abstraction has 249 states and 361 transitions. [2025-03-03 18:29:12,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.9473684210526314) internal successors, (56), 19 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:12,748 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 361 transitions. [2025-03-03 18:29:12,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-03 18:29:12,748 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:29:12,748 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:29:12,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 18:29:12,748 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:29:12,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:29:12,749 INFO L85 PathProgramCache]: Analyzing trace with hash 731123203, now seen corresponding path program 1 times [2025-03-03 18:29:12,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:29:12,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449414631] [2025-03-03 18:29:12,749 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:29:12,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:29:12,764 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-03 18:29:12,788 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-03 18:29:12,789 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:29:12,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:29:13,514 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:29:13,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:29:13,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449414631] [2025-03-03 18:29:13,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449414631] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:29:13,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:29:13,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2025-03-03 18:29:13,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282122119] [2025-03-03 18:29:13,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:29:13,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-03 18:29:13,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:29:13,515 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-03 18:29:13,516 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2025-03-03 18:29:13,516 INFO L87 Difference]: Start difference. First operand 249 states and 361 transitions. Second operand has 20 states, 20 states have (on average 2.8) internal successors, (56), 20 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:13,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:29:13,866 INFO L93 Difference]: Finished difference Result 537 states and 782 transitions. [2025-03-03 18:29:13,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-03 18:29:13,866 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.8) internal successors, (56), 20 states have internal predecessors, (56), 0 states have call successors, (0), 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 56 [2025-03-03 18:29:13,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:29:13,868 INFO L225 Difference]: With dead ends: 537 [2025-03-03 18:29:13,868 INFO L226 Difference]: Without dead ends: 415 [2025-03-03 18:29:13,868 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2025-03-03 18:29:13,869 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 232 mSDsluCounter, 891 mSDsCounter, 0 mSdLazyCounter, 736 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 977 SdHoareTripleChecker+Invalid, 737 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 736 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 18:29:13,869 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [232 Valid, 977 Invalid, 737 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 736 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 18:29:13,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2025-03-03 18:29:13,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 275. [2025-03-03 18:29:13,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 274 states have (on average 1.4562043795620438) internal successors, (399), 274 states have internal predecessors, (399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:13,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 399 transitions. [2025-03-03 18:29:13,878 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 399 transitions. Word has length 56 [2025-03-03 18:29:13,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:29:13,878 INFO L471 AbstractCegarLoop]: Abstraction has 275 states and 399 transitions. [2025-03-03 18:29:13,878 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.8) internal successors, (56), 20 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:13,878 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 399 transitions. [2025-03-03 18:29:13,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-03 18:29:13,878 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:29:13,878 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:29:13,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 18:29:13,879 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:29:13,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:29:13,879 INFO L85 PathProgramCache]: Analyzing trace with hash -1609393176, now seen corresponding path program 1 times [2025-03-03 18:29:13,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:29:13,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879976897] [2025-03-03 18:29:13,879 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:29:13,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:29:13,894 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-03 18:29:13,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-03 18:29:13,906 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:29:13,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:29:14,523 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:29:14,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:29:14,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879976897] [2025-03-03 18:29:14,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879976897] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:29:14,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:29:14,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2025-03-03 18:29:14,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760598613] [2025-03-03 18:29:14,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:29:14,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-03 18:29:14,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:29:14,525 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-03 18:29:14,525 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=489, Unknown=0, NotChecked=0, Total=552 [2025-03-03 18:29:14,525 INFO L87 Difference]: Start difference. First operand 275 states and 399 transitions. Second operand has 24 states, 24 states have (on average 2.3333333333333335) internal successors, (56), 24 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:14,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:29:14,851 INFO L93 Difference]: Finished difference Result 629 states and 918 transitions. [2025-03-03 18:29:14,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-03 18:29:14,851 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.3333333333333335) internal successors, (56), 24 states have internal predecessors, (56), 0 states have call successors, (0), 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 56 [2025-03-03 18:29:14,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:29:14,853 INFO L225 Difference]: With dead ends: 629 [2025-03-03 18:29:14,853 INFO L226 Difference]: Without dead ends: 473 [2025-03-03 18:29:14,854 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=489, Unknown=0, NotChecked=0, Total=552 [2025-03-03 18:29:14,854 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 142 mSDsluCounter, 984 mSDsCounter, 0 mSdLazyCounter, 727 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 1070 SdHoareTripleChecker+Invalid, 732 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 727 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 18:29:14,854 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 1070 Invalid, 732 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 727 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 18:29:14,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2025-03-03 18:29:14,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 346. [2025-03-03 18:29:14,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 345 states have (on average 1.4521739130434783) internal successors, (501), 345 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-03 18:29:14,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 501 transitions. [2025-03-03 18:29:14,867 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 501 transitions. Word has length 56 [2025-03-03 18:29:14,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:29:14,868 INFO L471 AbstractCegarLoop]: Abstraction has 346 states and 501 transitions. [2025-03-03 18:29:14,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.3333333333333335) internal successors, (56), 24 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:14,869 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 501 transitions. [2025-03-03 18:29:14,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-03 18:29:14,869 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:29:14,870 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:29:14,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 18:29:14,870 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:29:14,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:29:14,870 INFO L85 PathProgramCache]: Analyzing trace with hash 197715104, now seen corresponding path program 1 times [2025-03-03 18:29:14,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:29:14,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608142123] [2025-03-03 18:29:14,870 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:29:14,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:29:14,883 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-03 18:29:14,916 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-03 18:29:14,916 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:29:14,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:29:15,580 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:29:15,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:29:15,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608142123] [2025-03-03 18:29:15,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608142123] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:29:15,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:29:15,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-03 18:29:15,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415733688] [2025-03-03 18:29:15,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:29:15,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-03 18:29:15,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:29:15,583 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-03 18:29:15,583 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2025-03-03 18:29:15,583 INFO L87 Difference]: Start difference. First operand 346 states and 501 transitions. Second operand has 16 states, 16 states have (on average 3.5625) internal successors, (57), 16 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:16,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:29:16,142 INFO L93 Difference]: Finished difference Result 657 states and 952 transitions. [2025-03-03 18:29:16,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-03 18:29:16,143 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.5625) internal successors, (57), 16 states have internal predecessors, (57), 0 states have call successors, (0), 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 57 [2025-03-03 18:29:16,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:29:16,145 INFO L225 Difference]: With dead ends: 657 [2025-03-03 18:29:16,145 INFO L226 Difference]: Without dead ends: 573 [2025-03-03 18:29:16,145 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2025-03-03 18:29:16,145 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 415 mSDsluCounter, 1003 mSDsCounter, 0 mSdLazyCounter, 958 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 415 SdHoareTripleChecker+Valid, 1117 SdHoareTripleChecker+Invalid, 961 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 958 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 18:29:16,146 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [415 Valid, 1117 Invalid, 961 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 958 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 18:29:16,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2025-03-03 18:29:16,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 406. [2025-03-03 18:29:16,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 406 states, 405 states have (on average 1.4567901234567902) internal successors, (590), 405 states have internal predecessors, (590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:16,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 590 transitions. [2025-03-03 18:29:16,153 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 590 transitions. Word has length 57 [2025-03-03 18:29:16,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:29:16,153 INFO L471 AbstractCegarLoop]: Abstraction has 406 states and 590 transitions. [2025-03-03 18:29:16,153 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.5625) internal successors, (57), 16 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:16,154 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 590 transitions. [2025-03-03 18:29:16,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-03 18:29:16,154 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:29:16,154 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:29:16,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 18:29:16,155 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:29:16,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:29:16,155 INFO L85 PathProgramCache]: Analyzing trace with hash 801579620, now seen corresponding path program 1 times [2025-03-03 18:29:16,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:29:16,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818212692] [2025-03-03 18:29:16,155 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:29:16,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:29:16,168 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-03 18:29:16,177 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-03 18:29:16,177 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:29:16,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:29:16,608 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:29:16,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:29:16,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818212692] [2025-03-03 18:29:16,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818212692] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:29:16,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:29:16,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2025-03-03 18:29:16,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694501751] [2025-03-03 18:29:16,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:29:16,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-03 18:29:16,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:29:16,610 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-03 18:29:16,610 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2025-03-03 18:29:16,610 INFO L87 Difference]: Start difference. First operand 406 states and 590 transitions. Second operand has 19 states, 19 states have (on average 3.0) internal successors, (57), 19 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:16,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:29:16,826 INFO L93 Difference]: Finished difference Result 817 states and 1193 transitions. [2025-03-03 18:29:16,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-03 18:29:16,827 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.0) internal successors, (57), 19 states have internal predecessors, (57), 0 states have call successors, (0), 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 57 [2025-03-03 18:29:16,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:29:16,829 INFO L225 Difference]: With dead ends: 817 [2025-03-03 18:29:16,829 INFO L226 Difference]: Without dead ends: 647 [2025-03-03 18:29:16,829 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2025-03-03 18:29:16,830 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 147 mSDsluCounter, 753 mSDsCounter, 0 mSdLazyCounter, 453 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 842 SdHoareTripleChecker+Invalid, 455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 453 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 18:29:16,830 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 842 Invalid, 455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 453 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 18:29:16,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 647 states. [2025-03-03 18:29:16,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 647 to 526. [2025-03-03 18:29:16,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 526 states, 525 states have (on average 1.457142857142857) internal successors, (765), 525 states have internal predecessors, (765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:16,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 765 transitions. [2025-03-03 18:29:16,845 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 765 transitions. Word has length 57 [2025-03-03 18:29:16,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:29:16,845 INFO L471 AbstractCegarLoop]: Abstraction has 526 states and 765 transitions. [2025-03-03 18:29:16,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.0) internal successors, (57), 19 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:16,845 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 765 transitions. [2025-03-03 18:29:16,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-03 18:29:16,850 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:29:16,850 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:29:16,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 18:29:16,851 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:29:16,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:29:16,851 INFO L85 PathProgramCache]: Analyzing trace with hash -225538793, now seen corresponding path program 1 times [2025-03-03 18:29:16,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:29:16,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062496760] [2025-03-03 18:29:16,851 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:29:16,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:29:16,865 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-03 18:29:16,888 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-03 18:29:16,888 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:29:16,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:29:17,438 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:29:17,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:29:17,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062496760] [2025-03-03 18:29:17,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062496760] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:29:17,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:29:17,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2025-03-03 18:29:17,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711345856] [2025-03-03 18:29:17,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:29:17,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-03 18:29:17,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:29:17,440 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-03 18:29:17,440 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=320, Unknown=0, NotChecked=0, Total=380 [2025-03-03 18:29:17,440 INFO L87 Difference]: Start difference. First operand 526 states and 765 transitions. Second operand has 20 states, 20 states have (on average 2.85) internal successors, (57), 20 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:17,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:29:17,764 INFO L93 Difference]: Finished difference Result 825 states and 1194 transitions. [2025-03-03 18:29:17,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-03 18:29:17,765 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.85) internal successors, (57), 20 states have internal predecessors, (57), 0 states have call successors, (0), 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 57 [2025-03-03 18:29:17,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:29:17,767 INFO L225 Difference]: With dead ends: 825 [2025-03-03 18:29:17,767 INFO L226 Difference]: Without dead ends: 689 [2025-03-03 18:29:17,767 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=320, Unknown=0, NotChecked=0, Total=380 [2025-03-03 18:29:17,768 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 177 mSDsluCounter, 1433 mSDsCounter, 0 mSdLazyCounter, 755 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 1528 SdHoareTripleChecker+Invalid, 756 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 755 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 18:29:17,768 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 1528 Invalid, 756 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 755 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 18:29:17,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 689 states. [2025-03-03 18:29:17,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 689 to 547. [2025-03-03 18:29:17,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 547 states, 546 states have (on average 1.456043956043956) internal successors, (795), 546 states have internal predecessors, (795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:17,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 795 transitions. [2025-03-03 18:29:17,781 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 795 transitions. Word has length 57 [2025-03-03 18:29:17,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:29:17,781 INFO L471 AbstractCegarLoop]: Abstraction has 547 states and 795 transitions. [2025-03-03 18:29:17,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.85) internal successors, (57), 20 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:17,781 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 795 transitions. [2025-03-03 18:29:17,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-03 18:29:17,783 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:29:17,783 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:29:17,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 18:29:17,783 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:29:17,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:29:17,784 INFO L85 PathProgramCache]: Analyzing trace with hash 1211608598, now seen corresponding path program 1 times [2025-03-03 18:29:17,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:29:17,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600108701] [2025-03-03 18:29:17,784 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:29:17,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:29:17,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-03 18:29:17,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-03 18:29:17,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:29:17,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:29:18,561 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:29:18,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:29:18,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600108701] [2025-03-03 18:29:18,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600108701] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:29:18,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:29:18,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2025-03-03 18:29:18,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391547026] [2025-03-03 18:29:18,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:29:18,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-03 18:29:18,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:29:18,562 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-03 18:29:18,563 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2025-03-03 18:29:18,563 INFO L87 Difference]: Start difference. First operand 547 states and 795 transitions. Second operand has 20 states, 20 states have (on average 2.85) internal successors, (57), 20 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:18,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:29:18,904 INFO L93 Difference]: Finished difference Result 894 states and 1297 transitions. [2025-03-03 18:29:18,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-03 18:29:18,905 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.85) internal successors, (57), 20 states have internal predecessors, (57), 0 states have call successors, (0), 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 57 [2025-03-03 18:29:18,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:29:18,907 INFO L225 Difference]: With dead ends: 894 [2025-03-03 18:29:18,907 INFO L226 Difference]: Without dead ends: 761 [2025-03-03 18:29:18,908 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=354, Unknown=0, NotChecked=0, Total=420 [2025-03-03 18:29:18,908 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 161 mSDsluCounter, 885 mSDsCounter, 0 mSdLazyCounter, 662 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 972 SdHoareTripleChecker+Invalid, 663 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 662 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 18:29:18,908 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 972 Invalid, 663 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 662 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 18:29:18,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 761 states. [2025-03-03 18:29:18,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 761 to 573. [2025-03-03 18:29:18,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 573 states, 572 states have (on average 1.4580419580419581) internal successors, (834), 572 states have internal predecessors, (834), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:18,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 573 states and 834 transitions. [2025-03-03 18:29:18,920 INFO L78 Accepts]: Start accepts. Automaton has 573 states and 834 transitions. Word has length 57 [2025-03-03 18:29:18,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:29:18,920 INFO L471 AbstractCegarLoop]: Abstraction has 573 states and 834 transitions. [2025-03-03 18:29:18,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.85) internal successors, (57), 20 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:18,920 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 834 transitions. [2025-03-03 18:29:18,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-03 18:29:18,921 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:29:18,921 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:29:18,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 18:29:18,921 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:29:18,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:29:18,922 INFO L85 PathProgramCache]: Analyzing trace with hash -1128907781, now seen corresponding path program 1 times [2025-03-03 18:29:18,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:29:18,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306476724] [2025-03-03 18:29:18,922 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:29:18,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:29:18,934 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-03 18:29:18,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-03 18:29:18,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:29:18,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:29:19,717 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:29:19,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:29:19,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306476724] [2025-03-03 18:29:19,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306476724] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:29:19,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:29:19,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2025-03-03 18:29:19,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884239282] [2025-03-03 18:29:19,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:29:19,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-03 18:29:19,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:29:19,720 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-03 18:29:19,720 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=362, Unknown=0, NotChecked=0, Total=420 [2025-03-03 18:29:19,720 INFO L87 Difference]: Start difference. First operand 573 states and 834 transitions. Second operand has 21 states, 21 states have (on average 2.7142857142857144) internal successors, (57), 21 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:20,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:29:20,162 INFO L93 Difference]: Finished difference Result 1045 states and 1518 transitions. [2025-03-03 18:29:20,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-03 18:29:20,163 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.7142857142857144) internal successors, (57), 21 states have internal predecessors, (57), 0 states have call successors, (0), 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 57 [2025-03-03 18:29:20,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:29:20,165 INFO L225 Difference]: With dead ends: 1045 [2025-03-03 18:29:20,165 INFO L226 Difference]: Without dead ends: 861 [2025-03-03 18:29:20,166 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=62, Invalid=400, Unknown=0, NotChecked=0, Total=462 [2025-03-03 18:29:20,166 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 173 mSDsluCounter, 1011 mSDsCounter, 0 mSdLazyCounter, 812 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 1095 SdHoareTripleChecker+Invalid, 815 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 812 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 18:29:20,167 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 1095 Invalid, 815 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 812 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 18:29:20,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 861 states. [2025-03-03 18:29:20,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 861 to 620. [2025-03-03 18:29:20,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 620 states, 619 states have (on average 1.4588045234248788) internal successors, (903), 619 states have internal predecessors, (903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:20,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 903 transitions. [2025-03-03 18:29:20,180 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 903 transitions. Word has length 57 [2025-03-03 18:29:20,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:29:20,180 INFO L471 AbstractCegarLoop]: Abstraction has 620 states and 903 transitions. [2025-03-03 18:29:20,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.7142857142857144) internal successors, (57), 21 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:20,180 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 903 transitions. [2025-03-03 18:29:20,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-03 18:29:20,182 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:29:20,182 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:29:20,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 18:29:20,182 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:29:20,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:29:20,182 INFO L85 PathProgramCache]: Analyzing trace with hash -522979323, now seen corresponding path program 1 times [2025-03-03 18:29:20,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:29:20,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081736971] [2025-03-03 18:29:20,183 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:29:20,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:29:20,198 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-03 18:29:20,219 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-03 18:29:20,219 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:29:20,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:29:20,902 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:29:20,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:29:20,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081736971] [2025-03-03 18:29:20,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081736971] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:29:20,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:29:20,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2025-03-03 18:29:20,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387148587] [2025-03-03 18:29:20,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:29:20,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-03 18:29:20,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:29:20,903 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-03 18:29:20,904 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=327, Unknown=0, NotChecked=0, Total=380 [2025-03-03 18:29:20,904 INFO L87 Difference]: Start difference. First operand 620 states and 903 transitions. Second operand has 20 states, 20 states have (on average 2.85) internal successors, (57), 20 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:21,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:29:21,216 INFO L93 Difference]: Finished difference Result 984 states and 1429 transitions. [2025-03-03 18:29:21,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-03 18:29:21,217 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.85) internal successors, (57), 20 states have internal predecessors, (57), 0 states have call successors, (0), 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 57 [2025-03-03 18:29:21,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:29:21,219 INFO L225 Difference]: With dead ends: 984 [2025-03-03 18:29:21,219 INFO L226 Difference]: Without dead ends: 831 [2025-03-03 18:29:21,219 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2025-03-03 18:29:21,220 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 143 mSDsluCounter, 1157 mSDsCounter, 0 mSdLazyCounter, 816 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 1245 SdHoareTripleChecker+Invalid, 818 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 816 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 18:29:21,220 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 1245 Invalid, 818 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 816 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 18:29:21,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 831 states. [2025-03-03 18:29:21,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 831 to 689. [2025-03-03 18:29:21,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 689 states, 688 states have (on average 1.4607558139534884) internal successors, (1005), 688 states have internal predecessors, (1005), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:21,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 689 states to 689 states and 1005 transitions. [2025-03-03 18:29:21,229 INFO L78 Accepts]: Start accepts. Automaton has 689 states and 1005 transitions. Word has length 57 [2025-03-03 18:29:21,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:29:21,229 INFO L471 AbstractCegarLoop]: Abstraction has 689 states and 1005 transitions. [2025-03-03 18:29:21,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.85) internal successors, (57), 20 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:21,230 INFO L276 IsEmpty]: Start isEmpty. Operand 689 states and 1005 transitions. [2025-03-03 18:29:21,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-03 18:29:21,230 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:29:21,231 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:29:21,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 18:29:21,231 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:29:21,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:29:21,231 INFO L85 PathProgramCache]: Analyzing trace with hash 662714919, now seen corresponding path program 1 times [2025-03-03 18:29:21,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:29:21,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356733493] [2025-03-03 18:29:21,231 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:29:21,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:29:21,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-03 18:29:21,260 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-03 18:29:21,260 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:29:21,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:29:21,494 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:29:21,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:29:21,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356733493] [2025-03-03 18:29:21,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356733493] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:29:21,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:29:21,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-03 18:29:21,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631907323] [2025-03-03 18:29:21,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:29:21,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 18:29:21,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:29:21,495 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 18:29:21,495 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-03-03 18:29:21,495 INFO L87 Difference]: Start difference. First operand 689 states and 1005 transitions. Second operand has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:21,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:29:21,592 INFO L93 Difference]: Finished difference Result 1048 states and 1527 transitions. [2025-03-03 18:29:21,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 18:29:21,592 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 0 states have call successors, (0), 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 57 [2025-03-03 18:29:21,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:29:21,594 INFO L225 Difference]: With dead ends: 1048 [2025-03-03 18:29:21,594 INFO L226 Difference]: Without dead ends: 820 [2025-03-03 18:29:21,595 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-03-03 18:29:21,595 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 98 mSDsluCounter, 562 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 661 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 18:29:21,595 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 661 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 18:29:21,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 820 states. [2025-03-03 18:29:21,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 820 to 751. [2025-03-03 18:29:21,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 751 states, 750 states have (on average 1.4546666666666668) internal successors, (1091), 750 states have internal predecessors, (1091), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:21,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 751 states to 751 states and 1091 transitions. [2025-03-03 18:29:21,604 INFO L78 Accepts]: Start accepts. Automaton has 751 states and 1091 transitions. Word has length 57 [2025-03-03 18:29:21,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:29:21,604 INFO L471 AbstractCegarLoop]: Abstraction has 751 states and 1091 transitions. [2025-03-03 18:29:21,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:21,605 INFO L276 IsEmpty]: Start isEmpty. Operand 751 states and 1091 transitions. [2025-03-03 18:29:21,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-03 18:29:21,606 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:29:21,606 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:29:21,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 18:29:21,606 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:29:21,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:29:21,606 INFO L85 PathProgramCache]: Analyzing trace with hash -689980222, now seen corresponding path program 1 times [2025-03-03 18:29:21,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:29:21,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374229791] [2025-03-03 18:29:21,607 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:29:21,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:29:21,617 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-03 18:29:21,628 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-03 18:29:21,628 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:29:21,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:29:21,864 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:29:21,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:29:21,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374229791] [2025-03-03 18:29:21,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374229791] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:29:21,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:29:21,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-03 18:29:21,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365196706] [2025-03-03 18:29:21,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:29:21,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 18:29:21,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:29:21,866 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 18:29:21,866 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-03-03 18:29:21,866 INFO L87 Difference]: Start difference. First operand 751 states and 1091 transitions. Second operand has 11 states, 11 states have (on average 5.181818181818182) internal successors, (57), 11 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:21,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:29:21,970 INFO L93 Difference]: Finished difference Result 1030 states and 1493 transitions. [2025-03-03 18:29:21,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-03 18:29:21,970 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.181818181818182) internal successors, (57), 11 states have internal predecessors, (57), 0 states have call successors, (0), 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 57 [2025-03-03 18:29:21,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:29:21,972 INFO L225 Difference]: With dead ends: 1030 [2025-03-03 18:29:21,972 INFO L226 Difference]: Without dead ends: 811 [2025-03-03 18:29:21,973 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-03-03 18:29:21,974 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 84 mSDsluCounter, 685 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 785 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 18:29:21,974 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 785 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 18:29:21,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 811 states. [2025-03-03 18:29:21,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 811 to 739. [2025-03-03 18:29:21,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 739 states, 738 states have (on average 1.4390243902439024) internal successors, (1062), 738 states have internal predecessors, (1062), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:21,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 739 states to 739 states and 1062 transitions. [2025-03-03 18:29:21,983 INFO L78 Accepts]: Start accepts. Automaton has 739 states and 1062 transitions. Word has length 57 [2025-03-03 18:29:21,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:29:21,983 INFO L471 AbstractCegarLoop]: Abstraction has 739 states and 1062 transitions. [2025-03-03 18:29:21,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.181818181818182) internal successors, (57), 11 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:21,983 INFO L276 IsEmpty]: Start isEmpty. Operand 739 states and 1062 transitions. [2025-03-03 18:29:21,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-03 18:29:21,984 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:29:21,984 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:29:21,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 18:29:21,984 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:29:21,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:29:21,985 INFO L85 PathProgramCache]: Analyzing trace with hash -1385252832, now seen corresponding path program 1 times [2025-03-03 18:29:21,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:29:21,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288282939] [2025-03-03 18:29:21,985 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:29:21,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:29:21,996 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-03 18:29:22,003 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-03 18:29:22,003 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:29:22,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:29:22,074 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:29:22,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:29:22,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288282939] [2025-03-03 18:29:22,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288282939] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:29:22,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:29:22,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 18:29:22,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112893451] [2025-03-03 18:29:22,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:29:22,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 18:29:22,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:29:22,075 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 18:29:22,075 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 18:29:22,075 INFO L87 Difference]: Start difference. First operand 739 states and 1062 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:22,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:29:22,142 INFO L93 Difference]: Finished difference Result 1039 states and 1491 transitions. [2025-03-03 18:29:22,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 18:29:22,142 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 0 states have call successors, (0), 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 57 [2025-03-03 18:29:22,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:29:22,144 INFO L225 Difference]: With dead ends: 1039 [2025-03-03 18:29:22,144 INFO L226 Difference]: Without dead ends: 746 [2025-03-03 18:29:22,144 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-03 18:29:22,145 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 39 mSDsluCounter, 392 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 18:29:22,145 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 494 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 18:29:22,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 746 states. [2025-03-03 18:29:22,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 746 to 744. [2025-03-03 18:29:22,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 744 states, 743 states have (on average 1.414535666218035) internal successors, (1051), 743 states have internal predecessors, (1051), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:22,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 744 states to 744 states and 1051 transitions. [2025-03-03 18:29:22,154 INFO L78 Accepts]: Start accepts. Automaton has 744 states and 1051 transitions. Word has length 57 [2025-03-03 18:29:22,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:29:22,154 INFO L471 AbstractCegarLoop]: Abstraction has 744 states and 1051 transitions. [2025-03-03 18:29:22,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:22,154 INFO L276 IsEmpty]: Start isEmpty. Operand 744 states and 1051 transitions. [2025-03-03 18:29:22,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-03 18:29:22,155 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:29:22,155 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:29:22,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-03 18:29:22,155 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:29:22,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:29:22,155 INFO L85 PathProgramCache]: Analyzing trace with hash 1195507845, now seen corresponding path program 1 times [2025-03-03 18:29:22,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:29:22,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295245844] [2025-03-03 18:29:22,156 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:29:22,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:29:22,167 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-03 18:29:22,199 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-03 18:29:22,200 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:29:22,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:29:22,294 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:29:22,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:29:22,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295245844] [2025-03-03 18:29:22,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295245844] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:29:22,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:29:22,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 18:29:22,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898168949] [2025-03-03 18:29:22,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:29:22,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 18:29:22,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:29:22,295 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 18:29:22,295 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 18:29:22,295 INFO L87 Difference]: Start difference. First operand 744 states and 1051 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:22,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:29:22,370 INFO L93 Difference]: Finished difference Result 972 states and 1374 transitions. [2025-03-03 18:29:22,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 18:29:22,371 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 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 57 [2025-03-03 18:29:22,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:29:22,373 INFO L225 Difference]: With dead ends: 972 [2025-03-03 18:29:22,373 INFO L226 Difference]: Without dead ends: 666 [2025-03-03 18:29:22,373 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-03 18:29:22,374 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 31 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 18:29:22,374 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 389 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 18:29:22,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2025-03-03 18:29:22,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 664. [2025-03-03 18:29:22,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 664 states, 663 states have (on average 1.392156862745098) internal successors, (923), 663 states have internal predecessors, (923), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:22,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 664 states to 664 states and 923 transitions. [2025-03-03 18:29:22,385 INFO L78 Accepts]: Start accepts. Automaton has 664 states and 923 transitions. Word has length 57 [2025-03-03 18:29:22,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:29:22,385 INFO L471 AbstractCegarLoop]: Abstraction has 664 states and 923 transitions. [2025-03-03 18:29:22,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:22,385 INFO L276 IsEmpty]: Start isEmpty. Operand 664 states and 923 transitions. [2025-03-03 18:29:22,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-03 18:29:22,386 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:29:22,386 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:29:22,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-03 18:29:22,387 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:29:22,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:29:22,387 INFO L85 PathProgramCache]: Analyzing trace with hash 643680566, now seen corresponding path program 1 times [2025-03-03 18:29:22,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:29:22,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175251592] [2025-03-03 18:29:22,387 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:29:22,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:29:22,399 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-03 18:29:22,418 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-03 18:29:22,418 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:29:22,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:29:22,601 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:29:22,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:29:22,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175251592] [2025-03-03 18:29:22,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175251592] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:29:22,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:29:22,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 18:29:22,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572290398] [2025-03-03 18:29:22,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:29:22,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 18:29:22,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:29:22,603 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 18:29:22,603 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-03 18:29:22,603 INFO L87 Difference]: Start difference. First operand 664 states and 923 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:22,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:29:22,664 INFO L93 Difference]: Finished difference Result 954 states and 1323 transitions. [2025-03-03 18:29:22,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 18:29:22,664 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 0 states have call successors, (0), 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 57 [2025-03-03 18:29:22,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:29:22,665 INFO L225 Difference]: With dead ends: 954 [2025-03-03 18:29:22,666 INFO L226 Difference]: Without dead ends: 678 [2025-03-03 18:29:22,666 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-03 18:29:22,666 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 31 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 450 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 18:29:22,667 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 450 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 18:29:22,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 678 states. [2025-03-03 18:29:22,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 678 to 676. [2025-03-03 18:29:22,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 676 states, 675 states have (on average 1.3555555555555556) internal successors, (915), 675 states have internal predecessors, (915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:22,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 676 states to 676 states and 915 transitions. [2025-03-03 18:29:22,674 INFO L78 Accepts]: Start accepts. Automaton has 676 states and 915 transitions. Word has length 57 [2025-03-03 18:29:22,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:29:22,674 INFO L471 AbstractCegarLoop]: Abstraction has 676 states and 915 transitions. [2025-03-03 18:29:22,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:22,674 INFO L276 IsEmpty]: Start isEmpty. Operand 676 states and 915 transitions. [2025-03-03 18:29:22,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-03 18:29:22,675 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:29:22,675 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:29:22,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-03 18:29:22,675 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:29:22,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:29:22,676 INFO L85 PathProgramCache]: Analyzing trace with hash 1052018257, now seen corresponding path program 1 times [2025-03-03 18:29:22,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:29:22,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300769927] [2025-03-03 18:29:22,676 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:29:22,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:29:22,689 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-03 18:29:22,704 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-03 18:29:22,704 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:29:22,704 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:29:22,865 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:29:22,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:29:22,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300769927] [2025-03-03 18:29:22,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300769927] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:29:22,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:29:22,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 18:29:22,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901875196] [2025-03-03 18:29:22,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:29:22,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 18:29:22,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:29:22,867 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 18:29:22,867 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-03 18:29:22,867 INFO L87 Difference]: Start difference. First operand 676 states and 915 transitions. Second operand has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:22,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:29:22,939 INFO L93 Difference]: Finished difference Result 926 states and 1267 transitions. [2025-03-03 18:29:22,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 18:29:22,940 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 0 states have call successors, (0), 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 57 [2025-03-03 18:29:22,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:29:22,942 INFO L225 Difference]: With dead ends: 926 [2025-03-03 18:29:22,942 INFO L226 Difference]: Without dead ends: 673 [2025-03-03 18:29:22,942 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-03 18:29:22,943 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 31 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 553 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 18:29:22,944 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 553 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 18:29:22,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2025-03-03 18:29:22,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 671. [2025-03-03 18:29:22,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 671 states, 670 states have (on average 1.3388059701492536) internal successors, (897), 670 states have internal predecessors, (897), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:22,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 671 states to 671 states and 897 transitions. [2025-03-03 18:29:22,952 INFO L78 Accepts]: Start accepts. Automaton has 671 states and 897 transitions. Word has length 57 [2025-03-03 18:29:22,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:29:22,952 INFO L471 AbstractCegarLoop]: Abstraction has 671 states and 897 transitions. [2025-03-03 18:29:22,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:22,952 INFO L276 IsEmpty]: Start isEmpty. Operand 671 states and 897 transitions. [2025-03-03 18:29:22,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-03 18:29:22,953 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:29:22,953 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:29:22,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-03 18:29:22,954 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:29:22,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:29:22,954 INFO L85 PathProgramCache]: Analyzing trace with hash -421295245, now seen corresponding path program 1 times [2025-03-03 18:29:22,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:29:22,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780791188] [2025-03-03 18:29:22,955 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:29:22,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:29:22,966 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-03 18:29:22,975 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-03 18:29:22,975 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:29:22,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:29:23,306 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:29:23,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:29:23,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780791188] [2025-03-03 18:29:23,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1780791188] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:29:23,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:29:23,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-03-03 18:29:23,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357125556] [2025-03-03 18:29:23,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:29:23,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-03 18:29:23,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:29:23,307 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-03 18:29:23,308 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2025-03-03 18:29:23,308 INFO L87 Difference]: Start difference. First operand 671 states and 897 transitions. Second operand has 17 states, 17 states have (on average 3.3529411764705883) internal successors, (57), 17 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:23,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:29:23,491 INFO L93 Difference]: Finished difference Result 1003 states and 1376 transitions. [2025-03-03 18:29:23,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-03 18:29:23,492 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.3529411764705883) internal successors, (57), 17 states have internal predecessors, (57), 0 states have call successors, (0), 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 57 [2025-03-03 18:29:23,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:29:23,493 INFO L225 Difference]: With dead ends: 1003 [2025-03-03 18:29:23,494 INFO L226 Difference]: Without dead ends: 802 [2025-03-03 18:29:23,494 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2025-03-03 18:29:23,495 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 57 mSDsluCounter, 846 mSDsCounter, 0 mSdLazyCounter, 437 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 937 SdHoareTripleChecker+Invalid, 439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 18:29:23,495 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 937 Invalid, 439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 437 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 18:29:23,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 802 states. [2025-03-03 18:29:23,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 802 to 742. [2025-03-03 18:29:23,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 742 states, 741 states have (on average 1.3346828609986505) internal successors, (989), 741 states have internal predecessors, (989), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:23,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 742 states to 742 states and 989 transitions. [2025-03-03 18:29:23,503 INFO L78 Accepts]: Start accepts. Automaton has 742 states and 989 transitions. Word has length 57 [2025-03-03 18:29:23,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:29:23,503 INFO L471 AbstractCegarLoop]: Abstraction has 742 states and 989 transitions. [2025-03-03 18:29:23,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.3529411764705883) internal successors, (57), 17 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:23,503 INFO L276 IsEmpty]: Start isEmpty. Operand 742 states and 989 transitions. [2025-03-03 18:29:23,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-03 18:29:23,505 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:29:23,505 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:29:23,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-03 18:29:23,505 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:29:23,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:29:23,506 INFO L85 PathProgramCache]: Analyzing trace with hash -29588648, now seen corresponding path program 1 times [2025-03-03 18:29:23,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:29:23,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681092893] [2025-03-03 18:29:23,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:29:23,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:29:23,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-03 18:29:23,541 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-03 18:29:23,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:29:23,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:29:23,872 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:29:23,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:29:23,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681092893] [2025-03-03 18:29:23,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681092893] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:29:23,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:29:23,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-03 18:29:23,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197257331] [2025-03-03 18:29:23,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:29:23,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-03 18:29:23,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:29:23,873 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-03 18:29:23,874 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2025-03-03 18:29:23,874 INFO L87 Difference]: Start difference. First operand 742 states and 989 transitions. Second operand has 13 states, 13 states have (on average 4.384615384615385) internal successors, (57), 13 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:24,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:29:24,061 INFO L93 Difference]: Finished difference Result 945 states and 1272 transitions. [2025-03-03 18:29:24,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 18:29:24,061 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.384615384615385) internal successors, (57), 13 states have internal predecessors, (57), 0 states have call successors, (0), 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 57 [2025-03-03 18:29:24,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:29:24,063 INFO L225 Difference]: With dead ends: 945 [2025-03-03 18:29:24,063 INFO L226 Difference]: Without dead ends: 780 [2025-03-03 18:29:24,063 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2025-03-03 18:29:24,063 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 69 mSDsluCounter, 831 mSDsCounter, 0 mSdLazyCounter, 391 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 928 SdHoareTripleChecker+Invalid, 391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 18:29:24,064 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 928 Invalid, 391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 391 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 18:29:24,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 780 states. [2025-03-03 18:29:24,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 780 to 746. [2025-03-03 18:29:24,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 746 states, 745 states have (on average 1.3288590604026846) internal successors, (990), 745 states have internal predecessors, (990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:24,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 746 states to 746 states and 990 transitions. [2025-03-03 18:29:24,073 INFO L78 Accepts]: Start accepts. Automaton has 746 states and 990 transitions. Word has length 57 [2025-03-03 18:29:24,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:29:24,073 INFO L471 AbstractCegarLoop]: Abstraction has 746 states and 990 transitions. [2025-03-03 18:29:24,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.384615384615385) internal successors, (57), 13 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:24,074 INFO L276 IsEmpty]: Start isEmpty. Operand 746 states and 990 transitions. [2025-03-03 18:29:24,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-03 18:29:24,075 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:29:24,075 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:29:24,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-03 18:29:24,076 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:29:24,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:29:24,076 INFO L85 PathProgramCache]: Analyzing trace with hash -950389509, now seen corresponding path program 1 times [2025-03-03 18:29:24,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:29:24,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044743194] [2025-03-03 18:29:24,076 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:29:24,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:29:24,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-03 18:29:24,103 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-03 18:29:24,103 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:29:24,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:29:24,359 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:29:24,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:29:24,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044743194] [2025-03-03 18:29:24,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044743194] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:29:24,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:29:24,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 18:29:24,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187160161] [2025-03-03 18:29:24,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:29:24,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 18:29:24,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:29:24,360 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 18:29:24,360 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-03 18:29:24,360 INFO L87 Difference]: Start difference. First operand 746 states and 990 transitions. Second operand has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:24,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:29:24,630 INFO L93 Difference]: Finished difference Result 1303 states and 1752 transitions. [2025-03-03 18:29:24,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 18:29:24,631 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 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 58 [2025-03-03 18:29:24,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:29:24,633 INFO L225 Difference]: With dead ends: 1303 [2025-03-03 18:29:24,633 INFO L226 Difference]: Without dead ends: 1170 [2025-03-03 18:29:24,634 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-03-03 18:29:24,634 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 183 mSDsluCounter, 487 mSDsCounter, 0 mSdLazyCounter, 497 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 611 SdHoareTripleChecker+Invalid, 499 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 497 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 18:29:24,634 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 611 Invalid, 499 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 497 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 18:29:24,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1170 states. [2025-03-03 18:29:24,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1170 to 1021. [2025-03-03 18:29:24,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1021 states, 1020 states have (on average 1.3372549019607842) internal successors, (1364), 1020 states have internal predecessors, (1364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:24,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1021 states to 1021 states and 1364 transitions. [2025-03-03 18:29:24,644 INFO L78 Accepts]: Start accepts. Automaton has 1021 states and 1364 transitions. Word has length 58 [2025-03-03 18:29:24,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:29:24,644 INFO L471 AbstractCegarLoop]: Abstraction has 1021 states and 1364 transitions. [2025-03-03 18:29:24,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:24,645 INFO L276 IsEmpty]: Start isEmpty. Operand 1021 states and 1364 transitions. [2025-03-03 18:29:24,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-03 18:29:24,646 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:29:24,646 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:29:24,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-03 18:29:24,646 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:29:24,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:29:24,647 INFO L85 PathProgramCache]: Analyzing trace with hash -1977507922, now seen corresponding path program 1 times [2025-03-03 18:29:24,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:29:24,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999345434] [2025-03-03 18:29:24,647 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:29:24,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:29:24,658 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-03 18:29:24,666 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-03 18:29:24,667 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:29:24,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:29:25,130 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:29:25,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:29:25,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999345434] [2025-03-03 18:29:25,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999345434] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:29:25,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:29:25,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2025-03-03 18:29:25,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937524565] [2025-03-03 18:29:25,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:29:25,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-03 18:29:25,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:29:25,132 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-03 18:29:25,132 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=449, Unknown=0, NotChecked=0, Total=506 [2025-03-03 18:29:25,132 INFO L87 Difference]: Start difference. First operand 1021 states and 1364 transitions. Second operand has 23 states, 23 states have (on average 2.5217391304347827) internal successors, (58), 23 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:25,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:29:25,330 INFO L93 Difference]: Finished difference Result 1408 states and 1916 transitions. [2025-03-03 18:29:25,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-03 18:29:25,331 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.5217391304347827) internal successors, (58), 23 states have internal predecessors, (58), 0 states have call successors, (0), 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 58 [2025-03-03 18:29:25,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:29:25,333 INFO L225 Difference]: With dead ends: 1408 [2025-03-03 18:29:25,333 INFO L226 Difference]: Without dead ends: 1185 [2025-03-03 18:29:25,334 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=449, Unknown=0, NotChecked=0, Total=506 [2025-03-03 18:29:25,334 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 62 mSDsluCounter, 827 mSDsCounter, 0 mSdLazyCounter, 488 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 918 SdHoareTripleChecker+Invalid, 489 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 488 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 18:29:25,334 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 918 Invalid, 489 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 488 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 18:29:25,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1185 states. [2025-03-03 18:29:25,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1185 to 1063. [2025-03-03 18:29:25,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1063 states, 1062 states have (on average 1.3427495291902072) internal successors, (1426), 1062 states have internal predecessors, (1426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:25,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1063 states to 1063 states and 1426 transitions. [2025-03-03 18:29:25,348 INFO L78 Accepts]: Start accepts. Automaton has 1063 states and 1426 transitions. Word has length 58 [2025-03-03 18:29:25,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:29:25,348 INFO L471 AbstractCegarLoop]: Abstraction has 1063 states and 1426 transitions. [2025-03-03 18:29:25,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.5217391304347827) internal successors, (58), 23 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:25,348 INFO L276 IsEmpty]: Start isEmpty. Operand 1063 states and 1426 transitions. [2025-03-03 18:29:25,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-03 18:29:25,350 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:29:25,350 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:29:25,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-03 18:29:25,351 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:29:25,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:29:25,351 INFO L85 PathProgramCache]: Analyzing trace with hash -439438171, now seen corresponding path program 1 times [2025-03-03 18:29:25,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:29:25,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275076353] [2025-03-03 18:29:25,351 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:29:25,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:29:25,364 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-03 18:29:25,380 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-03 18:29:25,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:29:25,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:29:25,762 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:29:25,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:29:25,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275076353] [2025-03-03 18:29:25,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [275076353] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:29:25,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:29:25,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-03 18:29:25,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164660119] [2025-03-03 18:29:25,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:29:25,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-03 18:29:25,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:29:25,763 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-03 18:29:25,763 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2025-03-03 18:29:25,763 INFO L87 Difference]: Start difference. First operand 1063 states and 1426 transitions. Second operand has 16 states, 16 states have (on average 3.625) internal successors, (58), 16 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:25,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:29:25,904 INFO L93 Difference]: Finished difference Result 1410 states and 1904 transitions. [2025-03-03 18:29:25,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-03 18:29:25,905 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.625) internal successors, (58), 16 states have internal predecessors, (58), 0 states have call successors, (0), 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 58 [2025-03-03 18:29:25,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:29:25,907 INFO L225 Difference]: With dead ends: 1410 [2025-03-03 18:29:25,907 INFO L226 Difference]: Without dead ends: 1174 [2025-03-03 18:29:25,908 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2025-03-03 18:29:25,908 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 97 mSDsluCounter, 783 mSDsCounter, 0 mSdLazyCounter, 389 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 881 SdHoareTripleChecker+Invalid, 389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 18:29:25,908 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 881 Invalid, 389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 389 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 18:29:25,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1174 states. [2025-03-03 18:29:25,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1174 to 1079. [2025-03-03 18:29:25,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1079 states, 1078 states have (on average 1.3376623376623376) internal successors, (1442), 1078 states have internal predecessors, (1442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:25,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1079 states to 1079 states and 1442 transitions. [2025-03-03 18:29:25,918 INFO L78 Accepts]: Start accepts. Automaton has 1079 states and 1442 transitions. Word has length 58 [2025-03-03 18:29:25,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:29:25,918 INFO L471 AbstractCegarLoop]: Abstraction has 1079 states and 1442 transitions. [2025-03-03 18:29:25,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.625) internal successors, (58), 16 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:25,918 INFO L276 IsEmpty]: Start isEmpty. Operand 1079 states and 1442 transitions. [2025-03-03 18:29:25,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-03 18:29:25,919 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:29:25,919 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:29:25,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-03 18:29:25,919 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:29:25,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:29:25,920 INFO L85 PathProgramCache]: Analyzing trace with hash -611580680, now seen corresponding path program 1 times [2025-03-03 18:29:25,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:29:25,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316715259] [2025-03-03 18:29:25,920 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:29:25,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:29:25,934 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-03 18:29:25,948 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-03 18:29:25,948 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:29:25,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:29:26,447 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:29:26,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:29:26,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316715259] [2025-03-03 18:29:26,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316715259] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:29:26,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:29:26,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2025-03-03 18:29:26,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437933150] [2025-03-03 18:29:26,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:29:26,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-03 18:29:26,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:29:26,449 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-03 18:29:26,449 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=354, Unknown=0, NotChecked=0, Total=420 [2025-03-03 18:29:26,449 INFO L87 Difference]: Start difference. First operand 1079 states and 1442 transitions. Second operand has 21 states, 21 states have (on average 2.761904761904762) internal successors, (58), 21 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:26,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:29:26,632 INFO L93 Difference]: Finished difference Result 1513 states and 2046 transitions. [2025-03-03 18:29:26,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-03 18:29:26,632 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.761904761904762) internal successors, (58), 21 states have internal predecessors, (58), 0 states have call successors, (0), 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 58 [2025-03-03 18:29:26,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:29:26,635 INFO L225 Difference]: With dead ends: 1513 [2025-03-03 18:29:26,635 INFO L226 Difference]: Without dead ends: 1292 [2025-03-03 18:29:26,636 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=354, Unknown=0, NotChecked=0, Total=420 [2025-03-03 18:29:26,636 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 134 mSDsluCounter, 976 mSDsCounter, 0 mSdLazyCounter, 577 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 1074 SdHoareTripleChecker+Invalid, 578 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 577 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 18:29:26,636 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 1074 Invalid, 578 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 577 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 18:29:26,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1292 states. [2025-03-03 18:29:26,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1292 to 1138. [2025-03-03 18:29:26,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1138 states, 1137 states have (on average 1.3421284080914688) internal successors, (1526), 1137 states have internal predecessors, (1526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:26,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1138 states to 1138 states and 1526 transitions. [2025-03-03 18:29:26,647 INFO L78 Accepts]: Start accepts. Automaton has 1138 states and 1526 transitions. Word has length 58 [2025-03-03 18:29:26,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:29:26,647 INFO L471 AbstractCegarLoop]: Abstraction has 1138 states and 1526 transitions. [2025-03-03 18:29:26,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.761904761904762) internal successors, (58), 21 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:26,648 INFO L276 IsEmpty]: Start isEmpty. Operand 1138 states and 1526 transitions. [2025-03-03 18:29:26,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-03 18:29:26,649 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:29:26,649 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:29:26,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-03 18:29:26,649 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:29:26,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:29:26,650 INFO L85 PathProgramCache]: Analyzing trace with hash 919621756, now seen corresponding path program 1 times [2025-03-03 18:29:26,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:29:26,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623062862] [2025-03-03 18:29:26,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:29:26,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:29:26,660 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-03 18:29:26,673 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-03 18:29:26,673 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:29:26,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:29:26,906 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:29:26,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:29:26,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623062862] [2025-03-03 18:29:26,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623062862] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:29:26,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:29:26,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-03 18:29:26,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957215181] [2025-03-03 18:29:26,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:29:26,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 18:29:26,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:29:26,908 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 18:29:26,908 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-03-03 18:29:26,908 INFO L87 Difference]: Start difference. First operand 1138 states and 1526 transitions. Second operand has 10 states, 10 states have (on average 5.8) internal successors, (58), 10 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:27,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:29:27,004 INFO L93 Difference]: Finished difference Result 1431 states and 1935 transitions. [2025-03-03 18:29:27,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 18:29:27,004 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.8) internal successors, (58), 10 states have internal predecessors, (58), 0 states have call successors, (0), 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 58 [2025-03-03 18:29:27,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:29:27,006 INFO L225 Difference]: With dead ends: 1431 [2025-03-03 18:29:27,006 INFO L226 Difference]: Without dead ends: 1111 [2025-03-03 18:29:27,007 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-03-03 18:29:27,007 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 41 mSDsluCounter, 667 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 768 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 18:29:27,008 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 768 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 18:29:27,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1111 states. [2025-03-03 18:29:27,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1111 to 1069. [2025-03-03 18:29:27,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1069 states, 1068 states have (on average 1.3398876404494382) internal successors, (1431), 1068 states have internal predecessors, (1431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:27,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1069 states to 1069 states and 1431 transitions. [2025-03-03 18:29:27,017 INFO L78 Accepts]: Start accepts. Automaton has 1069 states and 1431 transitions. Word has length 58 [2025-03-03 18:29:27,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:29:27,018 INFO L471 AbstractCegarLoop]: Abstraction has 1069 states and 1431 transitions. [2025-03-03 18:29:27,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.8) internal successors, (58), 10 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:27,018 INFO L276 IsEmpty]: Start isEmpty. Operand 1069 states and 1431 transitions. [2025-03-03 18:29:27,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-03 18:29:27,019 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:29:27,019 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:29:27,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-03 18:29:27,019 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:29:27,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:29:27,020 INFO L85 PathProgramCache]: Analyzing trace with hash 663620049, now seen corresponding path program 1 times [2025-03-03 18:29:27,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:29:27,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224988799] [2025-03-03 18:29:27,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:29:27,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:29:27,031 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-03 18:29:27,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-03 18:29:27,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:29:27,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:29:27,562 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:29:27,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:29:27,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224988799] [2025-03-03 18:29:27,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224988799] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:29:27,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:29:27,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2025-03-03 18:29:27,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78852038] [2025-03-03 18:29:27,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:29:27,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-03 18:29:27,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:29:27,563 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-03 18:29:27,563 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=320, Unknown=0, NotChecked=0, Total=380 [2025-03-03 18:29:27,563 INFO L87 Difference]: Start difference. First operand 1069 states and 1431 transitions. Second operand has 20 states, 20 states have (on average 2.9) internal successors, (58), 20 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:27,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:29:27,770 INFO L93 Difference]: Finished difference Result 1348 states and 1828 transitions. [2025-03-03 18:29:27,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-03 18:29:27,771 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.9) internal successors, (58), 20 states have internal predecessors, (58), 0 states have call successors, (0), 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 58 [2025-03-03 18:29:27,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:29:27,774 INFO L225 Difference]: With dead ends: 1348 [2025-03-03 18:29:27,774 INFO L226 Difference]: Without dead ends: 1128 [2025-03-03 18:29:27,774 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=320, Unknown=0, NotChecked=0, Total=380 [2025-03-03 18:29:27,775 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 127 mSDsluCounter, 1091 mSDsCounter, 0 mSdLazyCounter, 584 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 1185 SdHoareTripleChecker+Invalid, 584 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 18:29:27,775 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 1185 Invalid, 584 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 584 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 18:29:27,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1128 states. [2025-03-03 18:29:27,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1128 to 1065. [2025-03-03 18:29:27,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1065 states, 1064 states have (on average 1.3402255639097744) internal successors, (1426), 1064 states have internal predecessors, (1426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:27,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1065 states to 1065 states and 1426 transitions. [2025-03-03 18:29:27,787 INFO L78 Accepts]: Start accepts. Automaton has 1065 states and 1426 transitions. Word has length 58 [2025-03-03 18:29:27,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:29:27,787 INFO L471 AbstractCegarLoop]: Abstraction has 1065 states and 1426 transitions. [2025-03-03 18:29:27,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.9) internal successors, (58), 20 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:27,787 INFO L276 IsEmpty]: Start isEmpty. Operand 1065 states and 1426 transitions. [2025-03-03 18:29:27,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-03 18:29:27,789 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:29:27,789 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:29:27,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-03 18:29:27,789 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:29:27,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:29:27,789 INFO L85 PathProgramCache]: Analyzing trace with hash -917611852, now seen corresponding path program 1 times [2025-03-03 18:29:27,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:29:27,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25005544] [2025-03-03 18:29:27,790 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:29:27,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:29:27,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-03 18:29:27,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-03 18:29:27,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:29:27,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:29:28,595 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:29:28,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:29:28,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25005544] [2025-03-03 18:29:28,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25005544] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:29:28,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:29:28,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2025-03-03 18:29:28,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854244699] [2025-03-03 18:29:28,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:29:28,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-03 18:29:28,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:29:28,597 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-03 18:29:28,597 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=444, Unknown=0, NotChecked=0, Total=506 [2025-03-03 18:29:28,597 INFO L87 Difference]: Start difference. First operand 1065 states and 1426 transitions. Second operand has 23 states, 23 states have (on average 2.5217391304347827) internal successors, (58), 23 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:29,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:29:29,054 INFO L93 Difference]: Finished difference Result 1412 states and 1929 transitions. [2025-03-03 18:29:29,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-03 18:29:29,054 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.5217391304347827) internal successors, (58), 23 states have internal predecessors, (58), 0 states have call successors, (0), 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 58 [2025-03-03 18:29:29,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:29:29,057 INFO L225 Difference]: With dead ends: 1412 [2025-03-03 18:29:29,057 INFO L226 Difference]: Without dead ends: 1192 [2025-03-03 18:29:29,058 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=62, Invalid=444, Unknown=0, NotChecked=0, Total=506 [2025-03-03 18:29:29,058 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 100 mSDsluCounter, 1221 mSDsCounter, 0 mSdLazyCounter, 1057 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 1322 SdHoareTripleChecker+Invalid, 1058 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1057 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 18:29:29,058 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 1322 Invalid, 1058 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1057 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 18:29:29,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1192 states. [2025-03-03 18:29:29,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1192 to 1132. [2025-03-03 18:29:29,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1132 states, 1131 states have (on average 1.3457117595048629) internal successors, (1522), 1131 states have internal predecessors, (1522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:29,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1132 states to 1132 states and 1522 transitions. [2025-03-03 18:29:29,066 INFO L78 Accepts]: Start accepts. Automaton has 1132 states and 1522 transitions. Word has length 58 [2025-03-03 18:29:29,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:29:29,067 INFO L471 AbstractCegarLoop]: Abstraction has 1132 states and 1522 transitions. [2025-03-03 18:29:29,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.5217391304347827) internal successors, (58), 23 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:29,067 INFO L276 IsEmpty]: Start isEmpty. Operand 1132 states and 1522 transitions. [2025-03-03 18:29:29,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-03 18:29:29,068 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:29:29,068 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:29:29,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-03 18:29:29,068 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:29:29,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:29:29,068 INFO L85 PathProgramCache]: Analyzing trace with hash 2024660303, now seen corresponding path program 1 times [2025-03-03 18:29:29,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:29:29,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294029833] [2025-03-03 18:29:29,069 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:29:29,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:29:29,080 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-03 18:29:29,093 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-03 18:29:29,093 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:29:29,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:29:29,331 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:29:29,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:29:29,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294029833] [2025-03-03 18:29:29,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294029833] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:29:29,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:29:29,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-03 18:29:29,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662805125] [2025-03-03 18:29:29,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:29:29,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 18:29:29,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:29:29,333 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 18:29:29,333 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-03-03 18:29:29,333 INFO L87 Difference]: Start difference. First operand 1132 states and 1522 transitions. Second operand has 12 states, 12 states have (on average 4.833333333333333) internal successors, (58), 12 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:29,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:29:29,444 INFO L93 Difference]: Finished difference Result 1535 states and 2103 transitions. [2025-03-03 18:29:29,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 18:29:29,444 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.833333333333333) internal successors, (58), 12 states have internal predecessors, (58), 0 states have call successors, (0), 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 58 [2025-03-03 18:29:29,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:29:29,447 INFO L225 Difference]: With dead ends: 1535 [2025-03-03 18:29:29,447 INFO L226 Difference]: Without dead ends: 1221 [2025-03-03 18:29:29,447 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-03-03 18:29:29,448 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 48 mSDsluCounter, 772 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 870 SdHoareTripleChecker+Invalid, 309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 18:29:29,448 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 870 Invalid, 309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 18:29:29,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1221 states. [2025-03-03 18:29:29,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1221 to 1198. [2025-03-03 18:29:29,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1198 states, 1197 states have (on average 1.33249791144528) internal successors, (1595), 1197 states have internal predecessors, (1595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:29,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1198 states to 1198 states and 1595 transitions. [2025-03-03 18:29:29,458 INFO L78 Accepts]: Start accepts. Automaton has 1198 states and 1595 transitions. Word has length 58 [2025-03-03 18:29:29,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:29:29,459 INFO L471 AbstractCegarLoop]: Abstraction has 1198 states and 1595 transitions. [2025-03-03 18:29:29,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.833333333333333) internal successors, (58), 12 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:29,459 INFO L276 IsEmpty]: Start isEmpty. Operand 1198 states and 1595 transitions. [2025-03-03 18:29:29,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-03 18:29:29,460 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:29:29,460 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:29:29,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-03 18:29:29,460 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:29:29,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:29:29,461 INFO L85 PathProgramCache]: Analyzing trace with hash -459175569, now seen corresponding path program 1 times [2025-03-03 18:29:29,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:29:29,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294096970] [2025-03-03 18:29:29,461 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:29:29,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:29:29,473 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-03 18:29:29,486 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-03 18:29:29,487 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:29:29,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:29:29,659 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:29:29,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:29:29,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294096970] [2025-03-03 18:29:29,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294096970] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 18:29:29,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1817476414] [2025-03-03 18:29:29,659 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:29:29,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 18:29:29,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 18:29:29,661 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 18:29:29,663 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 18:29:29,798 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-03 18:29:29,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-03 18:29:29,838 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:29:29,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:29:29,840 INFO L256 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 64 conjuncts are in the unsatisfiable core [2025-03-03 18:29:29,843 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 18:29:30,230 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:29:30,230 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 18:29:30,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1817476414] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:29:30,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 18:29:30,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [7] total 17 [2025-03-03 18:29:30,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879358098] [2025-03-03 18:29:30,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:29:30,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 18:29:30,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:29:30,231 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 18:29:30,231 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2025-03-03 18:29:30,232 INFO L87 Difference]: Start difference. First operand 1198 states and 1595 transitions. Second operand has 12 states, 12 states have (on average 4.833333333333333) internal successors, (58), 12 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:30,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:29:30,587 INFO L93 Difference]: Finished difference Result 1903 states and 2556 transitions. [2025-03-03 18:29:30,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 18:29:30,588 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.833333333333333) internal successors, (58), 12 states have internal predecessors, (58), 0 states have call successors, (0), 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 58 [2025-03-03 18:29:30,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:29:30,591 INFO L225 Difference]: With dead ends: 1903 [2025-03-03 18:29:30,591 INFO L226 Difference]: Without dead ends: 1679 [2025-03-03 18:29:30,592 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=398, Unknown=0, NotChecked=0, Total=462 [2025-03-03 18:29:30,592 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 285 mSDsluCounter, 780 mSDsCounter, 0 mSdLazyCounter, 796 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 887 SdHoareTripleChecker+Invalid, 798 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 796 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 18:29:30,592 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [285 Valid, 887 Invalid, 798 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 796 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 18:29:30,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1679 states. [2025-03-03 18:29:30,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1679 to 1280. [2025-03-03 18:29:30,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1280 states, 1279 states have (on average 1.3330727130570759) internal successors, (1705), 1279 states have internal predecessors, (1705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:30,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1280 states to 1280 states and 1705 transitions. [2025-03-03 18:29:30,603 INFO L78 Accepts]: Start accepts. Automaton has 1280 states and 1705 transitions. Word has length 58 [2025-03-03 18:29:30,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:29:30,603 INFO L471 AbstractCegarLoop]: Abstraction has 1280 states and 1705 transitions. [2025-03-03 18:29:30,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.833333333333333) internal successors, (58), 12 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:30,603 INFO L276 IsEmpty]: Start isEmpty. Operand 1280 states and 1705 transitions. [2025-03-03 18:29:30,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-03 18:29:30,604 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:29:30,604 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:29:30,611 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-03 18:29:30,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2025-03-03 18:29:30,805 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:29:30,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:29:30,805 INFO L85 PathProgramCache]: Analyzing trace with hash -1811870710, now seen corresponding path program 1 times [2025-03-03 18:29:30,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:29:30,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487375522] [2025-03-03 18:29:30,805 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:29:30,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:29:30,817 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-03 18:29:30,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-03 18:29:30,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:29:30,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:29:31,047 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:29:31,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:29:31,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487375522] [2025-03-03 18:29:31,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487375522] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:29:31,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:29:31,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-03 18:29:31,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640530115] [2025-03-03 18:29:31,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:29:31,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 18:29:31,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:29:31,048 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 18:29:31,048 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2025-03-03 18:29:31,048 INFO L87 Difference]: Start difference. First operand 1280 states and 1705 transitions. Second operand has 12 states, 12 states have (on average 4.833333333333333) internal successors, (58), 12 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:31,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:29:31,119 INFO L93 Difference]: Finished difference Result 1551 states and 2103 transitions. [2025-03-03 18:29:31,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 18:29:31,120 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.833333333333333) internal successors, (58), 12 states have internal predecessors, (58), 0 states have call successors, (0), 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 58 [2025-03-03 18:29:31,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:29:31,122 INFO L225 Difference]: With dead ends: 1551 [2025-03-03 18:29:31,122 INFO L226 Difference]: Without dead ends: 1298 [2025-03-03 18:29:31,123 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2025-03-03 18:29:31,123 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 34 mSDsluCounter, 552 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 654 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 18:29:31,123 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 654 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 18:29:31,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1298 states. [2025-03-03 18:29:31,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1298 to 1270. [2025-03-03 18:29:31,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1270 states, 1269 states have (on average 1.33096926713948) internal successors, (1689), 1269 states have internal predecessors, (1689), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:31,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1270 states to 1270 states and 1689 transitions. [2025-03-03 18:29:31,132 INFO L78 Accepts]: Start accepts. Automaton has 1270 states and 1689 transitions. Word has length 58 [2025-03-03 18:29:31,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:29:31,132 INFO L471 AbstractCegarLoop]: Abstraction has 1270 states and 1689 transitions. [2025-03-03 18:29:31,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.833333333333333) internal successors, (58), 12 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:31,132 INFO L276 IsEmpty]: Start isEmpty. Operand 1270 states and 1689 transitions. [2025-03-03 18:29:31,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-03 18:29:31,133 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:29:31,133 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:29:31,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-03 18:29:31,134 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:29:31,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:29:31,134 INFO L85 PathProgramCache]: Analyzing trace with hash 1300397295, now seen corresponding path program 1 times [2025-03-03 18:29:31,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:29:31,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161136865] [2025-03-03 18:29:31,134 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:29:31,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:29:31,147 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-03 18:29:31,155 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-03 18:29:31,155 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:29:31,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:29:31,516 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:29:31,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:29:31,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161136865] [2025-03-03 18:29:31,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161136865] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:29:31,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:29:31,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2025-03-03 18:29:31,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912396766] [2025-03-03 18:29:31,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:29:31,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-03 18:29:31,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:29:31,517 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-03 18:29:31,517 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2025-03-03 18:29:31,517 INFO L87 Difference]: Start difference. First operand 1270 states and 1689 transitions. Second operand has 18 states, 18 states have (on average 3.2222222222222223) internal successors, (58), 18 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:31,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:29:31,725 INFO L93 Difference]: Finished difference Result 1715 states and 2299 transitions. [2025-03-03 18:29:31,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-03 18:29:31,725 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.2222222222222223) internal successors, (58), 18 states have internal predecessors, (58), 0 states have call successors, (0), 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 58 [2025-03-03 18:29:31,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:29:31,729 INFO L225 Difference]: With dead ends: 1715 [2025-03-03 18:29:31,729 INFO L226 Difference]: Without dead ends: 1458 [2025-03-03 18:29:31,729 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2025-03-03 18:29:31,730 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 91 mSDsluCounter, 1266 mSDsCounter, 0 mSdLazyCounter, 590 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 1370 SdHoareTripleChecker+Invalid, 590 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 590 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 18:29:31,730 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 1370 Invalid, 590 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 590 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 18:29:31,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1458 states. [2025-03-03 18:29:31,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1458 to 1250. [2025-03-03 18:29:31,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1250 states, 1249 states have (on average 1.3418734987990393) internal successors, (1676), 1249 states have internal predecessors, (1676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:31,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1250 states to 1250 states and 1676 transitions. [2025-03-03 18:29:31,740 INFO L78 Accepts]: Start accepts. Automaton has 1250 states and 1676 transitions. Word has length 58 [2025-03-03 18:29:31,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:29:31,740 INFO L471 AbstractCegarLoop]: Abstraction has 1250 states and 1676 transitions. [2025-03-03 18:29:31,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.2222222222222223) internal successors, (58), 18 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:31,740 INFO L276 IsEmpty]: Start isEmpty. Operand 1250 states and 1676 transitions. [2025-03-03 18:29:31,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-03 18:29:31,741 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:29:31,741 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:29:31,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-03-03 18:29:31,741 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:29:31,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:29:31,742 INFO L85 PathProgramCache]: Analyzing trace with hash 273278882, now seen corresponding path program 1 times [2025-03-03 18:29:31,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:29:31,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87322942] [2025-03-03 18:29:31,742 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:29:31,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:29:31,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-03 18:29:31,760 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-03 18:29:31,760 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:29:31,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:29:32,194 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:29:32,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:29:32,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87322942] [2025-03-03 18:29:32,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87322942] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:29:32,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:29:32,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2025-03-03 18:29:32,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698379826] [2025-03-03 18:29:32,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:29:32,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-03 18:29:32,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:29:32,194 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-03 18:29:32,195 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=400, Unknown=0, NotChecked=0, Total=462 [2025-03-03 18:29:32,195 INFO L87 Difference]: Start difference. First operand 1250 states and 1676 transitions. Second operand has 22 states, 22 states have (on average 2.6363636363636362) internal successors, (58), 22 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:32,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:29:32,449 INFO L93 Difference]: Finished difference Result 1729 states and 2348 transitions. [2025-03-03 18:29:32,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-03 18:29:32,449 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.6363636363636362) internal successors, (58), 22 states have internal predecessors, (58), 0 states have call successors, (0), 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 58 [2025-03-03 18:29:32,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:29:32,452 INFO L225 Difference]: With dead ends: 1729 [2025-03-03 18:29:32,452 INFO L226 Difference]: Without dead ends: 1472 [2025-03-03 18:29:32,452 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=400, Unknown=0, NotChecked=0, Total=462 [2025-03-03 18:29:32,453 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 118 mSDsluCounter, 1182 mSDsCounter, 0 mSdLazyCounter, 746 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 1280 SdHoareTripleChecker+Invalid, 747 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 746 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 18:29:32,453 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 1280 Invalid, 747 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 746 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 18:29:32,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1472 states. [2025-03-03 18:29:32,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1472 to 1330. [2025-03-03 18:29:32,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1330 states, 1329 states have (on average 1.3423626787057938) internal successors, (1784), 1329 states have internal predecessors, (1784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:32,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1330 states to 1330 states and 1784 transitions. [2025-03-03 18:29:32,467 INFO L78 Accepts]: Start accepts. Automaton has 1330 states and 1784 transitions. Word has length 58 [2025-03-03 18:29:32,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:29:32,467 INFO L471 AbstractCegarLoop]: Abstraction has 1330 states and 1784 transitions. [2025-03-03 18:29:32,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.6363636363636362) internal successors, (58), 22 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:32,468 INFO L276 IsEmpty]: Start isEmpty. Operand 1330 states and 1784 transitions. [2025-03-03 18:29:32,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-03 18:29:32,469 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:29:32,469 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:29:32,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-03-03 18:29:32,469 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:29:32,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:29:32,470 INFO L85 PathProgramCache]: Analyzing trace with hash 1384314476, now seen corresponding path program 1 times [2025-03-03 18:29:32,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:29:32,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519970621] [2025-03-03 18:29:32,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:29:32,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:29:32,486 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-03 18:29:32,499 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-03 18:29:32,499 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:29:32,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:29:33,002 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:29:33,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:29:33,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519970621] [2025-03-03 18:29:33,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519970621] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:29:33,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:29:33,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2025-03-03 18:29:33,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064640973] [2025-03-03 18:29:33,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:29:33,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-03 18:29:33,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:29:33,003 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-03 18:29:33,003 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=320, Unknown=0, NotChecked=0, Total=380 [2025-03-03 18:29:33,003 INFO L87 Difference]: Start difference. First operand 1330 states and 1784 transitions. Second operand has 20 states, 20 states have (on average 2.9) internal successors, (58), 20 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:33,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:29:33,245 INFO L93 Difference]: Finished difference Result 1651 states and 2235 transitions. [2025-03-03 18:29:33,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-03 18:29:33,245 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.9) internal successors, (58), 20 states have internal predecessors, (58), 0 states have call successors, (0), 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 58 [2025-03-03 18:29:33,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:29:33,247 INFO L225 Difference]: With dead ends: 1651 [2025-03-03 18:29:33,247 INFO L226 Difference]: Without dead ends: 1401 [2025-03-03 18:29:33,248 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=320, Unknown=0, NotChecked=0, Total=380 [2025-03-03 18:29:33,248 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 119 mSDsluCounter, 1527 mSDsCounter, 0 mSdLazyCounter, 793 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 1631 SdHoareTripleChecker+Invalid, 793 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 793 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 18:29:33,248 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 1631 Invalid, 793 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 793 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 18:29:33,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1401 states. [2025-03-03 18:29:33,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1401 to 1338. [2025-03-03 18:29:33,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1338 states, 1337 states have (on average 1.343305908750935) internal successors, (1796), 1337 states have internal predecessors, (1796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:33,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1338 states to 1338 states and 1796 transitions. [2025-03-03 18:29:33,259 INFO L78 Accepts]: Start accepts. Automaton has 1338 states and 1796 transitions. Word has length 58 [2025-03-03 18:29:33,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:29:33,259 INFO L471 AbstractCegarLoop]: Abstraction has 1338 states and 1796 transitions. [2025-03-03 18:29:33,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.9) internal successors, (58), 20 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:33,259 INFO L276 IsEmpty]: Start isEmpty. Operand 1338 states and 1796 transitions. [2025-03-03 18:29:33,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-03 18:29:33,260 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:29:33,260 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:29:33,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-03-03 18:29:33,260 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:29:33,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:29:33,260 INFO L85 PathProgramCache]: Analyzing trace with hash -2040315303, now seen corresponding path program 1 times [2025-03-03 18:29:33,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:29:33,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461109179] [2025-03-03 18:29:33,261 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:29:33,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:29:33,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-03 18:29:33,283 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-03 18:29:33,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:29:33,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:29:33,551 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:29:33,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:29:33,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461109179] [2025-03-03 18:29:33,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461109179] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:29:33,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:29:33,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-03 18:29:33,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252385849] [2025-03-03 18:29:33,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:29:33,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 18:29:33,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:29:33,553 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 18:29:33,553 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2025-03-03 18:29:33,553 INFO L87 Difference]: Start difference. First operand 1338 states and 1796 transitions. Second operand has 10 states, 10 states have (on average 5.8) internal successors, (58), 10 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:33,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:29:33,731 INFO L93 Difference]: Finished difference Result 2008 states and 2730 transitions. [2025-03-03 18:29:33,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 18:29:33,732 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.8) internal successors, (58), 10 states have internal predecessors, (58), 0 states have call successors, (0), 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 58 [2025-03-03 18:29:33,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:29:33,734 INFO L225 Difference]: With dead ends: 2008 [2025-03-03 18:29:33,734 INFO L226 Difference]: Without dead ends: 1520 [2025-03-03 18:29:33,734 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2025-03-03 18:29:33,735 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 132 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 428 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 545 SdHoareTripleChecker+Invalid, 431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 18:29:33,735 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 545 Invalid, 431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 428 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 18:29:33,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1520 states. [2025-03-03 18:29:33,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1520 to 1492. [2025-03-03 18:29:33,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1492 states, 1491 states have (on average 1.313212608987257) internal successors, (1958), 1491 states have internal predecessors, (1958), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:33,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1492 states to 1492 states and 1958 transitions. [2025-03-03 18:29:33,747 INFO L78 Accepts]: Start accepts. Automaton has 1492 states and 1958 transitions. Word has length 58 [2025-03-03 18:29:33,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:29:33,747 INFO L471 AbstractCegarLoop]: Abstraction has 1492 states and 1958 transitions. [2025-03-03 18:29:33,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.8) internal successors, (58), 10 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:33,747 INFO L276 IsEmpty]: Start isEmpty. Operand 1492 states and 1958 transitions. [2025-03-03 18:29:33,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-03 18:29:33,748 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:29:33,748 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:29:33,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-03-03 18:29:33,749 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:29:33,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:29:33,749 INFO L85 PathProgramCache]: Analyzing trace with hash -1631977612, now seen corresponding path program 1 times [2025-03-03 18:29:33,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:29:33,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795850297] [2025-03-03 18:29:33,749 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:29:33,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:29:33,760 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-03 18:29:33,769 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-03 18:29:33,769 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:29:33,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:29:33,896 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:29:33,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:29:33,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795850297] [2025-03-03 18:29:33,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795850297] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:29:33,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:29:33,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 18:29:33,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809556131] [2025-03-03 18:29:33,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:29:33,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 18:29:33,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:29:33,897 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 18:29:33,897 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-03 18:29:33,897 INFO L87 Difference]: Start difference. First operand 1492 states and 1958 transitions. Second operand has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:33,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:29:33,963 INFO L93 Difference]: Finished difference Result 1952 states and 2613 transitions. [2025-03-03 18:29:33,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 18:29:33,963 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 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 58 [2025-03-03 18:29:33,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:29:33,965 INFO L225 Difference]: With dead ends: 1952 [2025-03-03 18:29:33,965 INFO L226 Difference]: Without dead ends: 1468 [2025-03-03 18:29:33,966 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-03 18:29:33,966 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 30 mSDsluCounter, 544 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 644 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 18:29:33,966 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 644 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 18:29:33,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1468 states. [2025-03-03 18:29:33,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1468 to 1468. [2025-03-03 18:29:33,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1468 states, 1467 states have (on average 1.2903885480572597) internal successors, (1893), 1467 states have internal predecessors, (1893), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:33,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1468 states to 1468 states and 1893 transitions. [2025-03-03 18:29:33,976 INFO L78 Accepts]: Start accepts. Automaton has 1468 states and 1893 transitions. Word has length 58 [2025-03-03 18:29:33,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:29:33,976 INFO L471 AbstractCegarLoop]: Abstraction has 1468 states and 1893 transitions. [2025-03-03 18:29:33,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:33,976 INFO L276 IsEmpty]: Start isEmpty. Operand 1468 states and 1893 transitions. [2025-03-03 18:29:33,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-03 18:29:33,977 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:29:33,977 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:29:33,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-03-03 18:29:33,977 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:29:33,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:29:33,978 INFO L85 PathProgramCache]: Analyzing trace with hash 1088205701, now seen corresponding path program 1 times [2025-03-03 18:29:33,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:29:33,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011338963] [2025-03-03 18:29:33,978 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:29:33,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:29:33,987 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-03 18:29:34,000 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-03 18:29:34,000 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:29:34,000 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:29:34,202 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:29:34,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:29:34,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011338963] [2025-03-03 18:29:34,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011338963] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:29:34,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:29:34,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-03 18:29:34,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014747299] [2025-03-03 18:29:34,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:29:34,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 18:29:34,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:29:34,202 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 18:29:34,202 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2025-03-03 18:29:34,202 INFO L87 Difference]: Start difference. First operand 1468 states and 1893 transitions. Second operand has 10 states, 10 states have (on average 5.8) internal successors, (58), 10 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:34,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:29:34,373 INFO L93 Difference]: Finished difference Result 2154 states and 2813 transitions. [2025-03-03 18:29:34,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 18:29:34,374 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.8) internal successors, (58), 10 states have internal predecessors, (58), 0 states have call successors, (0), 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 58 [2025-03-03 18:29:34,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:29:34,376 INFO L225 Difference]: With dead ends: 2154 [2025-03-03 18:29:34,376 INFO L226 Difference]: Without dead ends: 1858 [2025-03-03 18:29:34,377 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2025-03-03 18:29:34,377 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 158 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 408 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 408 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 18:29:34,377 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 535 Invalid, 410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 408 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 18:29:34,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1858 states. [2025-03-03 18:29:34,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1858 to 1817. [2025-03-03 18:29:34,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1817 states, 1816 states have (on average 1.282488986784141) internal successors, (2329), 1816 states have internal predecessors, (2329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:34,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1817 states to 1817 states and 2329 transitions. [2025-03-03 18:29:34,391 INFO L78 Accepts]: Start accepts. Automaton has 1817 states and 2329 transitions. Word has length 58 [2025-03-03 18:29:34,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:29:34,392 INFO L471 AbstractCegarLoop]: Abstraction has 1817 states and 2329 transitions. [2025-03-03 18:29:34,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.8) internal successors, (58), 10 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:34,392 INFO L276 IsEmpty]: Start isEmpty. Operand 1817 states and 2329 transitions. [2025-03-03 18:29:34,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-03 18:29:34,393 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:29:34,393 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:29:34,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-03-03 18:29:34,393 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:29:34,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:29:34,394 INFO L85 PathProgramCache]: Analyzing trace with hash 316401097, now seen corresponding path program 1 times [2025-03-03 18:29:34,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:29:34,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042735725] [2025-03-03 18:29:34,394 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:29:34,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:29:34,404 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-03 18:29:34,422 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-03 18:29:34,422 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:29:34,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:29:34,690 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:29:34,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:29:34,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042735725] [2025-03-03 18:29:34,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042735725] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:29:34,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:29:34,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-03 18:29:34,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890385356] [2025-03-03 18:29:34,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:29:34,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-03 18:29:34,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:29:34,691 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-03 18:29:34,691 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2025-03-03 18:29:34,691 INFO L87 Difference]: Start difference. First operand 1817 states and 2329 transitions. Second operand has 13 states, 13 states have (on average 4.461538461538462) internal successors, (58), 13 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:34,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:29:34,804 INFO L93 Difference]: Finished difference Result 2227 states and 2901 transitions. [2025-03-03 18:29:34,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 18:29:34,805 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.461538461538462) internal successors, (58), 13 states have internal predecessors, (58), 0 states have call successors, (0), 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 58 [2025-03-03 18:29:34,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:29:34,807 INFO L225 Difference]: With dead ends: 2227 [2025-03-03 18:29:34,807 INFO L226 Difference]: Without dead ends: 1857 [2025-03-03 18:29:34,808 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2025-03-03 18:29:34,808 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 73 mSDsluCounter, 544 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 643 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 18:29:34,808 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 643 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 18:29:34,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1857 states. [2025-03-03 18:29:34,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1857 to 1801. [2025-03-03 18:29:34,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1801 states, 1800 states have (on average 1.2827777777777778) internal successors, (2309), 1800 states have internal predecessors, (2309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:34,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1801 states to 1801 states and 2309 transitions. [2025-03-03 18:29:34,820 INFO L78 Accepts]: Start accepts. Automaton has 1801 states and 2309 transitions. Word has length 58 [2025-03-03 18:29:34,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:29:34,820 INFO L471 AbstractCegarLoop]: Abstraction has 1801 states and 2309 transitions. [2025-03-03 18:29:34,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.461538461538462) internal successors, (58), 13 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:34,821 INFO L276 IsEmpty]: Start isEmpty. Operand 1801 states and 2309 transitions. [2025-03-03 18:29:34,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-03 18:29:34,822 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:29:34,822 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:29:34,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-03-03 18:29:34,822 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:29:34,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:29:34,823 INFO L85 PathProgramCache]: Analyzing trace with hash -1840834353, now seen corresponding path program 1 times [2025-03-03 18:29:34,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:29:34,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019108391] [2025-03-03 18:29:34,823 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:29:34,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:29:34,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-03 18:29:34,848 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-03 18:29:34,848 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:29:34,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:29:35,004 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:29:35,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:29:35,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019108391] [2025-03-03 18:29:35,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019108391] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 18:29:35,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1389743082] [2025-03-03 18:29:35,005 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:29:35,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 18:29:35,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 18:29:35,007 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 18:29:35,009 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 18:29:35,168 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-03 18:29:35,204 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-03 18:29:35,204 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:29:35,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:29:35,207 INFO L256 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-03-03 18:29:35,209 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 18:29:35,486 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:29:35,486 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 18:29:35,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1389743082] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:29:35,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 18:29:35,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [7] total 14 [2025-03-03 18:29:35,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443246375] [2025-03-03 18:29:35,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:29:35,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 18:29:35,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:29:35,487 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 18:29:35,487 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2025-03-03 18:29:35,487 INFO L87 Difference]: Start difference. First operand 1801 states and 2309 transitions. Second operand has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:35,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:29:35,753 INFO L93 Difference]: Finished difference Result 3123 states and 4039 transitions. [2025-03-03 18:29:35,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 18:29:35,754 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 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 58 [2025-03-03 18:29:35,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:29:35,757 INFO L225 Difference]: With dead ends: 3123 [2025-03-03 18:29:35,757 INFO L226 Difference]: Without dead ends: 2771 [2025-03-03 18:29:35,758 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2025-03-03 18:29:35,758 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 159 mSDsluCounter, 594 mSDsCounter, 0 mSdLazyCounter, 636 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 706 SdHoareTripleChecker+Invalid, 638 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 636 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 18:29:35,759 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 706 Invalid, 638 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 636 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 18:29:35,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2771 states. [2025-03-03 18:29:35,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2771 to 2610. [2025-03-03 18:29:35,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2610 states, 2609 states have (on average 1.282483710233806) internal successors, (3346), 2609 states have internal predecessors, (3346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:35,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2610 states to 2610 states and 3346 transitions. [2025-03-03 18:29:35,776 INFO L78 Accepts]: Start accepts. Automaton has 2610 states and 3346 transitions. Word has length 58 [2025-03-03 18:29:35,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:29:35,776 INFO L471 AbstractCegarLoop]: Abstraction has 2610 states and 3346 transitions. [2025-03-03 18:29:35,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:35,776 INFO L276 IsEmpty]: Start isEmpty. Operand 2610 states and 3346 transitions. [2025-03-03 18:29:35,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-03-03 18:29:35,778 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:29:35,778 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:29:35,785 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-03 18:29:35,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 18:29:35,979 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:29:35,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:29:35,979 INFO L85 PathProgramCache]: Analyzing trace with hash 1670693499, now seen corresponding path program 1 times [2025-03-03 18:29:35,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:29:35,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622172091] [2025-03-03 18:29:35,979 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:29:35,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:29:35,993 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-03 18:29:36,000 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-03 18:29:36,000 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:29:36,000 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:29:36,346 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:29:36,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:29:36,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622172091] [2025-03-03 18:29:36,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622172091] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:29:36,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:29:36,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2025-03-03 18:29:36,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873001810] [2025-03-03 18:29:36,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:29:36,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-03 18:29:36,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:29:36,347 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-03 18:29:36,347 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=329, Unknown=0, NotChecked=0, Total=380 [2025-03-03 18:29:36,347 INFO L87 Difference]: Start difference. First operand 2610 states and 3346 transitions. Second operand has 20 states, 20 states have (on average 2.95) internal successors, (59), 20 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:36,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:29:36,525 INFO L93 Difference]: Finished difference Result 3537 states and 4604 transitions. [2025-03-03 18:29:36,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-03 18:29:36,526 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.95) internal successors, (59), 20 states have internal predecessors, (59), 0 states have call successors, (0), 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 59 [2025-03-03 18:29:36,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:29:36,530 INFO L225 Difference]: With dead ends: 3537 [2025-03-03 18:29:36,530 INFO L226 Difference]: Without dead ends: 3006 [2025-03-03 18:29:36,531 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=329, Unknown=0, NotChecked=0, Total=380 [2025-03-03 18:29:36,531 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 74 mSDsluCounter, 1070 mSDsCounter, 0 mSdLazyCounter, 580 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 1160 SdHoareTripleChecker+Invalid, 580 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 580 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 18:29:36,531 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 1160 Invalid, 580 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 580 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 18:29:36,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3006 states. [2025-03-03 18:29:36,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3006 to 2792. [2025-03-03 18:29:36,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2792 states, 2791 states have (on average 1.2758867789322823) internal successors, (3561), 2791 states have internal predecessors, (3561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:36,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2792 states to 2792 states and 3561 transitions. [2025-03-03 18:29:36,551 INFO L78 Accepts]: Start accepts. Automaton has 2792 states and 3561 transitions. Word has length 59 [2025-03-03 18:29:36,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:29:36,551 INFO L471 AbstractCegarLoop]: Abstraction has 2792 states and 3561 transitions. [2025-03-03 18:29:36,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.95) internal successors, (59), 20 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:36,551 INFO L276 IsEmpty]: Start isEmpty. Operand 2792 states and 3561 transitions. [2025-03-03 18:29:36,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-03-03 18:29:36,554 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:29:36,554 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:29:36,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2025-03-03 18:29:36,554 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:29:36,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:29:36,555 INFO L85 PathProgramCache]: Analyzing trace with hash 1214031720, now seen corresponding path program 1 times [2025-03-03 18:29:36,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:29:36,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092641998] [2025-03-03 18:29:36,555 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:29:36,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:29:36,567 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-03 18:29:36,576 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-03 18:29:36,576 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:29:36,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:29:37,172 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:29:37,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:29:37,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092641998] [2025-03-03 18:29:37,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092641998] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:29:37,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:29:37,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2025-03-03 18:29:37,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869253788] [2025-03-03 18:29:37,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:29:37,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-03 18:29:37,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:29:37,172 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-03 18:29:37,173 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=362, Unknown=0, NotChecked=0, Total=420 [2025-03-03 18:29:37,173 INFO L87 Difference]: Start difference. First operand 2792 states and 3561 transitions. Second operand has 21 states, 21 states have (on average 2.8095238095238093) internal successors, (59), 21 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:37,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:29:37,433 INFO L93 Difference]: Finished difference Result 3490 states and 4530 transitions. [2025-03-03 18:29:37,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-03 18:29:37,433 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.8095238095238093) internal successors, (59), 21 states have internal predecessors, (59), 0 states have call successors, (0), 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 59 [2025-03-03 18:29:37,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:29:37,437 INFO L225 Difference]: With dead ends: 3490 [2025-03-03 18:29:37,437 INFO L226 Difference]: Without dead ends: 2968 [2025-03-03 18:29:37,438 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=400, Unknown=0, NotChecked=0, Total=462 [2025-03-03 18:29:37,439 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 87 mSDsluCounter, 911 mSDsCounter, 0 mSdLazyCounter, 681 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 1000 SdHoareTripleChecker+Invalid, 682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 681 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 18:29:37,439 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 1000 Invalid, 682 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 681 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 18:29:37,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2968 states. [2025-03-03 18:29:37,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2968 to 2768. [2025-03-03 18:29:37,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2768 states, 2767 states have (on average 1.275027105168052) internal successors, (3528), 2767 states have internal predecessors, (3528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:37,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2768 states to 2768 states and 3528 transitions. [2025-03-03 18:29:37,459 INFO L78 Accepts]: Start accepts. Automaton has 2768 states and 3528 transitions. Word has length 59 [2025-03-03 18:29:37,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:29:37,459 INFO L471 AbstractCegarLoop]: Abstraction has 2768 states and 3528 transitions. [2025-03-03 18:29:37,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.8095238095238093) internal successors, (59), 21 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:37,459 INFO L276 IsEmpty]: Start isEmpty. Operand 2768 states and 3528 transitions. [2025-03-03 18:29:37,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-03-03 18:29:37,461 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:29:37,461 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:29:37,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2025-03-03 18:29:37,462 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:29:37,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:29:37,462 INFO L85 PathProgramCache]: Analyzing trace with hash 1084093678, now seen corresponding path program 1 times [2025-03-03 18:29:37,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:29:37,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501556792] [2025-03-03 18:29:37,462 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:29:37,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:29:37,473 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-03 18:29:37,485 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-03 18:29:37,485 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:29:37,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:29:37,798 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:29:37,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:29:37,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501556792] [2025-03-03 18:29:37,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501556792] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:29:37,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:29:37,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-03 18:29:37,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807937083] [2025-03-03 18:29:37,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:29:37,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 18:29:37,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:29:37,799 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 18:29:37,799 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2025-03-03 18:29:37,800 INFO L87 Difference]: Start difference. First operand 2768 states and 3528 transitions. Second operand has 12 states, 12 states have (on average 4.916666666666667) internal successors, (59), 12 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:38,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:29:38,035 INFO L93 Difference]: Finished difference Result 3511 states and 4579 transitions. [2025-03-03 18:29:38,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 18:29:38,036 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.916666666666667) internal successors, (59), 12 states have internal predecessors, (59), 0 states have call successors, (0), 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 59 [2025-03-03 18:29:38,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:29:38,040 INFO L225 Difference]: With dead ends: 3511 [2025-03-03 18:29:38,040 INFO L226 Difference]: Without dead ends: 2979 [2025-03-03 18:29:38,041 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2025-03-03 18:29:38,041 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 297 mSDsluCounter, 756 mSDsCounter, 0 mSdLazyCounter, 602 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 SdHoareTripleChecker+Valid, 870 SdHoareTripleChecker+Invalid, 603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 602 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 18:29:38,041 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [297 Valid, 870 Invalid, 603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 602 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 18:29:38,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2979 states. [2025-03-03 18:29:38,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2979 to 2781. [2025-03-03 18:29:38,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2781 states, 2780 states have (on average 1.275179856115108) internal successors, (3545), 2780 states have internal predecessors, (3545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:38,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2781 states to 2781 states and 3545 transitions. [2025-03-03 18:29:38,062 INFO L78 Accepts]: Start accepts. Automaton has 2781 states and 3545 transitions. Word has length 59 [2025-03-03 18:29:38,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:29:38,062 INFO L471 AbstractCegarLoop]: Abstraction has 2781 states and 3545 transitions. [2025-03-03 18:29:38,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.916666666666667) internal successors, (59), 12 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:38,062 INFO L276 IsEmpty]: Start isEmpty. Operand 2781 states and 3545 transitions. [2025-03-03 18:29:38,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-03-03 18:29:38,064 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:29:38,064 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:29:38,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2025-03-03 18:29:38,064 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:29:38,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:29:38,065 INFO L85 PathProgramCache]: Analyzing trace with hash 911951169, now seen corresponding path program 1 times [2025-03-03 18:29:38,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:29:38,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016376569] [2025-03-03 18:29:38,065 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:29:38,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:29:38,076 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-03 18:29:38,087 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-03 18:29:38,087 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:29:38,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:29:38,605 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:29:38,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:29:38,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016376569] [2025-03-03 18:29:38,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016376569] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:29:38,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:29:38,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2025-03-03 18:29:38,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472660190] [2025-03-03 18:29:38,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:29:38,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-03 18:29:38,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:29:38,606 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-03 18:29:38,606 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2025-03-03 18:29:38,606 INFO L87 Difference]: Start difference. First operand 2781 states and 3545 transitions. Second operand has 18 states, 18 states have (on average 3.2777777777777777) internal successors, (59), 18 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:39,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:29:39,023 INFO L93 Difference]: Finished difference Result 3491 states and 4548 transitions. [2025-03-03 18:29:39,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-03 18:29:39,023 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.2777777777777777) internal successors, (59), 18 states have internal predecessors, (59), 0 states have call successors, (0), 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 59 [2025-03-03 18:29:39,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:29:39,027 INFO L225 Difference]: With dead ends: 3491 [2025-03-03 18:29:39,027 INFO L226 Difference]: Without dead ends: 2956 [2025-03-03 18:29:39,028 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=118, Invalid=584, Unknown=0, NotChecked=0, Total=702 [2025-03-03 18:29:39,028 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 290 mSDsluCounter, 748 mSDsCounter, 0 mSdLazyCounter, 832 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 851 SdHoareTripleChecker+Invalid, 835 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 832 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 18:29:39,028 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [290 Valid, 851 Invalid, 835 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 832 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 18:29:39,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2956 states. [2025-03-03 18:29:39,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2956 to 2695. [2025-03-03 18:29:39,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2695 states, 2694 states have (on average 1.2795100222717148) internal successors, (3447), 2694 states have internal predecessors, (3447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:39,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2695 states to 2695 states and 3447 transitions. [2025-03-03 18:29:39,056 INFO L78 Accepts]: Start accepts. Automaton has 2695 states and 3447 transitions. Word has length 59 [2025-03-03 18:29:39,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:29:39,057 INFO L471 AbstractCegarLoop]: Abstraction has 2695 states and 3447 transitions. [2025-03-03 18:29:39,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.2777777777777777) internal successors, (59), 18 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:39,057 INFO L276 IsEmpty]: Start isEmpty. Operand 2695 states and 3447 transitions. [2025-03-03 18:29:39,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-03-03 18:29:39,059 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:29:39,059 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:29:39,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2025-03-03 18:29:39,059 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:29:39,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:29:39,060 INFO L85 PathProgramCache]: Analyzing trace with hash 478165220, now seen corresponding path program 1 times [2025-03-03 18:29:39,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:29:39,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71010739] [2025-03-03 18:29:39,060 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:29:39,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:29:39,075 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-03 18:29:39,090 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-03 18:29:39,090 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:29:39,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:29:39,221 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:29:39,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:29:39,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71010739] [2025-03-03 18:29:39,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71010739] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:29:39,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:29:39,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 18:29:39,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262901370] [2025-03-03 18:29:39,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:29:39,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 18:29:39,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:29:39,222 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 18:29:39,222 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-03 18:29:39,222 INFO L87 Difference]: Start difference. First operand 2695 states and 3447 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:39,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:29:39,373 INFO L93 Difference]: Finished difference Result 3466 states and 4509 transitions. [2025-03-03 18:29:39,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 18:29:39,374 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 0 states have call successors, (0), 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 59 [2025-03-03 18:29:39,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:29:39,376 INFO L225 Difference]: With dead ends: 3466 [2025-03-03 18:29:39,376 INFO L226 Difference]: Without dead ends: 2492 [2025-03-03 18:29:39,377 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-03 18:29:39,377 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 125 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 18:29:39,377 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 311 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 18:29:39,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2492 states. [2025-03-03 18:29:39,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2492 to 2488. [2025-03-03 18:29:39,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2488 states, 2487 states have (on average 1.2798552472858866) internal successors, (3183), 2487 states have internal predecessors, (3183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:39,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2488 states to 2488 states and 3183 transitions. [2025-03-03 18:29:39,392 INFO L78 Accepts]: Start accepts. Automaton has 2488 states and 3183 transitions. Word has length 59 [2025-03-03 18:29:39,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:29:39,392 INFO L471 AbstractCegarLoop]: Abstraction has 2488 states and 3183 transitions. [2025-03-03 18:29:39,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:39,393 INFO L276 IsEmpty]: Start isEmpty. Operand 2488 states and 3183 transitions. [2025-03-03 18:29:39,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-03-03 18:29:39,394 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:29:39,394 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:29:39,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2025-03-03 18:29:39,395 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:29:39,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:29:39,395 INFO L85 PathProgramCache]: Analyzing trace with hash -825867889, now seen corresponding path program 1 times [2025-03-03 18:29:39,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:29:39,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138780402] [2025-03-03 18:29:39,395 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:29:39,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:29:39,407 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-03 18:29:39,417 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-03 18:29:39,417 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:29:39,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:29:39,641 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:29:39,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:29:39,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138780402] [2025-03-03 18:29:39,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138780402] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:29:39,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:29:39,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-03 18:29:39,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244100872] [2025-03-03 18:29:39,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:29:39,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 18:29:39,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:29:39,641 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 18:29:39,641 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-03-03 18:29:39,642 INFO L87 Difference]: Start difference. First operand 2488 states and 3183 transitions. Second operand has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 11 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:39,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:29:39,746 INFO L93 Difference]: Finished difference Result 3143 states and 4100 transitions. [2025-03-03 18:29:39,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-03 18:29:39,747 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 11 states have internal predecessors, (59), 0 states have call successors, (0), 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 59 [2025-03-03 18:29:39,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:29:39,748 INFO L225 Difference]: With dead ends: 3143 [2025-03-03 18:29:39,748 INFO L226 Difference]: Without dead ends: 2450 [2025-03-03 18:29:39,749 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-03-03 18:29:39,750 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 40 mSDsluCounter, 578 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 677 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 18:29:39,750 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 677 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 18:29:39,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2450 states. [2025-03-03 18:29:39,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2450 to 2298. [2025-03-03 18:29:39,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2298 states, 2297 states have (on average 1.264257727470614) internal successors, (2904), 2297 states have internal predecessors, (2904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:39,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2298 states to 2298 states and 2904 transitions. [2025-03-03 18:29:39,766 INFO L78 Accepts]: Start accepts. Automaton has 2298 states and 2904 transitions. Word has length 59 [2025-03-03 18:29:39,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:29:39,766 INFO L471 AbstractCegarLoop]: Abstraction has 2298 states and 2904 transitions. [2025-03-03 18:29:39,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 11 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:39,767 INFO L276 IsEmpty]: Start isEmpty. Operand 2298 states and 2904 transitions. [2025-03-03 18:29:39,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-03-03 18:29:39,768 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:29:39,768 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:29:39,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2025-03-03 18:29:39,768 INFO L396 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:29:39,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:29:39,769 INFO L85 PathProgramCache]: Analyzing trace with hash 500754996, now seen corresponding path program 1 times [2025-03-03 18:29:39,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:29:39,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084129050] [2025-03-03 18:29:39,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:29:39,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:29:39,780 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-03 18:29:39,793 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-03 18:29:39,793 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:29:39,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:29:39,997 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:29:39,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:29:39,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084129050] [2025-03-03 18:29:39,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084129050] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:29:39,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:29:39,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-03 18:29:39,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843184268] [2025-03-03 18:29:39,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:29:39,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 18:29:39,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:29:39,998 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 18:29:39,998 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-03-03 18:29:39,998 INFO L87 Difference]: Start difference. First operand 2298 states and 2904 transitions. Second operand has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 11 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:40,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:29:40,071 INFO L93 Difference]: Finished difference Result 2883 states and 3724 transitions. [2025-03-03 18:29:40,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-03 18:29:40,072 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 11 states have internal predecessors, (59), 0 states have call successors, (0), 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 59 [2025-03-03 18:29:40,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:29:40,073 INFO L225 Difference]: With dead ends: 2883 [2025-03-03 18:29:40,073 INFO L226 Difference]: Without dead ends: 2286 [2025-03-03 18:29:40,074 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-03-03 18:29:40,075 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 30 mSDsluCounter, 574 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 674 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 18:29:40,075 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 674 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 18:29:40,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2286 states. [2025-03-03 18:29:40,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2286 to 2116. [2025-03-03 18:29:40,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2116 states, 2115 states have (on average 1.2723404255319148) internal successors, (2691), 2115 states have internal predecessors, (2691), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:40,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2116 states to 2116 states and 2691 transitions. [2025-03-03 18:29:40,090 INFO L78 Accepts]: Start accepts. Automaton has 2116 states and 2691 transitions. Word has length 59 [2025-03-03 18:29:40,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:29:40,090 INFO L471 AbstractCegarLoop]: Abstraction has 2116 states and 2691 transitions. [2025-03-03 18:29:40,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 11 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:40,090 INFO L276 IsEmpty]: Start isEmpty. Operand 2116 states and 2691 transitions. [2025-03-03 18:29:40,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-03-03 18:29:40,091 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:29:40,091 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:29:40,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2025-03-03 18:29:40,092 INFO L396 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:29:40,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:29:40,092 INFO L85 PathProgramCache]: Analyzing trace with hash 1605793543, now seen corresponding path program 1 times [2025-03-03 18:29:40,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:29:40,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227876095] [2025-03-03 18:29:40,092 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:29:40,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:29:40,104 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-03 18:29:40,115 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-03 18:29:40,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:29:40,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:29:40,201 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:29:40,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:29:40,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227876095] [2025-03-03 18:29:40,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227876095] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:29:40,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:29:40,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 18:29:40,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910778123] [2025-03-03 18:29:40,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:29:40,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 18:29:40,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:29:40,202 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 18:29:40,202 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-03 18:29:40,202 INFO L87 Difference]: Start difference. First operand 2116 states and 2691 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:40,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:29:40,297 INFO L93 Difference]: Finished difference Result 2707 states and 3518 transitions. [2025-03-03 18:29:40,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 18:29:40,298 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 0 states have call successors, (0), 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 59 [2025-03-03 18:29:40,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:29:40,299 INFO L225 Difference]: With dead ends: 2707 [2025-03-03 18:29:40,299 INFO L226 Difference]: Without dead ends: 2031 [2025-03-03 18:29:40,300 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-03 18:29:40,300 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 113 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 18:29:40,301 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 310 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 18:29:40,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2031 states. [2025-03-03 18:29:40,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2031 to 2027. [2025-03-03 18:29:40,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2027 states, 2026 states have (on average 1.2690029615004936) internal successors, (2571), 2026 states have internal predecessors, (2571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:40,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2027 states to 2027 states and 2571 transitions. [2025-03-03 18:29:40,313 INFO L78 Accepts]: Start accepts. Automaton has 2027 states and 2571 transitions. Word has length 59 [2025-03-03 18:29:40,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:29:40,313 INFO L471 AbstractCegarLoop]: Abstraction has 2027 states and 2571 transitions. [2025-03-03 18:29:40,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:40,313 INFO L276 IsEmpty]: Start isEmpty. Operand 2027 states and 2571 transitions. [2025-03-03 18:29:40,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-03-03 18:29:40,315 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:29:40,315 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:29:40,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2025-03-03 18:29:40,315 INFO L396 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:29:40,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:29:40,315 INFO L85 PathProgramCache]: Analyzing trace with hash -600751252, now seen corresponding path program 1 times [2025-03-03 18:29:40,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:29:40,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765307604] [2025-03-03 18:29:40,316 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:29:40,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:29:40,329 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-03 18:29:40,341 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-03 18:29:40,341 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:29:40,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:29:40,836 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:29:40,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:29:40,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765307604] [2025-03-03 18:29:40,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765307604] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:29:40,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:29:40,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2025-03-03 18:29:40,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886063940] [2025-03-03 18:29:40,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:29:40,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-03 18:29:40,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:29:40,836 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-03 18:29:40,837 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=354, Unknown=0, NotChecked=0, Total=420 [2025-03-03 18:29:40,837 INFO L87 Difference]: Start difference. First operand 2027 states and 2571 transitions. Second operand has 21 states, 21 states have (on average 2.8095238095238093) internal successors, (59), 21 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:41,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:29:41,039 INFO L93 Difference]: Finished difference Result 2708 states and 3499 transitions. [2025-03-03 18:29:41,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-03 18:29:41,039 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.8095238095238093) internal successors, (59), 21 states have internal predecessors, (59), 0 states have call successors, (0), 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 59 [2025-03-03 18:29:41,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:29:41,041 INFO L225 Difference]: With dead ends: 2708 [2025-03-03 18:29:41,041 INFO L226 Difference]: Without dead ends: 2204 [2025-03-03 18:29:41,042 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=354, Unknown=0, NotChecked=0, Total=420 [2025-03-03 18:29:41,044 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 146 mSDsluCounter, 692 mSDsCounter, 0 mSdLazyCounter, 545 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 777 SdHoareTripleChecker+Invalid, 545 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 545 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 18:29:41,044 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 777 Invalid, 545 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 545 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 18:29:41,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2204 states. [2025-03-03 18:29:41,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2204 to 2090. [2025-03-03 18:29:41,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2090 states, 2089 states have (on average 1.267113451412159) internal successors, (2647), 2089 states have internal predecessors, (2647), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:41,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2090 states to 2090 states and 2647 transitions. [2025-03-03 18:29:41,058 INFO L78 Accepts]: Start accepts. Automaton has 2090 states and 2647 transitions. Word has length 59 [2025-03-03 18:29:41,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:29:41,058 INFO L471 AbstractCegarLoop]: Abstraction has 2090 states and 2647 transitions. [2025-03-03 18:29:41,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.8095238095238093) internal successors, (59), 21 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:41,058 INFO L276 IsEmpty]: Start isEmpty. Operand 2090 states and 2647 transitions. [2025-03-03 18:29:41,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-03-03 18:29:41,059 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:29:41,059 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:29:41,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2025-03-03 18:29:41,060 INFO L396 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:29:41,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:29:41,060 INFO L85 PathProgramCache]: Analyzing trace with hash -142314969, now seen corresponding path program 1 times [2025-03-03 18:29:41,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:29:41,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501608537] [2025-03-03 18:29:41,060 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:29:41,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:29:41,071 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-03 18:29:41,083 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-03 18:29:41,083 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:29:41,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:29:41,290 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:29:41,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:29:41,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501608537] [2025-03-03 18:29:41,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501608537] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:29:41,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:29:41,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 18:29:41,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629625659] [2025-03-03 18:29:41,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:29:41,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 18:29:41,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:29:41,291 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 18:29:41,291 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-03 18:29:41,292 INFO L87 Difference]: Start difference. First operand 2090 states and 2647 transitions. Second operand has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:41,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:29:41,438 INFO L93 Difference]: Finished difference Result 3017 states and 3929 transitions. [2025-03-03 18:29:41,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 18:29:41,438 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 0 states have call successors, (0), 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 59 [2025-03-03 18:29:41,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:29:41,440 INFO L225 Difference]: With dead ends: 3017 [2025-03-03 18:29:41,441 INFO L226 Difference]: Without dead ends: 2513 [2025-03-03 18:29:41,441 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2025-03-03 18:29:41,442 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 237 mSDsluCounter, 503 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 592 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 18:29:41,442 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 592 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 18:29:41,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2513 states. [2025-03-03 18:29:41,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2513 to 2355. [2025-03-03 18:29:41,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2355 states, 2354 states have (on average 1.279949022939677) internal successors, (3013), 2354 states have internal predecessors, (3013), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:41,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2355 states to 2355 states and 3013 transitions. [2025-03-03 18:29:41,457 INFO L78 Accepts]: Start accepts. Automaton has 2355 states and 3013 transitions. Word has length 59 [2025-03-03 18:29:41,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:29:41,457 INFO L471 AbstractCegarLoop]: Abstraction has 2355 states and 3013 transitions. [2025-03-03 18:29:41,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:41,457 INFO L276 IsEmpty]: Start isEmpty. Operand 2355 states and 3013 transitions. [2025-03-03 18:29:41,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-03-03 18:29:41,459 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:29:41,459 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:29:41,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2025-03-03 18:29:41,459 INFO L396 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:29:41,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:29:41,460 INFO L85 PathProgramCache]: Analyzing trace with hash -249230859, now seen corresponding path program 1 times [2025-03-03 18:29:41,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:29:41,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70473005] [2025-03-03 18:29:41,460 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:29:41,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:29:41,487 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-03 18:29:41,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-03 18:29:41,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:29:41,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:29:42,205 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:29:42,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:29:42,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70473005] [2025-03-03 18:29:42,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70473005] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:29:42,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:29:42,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2025-03-03 18:29:42,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581238591] [2025-03-03 18:29:42,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:29:42,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-03 18:29:42,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:29:42,207 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-03 18:29:42,207 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=327, Unknown=0, NotChecked=0, Total=420 [2025-03-03 18:29:42,207 INFO L87 Difference]: Start difference. First operand 2355 states and 3013 transitions. Second operand has 21 states, 21 states have (on average 2.8095238095238093) internal successors, (59), 21 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:42,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:29:42,513 INFO L93 Difference]: Finished difference Result 3422 states and 4506 transitions. [2025-03-03 18:29:42,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-03 18:29:42,514 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.8095238095238093) internal successors, (59), 21 states have internal predecessors, (59), 0 states have call successors, (0), 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 59 [2025-03-03 18:29:42,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:29:42,516 INFO L225 Difference]: With dead ends: 3422 [2025-03-03 18:29:42,516 INFO L226 Difference]: Without dead ends: 2698 [2025-03-03 18:29:42,517 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=101, Invalid=361, Unknown=0, NotChecked=0, Total=462 [2025-03-03 18:29:42,517 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 340 mSDsluCounter, 1599 mSDsCounter, 0 mSdLazyCounter, 876 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 340 SdHoareTripleChecker+Valid, 1728 SdHoareTripleChecker+Invalid, 876 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 876 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 18:29:42,517 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [340 Valid, 1728 Invalid, 876 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 876 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 18:29:42,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2698 states. [2025-03-03 18:29:42,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2698 to 2380. [2025-03-03 18:29:42,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2380 states, 2379 states have (on average 1.2833123160992013) internal successors, (3053), 2379 states have internal predecessors, (3053), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:42,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2380 states to 2380 states and 3053 transitions. [2025-03-03 18:29:42,531 INFO L78 Accepts]: Start accepts. Automaton has 2380 states and 3053 transitions. Word has length 59 [2025-03-03 18:29:42,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:29:42,531 INFO L471 AbstractCegarLoop]: Abstraction has 2380 states and 3053 transitions. [2025-03-03 18:29:42,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.8095238095238093) internal successors, (59), 21 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:42,531 INFO L276 IsEmpty]: Start isEmpty. Operand 2380 states and 3053 transitions. [2025-03-03 18:29:42,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-03-03 18:29:42,533 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:29:42,533 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:29:42,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2025-03-03 18:29:42,533 INFO L396 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:29:42,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:29:42,533 INFO L85 PathProgramCache]: Analyzing trace with hash -215178839, now seen corresponding path program 1 times [2025-03-03 18:29:42,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:29:42,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149312247] [2025-03-03 18:29:42,533 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:29:42,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:29:42,562 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-03 18:29:42,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-03 18:29:42,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:29:42,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:29:43,093 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:29:43,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:29:43,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149312247] [2025-03-03 18:29:43,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149312247] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:29:43,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:29:43,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2025-03-03 18:29:43,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216973328] [2025-03-03 18:29:43,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:29:43,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-03 18:29:43,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:29:43,094 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-03 18:29:43,094 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=354, Unknown=0, NotChecked=0, Total=420 [2025-03-03 18:29:43,094 INFO L87 Difference]: Start difference. First operand 2380 states and 3053 transitions. Second operand has 21 states, 21 states have (on average 2.8095238095238093) internal successors, (59), 21 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:43,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:29:43,308 INFO L93 Difference]: Finished difference Result 3248 states and 4279 transitions. [2025-03-03 18:29:43,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-03 18:29:43,308 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.8095238095238093) internal successors, (59), 21 states have internal predecessors, (59), 0 states have call successors, (0), 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 59 [2025-03-03 18:29:43,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:29:43,310 INFO L225 Difference]: With dead ends: 3248 [2025-03-03 18:29:43,310 INFO L226 Difference]: Without dead ends: 2485 [2025-03-03 18:29:43,311 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=354, Unknown=0, NotChecked=0, Total=420 [2025-03-03 18:29:43,311 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 131 mSDsluCounter, 1171 mSDsCounter, 0 mSdLazyCounter, 666 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 1268 SdHoareTripleChecker+Invalid, 666 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 666 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 18:29:43,311 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 1268 Invalid, 666 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 666 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 18:29:43,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2485 states. [2025-03-03 18:29:43,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2485 to 2384. [2025-03-03 18:29:43,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2384 states, 2383 states have (on average 1.2845153168275283) internal successors, (3061), 2383 states have internal predecessors, (3061), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:43,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2384 states to 2384 states and 3061 transitions. [2025-03-03 18:29:43,323 INFO L78 Accepts]: Start accepts. Automaton has 2384 states and 3061 transitions. Word has length 59 [2025-03-03 18:29:43,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:29:43,323 INFO L471 AbstractCegarLoop]: Abstraction has 2384 states and 3061 transitions. [2025-03-03 18:29:43,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.8095238095238093) internal successors, (59), 21 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:43,323 INFO L276 IsEmpty]: Start isEmpty. Operand 2384 states and 3061 transitions. [2025-03-03 18:29:43,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-03 18:29:43,325 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:29:43,325 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:29:43,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2025-03-03 18:29:43,325 INFO L396 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:29:43,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:29:43,325 INFO L85 PathProgramCache]: Analyzing trace with hash -290556444, now seen corresponding path program 1 times [2025-03-03 18:29:43,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:29:43,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893065240] [2025-03-03 18:29:43,326 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:29:43,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:29:43,336 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-03 18:29:43,344 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-03 18:29:43,344 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:29:43,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:29:43,939 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:29:43,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:29:43,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893065240] [2025-03-03 18:29:43,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [893065240] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:29:43,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:29:43,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2025-03-03 18:29:43,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808836056] [2025-03-03 18:29:43,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:29:43,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-03 18:29:43,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:29:43,940 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-03 18:29:43,940 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=327, Unknown=0, NotChecked=0, Total=380 [2025-03-03 18:29:43,941 INFO L87 Difference]: Start difference. First operand 2384 states and 3061 transitions. Second operand has 20 states, 20 states have (on average 3.0) internal successors, (60), 20 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:44,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:29:44,202 INFO L93 Difference]: Finished difference Result 3219 states and 4236 transitions. [2025-03-03 18:29:44,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-03 18:29:44,203 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.0) internal successors, (60), 20 states have internal predecessors, (60), 0 states have call successors, (0), 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 60 [2025-03-03 18:29:44,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:29:44,205 INFO L225 Difference]: With dead ends: 3219 [2025-03-03 18:29:44,205 INFO L226 Difference]: Without dead ends: 2456 [2025-03-03 18:29:44,206 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2025-03-03 18:29:44,206 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 78 mSDsluCounter, 1053 mSDsCounter, 0 mSdLazyCounter, 715 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 1146 SdHoareTripleChecker+Invalid, 716 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 715 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 18:29:44,206 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 1146 Invalid, 716 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 715 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 18:29:44,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2456 states. [2025-03-03 18:29:44,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2456 to 2384. [2025-03-03 18:29:44,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2384 states, 2383 states have (on average 1.2845153168275283) internal successors, (3061), 2383 states have internal predecessors, (3061), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:44,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2384 states to 2384 states and 3061 transitions. [2025-03-03 18:29:44,229 INFO L78 Accepts]: Start accepts. Automaton has 2384 states and 3061 transitions. Word has length 60 [2025-03-03 18:29:44,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:29:44,229 INFO L471 AbstractCegarLoop]: Abstraction has 2384 states and 3061 transitions. [2025-03-03 18:29:44,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.0) internal successors, (60), 20 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:44,229 INFO L276 IsEmpty]: Start isEmpty. Operand 2384 states and 3061 transitions. [2025-03-03 18:29:44,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-03 18:29:44,231 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:29:44,231 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:29:44,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2025-03-03 18:29:44,231 INFO L396 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:29:44,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:29:44,231 INFO L85 PathProgramCache]: Analyzing trace with hash 950816561, now seen corresponding path program 1 times [2025-03-03 18:29:44,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:29:44,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250214809] [2025-03-03 18:29:44,231 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:29:44,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:29:44,241 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-03 18:29:44,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-03 18:29:44,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:29:44,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:29:44,958 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:29:44,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:29:44,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250214809] [2025-03-03 18:29:44,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250214809] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:29:44,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:29:44,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2025-03-03 18:29:44,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875057673] [2025-03-03 18:29:44,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:29:44,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-03 18:29:44,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:29:44,958 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-03 18:29:44,959 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=362, Unknown=0, NotChecked=0, Total=420 [2025-03-03 18:29:44,959 INFO L87 Difference]: Start difference. First operand 2384 states and 3061 transitions. Second operand has 21 states, 21 states have (on average 2.857142857142857) internal successors, (60), 21 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:45,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:29:45,294 INFO L93 Difference]: Finished difference Result 3341 states and 4398 transitions. [2025-03-03 18:29:45,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-03 18:29:45,294 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.857142857142857) internal successors, (60), 21 states have internal predecessors, (60), 0 states have call successors, (0), 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 60 [2025-03-03 18:29:45,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:29:45,296 INFO L225 Difference]: With dead ends: 3341 [2025-03-03 18:29:45,296 INFO L226 Difference]: Without dead ends: 2578 [2025-03-03 18:29:45,297 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=400, Unknown=0, NotChecked=0, Total=462 [2025-03-03 18:29:45,297 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 80 mSDsluCounter, 1216 mSDsCounter, 0 mSdLazyCounter, 847 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 1302 SdHoareTripleChecker+Invalid, 848 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 847 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 18:29:45,297 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 1302 Invalid, 848 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 847 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 18:29:45,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2578 states. [2025-03-03 18:29:45,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2578 to 2378. [2025-03-03 18:29:45,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2378 states, 2377 states have (on average 1.2852334875893985) internal successors, (3055), 2377 states have internal predecessors, (3055), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:45,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2378 states to 2378 states and 3055 transitions. [2025-03-03 18:29:45,310 INFO L78 Accepts]: Start accepts. Automaton has 2378 states and 3055 transitions. Word has length 60 [2025-03-03 18:29:45,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:29:45,310 INFO L471 AbstractCegarLoop]: Abstraction has 2378 states and 3055 transitions. [2025-03-03 18:29:45,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.857142857142857) internal successors, (60), 21 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:45,310 INFO L276 IsEmpty]: Start isEmpty. Operand 2378 states and 3055 transitions. [2025-03-03 18:29:45,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-03 18:29:45,312 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:29:45,312 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:29:45,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2025-03-03 18:29:45,312 INFO L396 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:29:45,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:29:45,312 INFO L85 PathProgramCache]: Analyzing trace with hash 127359844, now seen corresponding path program 1 times [2025-03-03 18:29:45,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:29:45,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802769868] [2025-03-03 18:29:45,312 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:29:45,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:29:45,333 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-03 18:29:45,345 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-03 18:29:45,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:29:45,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:29:45,754 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:29:45,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:29:45,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802769868] [2025-03-03 18:29:45,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802769868] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:29:45,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:29:45,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2025-03-03 18:29:45,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539670469] [2025-03-03 18:29:45,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:29:45,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-03 18:29:45,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:29:45,754 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-03 18:29:45,754 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2025-03-03 18:29:45,754 INFO L87 Difference]: Start difference. First operand 2378 states and 3055 transitions. Second operand has 18 states, 18 states have (on average 3.3333333333333335) internal successors, (60), 18 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:45,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:29:45,952 INFO L93 Difference]: Finished difference Result 3274 states and 4317 transitions. [2025-03-03 18:29:45,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-03 18:29:45,952 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.3333333333333335) internal successors, (60), 18 states have internal predecessors, (60), 0 states have call successors, (0), 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 60 [2025-03-03 18:29:45,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:29:45,954 INFO L225 Difference]: With dead ends: 3274 [2025-03-03 18:29:45,954 INFO L226 Difference]: Without dead ends: 2503 [2025-03-03 18:29:45,954 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2025-03-03 18:29:45,955 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 99 mSDsluCounter, 1189 mSDsCounter, 0 mSdLazyCounter, 606 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 1286 SdHoareTripleChecker+Invalid, 606 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 606 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 18:29:45,955 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 1286 Invalid, 606 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 606 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 18:29:45,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2503 states. [2025-03-03 18:29:45,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2503 to 2441. [2025-03-03 18:29:45,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2441 states, 2440 states have (on average 1.2860655737704918) internal successors, (3138), 2440 states have internal predecessors, (3138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:45,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2441 states to 2441 states and 3138 transitions. [2025-03-03 18:29:45,967 INFO L78 Accepts]: Start accepts. Automaton has 2441 states and 3138 transitions. Word has length 60 [2025-03-03 18:29:45,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:29:45,967 INFO L471 AbstractCegarLoop]: Abstraction has 2441 states and 3138 transitions. [2025-03-03 18:29:45,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.3333333333333335) internal successors, (60), 18 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:45,967 INFO L276 IsEmpty]: Start isEmpty. Operand 2441 states and 3138 transitions. [2025-03-03 18:29:45,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-03 18:29:45,968 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:29:45,968 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:29:45,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2025-03-03 18:29:45,969 INFO L396 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:29:45,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:29:45,971 INFO L85 PathProgramCache]: Analyzing trace with hash -1076494273, now seen corresponding path program 1 times [2025-03-03 18:29:45,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:29:45,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345899516] [2025-03-03 18:29:45,971 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:29:45,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:29:45,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-03 18:29:45,993 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-03 18:29:45,993 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:29:45,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:29:46,448 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:29:46,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:29:46,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345899516] [2025-03-03 18:29:46,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345899516] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:29:46,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:29:46,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2025-03-03 18:29:46,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957696778] [2025-03-03 18:29:46,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:29:46,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-03 18:29:46,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:29:46,448 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-03 18:29:46,448 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2025-03-03 18:29:46,449 INFO L87 Difference]: Start difference. First operand 2441 states and 3138 transitions. Second operand has 21 states, 21 states have (on average 2.857142857142857) internal successors, (60), 21 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:46,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:29:46,662 INFO L93 Difference]: Finished difference Result 3238 states and 4268 transitions. [2025-03-03 18:29:46,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-03 18:29:46,662 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.857142857142857) internal successors, (60), 21 states have internal predecessors, (60), 0 states have call successors, (0), 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 60 [2025-03-03 18:29:46,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:29:46,664 INFO L225 Difference]: With dead ends: 3238 [2025-03-03 18:29:46,664 INFO L226 Difference]: Without dead ends: 2475 [2025-03-03 18:29:46,664 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2025-03-03 18:29:46,665 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 81 mSDsluCounter, 1388 mSDsCounter, 0 mSdLazyCounter, 701 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 1484 SdHoareTripleChecker+Invalid, 701 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 701 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 18:29:46,665 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 1484 Invalid, 701 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 701 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 18:29:46,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2475 states. [2025-03-03 18:29:46,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2475 to 2427. [2025-03-03 18:29:46,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2427 states, 2426 states have (on average 1.2873042044517724) internal successors, (3123), 2426 states have internal predecessors, (3123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:46,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2427 states to 2427 states and 3123 transitions. [2025-03-03 18:29:46,677 INFO L78 Accepts]: Start accepts. Automaton has 2427 states and 3123 transitions. Word has length 60 [2025-03-03 18:29:46,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:29:46,677 INFO L471 AbstractCegarLoop]: Abstraction has 2427 states and 3123 transitions. [2025-03-03 18:29:46,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.857142857142857) internal successors, (60), 21 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:46,677 INFO L276 IsEmpty]: Start isEmpty. Operand 2427 states and 3123 transitions. [2025-03-03 18:29:46,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-03 18:29:46,678 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:29:46,678 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:29:46,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2025-03-03 18:29:46,679 INFO L396 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:29:46,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:29:46,679 INFO L85 PathProgramCache]: Analyzing trace with hash 1281840220, now seen corresponding path program 1 times [2025-03-03 18:29:46,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:29:46,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035644377] [2025-03-03 18:29:46,679 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:29:46,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:29:46,691 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-03 18:29:46,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-03 18:29:46,703 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:29:46,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:29:47,287 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:29:47,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:29:47,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035644377] [2025-03-03 18:29:47,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035644377] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:29:47,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:29:47,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2025-03-03 18:29:47,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675461608] [2025-03-03 18:29:47,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:29:47,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-03 18:29:47,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:29:47,288 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-03 18:29:47,288 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=400, Unknown=0, NotChecked=0, Total=462 [2025-03-03 18:29:47,288 INFO L87 Difference]: Start difference. First operand 2427 states and 3123 transitions. Second operand has 22 states, 22 states have (on average 2.727272727272727) internal successors, (60), 22 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:47,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:29:47,508 INFO L93 Difference]: Finished difference Result 3248 states and 4287 transitions. [2025-03-03 18:29:47,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-03 18:29:47,508 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.727272727272727) internal successors, (60), 22 states have internal predecessors, (60), 0 states have call successors, (0), 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 60 [2025-03-03 18:29:47,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:29:47,510 INFO L225 Difference]: With dead ends: 3248 [2025-03-03 18:29:47,510 INFO L226 Difference]: Without dead ends: 2485 [2025-03-03 18:29:47,511 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=400, Unknown=0, NotChecked=0, Total=462 [2025-03-03 18:29:47,511 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 87 mSDsluCounter, 1248 mSDsCounter, 0 mSdLazyCounter, 723 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 1342 SdHoareTripleChecker+Invalid, 724 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 723 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 18:29:47,511 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 1342 Invalid, 724 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 723 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 18:29:47,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2485 states. [2025-03-03 18:29:47,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2485 to 2434. [2025-03-03 18:29:47,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2434 states, 2433 states have (on average 1.287299630086313) internal successors, (3132), 2433 states have internal predecessors, (3132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:47,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2434 states to 2434 states and 3132 transitions. [2025-03-03 18:29:47,524 INFO L78 Accepts]: Start accepts. Automaton has 2434 states and 3132 transitions. Word has length 60 [2025-03-03 18:29:47,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:29:47,524 INFO L471 AbstractCegarLoop]: Abstraction has 2434 states and 3132 transitions. [2025-03-03 18:29:47,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.727272727272727) internal successors, (60), 22 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:47,524 INFO L276 IsEmpty]: Start isEmpty. Operand 2434 states and 3132 transitions. [2025-03-03 18:29:47,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-03 18:29:47,525 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:29:47,526 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:29:47,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2025-03-03 18:29:47,526 INFO L396 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:29:47,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:29:47,526 INFO L85 PathProgramCache]: Analyzing trace with hash -364321389, now seen corresponding path program 1 times [2025-03-03 18:29:47,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:29:47,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918606959] [2025-03-03 18:29:47,526 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:29:47,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:29:47,538 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-03 18:29:47,550 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-03 18:29:47,550 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:29:47,550 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:29:47,922 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:29:47,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:29:47,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918606959] [2025-03-03 18:29:47,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918606959] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:29:47,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:29:47,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2025-03-03 18:29:47,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482039375] [2025-03-03 18:29:47,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:29:47,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-03 18:29:47,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:29:47,922 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-03 18:29:47,922 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2025-03-03 18:29:47,923 INFO L87 Difference]: Start difference. First operand 2434 states and 3132 transitions. Second operand has 18 states, 18 states have (on average 3.3333333333333335) internal successors, (60), 18 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:48,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:29:48,097 INFO L93 Difference]: Finished difference Result 3376 states and 4439 transitions. [2025-03-03 18:29:48,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-03 18:29:48,097 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.3333333333333335) internal successors, (60), 18 states have internal predecessors, (60), 0 states have call successors, (0), 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 60 [2025-03-03 18:29:48,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:29:48,099 INFO L225 Difference]: With dead ends: 3376 [2025-03-03 18:29:48,099 INFO L226 Difference]: Without dead ends: 2605 [2025-03-03 18:29:48,100 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2025-03-03 18:29:48,100 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 72 mSDsluCounter, 985 mSDsCounter, 0 mSdLazyCounter, 498 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 1077 SdHoareTripleChecker+Invalid, 498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 498 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 18:29:48,100 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 1077 Invalid, 498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 498 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 18:29:48,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2605 states. [2025-03-03 18:29:48,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2605 to 2406. [2025-03-03 18:29:48,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2406 states, 2405 states have (on average 1.2906444906444907) internal successors, (3104), 2405 states have internal predecessors, (3104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:48,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2406 states to 2406 states and 3104 transitions. [2025-03-03 18:29:48,115 INFO L78 Accepts]: Start accepts. Automaton has 2406 states and 3104 transitions. Word has length 60 [2025-03-03 18:29:48,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:29:48,115 INFO L471 AbstractCegarLoop]: Abstraction has 2406 states and 3104 transitions. [2025-03-03 18:29:48,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.3333333333333335) internal successors, (60), 18 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:48,115 INFO L276 IsEmpty]: Start isEmpty. Operand 2406 states and 3104 transitions. [2025-03-03 18:29:48,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-03 18:29:48,117 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:29:48,117 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:29:48,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2025-03-03 18:29:48,117 INFO L396 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:29:48,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:29:48,117 INFO L85 PathProgramCache]: Analyzing trace with hash -536463898, now seen corresponding path program 1 times [2025-03-03 18:29:48,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:29:48,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686809053] [2025-03-03 18:29:48,117 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:29:48,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:29:48,128 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-03 18:29:48,139 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-03 18:29:48,139 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:29:48,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:29:48,551 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:29:48,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:29:48,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686809053] [2025-03-03 18:29:48,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686809053] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:29:48,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:29:48,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2025-03-03 18:29:48,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505528602] [2025-03-03 18:29:48,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:29:48,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-03 18:29:48,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:29:48,551 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-03 18:29:48,552 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=400, Unknown=0, NotChecked=0, Total=462 [2025-03-03 18:29:48,552 INFO L87 Difference]: Start difference. First operand 2406 states and 3104 transitions. Second operand has 22 states, 22 states have (on average 2.727272727272727) internal successors, (60), 22 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:48,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:29:48,719 INFO L93 Difference]: Finished difference Result 3340 states and 4399 transitions. [2025-03-03 18:29:48,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-03 18:29:48,719 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.727272727272727) internal successors, (60), 22 states have internal predecessors, (60), 0 states have call successors, (0), 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 60 [2025-03-03 18:29:48,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:29:48,721 INFO L225 Difference]: With dead ends: 3340 [2025-03-03 18:29:48,721 INFO L226 Difference]: Without dead ends: 2577 [2025-03-03 18:29:48,722 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=400, Unknown=0, NotChecked=0, Total=462 [2025-03-03 18:29:48,722 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 70 mSDsluCounter, 878 mSDsCounter, 0 mSdLazyCounter, 525 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 967 SdHoareTripleChecker+Invalid, 525 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 525 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 18:29:48,722 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 967 Invalid, 525 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 525 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 18:29:48,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2577 states. [2025-03-03 18:29:48,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2577 to 2406. [2025-03-03 18:29:48,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2406 states, 2405 states have (on average 1.2906444906444907) internal successors, (3104), 2405 states have internal predecessors, (3104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:48,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2406 states to 2406 states and 3104 transitions. [2025-03-03 18:29:48,735 INFO L78 Accepts]: Start accepts. Automaton has 2406 states and 3104 transitions. Word has length 60 [2025-03-03 18:29:48,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:29:48,735 INFO L471 AbstractCegarLoop]: Abstraction has 2406 states and 3104 transitions. [2025-03-03 18:29:48,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.727272727272727) internal successors, (60), 22 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:48,735 INFO L276 IsEmpty]: Start isEmpty. Operand 2406 states and 3104 transitions. [2025-03-03 18:29:48,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-03 18:29:48,736 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:29:48,736 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:29:48,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2025-03-03 18:29:48,736 INFO L396 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:29:48,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:29:48,737 INFO L85 PathProgramCache]: Analyzing trace with hash 949090798, now seen corresponding path program 1 times [2025-03-03 18:29:48,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:29:48,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944945005] [2025-03-03 18:29:48,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:29:48,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:29:48,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-03 18:29:48,754 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-03 18:29:48,754 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:29:48,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:29:49,075 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:29:49,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:29:49,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944945005] [2025-03-03 18:29:49,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944945005] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:29:49,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:29:49,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-03-03 18:29:49,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424618650] [2025-03-03 18:29:49,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:29:49,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-03 18:29:49,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:29:49,076 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-03 18:29:49,076 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2025-03-03 18:29:49,076 INFO L87 Difference]: Start difference. First operand 2406 states and 3104 transitions. Second operand has 17 states, 17 states have (on average 3.5294117647058822) internal successors, (60), 17 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:49,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:29:49,402 INFO L93 Difference]: Finished difference Result 4295 states and 5690 transitions. [2025-03-03 18:29:49,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-03 18:29:49,403 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.5294117647058822) internal successors, (60), 17 states have internal predecessors, (60), 0 states have call successors, (0), 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 60 [2025-03-03 18:29:49,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:29:49,405 INFO L225 Difference]: With dead ends: 4295 [2025-03-03 18:29:49,405 INFO L226 Difference]: Without dead ends: 3529 [2025-03-03 18:29:49,406 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=468, Unknown=0, NotChecked=0, Total=552 [2025-03-03 18:29:49,407 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 219 mSDsluCounter, 992 mSDsCounter, 0 mSdLazyCounter, 809 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 1101 SdHoareTripleChecker+Invalid, 812 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 809 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 18:29:49,407 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 1101 Invalid, 812 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 809 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 18:29:49,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3529 states. [2025-03-03 18:29:49,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3529 to 2927. [2025-03-03 18:29:49,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2927 states, 2926 states have (on average 1.297676008202324) internal successors, (3797), 2926 states have internal predecessors, (3797), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:49,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2927 states to 2927 states and 3797 transitions. [2025-03-03 18:29:49,426 INFO L78 Accepts]: Start accepts. Automaton has 2927 states and 3797 transitions. Word has length 60 [2025-03-03 18:29:49,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:29:49,426 INFO L471 AbstractCegarLoop]: Abstraction has 2927 states and 3797 transitions. [2025-03-03 18:29:49,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.5294117647058822) internal successors, (60), 17 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:49,426 INFO L276 IsEmpty]: Start isEmpty. Operand 2927 states and 3797 transitions. [2025-03-03 18:29:49,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-03 18:29:49,429 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:29:49,429 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:29:49,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2025-03-03 18:29:49,429 INFO L396 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:29:49,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:29:49,430 INFO L85 PathProgramCache]: Analyzing trace with hash 117746771, now seen corresponding path program 1 times [2025-03-03 18:29:49,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:29:49,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936236986] [2025-03-03 18:29:49,430 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:29:49,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:29:49,443 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-03 18:29:49,452 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-03 18:29:49,452 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:29:49,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:29:50,201 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:29:50,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:29:50,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936236986] [2025-03-03 18:29:50,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936236986] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:29:50,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:29:50,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2025-03-03 18:29:50,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509905343] [2025-03-03 18:29:50,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:29:50,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-03 18:29:50,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:29:50,202 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-03 18:29:50,203 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=448, Unknown=0, NotChecked=0, Total=506 [2025-03-03 18:29:50,203 INFO L87 Difference]: Start difference. First operand 2927 states and 3797 transitions. Second operand has 23 states, 23 states have (on average 2.608695652173913) internal successors, (60), 23 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:50,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:29:50,582 INFO L93 Difference]: Finished difference Result 4117 states and 5449 transitions. [2025-03-03 18:29:50,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-03 18:29:50,582 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.608695652173913) internal successors, (60), 23 states have internal predecessors, (60), 0 states have call successors, (0), 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 60 [2025-03-03 18:29:50,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:29:50,584 INFO L225 Difference]: With dead ends: 4117 [2025-03-03 18:29:50,584 INFO L226 Difference]: Without dead ends: 3128 [2025-03-03 18:29:50,585 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=490, Unknown=0, NotChecked=0, Total=552 [2025-03-03 18:29:50,586 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 62 mSDsluCounter, 1158 mSDsCounter, 0 mSdLazyCounter, 901 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 1248 SdHoareTripleChecker+Invalid, 904 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 901 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 18:29:50,586 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 1248 Invalid, 904 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 901 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 18:29:50,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3128 states. [2025-03-03 18:29:50,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3128 to 2963. [2025-03-03 18:29:50,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2963 states, 2962 states have (on average 1.2954085077650237) internal successors, (3837), 2962 states have internal predecessors, (3837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:50,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2963 states to 2963 states and 3837 transitions. [2025-03-03 18:29:50,600 INFO L78 Accepts]: Start accepts. Automaton has 2963 states and 3837 transitions. Word has length 60 [2025-03-03 18:29:50,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:29:50,600 INFO L471 AbstractCegarLoop]: Abstraction has 2963 states and 3837 transitions. [2025-03-03 18:29:50,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.608695652173913) internal successors, (60), 23 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:50,600 INFO L276 IsEmpty]: Start isEmpty. Operand 2963 states and 3837 transitions. [2025-03-03 18:29:50,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-03 18:29:50,602 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:29:50,602 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:29:50,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2025-03-03 18:29:50,602 INFO L396 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:29:50,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:29:50,602 INFO L85 PathProgramCache]: Analyzing trace with hash 1359119776, now seen corresponding path program 1 times [2025-03-03 18:29:50,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:29:50,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443278588] [2025-03-03 18:29:50,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:29:50,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:29:50,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-03 18:29:50,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-03 18:29:50,623 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:29:50,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:29:51,185 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:29:51,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:29:51,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443278588] [2025-03-03 18:29:51,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443278588] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:29:51,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:29:51,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2025-03-03 18:29:51,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093500400] [2025-03-03 18:29:51,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:29:51,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-03 18:29:51,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:29:51,186 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-03 18:29:51,186 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=406, Unknown=0, NotChecked=0, Total=462 [2025-03-03 18:29:51,187 INFO L87 Difference]: Start difference. First operand 2963 states and 3837 transitions. Second operand has 22 states, 22 states have (on average 2.727272727272727) internal successors, (60), 22 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:51,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:29:51,562 INFO L93 Difference]: Finished difference Result 4345 states and 5769 transitions. [2025-03-03 18:29:51,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-03 18:29:51,562 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.727272727272727) internal successors, (60), 22 states have internal predecessors, (60), 0 states have call successors, (0), 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 60 [2025-03-03 18:29:51,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:29:51,565 INFO L225 Difference]: With dead ends: 4345 [2025-03-03 18:29:51,565 INFO L226 Difference]: Without dead ends: 3354 [2025-03-03 18:29:51,566 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=446, Unknown=0, NotChecked=0, Total=506 [2025-03-03 18:29:51,566 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 82 mSDsluCounter, 1512 mSDsCounter, 0 mSdLazyCounter, 1116 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 1603 SdHoareTripleChecker+Invalid, 1118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 18:29:51,566 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 1603 Invalid, 1118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1116 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 18:29:51,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3354 states. [2025-03-03 18:29:51,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3354 to 3103. [2025-03-03 18:29:51,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3103 states, 3102 states have (on average 1.2965828497743392) internal successors, (4022), 3102 states have internal predecessors, (4022), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:51,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3103 states to 3103 states and 4022 transitions. [2025-03-03 18:29:51,595 INFO L78 Accepts]: Start accepts. Automaton has 3103 states and 4022 transitions. Word has length 60 [2025-03-03 18:29:51,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:29:51,595 INFO L471 AbstractCegarLoop]: Abstraction has 3103 states and 4022 transitions. [2025-03-03 18:29:51,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.727272727272727) internal successors, (60), 22 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:51,595 INFO L276 IsEmpty]: Start isEmpty. Operand 3103 states and 4022 transitions. [2025-03-03 18:29:51,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-03 18:29:51,597 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:29:51,597 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:29:51,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2025-03-03 18:29:51,597 INFO L396 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:29:51,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:29:51,598 INFO L85 PathProgramCache]: Analyzing trace with hash -960161182, now seen corresponding path program 1 times [2025-03-03 18:29:51,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:29:51,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192274863] [2025-03-03 18:29:51,598 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:29:51,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:29:51,610 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-03 18:29:51,619 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-03 18:29:51,619 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:29:51,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:29:52,073 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:29:52,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:29:52,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192274863] [2025-03-03 18:29:52,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192274863] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:29:52,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:29:52,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2025-03-03 18:29:52,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853393506] [2025-03-03 18:29:52,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:29:52,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-03 18:29:52,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:29:52,074 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-03 18:29:52,074 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=400, Unknown=0, NotChecked=0, Total=462 [2025-03-03 18:29:52,074 INFO L87 Difference]: Start difference. First operand 3103 states and 4022 transitions. Second operand has 22 states, 22 states have (on average 2.727272727272727) internal successors, (60), 22 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:52,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:29:52,303 INFO L93 Difference]: Finished difference Result 4186 states and 5550 transitions. [2025-03-03 18:29:52,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-03 18:29:52,303 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.727272727272727) internal successors, (60), 22 states have internal predecessors, (60), 0 states have call successors, (0), 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 60 [2025-03-03 18:29:52,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:29:52,305 INFO L225 Difference]: With dead ends: 4186 [2025-03-03 18:29:52,305 INFO L226 Difference]: Without dead ends: 3197 [2025-03-03 18:29:52,306 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=400, Unknown=0, NotChecked=0, Total=462 [2025-03-03 18:29:52,306 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 111 mSDsluCounter, 1164 mSDsCounter, 0 mSdLazyCounter, 716 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 1253 SdHoareTripleChecker+Invalid, 716 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 716 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 18:29:52,307 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 1253 Invalid, 716 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 716 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 18:29:52,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3197 states. [2025-03-03 18:29:52,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3197 to 3098. [2025-03-03 18:29:52,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3098 states, 3097 states have (on average 1.297061672586374) internal successors, (4017), 3097 states have internal predecessors, (4017), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:52,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3098 states to 3098 states and 4017 transitions. [2025-03-03 18:29:52,324 INFO L78 Accepts]: Start accepts. Automaton has 3098 states and 4017 transitions. Word has length 60 [2025-03-03 18:29:52,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:29:52,324 INFO L471 AbstractCegarLoop]: Abstraction has 3098 states and 4017 transitions. [2025-03-03 18:29:52,325 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.727272727272727) internal successors, (60), 22 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:52,325 INFO L276 IsEmpty]: Start isEmpty. Operand 3098 states and 4017 transitions. [2025-03-03 18:29:52,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-03 18:29:52,326 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:29:52,326 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:29:52,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2025-03-03 18:29:52,326 INFO L396 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:29:52,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:29:52,327 INFO L85 PathProgramCache]: Analyzing trace with hash -486341525, now seen corresponding path program 1 times [2025-03-03 18:29:52,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:29:52,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855113212] [2025-03-03 18:29:52,327 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:29:52,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:29:52,338 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-03 18:29:52,347 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-03 18:29:52,347 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:29:52,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:29:52,771 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:29:52,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:29:52,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855113212] [2025-03-03 18:29:52,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855113212] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:29:52,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:29:52,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2025-03-03 18:29:52,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750620999] [2025-03-03 18:29:52,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:29:52,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-03 18:29:52,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:29:52,772 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-03 18:29:52,772 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=332, Unknown=0, NotChecked=0, Total=380 [2025-03-03 18:29:52,772 INFO L87 Difference]: Start difference. First operand 3098 states and 4017 transitions. Second operand has 20 states, 20 states have (on average 3.0) internal successors, (60), 20 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:52,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:29:52,952 INFO L93 Difference]: Finished difference Result 4202 states and 5578 transitions. [2025-03-03 18:29:52,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-03 18:29:52,953 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.0) internal successors, (60), 20 states have internal predecessors, (60), 0 states have call successors, (0), 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 60 [2025-03-03 18:29:52,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:29:52,954 INFO L225 Difference]: With dead ends: 4202 [2025-03-03 18:29:52,954 INFO L226 Difference]: Without dead ends: 3049 [2025-03-03 18:29:52,955 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=332, Unknown=0, NotChecked=0, Total=380 [2025-03-03 18:29:52,956 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 76 mSDsluCounter, 1075 mSDsCounter, 0 mSdLazyCounter, 603 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 1164 SdHoareTripleChecker+Invalid, 605 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 603 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 18:29:52,956 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 1164 Invalid, 605 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 603 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 18:29:52,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3049 states. [2025-03-03 18:29:52,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3049 to 2878. [2025-03-03 18:29:52,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2878 states, 2877 states have (on average 1.2985749044143204) internal successors, (3736), 2877 states have internal predecessors, (3736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:52,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2878 states to 2878 states and 3736 transitions. [2025-03-03 18:29:52,972 INFO L78 Accepts]: Start accepts. Automaton has 2878 states and 3736 transitions. Word has length 60 [2025-03-03 18:29:52,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:29:52,972 INFO L471 AbstractCegarLoop]: Abstraction has 2878 states and 3736 transitions. [2025-03-03 18:29:52,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.0) internal successors, (60), 20 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:52,972 INFO L276 IsEmpty]: Start isEmpty. Operand 2878 states and 3736 transitions. [2025-03-03 18:29:52,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-03 18:29:52,973 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:29:52,973 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:29:52,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2025-03-03 18:29:52,974 INFO L396 AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:29:52,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:29:52,974 INFO L85 PathProgramCache]: Analyzing trace with hash 1583508649, now seen corresponding path program 1 times [2025-03-03 18:29:52,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:29:52,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899017022] [2025-03-03 18:29:52,974 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:29:52,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:29:52,987 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-03 18:29:53,001 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-03 18:29:53,001 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:29:53,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:29:53,126 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:29:53,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:29:53,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899017022] [2025-03-03 18:29:53,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899017022] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 18:29:53,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [50850873] [2025-03-03 18:29:53,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:29:53,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 18:29:53,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 18:29:53,128 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 18:29:53,129 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 18:29:53,385 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-03 18:29:53,420 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-03 18:29:53,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:29:53,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:29:53,422 INFO L256 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 60 conjuncts are in the unsatisfiable core [2025-03-03 18:29:53,430 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 18:29:53,879 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:29:53,879 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 18:29:53,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [50850873] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:29:53,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 18:29:53,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [6] total 17 [2025-03-03 18:29:53,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655021423] [2025-03-03 18:29:53,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:29:53,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-03 18:29:53,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:29:53,879 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-03 18:29:53,880 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2025-03-03 18:29:53,880 INFO L87 Difference]: Start difference. First operand 2878 states and 3736 transitions. Second operand has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 13 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:54,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:29:54,217 INFO L93 Difference]: Finished difference Result 4133 states and 5485 transitions. [2025-03-03 18:29:54,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 18:29:54,217 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 13 states have internal predecessors, (60), 0 states have call successors, (0), 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 60 [2025-03-03 18:29:54,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:29:54,219 INFO L225 Difference]: With dead ends: 4133 [2025-03-03 18:29:54,219 INFO L226 Difference]: Without dead ends: 3144 [2025-03-03 18:29:54,220 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2025-03-03 18:29:54,221 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 160 mSDsluCounter, 684 mSDsCounter, 0 mSdLazyCounter, 811 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 786 SdHoareTripleChecker+Invalid, 813 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 811 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 18:29:54,221 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 786 Invalid, 813 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 811 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 18:29:54,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3144 states. [2025-03-03 18:29:54,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3144 to 2954. [2025-03-03 18:29:54,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2954 states, 2953 states have (on average 1.2959701997968167) internal successors, (3827), 2953 states have internal predecessors, (3827), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:54,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2954 states to 2954 states and 3827 transitions. [2025-03-03 18:29:54,237 INFO L78 Accepts]: Start accepts. Automaton has 2954 states and 3827 transitions. Word has length 60 [2025-03-03 18:29:54,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:29:54,238 INFO L471 AbstractCegarLoop]: Abstraction has 2954 states and 3827 transitions. [2025-03-03 18:29:54,238 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 13 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:54,238 INFO L276 IsEmpty]: Start isEmpty. Operand 2954 states and 3827 transitions. [2025-03-03 18:29:54,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-03 18:29:54,239 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:29:54,239 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:29:54,247 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-03 18:29:54,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 18:29:54,440 INFO L396 AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:29:54,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:29:54,440 INFO L85 PathProgramCache]: Analyzing trace with hash 556390236, now seen corresponding path program 1 times [2025-03-03 18:29:54,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:29:54,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116167241] [2025-03-03 18:29:54,440 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:29:54,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:29:54,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-03 18:29:54,470 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-03 18:29:54,470 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:29:54,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:29:54,872 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:29:54,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:29:54,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116167241] [2025-03-03 18:29:54,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116167241] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:29:54,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:29:54,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-03 18:29:54,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148632569] [2025-03-03 18:29:54,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:29:54,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 18:29:54,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:29:54,873 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 18:29:54,873 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-03 18:29:54,873 INFO L87 Difference]: Start difference. First operand 2954 states and 3827 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:55,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:29:55,081 INFO L93 Difference]: Finished difference Result 4096 states and 5440 transitions. [2025-03-03 18:29:55,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 18:29:55,081 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 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 60 [2025-03-03 18:29:55,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:29:55,083 INFO L225 Difference]: With dead ends: 4096 [2025-03-03 18:29:55,083 INFO L226 Difference]: Without dead ends: 3080 [2025-03-03 18:29:55,084 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2025-03-03 18:29:55,084 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 230 mSDsluCounter, 555 mSDsCounter, 0 mSdLazyCounter, 377 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 640 SdHoareTripleChecker+Invalid, 378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 18:29:55,084 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 640 Invalid, 378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 377 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 18:29:55,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3080 states. [2025-03-03 18:29:55,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3080 to 2936. [2025-03-03 18:29:55,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2936 states, 2935 states have (on average 1.2977853492333902) internal successors, (3809), 2935 states have internal predecessors, (3809), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:55,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2936 states to 2936 states and 3809 transitions. [2025-03-03 18:29:55,098 INFO L78 Accepts]: Start accepts. Automaton has 2936 states and 3809 transitions. Word has length 60 [2025-03-03 18:29:55,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:29:55,099 INFO L471 AbstractCegarLoop]: Abstraction has 2936 states and 3809 transitions. [2025-03-03 18:29:55,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:55,099 INFO L276 IsEmpty]: Start isEmpty. Operand 2936 states and 3809 transitions. [2025-03-03 18:29:55,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-03 18:29:55,100 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:29:55,100 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:29:55,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2025-03-03 18:29:55,100 INFO L396 AbstractCegarLoop]: === Iteration 69 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:29:55,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:29:55,101 INFO L85 PathProgramCache]: Analyzing trace with hash 622773461, now seen corresponding path program 1 times [2025-03-03 18:29:55,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:29:55,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911556785] [2025-03-03 18:29:55,101 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:29:55,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:29:55,112 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-03 18:29:55,121 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-03 18:29:55,121 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:29:55,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:29:55,815 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:29:55,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:29:55,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911556785] [2025-03-03 18:29:55,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911556785] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:29:55,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:29:55,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2025-03-03 18:29:55,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421819533] [2025-03-03 18:29:55,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:29:55,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-03 18:29:55,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:29:55,816 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-03 18:29:55,816 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=487, Unknown=0, NotChecked=0, Total=552 [2025-03-03 18:29:55,816 INFO L87 Difference]: Start difference. First operand 2936 states and 3809 transitions. Second operand has 24 states, 24 states have (on average 2.5) internal successors, (60), 24 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:56,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:29:56,243 INFO L93 Difference]: Finished difference Result 4126 states and 5478 transitions. [2025-03-03 18:29:56,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-03 18:29:56,243 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.5) internal successors, (60), 24 states have internal predecessors, (60), 0 states have call successors, (0), 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 60 [2025-03-03 18:29:56,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:29:56,246 INFO L225 Difference]: With dead ends: 4126 [2025-03-03 18:29:56,246 INFO L226 Difference]: Without dead ends: 3094 [2025-03-03 18:29:56,247 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=65, Invalid=487, Unknown=0, NotChecked=0, Total=552 [2025-03-03 18:29:56,247 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 79 mSDsluCounter, 1263 mSDsCounter, 0 mSdLazyCounter, 1218 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 1353 SdHoareTripleChecker+Invalid, 1218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 18:29:56,247 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 1353 Invalid, 1218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1218 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 18:29:56,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3094 states. [2025-03-03 18:29:56,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3094 to 2991. [2025-03-03 18:29:56,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2991 states, 2990 states have (on average 1.2969899665551838) internal successors, (3878), 2990 states have internal predecessors, (3878), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:56,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2991 states to 2991 states and 3878 transitions. [2025-03-03 18:29:56,262 INFO L78 Accepts]: Start accepts. Automaton has 2991 states and 3878 transitions. Word has length 60 [2025-03-03 18:29:56,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:29:56,262 INFO L471 AbstractCegarLoop]: Abstraction has 2991 states and 3878 transitions. [2025-03-03 18:29:56,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.5) internal successors, (60), 24 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:56,262 INFO L276 IsEmpty]: Start isEmpty. Operand 2991 states and 3878 transitions. [2025-03-03 18:29:56,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-03 18:29:56,264 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:29:56,264 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:29:56,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2025-03-03 18:29:56,264 INFO L396 AbstractCegarLoop]: === Iteration 70 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:29:56,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:29:56,264 INFO L85 PathProgramCache]: Analyzing trace with hash 1949396346, now seen corresponding path program 1 times [2025-03-03 18:29:56,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:29:56,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907056806] [2025-03-03 18:29:56,264 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:29:56,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:29:56,278 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-03 18:29:56,287 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-03 18:29:56,287 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:29:56,287 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:29:56,747 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:29:56,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:29:56,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907056806] [2025-03-03 18:29:56,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907056806] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:29:56,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:29:56,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2025-03-03 18:29:56,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322798215] [2025-03-03 18:29:56,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:29:56,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-03 18:29:56,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:29:56,748 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-03 18:29:56,748 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=335, Unknown=0, NotChecked=0, Total=380 [2025-03-03 18:29:56,748 INFO L87 Difference]: Start difference. First operand 2991 states and 3878 transitions. Second operand has 20 states, 20 states have (on average 3.0) internal successors, (60), 20 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:56,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:29:56,894 INFO L93 Difference]: Finished difference Result 4214 states and 5593 transitions. [2025-03-03 18:29:56,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-03 18:29:56,894 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.0) internal successors, (60), 20 states have internal predecessors, (60), 0 states have call successors, (0), 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 60 [2025-03-03 18:29:56,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:29:56,896 INFO L225 Difference]: With dead ends: 4214 [2025-03-03 18:29:56,896 INFO L226 Difference]: Without dead ends: 3123 [2025-03-03 18:29:56,897 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=335, Unknown=0, NotChecked=0, Total=380 [2025-03-03 18:29:56,898 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 33 mSDsluCounter, 1063 mSDsCounter, 0 mSdLazyCounter, 501 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 1155 SdHoareTripleChecker+Invalid, 503 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 501 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 18:29:56,898 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 1155 Invalid, 503 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 501 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 18:29:56,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3123 states. [2025-03-03 18:29:56,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3123 to 2873. [2025-03-03 18:29:56,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2873 states, 2872 states have (on average 1.3064066852367688) internal successors, (3752), 2872 states have internal predecessors, (3752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:56,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2873 states to 2873 states and 3752 transitions. [2025-03-03 18:29:56,913 INFO L78 Accepts]: Start accepts. Automaton has 2873 states and 3752 transitions. Word has length 60 [2025-03-03 18:29:56,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:29:56,913 INFO L471 AbstractCegarLoop]: Abstraction has 2873 states and 3752 transitions. [2025-03-03 18:29:56,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.0) internal successors, (60), 20 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:56,913 INFO L276 IsEmpty]: Start isEmpty. Operand 2873 states and 3752 transitions. [2025-03-03 18:29:56,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-03 18:29:56,914 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:29:56,914 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:29:56,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2025-03-03 18:29:56,914 INFO L396 AbstractCegarLoop]: === Iteration 71 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:29:56,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:29:56,915 INFO L85 PathProgramCache]: Analyzing trace with hash 65943274, now seen corresponding path program 1 times [2025-03-03 18:29:56,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:29:56,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907947892] [2025-03-03 18:29:56,915 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:29:56,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:29:56,926 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-03 18:29:56,938 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-03 18:29:56,938 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:29:56,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:29:57,267 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:29:57,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:29:57,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907947892] [2025-03-03 18:29:57,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907947892] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:29:57,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:29:57,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-03-03 18:29:57,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387567686] [2025-03-03 18:29:57,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:29:57,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-03 18:29:57,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:29:57,268 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-03 18:29:57,268 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2025-03-03 18:29:57,268 INFO L87 Difference]: Start difference. First operand 2873 states and 3752 transitions. Second operand has 17 states, 17 states have (on average 3.588235294117647) internal successors, (61), 17 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:57,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:29:57,407 INFO L93 Difference]: Finished difference Result 3976 states and 5303 transitions. [2025-03-03 18:29:57,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-03 18:29:57,407 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.588235294117647) internal successors, (61), 17 states have internal predecessors, (61), 0 states have call successors, (0), 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 61 [2025-03-03 18:29:57,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:29:57,409 INFO L225 Difference]: With dead ends: 3976 [2025-03-03 18:29:57,409 INFO L226 Difference]: Without dead ends: 2942 [2025-03-03 18:29:57,410 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2025-03-03 18:29:57,410 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 92 mSDsluCounter, 896 mSDsCounter, 0 mSdLazyCounter, 434 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 992 SdHoareTripleChecker+Invalid, 434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 434 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 18:29:57,411 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 992 Invalid, 434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 434 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 18:29:57,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2942 states. [2025-03-03 18:29:57,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2942 to 2873. [2025-03-03 18:29:57,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2873 states, 2872 states have (on average 1.3064066852367688) internal successors, (3752), 2872 states have internal predecessors, (3752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:57,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2873 states to 2873 states and 3752 transitions. [2025-03-03 18:29:57,425 INFO L78 Accepts]: Start accepts. Automaton has 2873 states and 3752 transitions. Word has length 61 [2025-03-03 18:29:57,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:29:57,425 INFO L471 AbstractCegarLoop]: Abstraction has 2873 states and 3752 transitions. [2025-03-03 18:29:57,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.588235294117647) internal successors, (61), 17 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:57,425 INFO L276 IsEmpty]: Start isEmpty. Operand 2873 states and 3752 transitions. [2025-03-03 18:29:57,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-03 18:29:57,427 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:29:57,427 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:29:57,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2025-03-03 18:29:57,427 INFO L396 AbstractCegarLoop]: === Iteration 72 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:29:57,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:29:57,428 INFO L85 PathProgramCache]: Analyzing trace with hash -106199235, now seen corresponding path program 1 times [2025-03-03 18:29:57,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:29:57,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275639082] [2025-03-03 18:29:57,428 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:29:57,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:29:57,441 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-03 18:29:57,452 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-03 18:29:57,452 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:29:57,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:29:57,882 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:29:57,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:29:57,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275639082] [2025-03-03 18:29:57,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275639082] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:29:57,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:29:57,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2025-03-03 18:29:57,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321850735] [2025-03-03 18:29:57,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:29:57,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-03 18:29:57,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:29:57,883 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-03 18:29:57,883 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=400, Unknown=0, NotChecked=0, Total=462 [2025-03-03 18:29:57,883 INFO L87 Difference]: Start difference. First operand 2873 states and 3752 transitions. Second operand has 22 states, 22 states have (on average 2.772727272727273) internal successors, (61), 22 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:58,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:29:58,104 INFO L93 Difference]: Finished difference Result 3987 states and 5324 transitions. [2025-03-03 18:29:58,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-03 18:29:58,105 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.772727272727273) internal successors, (61), 22 states have internal predecessors, (61), 0 states have call successors, (0), 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 61 [2025-03-03 18:29:58,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:29:58,107 INFO L225 Difference]: With dead ends: 3987 [2025-03-03 18:29:58,107 INFO L226 Difference]: Without dead ends: 2955 [2025-03-03 18:29:58,108 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=400, Unknown=0, NotChecked=0, Total=462 [2025-03-03 18:29:58,108 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 68 mSDsluCounter, 1423 mSDsCounter, 0 mSdLazyCounter, 739 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 1517 SdHoareTripleChecker+Invalid, 739 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 739 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 18:29:58,108 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 1517 Invalid, 739 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 739 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 18:29:58,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2955 states. [2025-03-03 18:29:58,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2955 to 2861. [2025-03-03 18:29:58,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2861 states, 2860 states have (on average 1.3083916083916083) internal successors, (3742), 2860 states have internal predecessors, (3742), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:58,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2861 states to 2861 states and 3742 transitions. [2025-03-03 18:29:58,124 INFO L78 Accepts]: Start accepts. Automaton has 2861 states and 3742 transitions. Word has length 61 [2025-03-03 18:29:58,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:29:58,124 INFO L471 AbstractCegarLoop]: Abstraction has 2861 states and 3742 transitions. [2025-03-03 18:29:58,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.772727272727273) internal successors, (61), 22 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:58,124 INFO L276 IsEmpty]: Start isEmpty. Operand 2861 states and 3742 transitions. [2025-03-03 18:29:58,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-03 18:29:58,126 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:29:58,126 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:29:58,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2025-03-03 18:29:58,126 INFO L396 AbstractCegarLoop]: === Iteration 73 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:29:58,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:29:58,126 INFO L85 PathProgramCache]: Analyzing trace with hash 548011434, now seen corresponding path program 1 times [2025-03-03 18:29:58,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:29:58,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753055315] [2025-03-03 18:29:58,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:29:58,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:29:58,138 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-03 18:29:58,148 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-03 18:29:58,148 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:29:58,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:29:58,940 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:29:58,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:29:58,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753055315] [2025-03-03 18:29:58,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753055315] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:29:58,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:29:58,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2025-03-03 18:29:58,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315313077] [2025-03-03 18:29:58,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:29:58,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-03 18:29:58,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:29:58,941 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-03 18:29:58,941 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=523, Unknown=0, NotChecked=0, Total=600 [2025-03-03 18:29:58,941 INFO L87 Difference]: Start difference. First operand 2861 states and 3742 transitions. Second operand has 25 states, 25 states have (on average 2.44) internal successors, (61), 25 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:59,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:29:59,460 INFO L93 Difference]: Finished difference Result 4099 states and 5462 transitions. [2025-03-03 18:29:59,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-03 18:29:59,460 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.44) internal successors, (61), 25 states have internal predecessors, (61), 0 states have call successors, (0), 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 61 [2025-03-03 18:29:59,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:29:59,462 INFO L225 Difference]: With dead ends: 4099 [2025-03-03 18:29:59,462 INFO L226 Difference]: Without dead ends: 3067 [2025-03-03 18:29:59,463 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=81, Invalid=569, Unknown=0, NotChecked=0, Total=650 [2025-03-03 18:29:59,463 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 102 mSDsluCounter, 1296 mSDsCounter, 0 mSdLazyCounter, 1509 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 1410 SdHoareTripleChecker+Invalid, 1514 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1509 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 18:29:59,464 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 1410 Invalid, 1514 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1509 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 18:29:59,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3067 states. [2025-03-03 18:29:59,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3067 to 2877. [2025-03-03 18:29:59,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2877 states, 2876 states have (on average 1.3080667593880388) internal successors, (3762), 2876 states have internal predecessors, (3762), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:59,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2877 states to 2877 states and 3762 transitions. [2025-03-03 18:29:59,479 INFO L78 Accepts]: Start accepts. Automaton has 2877 states and 3762 transitions. Word has length 61 [2025-03-03 18:29:59,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:29:59,479 INFO L471 AbstractCegarLoop]: Abstraction has 2877 states and 3762 transitions. [2025-03-03 18:29:59,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.44) internal successors, (61), 25 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:29:59,479 INFO L276 IsEmpty]: Start isEmpty. Operand 2877 states and 3762 transitions. [2025-03-03 18:29:59,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-03 18:29:59,480 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:29:59,480 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:29:59,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2025-03-03 18:29:59,480 INFO L396 AbstractCegarLoop]: === Iteration 74 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:29:59,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:29:59,481 INFO L85 PathProgramCache]: Analyzing trace with hash -1906098122, now seen corresponding path program 1 times [2025-03-03 18:29:59,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:29:59,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853267790] [2025-03-03 18:29:59,481 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:29:59,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:29:59,491 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-03 18:29:59,500 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-03 18:29:59,500 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:29:59,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:29:59,868 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:29:59,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:29:59,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853267790] [2025-03-03 18:29:59,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853267790] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:29:59,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:29:59,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-03 18:29:59,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758196096] [2025-03-03 18:29:59,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:29:59,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-03 18:29:59,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:29:59,869 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-03 18:29:59,870 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2025-03-03 18:29:59,870 INFO L87 Difference]: Start difference. First operand 2877 states and 3762 transitions. Second operand has 13 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 13 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:30:00,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:30:00,262 INFO L93 Difference]: Finished difference Result 4132 states and 5512 transitions. [2025-03-03 18:30:00,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-03 18:30:00,262 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 13 states have internal predecessors, (61), 0 states have call successors, (0), 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 61 [2025-03-03 18:30:00,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:30:00,265 INFO L225 Difference]: With dead ends: 4132 [2025-03-03 18:30:00,265 INFO L226 Difference]: Without dead ends: 3100 [2025-03-03 18:30:00,266 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2025-03-03 18:30:00,266 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 306 mSDsluCounter, 901 mSDsCounter, 0 mSdLazyCounter, 883 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 306 SdHoareTripleChecker+Valid, 1012 SdHoareTripleChecker+Invalid, 886 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 883 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 18:30:00,266 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [306 Valid, 1012 Invalid, 886 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 883 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 18:30:00,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3100 states. [2025-03-03 18:30:00,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3100 to 2805. [2025-03-03 18:30:00,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2805 states, 2804 states have (on average 1.3081312410841655) internal successors, (3668), 2804 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:30:00,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2805 states to 2805 states and 3668 transitions. [2025-03-03 18:30:00,283 INFO L78 Accepts]: Start accepts. Automaton has 2805 states and 3668 transitions. Word has length 61 [2025-03-03 18:30:00,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:30:00,284 INFO L471 AbstractCegarLoop]: Abstraction has 2805 states and 3668 transitions. [2025-03-03 18:30:00,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 13 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:30:00,284 INFO L276 IsEmpty]: Start isEmpty. Operand 2805 states and 3668 transitions. [2025-03-03 18:30:00,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-03 18:30:00,285 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:30:00,285 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:30:00,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2025-03-03 18:30:00,286 INFO L396 AbstractCegarLoop]: === Iteration 75 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:30:00,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:30:00,286 INFO L85 PathProgramCache]: Analyzing trace with hash 1026699199, now seen corresponding path program 1 times [2025-03-03 18:30:00,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:30:00,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048676359] [2025-03-03 18:30:00,286 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:30:00,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:30:00,299 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-03 18:30:00,311 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-03 18:30:00,311 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:30:00,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:30:00,682 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:30:00,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:30:00,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048676359] [2025-03-03 18:30:00,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048676359] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:30:00,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:30:00,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-03 18:30:00,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805491307] [2025-03-03 18:30:00,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:30:00,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-03 18:30:00,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:30:00,683 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-03 18:30:00,683 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2025-03-03 18:30:00,683 INFO L87 Difference]: Start difference. First operand 2805 states and 3668 transitions. Second operand has 15 states, 15 states have (on average 4.066666666666666) internal successors, (61), 15 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:30:00,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:30:00,964 INFO L93 Difference]: Finished difference Result 4489 states and 6018 transitions. [2025-03-03 18:30:00,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-03 18:30:00,964 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.066666666666666) internal successors, (61), 15 states have internal predecessors, (61), 0 states have call successors, (0), 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 61 [2025-03-03 18:30:00,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:30:00,967 INFO L225 Difference]: With dead ends: 4489 [2025-03-03 18:30:00,967 INFO L226 Difference]: Without dead ends: 3414 [2025-03-03 18:30:00,968 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=240, Unknown=0, NotChecked=0, Total=306 [2025-03-03 18:30:00,969 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 307 mSDsluCounter, 984 mSDsCounter, 0 mSdLazyCounter, 761 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 1083 SdHoareTripleChecker+Invalid, 762 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 761 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 18:30:00,969 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [307 Valid, 1083 Invalid, 762 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 761 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 18:30:00,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3414 states. [2025-03-03 18:30:00,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3414 to 2871. [2025-03-03 18:30:00,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2871 states, 2870 states have (on average 1.3142857142857143) internal successors, (3772), 2870 states have internal predecessors, (3772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:30:00,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2871 states to 2871 states and 3772 transitions. [2025-03-03 18:30:00,988 INFO L78 Accepts]: Start accepts. Automaton has 2871 states and 3772 transitions. Word has length 61 [2025-03-03 18:30:00,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:30:00,988 INFO L471 AbstractCegarLoop]: Abstraction has 2871 states and 3772 transitions. [2025-03-03 18:30:00,988 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.066666666666666) internal successors, (61), 15 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:30:00,988 INFO L276 IsEmpty]: Start isEmpty. Operand 2871 states and 3772 transitions. [2025-03-03 18:30:00,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-03 18:30:00,989 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:30:00,990 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:30:00,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2025-03-03 18:30:00,990 INFO L396 AbstractCegarLoop]: === Iteration 76 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:30:00,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:30:00,990 INFO L85 PathProgramCache]: Analyzing trace with hash -161558949, now seen corresponding path program 1 times [2025-03-03 18:30:00,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:30:00,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303332167] [2025-03-03 18:30:00,990 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:30:00,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:30:01,012 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-03 18:30:01,024 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-03 18:30:01,024 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:30:01,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:30:01,366 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:30:01,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:30:01,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303332167] [2025-03-03 18:30:01,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303332167] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:30:01,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:30:01,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2025-03-03 18:30:01,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171993621] [2025-03-03 18:30:01,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:30:01,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-03 18:30:01,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:30:01,367 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-03 18:30:01,367 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2025-03-03 18:30:01,367 INFO L87 Difference]: Start difference. First operand 2871 states and 3772 transitions. Second operand has 18 states, 18 states have (on average 3.388888888888889) internal successors, (61), 18 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:30:01,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:30:01,497 INFO L93 Difference]: Finished difference Result 4085 states and 5477 transitions. [2025-03-03 18:30:01,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-03 18:30:01,498 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.388888888888889) internal successors, (61), 18 states have internal predecessors, (61), 0 states have call successors, (0), 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 61 [2025-03-03 18:30:01,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:30:01,500 INFO L225 Difference]: With dead ends: 4085 [2025-03-03 18:30:01,500 INFO L226 Difference]: Without dead ends: 2959 [2025-03-03 18:30:01,501 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2025-03-03 18:30:01,501 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 45 mSDsluCounter, 807 mSDsCounter, 0 mSdLazyCounter, 403 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 900 SdHoareTripleChecker+Invalid, 403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 403 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 18:30:01,501 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 900 Invalid, 403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 403 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 18:30:01,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2959 states. [2025-03-03 18:30:01,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2959 to 2912. [2025-03-03 18:30:01,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2912 states, 2911 states have (on average 1.310889728615596) internal successors, (3816), 2911 states have internal predecessors, (3816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:30:01,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2912 states to 2912 states and 3816 transitions. [2025-03-03 18:30:01,514 INFO L78 Accepts]: Start accepts. Automaton has 2912 states and 3816 transitions. Word has length 61 [2025-03-03 18:30:01,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:30:01,514 INFO L471 AbstractCegarLoop]: Abstraction has 2912 states and 3816 transitions. [2025-03-03 18:30:01,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.388888888888889) internal successors, (61), 18 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:30:01,514 INFO L276 IsEmpty]: Start isEmpty. Operand 2912 states and 3816 transitions. [2025-03-03 18:30:01,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-03 18:30:01,515 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:30:01,516 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:30:01,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2025-03-03 18:30:01,516 INFO L396 AbstractCegarLoop]: === Iteration 77 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:30:01,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:30:01,516 INFO L85 PathProgramCache]: Analyzing trace with hash -333701458, now seen corresponding path program 1 times [2025-03-03 18:30:01,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:30:01,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871531733] [2025-03-03 18:30:01,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:30:01,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:30:01,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-03 18:30:01,538 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-03 18:30:01,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:30:01,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:30:01,963 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:30:01,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:30:01,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871531733] [2025-03-03 18:30:01,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871531733] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:30:01,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:30:01,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2025-03-03 18:30:01,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917048463] [2025-03-03 18:30:01,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:30:01,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-03 18:30:01,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:30:01,964 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-03 18:30:01,964 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=446, Unknown=0, NotChecked=0, Total=506 [2025-03-03 18:30:01,964 INFO L87 Difference]: Start difference. First operand 2912 states and 3816 transitions. Second operand has 23 states, 23 states have (on average 2.652173913043478) internal successors, (61), 23 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:30:02,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:30:02,186 INFO L93 Difference]: Finished difference Result 4349 states and 5831 transitions. [2025-03-03 18:30:02,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-03 18:30:02,186 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.652173913043478) internal successors, (61), 23 states have internal predecessors, (61), 0 states have call successors, (0), 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 61 [2025-03-03 18:30:02,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:30:02,188 INFO L225 Difference]: With dead ends: 4349 [2025-03-03 18:30:02,188 INFO L226 Difference]: Without dead ends: 3223 [2025-03-03 18:30:02,189 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=446, Unknown=0, NotChecked=0, Total=506 [2025-03-03 18:30:02,189 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 77 mSDsluCounter, 1340 mSDsCounter, 0 mSdLazyCounter, 768 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 1430 SdHoareTripleChecker+Invalid, 769 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 768 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 18:30:02,189 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 1430 Invalid, 769 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 768 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 18:30:02,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3223 states. [2025-03-03 18:30:02,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3223 to 2997. [2025-03-03 18:30:02,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2997 states, 2996 states have (on average 1.3124165554072096) internal successors, (3932), 2996 states have internal predecessors, (3932), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:30:02,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2997 states to 2997 states and 3932 transitions. [2025-03-03 18:30:02,204 INFO L78 Accepts]: Start accepts. Automaton has 2997 states and 3932 transitions. Word has length 61 [2025-03-03 18:30:02,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:30:02,204 INFO L471 AbstractCegarLoop]: Abstraction has 2997 states and 3932 transitions. [2025-03-03 18:30:02,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.652173913043478) internal successors, (61), 23 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:30:02,204 INFO L276 IsEmpty]: Start isEmpty. Operand 2997 states and 3932 transitions. [2025-03-03 18:30:02,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-03 18:30:02,206 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:30:02,206 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:30:02,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2025-03-03 18:30:02,206 INFO L396 AbstractCegarLoop]: === Iteration 78 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:30:02,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:30:02,206 INFO L85 PathProgramCache]: Analyzing trace with hash 1938901207, now seen corresponding path program 1 times [2025-03-03 18:30:02,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:30:02,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231779292] [2025-03-03 18:30:02,206 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:30:02,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:30:02,218 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-03 18:30:02,229 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-03 18:30:02,229 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:30:02,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:30:02,447 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:30:02,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:30:02,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231779292] [2025-03-03 18:30:02,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231779292] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:30:02,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:30:02,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-03 18:30:02,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104784799] [2025-03-03 18:30:02,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:30:02,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-03 18:30:02,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:30:02,447 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-03 18:30:02,447 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2025-03-03 18:30:02,448 INFO L87 Difference]: Start difference. First operand 2997 states and 3932 transitions. Second operand has 13 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 13 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:30:02,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:30:02,560 INFO L93 Difference]: Finished difference Result 4247 states and 5722 transitions. [2025-03-03 18:30:02,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 18:30:02,560 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 13 states have internal predecessors, (61), 0 states have call successors, (0), 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 61 [2025-03-03 18:30:02,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:30:02,562 INFO L225 Difference]: With dead ends: 4247 [2025-03-03 18:30:02,562 INFO L226 Difference]: Without dead ends: 2988 [2025-03-03 18:30:02,563 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2025-03-03 18:30:02,563 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 34 mSDsluCounter, 787 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 884 SdHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 18:30:02,564 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 884 Invalid, 302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 302 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 18:30:02,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2988 states. [2025-03-03 18:30:02,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2988 to 2924. [2025-03-03 18:30:02,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2924 states, 2923 states have (on average 1.298323640095792) internal successors, (3795), 2923 states have internal predecessors, (3795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:30:02,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2924 states to 2924 states and 3795 transitions. [2025-03-03 18:30:02,586 INFO L78 Accepts]: Start accepts. Automaton has 2924 states and 3795 transitions. Word has length 61 [2025-03-03 18:30:02,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:30:02,586 INFO L471 AbstractCegarLoop]: Abstraction has 2924 states and 3795 transitions. [2025-03-03 18:30:02,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 13 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:30:02,586 INFO L276 IsEmpty]: Start isEmpty. Operand 2924 states and 3795 transitions. [2025-03-03 18:30:02,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-03 18:30:02,588 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:30:02,588 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:30:02,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2025-03-03 18:30:02,588 INFO L396 AbstractCegarLoop]: === Iteration 79 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:30:02,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:30:02,588 INFO L85 PathProgramCache]: Analyzing trace with hash -1787760911, now seen corresponding path program 1 times [2025-03-03 18:30:02,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:30:02,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179326505] [2025-03-03 18:30:02,588 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:30:02,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:30:02,605 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-03 18:30:02,621 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-03 18:30:02,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:30:02,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:30:03,418 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:30:03,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:30:03,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179326505] [2025-03-03 18:30:03,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179326505] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:30:03,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:30:03,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2025-03-03 18:30:03,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505304362] [2025-03-03 18:30:03,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:30:03,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-03 18:30:03,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:30:03,419 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-03 18:30:03,419 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=487, Unknown=0, NotChecked=0, Total=552 [2025-03-03 18:30:03,419 INFO L87 Difference]: Start difference. First operand 2924 states and 3795 transitions. Second operand has 24 states, 24 states have (on average 2.5416666666666665) internal successors, (61), 24 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:30:03,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:30:03,842 INFO L93 Difference]: Finished difference Result 4171 states and 5553 transitions. [2025-03-03 18:30:03,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-03 18:30:03,842 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.5416666666666665) internal successors, (61), 24 states have internal predecessors, (61), 0 states have call successors, (0), 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 61 [2025-03-03 18:30:03,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:30:03,845 INFO L225 Difference]: With dead ends: 4171 [2025-03-03 18:30:03,845 INFO L226 Difference]: Without dead ends: 3045 [2025-03-03 18:30:03,846 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=65, Invalid=487, Unknown=0, NotChecked=0, Total=552 [2025-03-03 18:30:03,846 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 100 mSDsluCounter, 1304 mSDsCounter, 0 mSdLazyCounter, 1147 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 1399 SdHoareTripleChecker+Invalid, 1147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 18:30:03,846 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 1399 Invalid, 1147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1147 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 18:30:03,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3045 states. [2025-03-03 18:30:03,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3045 to 2943. [2025-03-03 18:30:03,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2943 states, 2942 states have (on average 1.2994561522773624) internal successors, (3823), 2942 states have internal predecessors, (3823), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:30:03,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2943 states to 2943 states and 3823 transitions. [2025-03-03 18:30:03,860 INFO L78 Accepts]: Start accepts. Automaton has 2943 states and 3823 transitions. Word has length 61 [2025-03-03 18:30:03,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:30:03,860 INFO L471 AbstractCegarLoop]: Abstraction has 2943 states and 3823 transitions. [2025-03-03 18:30:03,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.5416666666666665) internal successors, (61), 24 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:30:03,861 INFO L276 IsEmpty]: Start isEmpty. Operand 2943 states and 3823 transitions. [2025-03-03 18:30:03,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-03 18:30:03,862 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:30:03,862 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:30:03,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2025-03-03 18:30:03,862 INFO L396 AbstractCegarLoop]: === Iteration 80 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:30:03,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:30:03,862 INFO L85 PathProgramCache]: Analyzing trace with hash 852875900, now seen corresponding path program 1 times [2025-03-03 18:30:03,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:30:03,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688132532] [2025-03-03 18:30:03,863 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:30:03,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:30:03,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-03 18:30:03,883 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-03 18:30:03,883 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:30:03,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:30:04,192 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:30:04,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:30:04,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688132532] [2025-03-03 18:30:04,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688132532] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:30:04,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:30:04,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-03 18:30:04,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802594660] [2025-03-03 18:30:04,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:30:04,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 18:30:04,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:30:04,192 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 18:30:04,192 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2025-03-03 18:30:04,192 INFO L87 Difference]: Start difference. First operand 2943 states and 3823 transitions. Second operand has 12 states, 12 states have (on average 5.083333333333333) internal successors, (61), 12 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:30:04,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:30:04,532 INFO L93 Difference]: Finished difference Result 4331 states and 5750 transitions. [2025-03-03 18:30:04,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-03 18:30:04,532 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.083333333333333) internal successors, (61), 12 states have internal predecessors, (61), 0 states have call successors, (0), 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 61 [2025-03-03 18:30:04,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:30:04,534 INFO L225 Difference]: With dead ends: 4331 [2025-03-03 18:30:04,535 INFO L226 Difference]: Without dead ends: 3205 [2025-03-03 18:30:04,536 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2025-03-03 18:30:04,536 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 355 mSDsluCounter, 968 mSDsCounter, 0 mSdLazyCounter, 706 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 355 SdHoareTripleChecker+Valid, 1129 SdHoareTripleChecker+Invalid, 709 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 706 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 18:30:04,536 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [355 Valid, 1129 Invalid, 709 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 706 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 18:30:04,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3205 states. [2025-03-03 18:30:04,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3205 to 2953. [2025-03-03 18:30:04,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2953 states, 2952 states have (on average 1.3001355013550135) internal successors, (3838), 2952 states have internal predecessors, (3838), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:30:04,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2953 states to 2953 states and 3838 transitions. [2025-03-03 18:30:04,554 INFO L78 Accepts]: Start accepts. Automaton has 2953 states and 3838 transitions. Word has length 61 [2025-03-03 18:30:04,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:30:04,554 INFO L471 AbstractCegarLoop]: Abstraction has 2953 states and 3838 transitions. [2025-03-03 18:30:04,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.083333333333333) internal successors, (61), 12 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:30:04,554 INFO L276 IsEmpty]: Start isEmpty. Operand 2953 states and 3838 transitions. [2025-03-03 18:30:04,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-03 18:30:04,556 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:30:04,556 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:30:04,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2025-03-03 18:30:04,556 INFO L396 AbstractCegarLoop]: === Iteration 81 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:30:04,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:30:04,556 INFO L85 PathProgramCache]: Analyzing trace with hash -626291371, now seen corresponding path program 1 times [2025-03-03 18:30:04,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:30:04,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029403944] [2025-03-03 18:30:04,556 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:30:04,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:30:04,568 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-03 18:30:04,578 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-03 18:30:04,579 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:30:04,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:30:05,300 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:30:05,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:30:05,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029403944] [2025-03-03 18:30:05,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029403944] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:30:05,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:30:05,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2025-03-03 18:30:05,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399165204] [2025-03-03 18:30:05,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:30:05,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-03 18:30:05,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:30:05,301 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-03 18:30:05,301 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=487, Unknown=0, NotChecked=0, Total=552 [2025-03-03 18:30:05,301 INFO L87 Difference]: Start difference. First operand 2953 states and 3838 transitions. Second operand has 24 states, 24 states have (on average 2.5416666666666665) internal successors, (61), 24 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:30:05,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:30:05,711 INFO L93 Difference]: Finished difference Result 4238 states and 5649 transitions. [2025-03-03 18:30:05,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-03 18:30:05,712 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.5416666666666665) internal successors, (61), 24 states have internal predecessors, (61), 0 states have call successors, (0), 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 61 [2025-03-03 18:30:05,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:30:05,713 INFO L225 Difference]: With dead ends: 4238 [2025-03-03 18:30:05,714 INFO L226 Difference]: Without dead ends: 3100 [2025-03-03 18:30:05,715 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=65, Invalid=487, Unknown=0, NotChecked=0, Total=552 [2025-03-03 18:30:05,715 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 104 mSDsluCounter, 1180 mSDsCounter, 0 mSdLazyCounter, 1138 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 1269 SdHoareTripleChecker+Invalid, 1138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 18:30:05,715 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 1269 Invalid, 1138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1138 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 18:30:05,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3100 states. [2025-03-03 18:30:05,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3100 to 2953. [2025-03-03 18:30:05,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2953 states, 2952 states have (on average 1.3001355013550135) internal successors, (3838), 2952 states have internal predecessors, (3838), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:30:05,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2953 states to 2953 states and 3838 transitions. [2025-03-03 18:30:05,729 INFO L78 Accepts]: Start accepts. Automaton has 2953 states and 3838 transitions. Word has length 61 [2025-03-03 18:30:05,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:30:05,730 INFO L471 AbstractCegarLoop]: Abstraction has 2953 states and 3838 transitions. [2025-03-03 18:30:05,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.5416666666666665) internal successors, (61), 24 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:30:05,730 INFO L276 IsEmpty]: Start isEmpty. Operand 2953 states and 3838 transitions. [2025-03-03 18:30:05,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-03 18:30:05,731 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:30:05,731 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:30:05,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2025-03-03 18:30:05,731 INFO L396 AbstractCegarLoop]: === Iteration 82 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:30:05,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:30:05,732 INFO L85 PathProgramCache]: Analyzing trace with hash -1034879169, now seen corresponding path program 1 times [2025-03-03 18:30:05,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:30:05,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811288802] [2025-03-03 18:30:05,732 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:30:05,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:30:05,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-03 18:30:05,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-03 18:30:05,759 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:30:05,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:30:06,148 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:30:06,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:30:06,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811288802] [2025-03-03 18:30:06,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811288802] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:30:06,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:30:06,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2025-03-03 18:30:06,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054243923] [2025-03-03 18:30:06,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:30:06,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-03 18:30:06,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:30:06,149 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-03 18:30:06,149 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2025-03-03 18:30:06,149 INFO L87 Difference]: Start difference. First operand 2953 states and 3838 transitions. Second operand has 18 states, 18 states have (on average 3.4444444444444446) internal successors, (62), 18 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:30:06,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:30:06,318 INFO L93 Difference]: Finished difference Result 4156 states and 5540 transitions. [2025-03-03 18:30:06,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-03 18:30:06,318 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.4444444444444446) internal successors, (62), 18 states have internal predecessors, (62), 0 states have call successors, (0), 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 62 [2025-03-03 18:30:06,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:30:06,320 INFO L225 Difference]: With dead ends: 4156 [2025-03-03 18:30:06,320 INFO L226 Difference]: Without dead ends: 3016 [2025-03-03 18:30:06,321 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2025-03-03 18:30:06,321 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 59 mSDsluCounter, 1159 mSDsCounter, 0 mSdLazyCounter, 570 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 1253 SdHoareTripleChecker+Invalid, 570 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 570 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 18:30:06,321 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 1253 Invalid, 570 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 570 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 18:30:06,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3016 states. [2025-03-03 18:30:06,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3016 to 2919. [2025-03-03 18:30:06,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2919 states, 2918 states have (on average 1.3022618231665524) internal successors, (3800), 2918 states have internal predecessors, (3800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:30:06,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2919 states to 2919 states and 3800 transitions. [2025-03-03 18:30:06,335 INFO L78 Accepts]: Start accepts. Automaton has 2919 states and 3800 transitions. Word has length 62 [2025-03-03 18:30:06,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:30:06,335 INFO L471 AbstractCegarLoop]: Abstraction has 2919 states and 3800 transitions. [2025-03-03 18:30:06,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.4444444444444446) internal successors, (62), 18 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:30:06,335 INFO L276 IsEmpty]: Start isEmpty. Operand 2919 states and 3800 transitions. [2025-03-03 18:30:06,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-03 18:30:06,337 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:30:06,337 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:30:06,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81 [2025-03-03 18:30:06,337 INFO L396 AbstractCegarLoop]: === Iteration 83 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:30:06,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:30:06,337 INFO L85 PathProgramCache]: Analyzing trace with hash 291743716, now seen corresponding path program 1 times [2025-03-03 18:30:06,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:30:06,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502139570] [2025-03-03 18:30:06,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:30:06,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:30:06,350 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-03 18:30:06,363 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-03 18:30:06,364 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:30:06,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:30:06,697 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:30:06,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:30:06,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502139570] [2025-03-03 18:30:06,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502139570] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:30:06,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:30:06,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-03 18:30:06,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614677133] [2025-03-03 18:30:06,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:30:06,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-03 18:30:06,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:30:06,698 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-03 18:30:06,698 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2025-03-03 18:30:06,698 INFO L87 Difference]: Start difference. First operand 2919 states and 3800 transitions. Second operand has 16 states, 16 states have (on average 3.875) internal successors, (62), 16 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:30:07,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:30:07,014 INFO L93 Difference]: Finished difference Result 4912 states and 6570 transitions. [2025-03-03 18:30:07,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-03 18:30:07,014 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.875) internal successors, (62), 16 states have internal predecessors, (62), 0 states have call successors, (0), 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 62 [2025-03-03 18:30:07,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:30:07,017 INFO L225 Difference]: With dead ends: 4912 [2025-03-03 18:30:07,017 INFO L226 Difference]: Without dead ends: 3772 [2025-03-03 18:30:07,017 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=82, Invalid=380, Unknown=0, NotChecked=0, Total=462 [2025-03-03 18:30:07,018 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 229 mSDsluCounter, 1114 mSDsCounter, 0 mSdLazyCounter, 895 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 1228 SdHoareTripleChecker+Invalid, 898 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 895 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 18:30:07,018 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 1228 Invalid, 898 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 895 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 18:30:07,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3772 states. [2025-03-03 18:30:07,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3772 to 3199. [2025-03-03 18:30:07,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3199 states, 3198 states have (on average 1.310193871169481) internal successors, (4190), 3198 states have internal predecessors, (4190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:30:07,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3199 states to 3199 states and 4190 transitions. [2025-03-03 18:30:07,035 INFO L78 Accepts]: Start accepts. Automaton has 3199 states and 4190 transitions. Word has length 62 [2025-03-03 18:30:07,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:30:07,035 INFO L471 AbstractCegarLoop]: Abstraction has 3199 states and 4190 transitions. [2025-03-03 18:30:07,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.875) internal successors, (62), 16 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:30:07,035 INFO L276 IsEmpty]: Start isEmpty. Operand 3199 states and 4190 transitions. [2025-03-03 18:30:07,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-03 18:30:07,036 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:30:07,036 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:30:07,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82 [2025-03-03 18:30:07,036 INFO L396 AbstractCegarLoop]: === Iteration 84 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:30:07,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:30:07,036 INFO L85 PathProgramCache]: Analyzing trace with hash 475002109, now seen corresponding path program 1 times [2025-03-03 18:30:07,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:30:07,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716454800] [2025-03-03 18:30:07,037 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:30:07,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:30:07,048 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-03 18:30:07,057 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-03 18:30:07,057 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:30:07,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:30:07,764 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:30:07,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:30:07,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716454800] [2025-03-03 18:30:07,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716454800] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:30:07,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:30:07,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2025-03-03 18:30:07,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645277193] [2025-03-03 18:30:07,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:30:07,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-03 18:30:07,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:30:07,765 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-03 18:30:07,765 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=409, Unknown=0, NotChecked=0, Total=462 [2025-03-03 18:30:07,765 INFO L87 Difference]: Start difference. First operand 3199 states and 4190 transitions. Second operand has 22 states, 22 states have (on average 2.8181818181818183) internal successors, (62), 22 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:30:08,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:30:08,076 INFO L93 Difference]: Finished difference Result 4822 states and 6475 transitions. [2025-03-03 18:30:08,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-03 18:30:08,076 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.8181818181818183) internal successors, (62), 22 states have internal predecessors, (62), 0 states have call successors, (0), 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 62 [2025-03-03 18:30:08,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:30:08,078 INFO L225 Difference]: With dead ends: 4822 [2025-03-03 18:30:08,078 INFO L226 Difference]: Without dead ends: 3428 [2025-03-03 18:30:08,080 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=57, Invalid=449, Unknown=0, NotChecked=0, Total=506 [2025-03-03 18:30:08,080 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 64 mSDsluCounter, 1055 mSDsCounter, 0 mSdLazyCounter, 816 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 1137 SdHoareTripleChecker+Invalid, 818 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 816 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 18:30:08,080 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 1137 Invalid, 818 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 816 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 18:30:08,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3428 states. [2025-03-03 18:30:08,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3428 to 3204. [2025-03-03 18:30:08,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3204 states, 3203 states have (on average 1.3109584764283484) internal successors, (4199), 3203 states have internal predecessors, (4199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:30:08,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3204 states to 3204 states and 4199 transitions. [2025-03-03 18:30:08,096 INFO L78 Accepts]: Start accepts. Automaton has 3204 states and 4199 transitions. Word has length 62 [2025-03-03 18:30:08,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:30:08,096 INFO L471 AbstractCegarLoop]: Abstraction has 3204 states and 4199 transitions. [2025-03-03 18:30:08,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.8181818181818183) internal successors, (62), 22 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:30:08,096 INFO L276 IsEmpty]: Start isEmpty. Operand 3204 states and 4199 transitions. [2025-03-03 18:30:08,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-03 18:30:08,098 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:30:08,098 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:30:08,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83 [2025-03-03 18:30:08,098 INFO L396 AbstractCegarLoop]: === Iteration 85 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:30:08,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:30:08,098 INFO L85 PathProgramCache]: Analyzing trace with hash 119601207, now seen corresponding path program 1 times [2025-03-03 18:30:08,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:30:08,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071709908] [2025-03-03 18:30:08,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:30:08,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:30:08,109 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-03 18:30:08,118 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-03 18:30:08,118 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:30:08,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:30:08,586 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:30:08,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:30:08,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071709908] [2025-03-03 18:30:08,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071709908] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:30:08,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:30:08,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2025-03-03 18:30:08,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511535928] [2025-03-03 18:30:08,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:30:08,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-03 18:30:08,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:30:08,587 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-03 18:30:08,587 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=446, Unknown=0, NotChecked=0, Total=506 [2025-03-03 18:30:08,587 INFO L87 Difference]: Start difference. First operand 3204 states and 4199 transitions. Second operand has 23 states, 23 states have (on average 2.6956521739130435) internal successors, (62), 23 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:30:08,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:30:08,783 INFO L93 Difference]: Finished difference Result 4690 states and 6290 transitions. [2025-03-03 18:30:08,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-03 18:30:08,784 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.6956521739130435) internal successors, (62), 23 states have internal predecessors, (62), 0 states have call successors, (0), 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 62 [2025-03-03 18:30:08,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:30:08,786 INFO L225 Difference]: With dead ends: 4690 [2025-03-03 18:30:08,786 INFO L226 Difference]: Without dead ends: 3296 [2025-03-03 18:30:08,787 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=446, Unknown=0, NotChecked=0, Total=506 [2025-03-03 18:30:08,787 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 68 mSDsluCounter, 1163 mSDsCounter, 0 mSdLazyCounter, 626 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 1256 SdHoareTripleChecker+Invalid, 626 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 626 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 18:30:08,787 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 1256 Invalid, 626 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 626 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 18:30:08,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3296 states. [2025-03-03 18:30:08,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3296 to 3189. [2025-03-03 18:30:08,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3189 states, 3188 states have (on average 1.3114805520702635) internal successors, (4181), 3188 states have internal predecessors, (4181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:30:08,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3189 states to 3189 states and 4181 transitions. [2025-03-03 18:30:08,819 INFO L78 Accepts]: Start accepts. Automaton has 3189 states and 4181 transitions. Word has length 62 [2025-03-03 18:30:08,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:30:08,819 INFO L471 AbstractCegarLoop]: Abstraction has 3189 states and 4181 transitions. [2025-03-03 18:30:08,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.6956521739130435) internal successors, (62), 23 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:30:08,819 INFO L276 IsEmpty]: Start isEmpty. Operand 3189 states and 4181 transitions. [2025-03-03 18:30:08,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-03 18:30:08,820 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:30:08,820 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:30:08,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84 [2025-03-03 18:30:08,820 INFO L396 AbstractCegarLoop]: === Iteration 86 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:30:08,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:30:08,821 INFO L85 PathProgramCache]: Analyzing trace with hash 727766456, now seen corresponding path program 1 times [2025-03-03 18:30:08,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:30:08,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584127779] [2025-03-03 18:30:08,821 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:30:08,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:30:08,833 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-03 18:30:08,842 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-03 18:30:08,842 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:30:08,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:30:09,430 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:30:09,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:30:09,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584127779] [2025-03-03 18:30:09,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [584127779] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:30:09,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:30:09,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2025-03-03 18:30:09,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442832888] [2025-03-03 18:30:09,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:30:09,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-03 18:30:09,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:30:09,431 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-03 18:30:09,431 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=401, Unknown=0, NotChecked=0, Total=462 [2025-03-03 18:30:09,431 INFO L87 Difference]: Start difference. First operand 3189 states and 4181 transitions. Second operand has 22 states, 22 states have (on average 2.8181818181818183) internal successors, (62), 22 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:30:09,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:30:09,687 INFO L93 Difference]: Finished difference Result 4673 states and 6277 transitions. [2025-03-03 18:30:09,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-03 18:30:09,688 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.8181818181818183) internal successors, (62), 22 states have internal predecessors, (62), 0 states have call successors, (0), 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 62 [2025-03-03 18:30:09,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:30:09,689 INFO L225 Difference]: With dead ends: 4673 [2025-03-03 18:30:09,689 INFO L226 Difference]: Without dead ends: 3279 [2025-03-03 18:30:09,690 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=440, Unknown=0, NotChecked=0, Total=506 [2025-03-03 18:30:09,691 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 85 mSDsluCounter, 907 mSDsCounter, 0 mSdLazyCounter, 681 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 992 SdHoareTripleChecker+Invalid, 683 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 681 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 18:30:09,691 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 992 Invalid, 683 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 681 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 18:30:09,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3279 states. [2025-03-03 18:30:09,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3279 to 3157. [2025-03-03 18:30:09,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3157 states, 3156 states have (on average 1.3130544993662865) internal successors, (4144), 3156 states have internal predecessors, (4144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:30:09,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3157 states to 3157 states and 4144 transitions. [2025-03-03 18:30:09,707 INFO L78 Accepts]: Start accepts. Automaton has 3157 states and 4144 transitions. Word has length 62 [2025-03-03 18:30:09,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:30:09,707 INFO L471 AbstractCegarLoop]: Abstraction has 3157 states and 4144 transitions. [2025-03-03 18:30:09,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.8181818181818183) internal successors, (62), 22 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:30:09,708 INFO L276 IsEmpty]: Start isEmpty. Operand 3157 states and 4144 transitions. [2025-03-03 18:30:09,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-03 18:30:09,709 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:30:09,709 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:30:09,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85 [2025-03-03 18:30:09,709 INFO L396 AbstractCegarLoop]: === Iteration 87 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:30:09,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:30:09,709 INFO L85 PathProgramCache]: Analyzing trace with hash 1523758808, now seen corresponding path program 1 times [2025-03-03 18:30:09,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:30:09,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595749704] [2025-03-03 18:30:09,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:30:09,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:30:09,721 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-03 18:30:09,731 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-03 18:30:09,731 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:30:09,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:30:09,989 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:30:09,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:30:09,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595749704] [2025-03-03 18:30:09,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595749704] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:30:09,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:30:09,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-03 18:30:09,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713507324] [2025-03-03 18:30:09,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:30:09,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 18:30:09,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:30:09,990 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 18:30:09,990 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2025-03-03 18:30:09,990 INFO L87 Difference]: Start difference. First operand 3157 states and 4144 transitions. Second operand has 10 states, 10 states have (on average 6.2) internal successors, (62), 10 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:30:10,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:30:10,175 INFO L93 Difference]: Finished difference Result 4723 states and 6330 transitions. [2025-03-03 18:30:10,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 18:30:10,175 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.2) internal successors, (62), 10 states have internal predecessors, (62), 0 states have call successors, (0), 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 62 [2025-03-03 18:30:10,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:30:10,177 INFO L225 Difference]: With dead ends: 4723 [2025-03-03 18:30:10,177 INFO L226 Difference]: Without dead ends: 3325 [2025-03-03 18:30:10,178 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2025-03-03 18:30:10,178 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 274 mSDsluCounter, 469 mSDsCounter, 0 mSdLazyCounter, 428 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 580 SdHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 18:30:10,179 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [274 Valid, 580 Invalid, 430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 428 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 18:30:10,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3325 states. [2025-03-03 18:30:10,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3325 to 3167. [2025-03-03 18:30:10,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3167 states, 3166 states have (on average 1.3114339861023374) internal successors, (4152), 3166 states have internal predecessors, (4152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:30:10,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3167 states to 3167 states and 4152 transitions. [2025-03-03 18:30:10,204 INFO L78 Accepts]: Start accepts. Automaton has 3167 states and 4152 transitions. Word has length 62 [2025-03-03 18:30:10,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:30:10,204 INFO L471 AbstractCegarLoop]: Abstraction has 3167 states and 4152 transitions. [2025-03-03 18:30:10,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.2) internal successors, (62), 10 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:30:10,204 INFO L276 IsEmpty]: Start isEmpty. Operand 3167 states and 4152 transitions. [2025-03-03 18:30:10,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-03 18:30:10,205 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:30:10,205 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:30:10,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86 [2025-03-03 18:30:10,206 INFO L396 AbstractCegarLoop]: === Iteration 88 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:30:10,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:30:10,206 INFO L85 PathProgramCache]: Analyzing trace with hash 1351616299, now seen corresponding path program 1 times [2025-03-03 18:30:10,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:30:10,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581590960] [2025-03-03 18:30:10,206 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:30:10,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:30:10,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-03 18:30:10,239 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-03 18:30:10,239 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:30:10,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:30:10,670 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:30:10,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:30:10,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581590960] [2025-03-03 18:30:10,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1581590960] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:30:10,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:30:10,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2025-03-03 18:30:10,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163885426] [2025-03-03 18:30:10,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:30:10,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-03 18:30:10,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:30:10,671 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-03 18:30:10,671 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=446, Unknown=0, NotChecked=0, Total=506 [2025-03-03 18:30:10,671 INFO L87 Difference]: Start difference. First operand 3167 states and 4152 transitions. Second operand has 23 states, 23 states have (on average 2.6956521739130435) internal successors, (62), 23 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:30:10,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:30:10,897 INFO L93 Difference]: Finished difference Result 4946 states and 6635 transitions. [2025-03-03 18:30:10,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-03 18:30:10,897 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.6956521739130435) internal successors, (62), 23 states have internal predecessors, (62), 0 states have call successors, (0), 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 62 [2025-03-03 18:30:10,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:30:10,899 INFO L225 Difference]: With dead ends: 4946 [2025-03-03 18:30:10,899 INFO L226 Difference]: Without dead ends: 3546 [2025-03-03 18:30:10,901 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=446, Unknown=0, NotChecked=0, Total=506 [2025-03-03 18:30:10,901 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 60 mSDsluCounter, 1472 mSDsCounter, 0 mSdLazyCounter, 818 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 1567 SdHoareTripleChecker+Invalid, 820 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 818 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 18:30:10,901 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 1567 Invalid, 820 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 818 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 18:30:10,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3546 states. [2025-03-03 18:30:10,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3546 to 3175. [2025-03-03 18:30:10,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3175 states, 3174 states have (on average 1.311279143037177) internal successors, (4162), 3174 states have internal predecessors, (4162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:30:10,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3175 states to 3175 states and 4162 transitions. [2025-03-03 18:30:10,917 INFO L78 Accepts]: Start accepts. Automaton has 3175 states and 4162 transitions. Word has length 62 [2025-03-03 18:30:10,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:30:10,917 INFO L471 AbstractCegarLoop]: Abstraction has 3175 states and 4162 transitions. [2025-03-03 18:30:10,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.6956521739130435) internal successors, (62), 23 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:30:10,917 INFO L276 IsEmpty]: Start isEmpty. Operand 3175 states and 4162 transitions. [2025-03-03 18:30:10,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-03 18:30:10,918 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:30:10,918 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:30:10,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87 [2025-03-03 18:30:10,918 INFO L396 AbstractCegarLoop]: === Iteration 89 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:30:10,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:30:10,919 INFO L85 PathProgramCache]: Analyzing trace with hash 975825938, now seen corresponding path program 1 times [2025-03-03 18:30:10,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:30:10,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230439307] [2025-03-03 18:30:10,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:30:10,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:30:10,933 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-03 18:30:10,942 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-03 18:30:10,942 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:30:10,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:30:11,245 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:30:11,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:30:11,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230439307] [2025-03-03 18:30:11,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230439307] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:30:11,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:30:11,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-03 18:30:11,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595484410] [2025-03-03 18:30:11,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:30:11,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-03 18:30:11,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:30:11,245 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-03 18:30:11,245 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2025-03-03 18:30:11,245 INFO L87 Difference]: Start difference. First operand 3175 states and 4162 transitions. Second operand has 15 states, 15 states have (on average 4.133333333333334) internal successors, (62), 15 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:30:11,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:30:11,359 INFO L93 Difference]: Finished difference Result 4704 states and 6324 transitions. [2025-03-03 18:30:11,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-03 18:30:11,359 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.133333333333334) internal successors, (62), 15 states have internal predecessors, (62), 0 states have call successors, (0), 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 62 [2025-03-03 18:30:11,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:30:11,361 INFO L225 Difference]: With dead ends: 4704 [2025-03-03 18:30:11,361 INFO L226 Difference]: Without dead ends: 3304 [2025-03-03 18:30:11,362 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2025-03-03 18:30:11,362 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 58 mSDsluCounter, 756 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 852 SdHoareTripleChecker+Invalid, 343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 18:30:11,362 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 852 Invalid, 343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 343 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 18:30:11,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3304 states. [2025-03-03 18:30:11,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3304 to 3137. [2025-03-03 18:30:11,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3137 states, 3136 states have (on average 1.3137755102040816) internal successors, (4120), 3136 states have internal predecessors, (4120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:30:11,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3137 states to 3137 states and 4120 transitions. [2025-03-03 18:30:11,378 INFO L78 Accepts]: Start accepts. Automaton has 3137 states and 4120 transitions. Word has length 62 [2025-03-03 18:30:11,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:30:11,378 INFO L471 AbstractCegarLoop]: Abstraction has 3137 states and 4120 transitions. [2025-03-03 18:30:11,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.133333333333334) internal successors, (62), 15 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:30:11,378 INFO L276 IsEmpty]: Start isEmpty. Operand 3137 states and 4120 transitions. [2025-03-03 18:30:11,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-03 18:30:11,380 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:30:11,380 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:30:11,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable88 [2025-03-03 18:30:11,380 INFO L396 AbstractCegarLoop]: === Iteration 90 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:30:11,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:30:11,380 INFO L85 PathProgramCache]: Analyzing trace with hash -285037150, now seen corresponding path program 1 times [2025-03-03 18:30:11,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:30:11,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303880952] [2025-03-03 18:30:11,380 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:30:11,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:30:11,391 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-03 18:30:11,404 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-03 18:30:11,405 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:30:11,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:30:11,673 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:30:11,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:30:11,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303880952] [2025-03-03 18:30:11,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303880952] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:30:11,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:30:11,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-03 18:30:11,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997272214] [2025-03-03 18:30:11,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:30:11,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-03 18:30:11,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:30:11,674 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-03 18:30:11,674 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2025-03-03 18:30:11,674 INFO L87 Difference]: Start difference. First operand 3137 states and 4120 transitions. Second operand has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 14 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:30:11,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:30:11,768 INFO L93 Difference]: Finished difference Result 4622 states and 6217 transitions. [2025-03-03 18:30:11,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-03 18:30:11,768 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 14 states have internal predecessors, (62), 0 states have call successors, (0), 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 62 [2025-03-03 18:30:11,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:30:11,770 INFO L225 Difference]: With dead ends: 4622 [2025-03-03 18:30:11,770 INFO L226 Difference]: Without dead ends: 3186 [2025-03-03 18:30:11,771 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2025-03-03 18:30:11,771 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 65 mSDsluCounter, 572 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 669 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 18:30:11,771 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 669 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 274 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 18:30:11,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3186 states. [2025-03-03 18:30:11,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3186 to 3048. [2025-03-03 18:30:11,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3048 states, 3047 states have (on average 1.3167049556941253) internal successors, (4012), 3047 states have internal predecessors, (4012), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:30:11,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3048 states to 3048 states and 4012 transitions. [2025-03-03 18:30:11,785 INFO L78 Accepts]: Start accepts. Automaton has 3048 states and 4012 transitions. Word has length 62 [2025-03-03 18:30:11,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:30:11,785 INFO L471 AbstractCegarLoop]: Abstraction has 3048 states and 4012 transitions. [2025-03-03 18:30:11,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 14 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:30:11,785 INFO L276 IsEmpty]: Start isEmpty. Operand 3048 states and 4012 transitions. [2025-03-03 18:30:11,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-03 18:30:11,787 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:30:11,787 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:30:11,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable89 [2025-03-03 18:30:11,787 INFO L396 AbstractCegarLoop]: === Iteration 91 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:30:11,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:30:11,787 INFO L85 PathProgramCache]: Analyzing trace with hash 1294022705, now seen corresponding path program 1 times [2025-03-03 18:30:11,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:30:11,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664800805] [2025-03-03 18:30:11,787 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:30:11,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:30:11,798 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-03 18:30:11,807 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-03 18:30:11,807 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:30:11,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:30:12,104 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:30:12,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:30:12,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664800805] [2025-03-03 18:30:12,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664800805] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:30:12,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:30:12,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-03 18:30:12,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676343518] [2025-03-03 18:30:12,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:30:12,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 18:30:12,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:30:12,105 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 18:30:12,105 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-03-03 18:30:12,105 INFO L87 Difference]: Start difference. First operand 3048 states and 4012 transitions. Second operand has 10 states, 10 states have (on average 6.2) internal successors, (62), 10 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:30:12,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:30:12,354 INFO L93 Difference]: Finished difference Result 4544 states and 6132 transitions. [2025-03-03 18:30:12,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 18:30:12,354 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.2) internal successors, (62), 10 states have internal predecessors, (62), 0 states have call successors, (0), 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 62 [2025-03-03 18:30:12,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:30:12,356 INFO L225 Difference]: With dead ends: 4544 [2025-03-03 18:30:12,356 INFO L226 Difference]: Without dead ends: 3144 [2025-03-03 18:30:12,357 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2025-03-03 18:30:12,357 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 293 mSDsluCounter, 551 mSDsCounter, 0 mSdLazyCounter, 540 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 667 SdHoareTripleChecker+Invalid, 541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 540 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 18:30:12,357 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 667 Invalid, 541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 540 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 18:30:12,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3144 states. [2025-03-03 18:30:12,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3144 to 3050. [2025-03-03 18:30:12,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3050 states, 3049 states have (on average 1.3168251885864217) internal successors, (4015), 3049 states have internal predecessors, (4015), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:30:12,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3050 states to 3050 states and 4015 transitions. [2025-03-03 18:30:12,373 INFO L78 Accepts]: Start accepts. Automaton has 3050 states and 4015 transitions. Word has length 62 [2025-03-03 18:30:12,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:30:12,373 INFO L471 AbstractCegarLoop]: Abstraction has 3050 states and 4015 transitions. [2025-03-03 18:30:12,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.2) internal successors, (62), 10 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:30:12,373 INFO L276 IsEmpty]: Start isEmpty. Operand 3050 states and 4015 transitions. [2025-03-03 18:30:12,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-03 18:30:12,374 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:30:12,374 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:30:12,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90 [2025-03-03 18:30:12,374 INFO L396 AbstractCegarLoop]: === Iteration 92 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:30:12,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:30:12,374 INFO L85 PathProgramCache]: Analyzing trace with hash -1277599753, now seen corresponding path program 1 times [2025-03-03 18:30:12,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:30:12,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390769737] [2025-03-03 18:30:12,375 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:30:12,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:30:12,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-03 18:30:12,399 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-03 18:30:12,399 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:30:12,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:30:12,572 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:30:12,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:30:12,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390769737] [2025-03-03 18:30:12,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390769737] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:30:12,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:30:12,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 18:30:12,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205565035] [2025-03-03 18:30:12,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:30:12,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 18:30:12,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:30:12,572 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 18:30:12,573 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 18:30:12,573 INFO L87 Difference]: Start difference. First operand 3050 states and 4015 transitions. Second operand has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:30:12,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:30:12,767 INFO L93 Difference]: Finished difference Result 4225 states and 5678 transitions. [2025-03-03 18:30:12,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 18:30:12,767 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 0 states have call successors, (0), 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 62 [2025-03-03 18:30:12,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:30:12,769 INFO L225 Difference]: With dead ends: 4225 [2025-03-03 18:30:12,769 INFO L226 Difference]: Without dead ends: 2436 [2025-03-03 18:30:12,770 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-03 18:30:12,770 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 128 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 18:30:12,770 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 385 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 18:30:12,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2436 states. [2025-03-03 18:30:12,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2436 to 2432. [2025-03-03 18:30:12,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2432 states, 2431 states have (on average 1.316330728095434) internal successors, (3200), 2431 states have internal predecessors, (3200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:30:12,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2432 states to 2432 states and 3200 transitions. [2025-03-03 18:30:12,782 INFO L78 Accepts]: Start accepts. Automaton has 2432 states and 3200 transitions. Word has length 62 [2025-03-03 18:30:12,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:30:12,782 INFO L471 AbstractCegarLoop]: Abstraction has 2432 states and 3200 transitions. [2025-03-03 18:30:12,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:30:12,782 INFO L276 IsEmpty]: Start isEmpty. Operand 2432 states and 3200 transitions. [2025-03-03 18:30:12,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-03 18:30:12,783 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:30:12,783 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:30:12,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable91 [2025-03-03 18:30:12,783 INFO L396 AbstractCegarLoop]: === Iteration 93 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:30:12,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:30:12,784 INFO L85 PathProgramCache]: Analyzing trace with hash -896979227, now seen corresponding path program 1 times [2025-03-03 18:30:12,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:30:12,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752215136] [2025-03-03 18:30:12,784 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:30:12,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:30:12,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-03 18:30:12,804 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-03 18:30:12,804 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:30:12,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:30:13,350 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:30:13,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:30:13,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752215136] [2025-03-03 18:30:13,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752215136] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:30:13,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:30:13,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2025-03-03 18:30:13,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737494357] [2025-03-03 18:30:13,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:30:13,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-03 18:30:13,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:30:13,350 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-03 18:30:13,350 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=368, Unknown=0, NotChecked=0, Total=420 [2025-03-03 18:30:13,350 INFO L87 Difference]: Start difference. First operand 2432 states and 3200 transitions. Second operand has 21 states, 21 states have (on average 2.9523809523809526) internal successors, (62), 21 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:30:13,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:30:13,587 INFO L93 Difference]: Finished difference Result 3637 states and 4892 transitions. [2025-03-03 18:30:13,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-03 18:30:13,587 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.9523809523809526) internal successors, (62), 21 states have internal predecessors, (62), 0 states have call successors, (0), 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 62 [2025-03-03 18:30:13,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:30:13,588 INFO L225 Difference]: With dead ends: 3637 [2025-03-03 18:30:13,588 INFO L226 Difference]: Without dead ends: 2505 [2025-03-03 18:30:13,589 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=406, Unknown=0, NotChecked=0, Total=462 [2025-03-03 18:30:13,590 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 50 mSDsluCounter, 1024 mSDsCounter, 0 mSdLazyCounter, 648 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 1113 SdHoareTripleChecker+Invalid, 649 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 648 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 18:30:13,590 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 1113 Invalid, 649 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 648 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 18:30:13,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2505 states. [2025-03-03 18:30:13,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2505 to 2432. [2025-03-03 18:30:13,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2432 states, 2431 states have (on average 1.316330728095434) internal successors, (3200), 2431 states have internal predecessors, (3200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:30:13,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2432 states to 2432 states and 3200 transitions. [2025-03-03 18:30:13,601 INFO L78 Accepts]: Start accepts. Automaton has 2432 states and 3200 transitions. Word has length 62 [2025-03-03 18:30:13,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:30:13,601 INFO L471 AbstractCegarLoop]: Abstraction has 2432 states and 3200 transitions. [2025-03-03 18:30:13,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.9523809523809526) internal successors, (62), 21 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:30:13,601 INFO L276 IsEmpty]: Start isEmpty. Operand 2432 states and 3200 transitions. [2025-03-03 18:30:13,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-03 18:30:13,602 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:30:13,602 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:30:13,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92 [2025-03-03 18:30:13,602 INFO L396 AbstractCegarLoop]: === Iteration 94 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:30:13,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:30:13,603 INFO L85 PathProgramCache]: Analyzing trace with hash 1205205529, now seen corresponding path program 1 times [2025-03-03 18:30:13,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:30:13,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896514140] [2025-03-03 18:30:13,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:30:13,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:30:13,616 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-03 18:30:13,632 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-03 18:30:13,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:30:13,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:30:14,157 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:30:14,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:30:14,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896514140] [2025-03-03 18:30:14,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896514140] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:30:14,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:30:14,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2025-03-03 18:30:14,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313185292] [2025-03-03 18:30:14,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:30:14,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-03 18:30:14,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:30:14,158 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-03 18:30:14,158 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=370, Unknown=0, NotChecked=0, Total=420 [2025-03-03 18:30:14,158 INFO L87 Difference]: Start difference. First operand 2432 states and 3200 transitions. Second operand has 21 states, 21 states have (on average 2.9523809523809526) internal successors, (62), 21 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:30:14,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:30:14,495 INFO L93 Difference]: Finished difference Result 3773 states and 5083 transitions. [2025-03-03 18:30:14,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-03 18:30:14,496 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.9523809523809526) internal successors, (62), 21 states have internal predecessors, (62), 0 states have call successors, (0), 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 62 [2025-03-03 18:30:14,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:30:14,498 INFO L225 Difference]: With dead ends: 3773 [2025-03-03 18:30:14,498 INFO L226 Difference]: Without dead ends: 2641 [2025-03-03 18:30:14,499 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=408, Unknown=0, NotChecked=0, Total=462 [2025-03-03 18:30:14,499 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 61 mSDsluCounter, 1207 mSDsCounter, 0 mSdLazyCounter, 1036 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 1288 SdHoareTripleChecker+Invalid, 1037 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1036 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 18:30:14,499 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 1288 Invalid, 1037 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1036 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 18:30:14,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2641 states. [2025-03-03 18:30:14,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2641 to 2438. [2025-03-03 18:30:14,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2438 states, 2437 states have (on average 1.3167829298317604) internal successors, (3209), 2437 states have internal predecessors, (3209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:30:14,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2438 states to 2438 states and 3209 transitions. [2025-03-03 18:30:14,513 INFO L78 Accepts]: Start accepts. Automaton has 2438 states and 3209 transitions. Word has length 62 [2025-03-03 18:30:14,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:30:14,513 INFO L471 AbstractCegarLoop]: Abstraction has 2438 states and 3209 transitions. [2025-03-03 18:30:14,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.9523809523809526) internal successors, (62), 21 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:30:14,513 INFO L276 IsEmpty]: Start isEmpty. Operand 2438 states and 3209 transitions. [2025-03-03 18:30:14,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-03 18:30:14,514 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:30:14,515 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:30:14,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable93 [2025-03-03 18:30:14,515 INFO L396 AbstractCegarLoop]: === Iteration 95 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:30:14,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:30:14,515 INFO L85 PathProgramCache]: Analyzing trace with hash 1999262881, now seen corresponding path program 1 times [2025-03-03 18:30:14,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:30:14,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300547721] [2025-03-03 18:30:14,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:30:14,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:30:14,533 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-03 18:30:14,549 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-03 18:30:14,549 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:30:14,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:30:14,817 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:30:14,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:30:14,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300547721] [2025-03-03 18:30:14,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300547721] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:30:14,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:30:14,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-03 18:30:14,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565096337] [2025-03-03 18:30:14,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:30:14,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 18:30:14,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:30:14,818 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 18:30:14,818 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-03-03 18:30:14,818 INFO L87 Difference]: Start difference. First operand 2438 states and 3209 transitions. Second operand has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 12 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:30:14,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:30:14,920 INFO L93 Difference]: Finished difference Result 3603 states and 4863 transitions. [2025-03-03 18:30:14,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 18:30:14,920 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 12 states have internal predecessors, (62), 0 states have call successors, (0), 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 62 [2025-03-03 18:30:14,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:30:14,921 INFO L225 Difference]: With dead ends: 3603 [2025-03-03 18:30:14,921 INFO L226 Difference]: Without dead ends: 2290 [2025-03-03 18:30:14,922 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-03-03 18:30:14,923 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 30 mSDsluCounter, 651 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 749 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 18:30:14,923 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 749 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 18:30:14,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2290 states. [2025-03-03 18:30:14,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2290 to 2069. [2025-03-03 18:30:14,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2069 states, 2068 states have (on average 1.3205996131528046) internal successors, (2731), 2068 states have internal predecessors, (2731), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:30:14,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2069 states to 2069 states and 2731 transitions. [2025-03-03 18:30:14,933 INFO L78 Accepts]: Start accepts. Automaton has 2069 states and 2731 transitions. Word has length 62 [2025-03-03 18:30:14,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:30:14,933 INFO L471 AbstractCegarLoop]: Abstraction has 2069 states and 2731 transitions. [2025-03-03 18:30:14,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 12 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:30:14,934 INFO L276 IsEmpty]: Start isEmpty. Operand 2069 states and 2731 transitions. [2025-03-03 18:30:14,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-03 18:30:14,934 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:30:14,934 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:30:14,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable94 [2025-03-03 18:30:14,934 INFO L396 AbstractCegarLoop]: === Iteration 96 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:30:14,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:30:14,935 INFO L85 PathProgramCache]: Analyzing trace with hash -103414490, now seen corresponding path program 1 times [2025-03-03 18:30:14,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:30:14,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033236117] [2025-03-03 18:30:14,935 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:30:14,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:30:14,946 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-03 18:30:14,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-03 18:30:14,953 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:30:14,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:30:15,211 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:30:15,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:30:15,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033236117] [2025-03-03 18:30:15,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033236117] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:30:15,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:30:15,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-03 18:30:15,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435332313] [2025-03-03 18:30:15,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:30:15,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-03 18:30:15,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:30:15,212 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-03 18:30:15,212 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2025-03-03 18:30:15,212 INFO L87 Difference]: Start difference. First operand 2069 states and 2731 transitions. Second operand has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 14 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:30:15,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:30:15,485 INFO L93 Difference]: Finished difference Result 3348 states and 4534 transitions. [2025-03-03 18:30:15,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-03 18:30:15,485 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 14 states have internal predecessors, (62), 0 states have call successors, (0), 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 62 [2025-03-03 18:30:15,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:30:15,486 INFO L225 Difference]: With dead ends: 3348 [2025-03-03 18:30:15,486 INFO L226 Difference]: Without dead ends: 2216 [2025-03-03 18:30:15,487 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=314, Unknown=0, NotChecked=0, Total=380 [2025-03-03 18:30:15,487 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 169 mSDsluCounter, 960 mSDsCounter, 0 mSdLazyCounter, 780 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 1076 SdHoareTripleChecker+Invalid, 781 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 780 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 18:30:15,487 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 1076 Invalid, 781 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 780 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 18:30:15,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2216 states. [2025-03-03 18:30:15,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2216 to 2071. [2025-03-03 18:30:15,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2071 states, 2070 states have (on average 1.3207729468599034) internal successors, (2734), 2070 states have internal predecessors, (2734), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:30:15,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2071 states to 2071 states and 2734 transitions. [2025-03-03 18:30:15,498 INFO L78 Accepts]: Start accepts. Automaton has 2071 states and 2734 transitions. Word has length 62 [2025-03-03 18:30:15,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:30:15,498 INFO L471 AbstractCegarLoop]: Abstraction has 2071 states and 2734 transitions. [2025-03-03 18:30:15,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 14 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:30:15,498 INFO L276 IsEmpty]: Start isEmpty. Operand 2071 states and 2734 transitions. [2025-03-03 18:30:15,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-03 18:30:15,499 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:30:15,499 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:30:15,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable95 [2025-03-03 18:30:15,499 INFO L396 AbstractCegarLoop]: === Iteration 97 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:30:15,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:30:15,499 INFO L85 PathProgramCache]: Analyzing trace with hash -1719183716, now seen corresponding path program 1 times [2025-03-03 18:30:15,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:30:15,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501512142] [2025-03-03 18:30:15,499 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:30:15,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:30:15,510 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-03 18:30:15,525 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-03 18:30:15,525 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:30:15,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:30:15,811 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:30:15,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:30:15,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501512142] [2025-03-03 18:30:15,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501512142] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:30:15,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:30:15,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-03 18:30:15,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600856066] [2025-03-03 18:30:15,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:30:15,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-03 18:30:15,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:30:15,811 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-03 18:30:15,811 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2025-03-03 18:30:15,811 INFO L87 Difference]: Start difference. First operand 2071 states and 2734 transitions. Second operand has 13 states, 13 states have (on average 4.769230769230769) internal successors, (62), 13 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:30:15,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:30:15,993 INFO L93 Difference]: Finished difference Result 3571 states and 4811 transitions. [2025-03-03 18:30:15,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 18:30:15,994 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.769230769230769) internal successors, (62), 13 states have internal predecessors, (62), 0 states have call successors, (0), 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 62 [2025-03-03 18:30:15,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:30:15,995 INFO L225 Difference]: With dead ends: 3571 [2025-03-03 18:30:15,995 INFO L226 Difference]: Without dead ends: 2428 [2025-03-03 18:30:15,996 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2025-03-03 18:30:15,996 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 315 mSDsluCounter, 501 mSDsCounter, 0 mSdLazyCounter, 434 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 315 SdHoareTripleChecker+Valid, 603 SdHoareTripleChecker+Invalid, 435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 434 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 18:30:15,996 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [315 Valid, 603 Invalid, 435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 434 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 18:30:15,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2428 states. [2025-03-03 18:30:16,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2428 to 2045. [2025-03-03 18:30:16,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2045 states, 2044 states have (on average 1.3228962818003913) internal successors, (2704), 2044 states have internal predecessors, (2704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:30:16,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2045 states to 2045 states and 2704 transitions. [2025-03-03 18:30:16,007 INFO L78 Accepts]: Start accepts. Automaton has 2045 states and 2704 transitions. Word has length 62 [2025-03-03 18:30:16,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:30:16,007 INFO L471 AbstractCegarLoop]: Abstraction has 2045 states and 2704 transitions. [2025-03-03 18:30:16,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.769230769230769) internal successors, (62), 13 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:30:16,007 INFO L276 IsEmpty]: Start isEmpty. Operand 2045 states and 2704 transitions. [2025-03-03 18:30:16,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-03 18:30:16,008 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:30:16,008 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:30:16,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable96 [2025-03-03 18:30:16,008 INFO L396 AbstractCegarLoop]: === Iteration 98 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:30:16,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:30:16,008 INFO L85 PathProgramCache]: Analyzing trace with hash 274035703, now seen corresponding path program 1 times [2025-03-03 18:30:16,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:30:16,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903969953] [2025-03-03 18:30:16,008 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:30:16,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:30:16,020 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-03 18:30:16,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-03 18:30:16,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:30:16,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:30:16,293 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:30:16,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:30:16,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903969953] [2025-03-03 18:30:16,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903969953] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:30:16,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:30:16,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-03 18:30:16,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213754068] [2025-03-03 18:30:16,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:30:16,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-03 18:30:16,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:30:16,294 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-03 18:30:16,294 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2025-03-03 18:30:16,294 INFO L87 Difference]: Start difference. First operand 2045 states and 2704 transitions. Second operand has 15 states, 15 states have (on average 4.133333333333334) internal successors, (62), 15 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:30:16,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:30:16,424 INFO L93 Difference]: Finished difference Result 3335 states and 4488 transitions. [2025-03-03 18:30:16,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-03 18:30:16,424 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.133333333333334) internal successors, (62), 15 states have internal predecessors, (62), 0 states have call successors, (0), 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 62 [2025-03-03 18:30:16,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:30:16,426 INFO L225 Difference]: With dead ends: 3335 [2025-03-03 18:30:16,426 INFO L226 Difference]: Without dead ends: 2176 [2025-03-03 18:30:16,426 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2025-03-03 18:30:16,427 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 47 mSDsluCounter, 921 mSDsCounter, 0 mSdLazyCounter, 407 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 1017 SdHoareTripleChecker+Invalid, 407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 18:30:16,427 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 1017 Invalid, 407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 407 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 18:30:16,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2176 states. [2025-03-03 18:30:16,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2176 to 2047. [2025-03-03 18:30:16,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2047 states, 2046 states have (on average 1.3196480938416422) internal successors, (2700), 2046 states have internal predecessors, (2700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:30:16,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2047 states to 2047 states and 2700 transitions. [2025-03-03 18:30:16,437 INFO L78 Accepts]: Start accepts. Automaton has 2047 states and 2700 transitions. Word has length 62 [2025-03-03 18:30:16,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:30:16,437 INFO L471 AbstractCegarLoop]: Abstraction has 2047 states and 2700 transitions. [2025-03-03 18:30:16,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.133333333333334) internal successors, (62), 15 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:30:16,437 INFO L276 IsEmpty]: Start isEmpty. Operand 2047 states and 2700 transitions. [2025-03-03 18:30:16,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-03 18:30:16,437 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:30:16,438 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:30:16,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable97 [2025-03-03 18:30:16,438 INFO L396 AbstractCegarLoop]: === Iteration 99 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:30:16,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:30:16,438 INFO L85 PathProgramCache]: Analyzing trace with hash -437252437, now seen corresponding path program 1 times [2025-03-03 18:30:16,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:30:16,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696699786] [2025-03-03 18:30:16,438 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:30:16,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:30:16,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-03 18:30:16,457 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-03 18:30:16,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:30:16,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:30:16,638 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:30:16,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:30:16,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696699786] [2025-03-03 18:30:16,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696699786] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:30:16,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:30:16,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-03 18:30:16,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142457803] [2025-03-03 18:30:16,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:30:16,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 18:30:16,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:30:16,638 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 18:30:16,638 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-03-03 18:30:16,639 INFO L87 Difference]: Start difference. First operand 2047 states and 2700 transitions. Second operand has 10 states, 10 states have (on average 6.2) internal successors, (62), 10 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:30:16,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:30:16,795 INFO L93 Difference]: Finished difference Result 3213 states and 4348 transitions. [2025-03-03 18:30:16,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 18:30:16,795 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.2) internal successors, (62), 10 states have internal predecessors, (62), 0 states have call successors, (0), 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 62 [2025-03-03 18:30:16,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:30:16,796 INFO L225 Difference]: With dead ends: 3213 [2025-03-03 18:30:16,796 INFO L226 Difference]: Without dead ends: 2090 [2025-03-03 18:30:16,797 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2025-03-03 18:30:16,797 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 183 mSDsluCounter, 506 mSDsCounter, 0 mSdLazyCounter, 432 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 616 SdHoareTripleChecker+Invalid, 433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 432 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 18:30:16,797 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 616 Invalid, 433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 432 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 18:30:16,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2090 states. [2025-03-03 18:30:16,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2090 to 2015. [2025-03-03 18:30:16,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2015 states, 2014 states have (on average 1.3227408142999006) internal successors, (2664), 2014 states have internal predecessors, (2664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:30:16,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2015 states to 2015 states and 2664 transitions. [2025-03-03 18:30:16,807 INFO L78 Accepts]: Start accepts. Automaton has 2015 states and 2664 transitions. Word has length 62 [2025-03-03 18:30:16,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:30:16,807 INFO L471 AbstractCegarLoop]: Abstraction has 2015 states and 2664 transitions. [2025-03-03 18:30:16,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.2) internal successors, (62), 10 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:30:16,807 INFO L276 IsEmpty]: Start isEmpty. Operand 2015 states and 2664 transitions. [2025-03-03 18:30:16,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-03 18:30:16,808 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:30:16,808 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:30:16,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable98 [2025-03-03 18:30:16,808 INFO L396 AbstractCegarLoop]: === Iteration 100 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:30:16,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:30:16,808 INFO L85 PathProgramCache]: Analyzing trace with hash -2121827860, now seen corresponding path program 1 times [2025-03-03 18:30:16,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:30:16,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329426408] [2025-03-03 18:30:16,808 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:30:16,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:30:16,820 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-03 18:30:16,844 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-03 18:30:16,844 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:30:16,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:30:17,541 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:30:17,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:30:17,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329426408] [2025-03-03 18:30:17,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329426408] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:30:17,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:30:17,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2025-03-03 18:30:17,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126805420] [2025-03-03 18:30:17,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:30:17,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-03 18:30:17,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:30:17,541 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-03 18:30:17,541 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462 [2025-03-03 18:30:17,542 INFO L87 Difference]: Start difference. First operand 2015 states and 2664 transitions. Second operand has 22 states, 22 states have (on average 2.8181818181818183) internal successors, (62), 22 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:30:17,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:30:17,901 INFO L93 Difference]: Finished difference Result 3306 states and 4479 transitions. [2025-03-03 18:30:17,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-03 18:30:17,901 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.8181818181818183) internal successors, (62), 22 states have internal predecessors, (62), 0 states have call successors, (0), 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 62 [2025-03-03 18:30:17,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:30:17,903 INFO L225 Difference]: With dead ends: 3306 [2025-03-03 18:30:17,903 INFO L226 Difference]: Without dead ends: 2187 [2025-03-03 18:30:17,903 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462 [2025-03-03 18:30:17,904 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 107 mSDsluCounter, 1079 mSDsCounter, 0 mSdLazyCounter, 978 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 1165 SdHoareTripleChecker+Invalid, 980 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 978 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 18:30:17,904 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 1165 Invalid, 980 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 978 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 18:30:17,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2187 states. [2025-03-03 18:30:17,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2187 to 2030. [2025-03-03 18:30:17,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2030 states, 2029 states have (on average 1.3238048299655003) internal successors, (2686), 2029 states have internal predecessors, (2686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:30:17,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2030 states to 2030 states and 2686 transitions. [2025-03-03 18:30:17,913 INFO L78 Accepts]: Start accepts. Automaton has 2030 states and 2686 transitions. Word has length 62 [2025-03-03 18:30:17,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:30:17,913 INFO L471 AbstractCegarLoop]: Abstraction has 2030 states and 2686 transitions. [2025-03-03 18:30:17,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.8181818181818183) internal successors, (62), 22 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:30:17,914 INFO L276 IsEmpty]: Start isEmpty. Operand 2030 states and 2686 transitions. [2025-03-03 18:30:17,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-03 18:30:17,914 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:30:17,914 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:30:17,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable99 [2025-03-03 18:30:17,914 INFO L396 AbstractCegarLoop]: === Iteration 101 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:30:17,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:30:17,915 INFO L85 PathProgramCache]: Analyzing trace with hash 2144760928, now seen corresponding path program 1 times [2025-03-03 18:30:17,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:30:17,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113664960] [2025-03-03 18:30:17,915 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:30:17,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:30:17,926 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-03 18:30:17,939 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-03 18:30:17,939 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:30:17,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:30:18,279 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:30:18,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:30:18,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113664960] [2025-03-03 18:30:18,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113664960] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:30:18,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:30:18,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2025-03-03 18:30:18,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608092386] [2025-03-03 18:30:18,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:30:18,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-03 18:30:18,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:30:18,280 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-03 18:30:18,280 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2025-03-03 18:30:18,280 INFO L87 Difference]: Start difference. First operand 2030 states and 2686 transitions. Second operand has 18 states, 18 states have (on average 3.5) internal successors, (63), 18 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:30:18,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:30:18,384 INFO L93 Difference]: Finished difference Result 3210 states and 4344 transitions. [2025-03-03 18:30:18,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-03 18:30:18,384 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.5) internal successors, (63), 18 states have internal predecessors, (63), 0 states have call successors, (0), 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 63 [2025-03-03 18:30:18,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:30:18,385 INFO L225 Difference]: With dead ends: 3210 [2025-03-03 18:30:18,385 INFO L226 Difference]: Without dead ends: 2089 [2025-03-03 18:30:18,386 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2025-03-03 18:30:18,386 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 48 mSDsluCounter, 687 mSDsCounter, 0 mSdLazyCounter, 322 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 782 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 18:30:18,386 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 782 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 322 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 18:30:18,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2089 states. [2025-03-03 18:30:18,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2089 to 2030. [2025-03-03 18:30:18,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2030 states, 2029 states have (on average 1.3238048299655003) internal successors, (2686), 2029 states have internal predecessors, (2686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:30:18,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2030 states to 2030 states and 2686 transitions. [2025-03-03 18:30:18,395 INFO L78 Accepts]: Start accepts. Automaton has 2030 states and 2686 transitions. Word has length 63 [2025-03-03 18:30:18,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:30:18,395 INFO L471 AbstractCegarLoop]: Abstraction has 2030 states and 2686 transitions. [2025-03-03 18:30:18,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.5) internal successors, (63), 18 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:30:18,395 INFO L276 IsEmpty]: Start isEmpty. Operand 2030 states and 2686 transitions. [2025-03-03 18:30:18,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-03 18:30:18,396 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:30:18,396 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:30:18,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable100 [2025-03-03 18:30:18,396 INFO L396 AbstractCegarLoop]: === Iteration 102 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:30:18,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:30:18,396 INFO L85 PathProgramCache]: Analyzing trace with hash -1504794631, now seen corresponding path program 1 times [2025-03-03 18:30:18,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:30:18,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622872880] [2025-03-03 18:30:18,397 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:30:18,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:30:18,409 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-03 18:30:18,417 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-03 18:30:18,417 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:30:18,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:30:18,980 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:30:18,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:30:18,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622872880] [2025-03-03 18:30:18,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622872880] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:30:18,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:30:18,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2025-03-03 18:30:18,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143952196] [2025-03-03 18:30:18,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:30:18,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-03 18:30:18,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:30:18,981 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-03 18:30:18,981 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=406, Unknown=0, NotChecked=0, Total=462 [2025-03-03 18:30:18,981 INFO L87 Difference]: Start difference. First operand 2030 states and 2686 transitions. Second operand has 22 states, 22 states have (on average 2.8636363636363638) internal successors, (63), 22 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:30:19,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:30:19,223 INFO L93 Difference]: Finished difference Result 3424 states and 4612 transitions. [2025-03-03 18:30:19,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-03 18:30:19,224 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.8636363636363638) internal successors, (63), 22 states have internal predecessors, (63), 0 states have call successors, (0), 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 63 [2025-03-03 18:30:19,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:30:19,225 INFO L225 Difference]: With dead ends: 3424 [2025-03-03 18:30:19,225 INFO L226 Difference]: Without dead ends: 2305 [2025-03-03 18:30:19,226 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=446, Unknown=0, NotChecked=0, Total=506 [2025-03-03 18:30:19,226 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 60 mSDsluCounter, 937 mSDsCounter, 0 mSdLazyCounter, 671 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 1020 SdHoareTripleChecker+Invalid, 672 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 671 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 18:30:19,226 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 1020 Invalid, 672 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 671 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 18:30:19,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2305 states. [2025-03-03 18:30:19,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2305 to 2038. [2025-03-03 18:30:19,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2038 states, 2037 states have (on average 1.323514972999509) internal successors, (2696), 2037 states have internal predecessors, (2696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:30:19,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2038 states to 2038 states and 2696 transitions. [2025-03-03 18:30:19,248 INFO L78 Accepts]: Start accepts. Automaton has 2038 states and 2696 transitions. Word has length 63 [2025-03-03 18:30:19,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:30:19,248 INFO L471 AbstractCegarLoop]: Abstraction has 2038 states and 2696 transitions. [2025-03-03 18:30:19,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.8636363636363638) internal successors, (63), 22 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:30:19,248 INFO L276 IsEmpty]: Start isEmpty. Operand 2038 states and 2696 transitions. [2025-03-03 18:30:19,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-03 18:30:19,249 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:30:19,249 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:30:19,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable101 [2025-03-03 18:30:19,249 INFO L396 AbstractCegarLoop]: === Iteration 103 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:30:19,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:30:19,250 INFO L85 PathProgramCache]: Analyzing trace with hash -1553293815, now seen corresponding path program 1 times [2025-03-03 18:30:19,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:30:19,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363056217] [2025-03-03 18:30:19,250 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:30:19,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:30:19,262 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-03 18:30:19,273 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-03 18:30:19,274 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:30:19,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:30:19,608 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:30:19,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:30:19,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363056217] [2025-03-03 18:30:19,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363056217] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:30:19,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:30:19,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2025-03-03 18:30:19,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696116067] [2025-03-03 18:30:19,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:30:19,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-03 18:30:19,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:30:19,609 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-03 18:30:19,609 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=296, Unknown=0, NotChecked=0, Total=342 [2025-03-03 18:30:19,609 INFO L87 Difference]: Start difference. First operand 2038 states and 2696 transitions. Second operand has 19 states, 19 states have (on average 3.3157894736842106) internal successors, (63), 19 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:30:19,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:30:19,737 INFO L93 Difference]: Finished difference Result 3217 states and 4354 transitions. [2025-03-03 18:30:19,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-03 18:30:19,738 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.3157894736842106) internal successors, (63), 19 states have internal predecessors, (63), 0 states have call successors, (0), 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 63 [2025-03-03 18:30:19,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:30:19,739 INFO L225 Difference]: With dead ends: 3217 [2025-03-03 18:30:19,739 INFO L226 Difference]: Without dead ends: 2094 [2025-03-03 18:30:19,740 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=296, Unknown=0, NotChecked=0, Total=342 [2025-03-03 18:30:19,740 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 26 mSDsluCounter, 1030 mSDsCounter, 0 mSdLazyCounter, 443 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 1124 SdHoareTripleChecker+Invalid, 443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 443 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 18:30:19,740 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 1124 Invalid, 443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 443 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 18:30:19,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2094 states. [2025-03-03 18:30:19,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2094 to 1986. [2025-03-03 18:30:19,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1986 states, 1985 states have (on average 1.3309823677581865) internal successors, (2642), 1985 states have internal predecessors, (2642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:30:19,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1986 states to 1986 states and 2642 transitions. [2025-03-03 18:30:19,749 INFO L78 Accepts]: Start accepts. Automaton has 1986 states and 2642 transitions. Word has length 63 [2025-03-03 18:30:19,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:30:19,749 INFO L471 AbstractCegarLoop]: Abstraction has 1986 states and 2642 transitions. [2025-03-03 18:30:19,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.3157894736842106) internal successors, (63), 19 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:30:19,749 INFO L276 IsEmpty]: Start isEmpty. Operand 1986 states and 2642 transitions. [2025-03-03 18:30:19,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-03 18:30:19,750 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:30:19,750 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:30:19,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable102 [2025-03-03 18:30:19,750 INFO L396 AbstractCegarLoop]: === Iteration 104 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:30:19,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:30:19,750 INFO L85 PathProgramCache]: Analyzing trace with hash -698317911, now seen corresponding path program 1 times [2025-03-03 18:30:19,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:30:19,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766931753] [2025-03-03 18:30:19,751 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:30:19,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:30:19,762 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-03 18:30:19,768 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-03 18:30:19,768 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:30:19,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat