./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 c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/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-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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-?-c00e63d-m [2025-02-05 20:11:38,424 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 20:11:38,495 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-02-05 20:11:38,499 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 20:11:38,500 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 20:11:38,525 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 20:11:38,526 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 20:11:38,526 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 20:11:38,527 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 20:11:38,527 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 20:11:38,527 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 20:11:38,527 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 20:11:38,527 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 20:11:38,527 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 20:11:38,528 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 20:11:38,528 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 20:11:38,528 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 20:11:38,528 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 20:11:38,528 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 20:11:38,528 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 20:11:38,528 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 20:11:38,529 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 20:11:38,529 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 20:11:38,529 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 20:11:38,529 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 20:11:38,529 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 20:11:38,529 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 20:11:38,529 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 20:11:38,529 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 20:11:38,529 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 20:11:38,530 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 20:11:38,530 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 20:11:38,530 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 20:11:38,530 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 20:11:38,530 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 20:11:38,530 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 20:11:38,530 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 20:11:38,530 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 20:11:38,530 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 20:11:38,531 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 20:11:38,531 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-jdk21/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-02-05 20:11:38,799 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 20:11:38,811 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 20:11:38,815 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 20:11:38,816 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 20:11:38,816 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 20:11:38,818 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_rotate32.c [2025-02-05 20:11:40,205 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/25e81a399/55dbb96623f44382bdc21c857a3b6195/FLAG1e803ce5b [2025-02-05 20:11:40,546 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 20:11:40,546 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_rotate32.c [2025-02-05 20:11:40,559 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/25e81a399/55dbb96623f44382bdc21c857a3b6195/FLAG1e803ce5b [2025-02-05 20:11:40,581 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/25e81a399/55dbb96623f44382bdc21c857a3b6195 [2025-02-05 20:11:40,583 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 20:11:40,585 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 20:11:40,587 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 20:11:40,588 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 20:11:40,591 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 20:11:40,593 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 08:11:40" (1/1) ... [2025-02-05 20:11:40,594 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3000992a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:11:40, skipping insertion in model container [2025-02-05 20:11:40,594 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 08:11:40" (1/1) ... [2025-02-05 20:11:40,617 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 20:11:40,749 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_rotate32.c[1258,1271] [2025-02-05 20:11:40,805 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 20:11:40,815 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 20:11:40,823 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_rotate32.c[1258,1271] [2025-02-05 20:11:40,864 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 20:11:40,880 INFO L204 MainTranslator]: Completed translation [2025-02-05 20:11:40,882 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:11:40 WrapperNode [2025-02-05 20:11:40,882 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 20:11:40,883 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 20:11:40,883 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 20:11:40,883 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 20:11:40,888 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:11:40" (1/1) ... [2025-02-05 20:11:40,895 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:11:40" (1/1) ... [2025-02-05 20:11:40,932 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 318 [2025-02-05 20:11:40,933 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 20:11:40,933 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 20:11:40,934 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 20:11:40,934 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 20:11:40,941 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:11:40" (1/1) ... [2025-02-05 20:11:40,941 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:11:40" (1/1) ... [2025-02-05 20:11:40,946 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:11:40" (1/1) ... [2025-02-05 20:11:40,968 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-02-05 20:11:40,968 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:11:40" (1/1) ... [2025-02-05 20:11:40,968 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:11:40" (1/1) ... [2025-02-05 20:11:40,978 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:11:40" (1/1) ... [2025-02-05 20:11:40,980 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:11:40" (1/1) ... [2025-02-05 20:11:40,983 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:11:40" (1/1) ... [2025-02-05 20:11:40,984 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:11:40" (1/1) ... [2025-02-05 20:11:40,989 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 20:11:40,990 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 20:11:40,990 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 20:11:40,990 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 20:11:40,991 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:11:40" (1/1) ... [2025-02-05 20:11:40,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 20:11:41,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:11:41,021 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 20:11:41,024 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 20:11:41,040 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 20:11:41,041 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 20:11:41,041 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 20:11:41,041 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 20:11:41,132 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 20:11:41,134 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 20:11:41,707 INFO L? ?]: Removed 172 outVars from TransFormulas that were not future-live. [2025-02-05 20:11:41,707 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 20:11:41,751 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 20:11:41,754 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 20:11:41,754 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 08:11:41 BoogieIcfgContainer [2025-02-05 20:11:41,754 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 20:11:41,757 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 20:11:41,757 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 20:11:41,761 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 20:11:41,761 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 08:11:40" (1/3) ... [2025-02-05 20:11:41,762 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26967051 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 08:11:41, skipping insertion in model container [2025-02-05 20:11:41,762 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:11:40" (2/3) ... [2025-02-05 20:11:41,763 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26967051 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 08:11:41, skipping insertion in model container [2025-02-05 20:11:41,763 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 08:11:41" (3/3) ... [2025-02-05 20:11:41,764 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_QF_BV_rotate32.c [2025-02-05 20:11:41,778 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 20:11:41,781 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-02-05 20:11:41,835 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 20:11:41,847 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;@69ff6673, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 20:11:41,847 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 20:11:41,852 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-02-05 20:11:41,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-02-05 20:11:41,857 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:11:41,857 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:11:41,858 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:11:41,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:11:41,864 INFO L85 PathProgramCache]: Analyzing trace with hash -406527163, now seen corresponding path program 1 times [2025-02-05 20:11:41,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:11:41,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75634026] [2025-02-05 20:11:41,872 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:11:41,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:11:41,952 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-05 20:11:42,000 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-05 20:11:42,000 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:11:42,000 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:11:42,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:11:42,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:11:42,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75634026] [2025-02-05 20:11:42,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75634026] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:11:42,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:11:42,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 20:11:42,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506041444] [2025-02-05 20:11:42,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:11:42,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 20:11:42,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:11:42,373 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 20:11:42,373 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 20:11:42,375 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-02-05 20:11:42,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:11:42,485 INFO L93 Difference]: Finished difference Result 169 states and 249 transitions. [2025-02-05 20:11:42,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 20:11:42,488 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-02-05 20:11:42,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:11:42,495 INFO L225 Difference]: With dead ends: 169 [2025-02-05 20:11:42,495 INFO L226 Difference]: Without dead ends: 89 [2025-02-05 20:11:42,499 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-02-05 20:11:42,502 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 0 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-02-05 20:11:42,503 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-02-05 20:11:42,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2025-02-05 20:11:42,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2025-02-05 20:11:42,532 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-02-05 20:11:42,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 129 transitions. [2025-02-05 20:11:42,539 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 129 transitions. Word has length 13 [2025-02-05 20:11:42,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:11:42,539 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 129 transitions. [2025-02-05 20:11:42,540 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-02-05 20:11:42,541 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 129 transitions. [2025-02-05 20:11:42,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-02-05 20:11:42,541 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:11:42,541 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:11:42,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 20:11:42,542 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:11:42,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:11:42,543 INFO L85 PathProgramCache]: Analyzing trace with hash 287239092, now seen corresponding path program 1 times [2025-02-05 20:11:42,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:11:42,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885745134] [2025-02-05 20:11:42,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:11:42,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:11:42,559 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-05 20:11:42,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-05 20:11:42,584 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:11:42,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:11:42,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:11:42,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:11:42,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885745134] [2025-02-05 20:11:42,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885745134] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:11:42,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:11:42,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 20:11:42,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769513908] [2025-02-05 20:11:42,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:11:42,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 20:11:42,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:11:42,709 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 20:11:42,709 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 20:11:42,709 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-02-05 20:11:42,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:11:42,807 INFO L93 Difference]: Finished difference Result 170 states and 247 transitions. [2025-02-05 20:11:42,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 20:11:42,807 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-02-05 20:11:42,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:11:42,808 INFO L225 Difference]: With dead ends: 170 [2025-02-05 20:11:42,808 INFO L226 Difference]: Without dead ends: 91 [2025-02-05 20:11:42,809 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-02-05 20:11:42,809 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 0 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-02-05 20:11:42,809 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-02-05 20:11:42,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-02-05 20:11:42,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2025-02-05 20:11:42,815 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-02-05 20:11:42,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 131 transitions. [2025-02-05 20:11:42,816 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 131 transitions. Word has length 14 [2025-02-05 20:11:42,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:11:42,816 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 131 transitions. [2025-02-05 20:11:42,816 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-02-05 20:11:42,816 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 131 transitions. [2025-02-05 20:11:42,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-02-05 20:11:42,817 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:11:42,817 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:11:42,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 20:11:42,817 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:11:42,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:11:42,818 INFO L85 PathProgramCache]: Analyzing trace with hash -2048980704, now seen corresponding path program 1 times [2025-02-05 20:11:42,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:11:42,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109850159] [2025-02-05 20:11:42,818 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:11:42,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:11:42,832 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-05 20:11:42,863 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-05 20:11:42,866 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:11:42,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:11:43,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:11:43,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:11:43,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109850159] [2025-02-05 20:11:43,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109850159] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:11:43,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:11:43,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 20:11:43,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388292372] [2025-02-05 20:11:43,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:11:43,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 20:11:43,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:11:43,182 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 20:11:43,182 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 20:11:43,183 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-02-05 20:11:43,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:11:43,318 INFO L93 Difference]: Finished difference Result 174 states and 251 transitions. [2025-02-05 20:11:43,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 20:11:43,320 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-02-05 20:11:43,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:11:43,321 INFO L225 Difference]: With dead ends: 174 [2025-02-05 20:11:43,321 INFO L226 Difference]: Without dead ends: 93 [2025-02-05 20:11:43,322 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-02-05 20:11:43,322 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-02-05 20:11:43,323 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-02-05 20:11:43,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2025-02-05 20:11:43,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2025-02-05 20:11:43,335 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-02-05 20:11:43,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 133 transitions. [2025-02-05 20:11:43,338 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 133 transitions. Word has length 15 [2025-02-05 20:11:43,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:11:43,338 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 133 transitions. [2025-02-05 20:11:43,338 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-02-05 20:11:43,339 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 133 transitions. [2025-02-05 20:11:43,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-02-05 20:11:43,340 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:11:43,341 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-02-05 20:11:43,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 20:11:43,341 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:11:43,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:11:43,342 INFO L85 PathProgramCache]: Analyzing trace with hash 1460913900, now seen corresponding path program 1 times [2025-02-05 20:11:43,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:11:43,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103416290] [2025-02-05 20:11:43,342 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:11:43,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:11:43,376 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-02-05 20:11:43,480 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-02-05 20:11:43,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:11:43,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:11:44,087 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:11:44,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:11:44,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103416290] [2025-02-05 20:11:44,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103416290] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 20:11:44,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1745394650] [2025-02-05 20:11:44,088 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:11:44,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:11:44,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:11:44,091 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 20:11:44,093 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 20:11:44,194 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-02-05 20:11:44,267 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-02-05 20:11:44,268 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:11:44,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:11:44,276 INFO L256 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 56 conjuncts are in the unsatisfiable core [2025-02-05 20:11:44,287 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 20:11:44,832 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-05 20:11:44,833 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 20:11:46,189 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:11:46,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1745394650] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 20:11:46,191 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 20:11:46,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 10] total 20 [2025-02-05 20:11:46,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805769050] [2025-02-05 20:11:46,192 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 20:11:46,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-02-05 20:11:46,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:11:46,193 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-02-05 20:11:46,194 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=293, Unknown=0, NotChecked=0, Total=380 [2025-02-05 20:11:46,194 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-02-05 20:11:46,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:11:46,513 INFO L93 Difference]: Finished difference Result 177 states and 254 transitions. [2025-02-05 20:11:46,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 20:11:46,515 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-02-05 20:11:46,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:11:46,517 INFO L225 Difference]: With dead ends: 177 [2025-02-05 20:11:46,517 INFO L226 Difference]: Without dead ends: 96 [2025-02-05 20:11:46,518 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=97, Invalid=323, Unknown=0, NotChecked=0, Total=420 [2025-02-05 20:11:46,519 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.3s IncrementalHoareTripleChecker+Time [2025-02-05 20:11:46,519 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.3s Time] [2025-02-05 20:11:46,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-02-05 20:11:46,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 94. [2025-02-05 20:11:46,531 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-02-05 20:11:46,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 134 transitions. [2025-02-05 20:11:46,532 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 134 transitions. Word has length 54 [2025-02-05 20:11:46,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:11:46,532 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 134 transitions. [2025-02-05 20:11:46,532 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-02-05 20:11:46,532 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 134 transitions. [2025-02-05 20:11:46,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-02-05 20:11:46,536 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:11:46,537 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-02-05 20:11:46,547 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-05 20:11:46,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:11:46,741 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:11:46,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:11:46,741 INFO L85 PathProgramCache]: Analyzing trace with hash 2039846026, now seen corresponding path program 1 times [2025-02-05 20:11:46,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:11:46,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875113819] [2025-02-05 20:11:46,742 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:11:46,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:11:46,763 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-02-05 20:11:46,821 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-02-05 20:11:46,821 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:11:46,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:11:48,152 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:11:48,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:11:48,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875113819] [2025-02-05 20:11:48,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875113819] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:11:48,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:11:48,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2025-02-05 20:11:48,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457924791] [2025-02-05 20:11:48,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:11:48,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-02-05 20:11:48,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:11:48,155 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-02-05 20:11:48,156 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2025-02-05 20:11:48,156 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-02-05 20:11:48,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:11:48,671 INFO L93 Difference]: Finished difference Result 333 states and 481 transitions. [2025-02-05 20:11:48,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-02-05 20:11:48,671 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-02-05 20:11:48,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:11:48,674 INFO L225 Difference]: With dead ends: 333 [2025-02-05 20:11:48,676 INFO L226 Difference]: Without dead ends: 249 [2025-02-05 20:11:48,676 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2025-02-05 20:11:48,677 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 205 mSDsluCounter, 1036 mSDsCounter, 0 mSdLazyCounter, 736 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.5s IncrementalHoareTripleChecker+Time [2025-02-05 20:11:48,677 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.5s Time] [2025-02-05 20:11:48,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2025-02-05 20:11:48,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 153. [2025-02-05 20:11:48,691 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-02-05 20:11:48,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 219 transitions. [2025-02-05 20:11:48,692 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 219 transitions. Word has length 55 [2025-02-05 20:11:48,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:11:48,692 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 219 transitions. [2025-02-05 20:11:48,692 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-02-05 20:11:48,692 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 219 transitions. [2025-02-05 20:11:48,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-02-05 20:11:48,695 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:11:48,695 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-02-05 20:11:48,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 20:11:48,695 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:11:48,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:11:48,697 INFO L85 PathProgramCache]: Analyzing trace with hash -2101074409, now seen corresponding path program 1 times [2025-02-05 20:11:48,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:11:48,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143568776] [2025-02-05 20:11:48,697 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:11:48,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:11:48,720 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-02-05 20:11:48,763 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-02-05 20:11:48,763 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:11:48,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:11:50,109 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:11:50,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:11:50,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143568776] [2025-02-05 20:11:50,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143568776] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:11:50,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:11:50,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2025-02-05 20:11:50,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921383878] [2025-02-05 20:11:50,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:11:50,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-02-05 20:11:50,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:11:50,111 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-02-05 20:11:50,111 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2025-02-05 20:11:50,111 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-02-05 20:11:50,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:11:50,626 INFO L93 Difference]: Finished difference Result 363 states and 525 transitions. [2025-02-05 20:11:50,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-02-05 20:11:50,626 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-02-05 20:11:50,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:11:50,628 INFO L225 Difference]: With dead ends: 363 [2025-02-05 20:11:50,628 INFO L226 Difference]: Without dead ends: 279 [2025-02-05 20:11:50,628 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=60, Invalid=320, Unknown=0, NotChecked=0, Total=380 [2025-02-05 20:11:50,629 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 205 mSDsluCounter, 1092 mSDsCounter, 0 mSdLazyCounter, 711 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.5s IncrementalHoareTripleChecker+Time [2025-02-05 20:11:50,629 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.5s Time] [2025-02-05 20:11:50,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2025-02-05 20:11:50,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 201. [2025-02-05 20:11:50,649 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-02-05 20:11:50,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 291 transitions. [2025-02-05 20:11:50,650 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 291 transitions. Word has length 56 [2025-02-05 20:11:50,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:11:50,650 INFO L471 AbstractCegarLoop]: Abstraction has 201 states and 291 transitions. [2025-02-05 20:11:50,650 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-02-05 20:11:50,650 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 291 transitions. [2025-02-05 20:11:50,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-02-05 20:11:50,655 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:11:50,656 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-02-05 20:11:50,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 20:11:50,656 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:11:50,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:11:50,656 INFO L85 PathProgramCache]: Analyzing trace with hash -282770291, now seen corresponding path program 1 times [2025-02-05 20:11:50,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:11:50,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675788781] [2025-02-05 20:11:50,657 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:11:50,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:11:50,674 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-02-05 20:11:50,707 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-02-05 20:11:50,707 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:11:50,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:11:51,742 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:11:51,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:11:51,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675788781] [2025-02-05 20:11:51,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675788781] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:11:51,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:11:51,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2025-02-05 20:11:51,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081833629] [2025-02-05 20:11:51,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:11:51,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-02-05 20:11:51,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:11:51,744 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-02-05 20:11:51,744 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=320, Unknown=0, NotChecked=0, Total=380 [2025-02-05 20:11:51,744 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-02-05 20:11:52,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:11:52,183 INFO L93 Difference]: Finished difference Result 453 states and 660 transitions. [2025-02-05 20:11:52,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-02-05 20:11:52,183 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-02-05 20:11:52,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:11:52,185 INFO L225 Difference]: With dead ends: 453 [2025-02-05 20:11:52,185 INFO L226 Difference]: Without dead ends: 349 [2025-02-05 20:11:52,186 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-02-05 20:11:52,186 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.4s IncrementalHoareTripleChecker+Time [2025-02-05 20:11:52,189 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.4s Time] [2025-02-05 20:11:52,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2025-02-05 20:11:52,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 231. [2025-02-05 20:11:52,204 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-02-05 20:11:52,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 335 transitions. [2025-02-05 20:11:52,205 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 335 transitions. Word has length 56 [2025-02-05 20:11:52,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:11:52,205 INFO L471 AbstractCegarLoop]: Abstraction has 231 states and 335 transitions. [2025-02-05 20:11:52,205 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-02-05 20:11:52,205 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 335 transitions. [2025-02-05 20:11:52,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-02-05 20:11:52,207 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:11:52,207 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-02-05 20:11:52,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 20:11:52,207 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:11:52,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:11:52,211 INFO L85 PathProgramCache]: Analyzing trace with hash -706024188, now seen corresponding path program 1 times [2025-02-05 20:11:52,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:11:52,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112653575] [2025-02-05 20:11:52,212 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:11:52,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:11:52,228 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-02-05 20:11:52,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-02-05 20:11:52,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:11:52,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:11:53,278 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:11:53,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:11:53,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112653575] [2025-02-05 20:11:53,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112653575] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:11:53,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:11:53,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2025-02-05 20:11:53,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422062884] [2025-02-05 20:11:53,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:11:53,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-02-05 20:11:53,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:11:53,281 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-02-05 20:11:53,282 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2025-02-05 20:11:53,282 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-02-05 20:11:53,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:11:53,614 INFO L93 Difference]: Finished difference Result 421 states and 611 transitions. [2025-02-05 20:11:53,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-02-05 20:11:53,615 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-02-05 20:11:53,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:11:53,617 INFO L225 Difference]: With dead ends: 421 [2025-02-05 20:11:53,617 INFO L226 Difference]: Without dead ends: 336 [2025-02-05 20:11:53,617 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-02-05 20:11:53,618 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 220 mSDsluCounter, 1017 mSDsCounter, 0 mSdLazyCounter, 530 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.3s IncrementalHoareTripleChecker+Time [2025-02-05 20:11:53,618 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.3s Time] [2025-02-05 20:11:53,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2025-02-05 20:11:53,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 249. [2025-02-05 20:11:53,624 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-02-05 20:11:53,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 361 transitions. [2025-02-05 20:11:53,625 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 361 transitions. Word has length 56 [2025-02-05 20:11:53,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:11:53,625 INFO L471 AbstractCegarLoop]: Abstraction has 249 states and 361 transitions. [2025-02-05 20:11:53,625 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-02-05 20:11:53,625 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 361 transitions. [2025-02-05 20:11:53,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-02-05 20:11:53,627 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:11:53,627 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-02-05 20:11:53,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 20:11:53,627 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:11:53,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:11:53,627 INFO L85 PathProgramCache]: Analyzing trace with hash 731123203, now seen corresponding path program 1 times [2025-02-05 20:11:53,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:11:53,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467744034] [2025-02-05 20:11:53,628 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:11:53,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:11:53,644 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-02-05 20:11:53,669 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-02-05 20:11:53,669 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:11:53,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:11:54,661 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:11:54,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:11:54,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467744034] [2025-02-05 20:11:54,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467744034] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:11:54,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:11:54,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2025-02-05 20:11:54,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60414880] [2025-02-05 20:11:54,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:11:54,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-02-05 20:11:54,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:11:54,663 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-02-05 20:11:54,664 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2025-02-05 20:11:54,664 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-02-05 20:11:55,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:11:55,133 INFO L93 Difference]: Finished difference Result 537 states and 782 transitions. [2025-02-05 20:11:55,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-02-05 20:11:55,133 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-02-05 20:11:55,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:11:55,135 INFO L225 Difference]: With dead ends: 537 [2025-02-05 20:11:55,137 INFO L226 Difference]: Without dead ends: 415 [2025-02-05 20:11:55,138 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2025-02-05 20:11:55,138 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 232 mSDsluCounter, 891 mSDsCounter, 0 mSdLazyCounter, 736 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.4s IncrementalHoareTripleChecker+Time [2025-02-05 20:11:55,138 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.4s Time] [2025-02-05 20:11:55,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2025-02-05 20:11:55,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 275. [2025-02-05 20:11:55,149 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-02-05 20:11:55,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 399 transitions. [2025-02-05 20:11:55,150 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 399 transitions. Word has length 56 [2025-02-05 20:11:55,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:11:55,150 INFO L471 AbstractCegarLoop]: Abstraction has 275 states and 399 transitions. [2025-02-05 20:11:55,150 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-02-05 20:11:55,151 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 399 transitions. [2025-02-05 20:11:55,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-02-05 20:11:55,152 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:11:55,152 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-02-05 20:11:55,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 20:11:55,152 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:11:55,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:11:55,153 INFO L85 PathProgramCache]: Analyzing trace with hash -1609393176, now seen corresponding path program 1 times [2025-02-05 20:11:55,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:11:55,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526189527] [2025-02-05 20:11:55,154 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:11:55,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:11:55,171 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-02-05 20:11:55,189 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-02-05 20:11:55,190 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:11:55,190 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:11:56,050 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:11:56,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:11:56,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526189527] [2025-02-05 20:11:56,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526189527] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:11:56,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:11:56,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2025-02-05 20:11:56,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666515395] [2025-02-05 20:11:56,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:11:56,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-02-05 20:11:56,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:11:56,052 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-02-05 20:11:56,052 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=489, Unknown=0, NotChecked=0, Total=552 [2025-02-05 20:11:56,053 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-02-05 20:11:56,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:11:56,472 INFO L93 Difference]: Finished difference Result 629 states and 918 transitions. [2025-02-05 20:11:56,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-02-05 20:11:56,473 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-02-05 20:11:56,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:11:56,475 INFO L225 Difference]: With dead ends: 629 [2025-02-05 20:11:56,475 INFO L226 Difference]: Without dead ends: 473 [2025-02-05 20:11:56,476 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-02-05 20:11:56,477 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.4s IncrementalHoareTripleChecker+Time [2025-02-05 20:11:56,477 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.4s Time] [2025-02-05 20:11:56,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2025-02-05 20:11:56,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 346. [2025-02-05 20:11:56,485 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-02-05 20:11:56,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 501 transitions. [2025-02-05 20:11:56,486 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 501 transitions. Word has length 56 [2025-02-05 20:11:56,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:11:56,486 INFO L471 AbstractCegarLoop]: Abstraction has 346 states and 501 transitions. [2025-02-05 20:11:56,487 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-02-05 20:11:56,487 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 501 transitions. [2025-02-05 20:11:56,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-02-05 20:11:56,488 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:11:56,488 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-02-05 20:11:56,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 20:11:56,488 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:11:56,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:11:56,488 INFO L85 PathProgramCache]: Analyzing trace with hash 197715104, now seen corresponding path program 1 times [2025-02-05 20:11:56,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:11:56,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619415463] [2025-02-05 20:11:56,489 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:11:56,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:11:56,505 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-02-05 20:11:56,531 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-02-05 20:11:56,531 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:11:56,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:11:57,403 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:11:57,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:11:57,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619415463] [2025-02-05 20:11:57,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619415463] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:11:57,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:11:57,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-02-05 20:11:57,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944522807] [2025-02-05 20:11:57,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:11:57,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-05 20:11:57,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:11:57,405 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-05 20:11:57,406 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2025-02-05 20:11:57,406 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-02-05 20:11:58,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:11:58,108 INFO L93 Difference]: Finished difference Result 657 states and 952 transitions. [2025-02-05 20:11:58,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-05 20:11:58,109 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-02-05 20:11:58,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:11:58,115 INFO L225 Difference]: With dead ends: 657 [2025-02-05 20:11:58,115 INFO L226 Difference]: Without dead ends: 573 [2025-02-05 20:11:58,115 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-02-05 20:11:58,117 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 415 mSDsluCounter, 1003 mSDsCounter, 0 mSdLazyCounter, 958 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.6s IncrementalHoareTripleChecker+Time [2025-02-05 20:11:58,117 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.6s Time] [2025-02-05 20:11:58,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2025-02-05 20:11:58,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 406. [2025-02-05 20:11:58,136 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-02-05 20:11:58,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 590 transitions. [2025-02-05 20:11:58,138 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 590 transitions. Word has length 57 [2025-02-05 20:11:58,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:11:58,139 INFO L471 AbstractCegarLoop]: Abstraction has 406 states and 590 transitions. [2025-02-05 20:11:58,139 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-02-05 20:11:58,139 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 590 transitions. [2025-02-05 20:11:58,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-02-05 20:11:58,140 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:11:58,140 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-02-05 20:11:58,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 20:11:58,140 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:11:58,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:11:58,141 INFO L85 PathProgramCache]: Analyzing trace with hash 801579620, now seen corresponding path program 1 times [2025-02-05 20:11:58,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:11:58,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427701017] [2025-02-05 20:11:58,141 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:11:58,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:11:58,156 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-02-05 20:11:58,171 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-02-05 20:11:58,171 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:11:58,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:11:58,816 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:11:58,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:11:58,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427701017] [2025-02-05 20:11:58,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427701017] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:11:58,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:11:58,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2025-02-05 20:11:58,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005447588] [2025-02-05 20:11:58,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:11:58,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-02-05 20:11:58,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:11:58,818 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-02-05 20:11:58,818 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2025-02-05 20:11:58,819 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-02-05 20:11:59,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:11:59,107 INFO L93 Difference]: Finished difference Result 817 states and 1193 transitions. [2025-02-05 20:11:59,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-02-05 20:11:59,107 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-02-05 20:11:59,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:11:59,110 INFO L225 Difference]: With dead ends: 817 [2025-02-05 20:11:59,111 INFO L226 Difference]: Without dead ends: 647 [2025-02-05 20:11:59,111 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2025-02-05 20:11:59,112 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.3s IncrementalHoareTripleChecker+Time [2025-02-05 20:11:59,112 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.3s Time] [2025-02-05 20:11:59,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 647 states. [2025-02-05 20:11:59,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 647 to 526. [2025-02-05 20:11:59,134 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-02-05 20:11:59,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 765 transitions. [2025-02-05 20:11:59,137 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 765 transitions. Word has length 57 [2025-02-05 20:11:59,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:11:59,137 INFO L471 AbstractCegarLoop]: Abstraction has 526 states and 765 transitions. [2025-02-05 20:11:59,137 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-02-05 20:11:59,137 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 765 transitions. [2025-02-05 20:11:59,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-02-05 20:11:59,138 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:11:59,139 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-02-05 20:11:59,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 20:11:59,139 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:11:59,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:11:59,139 INFO L85 PathProgramCache]: Analyzing trace with hash -225538793, now seen corresponding path program 1 times [2025-02-05 20:11:59,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:11:59,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287515415] [2025-02-05 20:11:59,143 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:11:59,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:11:59,159 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-02-05 20:11:59,196 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-02-05 20:11:59,196 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:11:59,196 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:12:00,015 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:12:00,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:12:00,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287515415] [2025-02-05 20:12:00,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287515415] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:12:00,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:12:00,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2025-02-05 20:12:00,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187509927] [2025-02-05 20:12:00,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:12:00,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-02-05 20:12:00,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:12:00,018 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-02-05 20:12:00,018 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=320, Unknown=0, NotChecked=0, Total=380 [2025-02-05 20:12:00,019 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-02-05 20:12:00,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:12:00,458 INFO L93 Difference]: Finished difference Result 825 states and 1194 transitions. [2025-02-05 20:12:00,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-02-05 20:12:00,458 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-02-05 20:12:00,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:12:00,461 INFO L225 Difference]: With dead ends: 825 [2025-02-05 20:12:00,461 INFO L226 Difference]: Without dead ends: 689 [2025-02-05 20:12:00,462 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=320, Unknown=0, NotChecked=0, Total=380 [2025-02-05 20:12:00,462 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 177 mSDsluCounter, 1433 mSDsCounter, 0 mSdLazyCounter, 755 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.4s IncrementalHoareTripleChecker+Time [2025-02-05 20:12:00,463 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.4s Time] [2025-02-05 20:12:00,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 689 states. [2025-02-05 20:12:00,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 689 to 547. [2025-02-05 20:12:00,476 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-02-05 20:12:00,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 795 transitions. [2025-02-05 20:12:00,479 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 795 transitions. Word has length 57 [2025-02-05 20:12:00,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:12:00,479 INFO L471 AbstractCegarLoop]: Abstraction has 547 states and 795 transitions. [2025-02-05 20:12:00,480 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-02-05 20:12:00,480 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 795 transitions. [2025-02-05 20:12:00,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-02-05 20:12:00,481 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:12:00,481 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-02-05 20:12:00,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 20:12:00,482 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:12:00,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:12:00,482 INFO L85 PathProgramCache]: Analyzing trace with hash 1211608598, now seen corresponding path program 1 times [2025-02-05 20:12:00,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:12:00,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794824739] [2025-02-05 20:12:00,484 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:12:00,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:12:00,501 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-02-05 20:12:00,523 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-02-05 20:12:00,523 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:12:00,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:12:01,565 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:12:01,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:12:01,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794824739] [2025-02-05 20:12:01,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794824739] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:12:01,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:12:01,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2025-02-05 20:12:01,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399393221] [2025-02-05 20:12:01,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:12:01,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-02-05 20:12:01,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:12:01,570 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-02-05 20:12:01,570 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2025-02-05 20:12:01,570 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-02-05 20:12:01,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:12:01,994 INFO L93 Difference]: Finished difference Result 894 states and 1297 transitions. [2025-02-05 20:12:01,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-02-05 20:12:01,994 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-02-05 20:12:01,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:12:01,997 INFO L225 Difference]: With dead ends: 894 [2025-02-05 20:12:01,997 INFO L226 Difference]: Without dead ends: 761 [2025-02-05 20:12:01,998 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=354, Unknown=0, NotChecked=0, Total=420 [2025-02-05 20:12:01,999 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.4s IncrementalHoareTripleChecker+Time [2025-02-05 20:12:01,999 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.4s Time] [2025-02-05 20:12:02,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 761 states. [2025-02-05 20:12:02,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 761 to 573. [2025-02-05 20:12:02,009 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-02-05 20:12:02,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 573 states and 834 transitions. [2025-02-05 20:12:02,011 INFO L78 Accepts]: Start accepts. Automaton has 573 states and 834 transitions. Word has length 57 [2025-02-05 20:12:02,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:12:02,012 INFO L471 AbstractCegarLoop]: Abstraction has 573 states and 834 transitions. [2025-02-05 20:12:02,012 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-02-05 20:12:02,012 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 834 transitions. [2025-02-05 20:12:02,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-02-05 20:12:02,013 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:12:02,013 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-02-05 20:12:02,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 20:12:02,013 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:12:02,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:12:02,014 INFO L85 PathProgramCache]: Analyzing trace with hash -1128907781, now seen corresponding path program 1 times [2025-02-05 20:12:02,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:12:02,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704254209] [2025-02-05 20:12:02,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:12:02,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:12:02,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-02-05 20:12:02,045 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-02-05 20:12:02,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:12:02,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:12:03,045 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:12:03,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:12:03,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704254209] [2025-02-05 20:12:03,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704254209] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:12:03,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:12:03,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2025-02-05 20:12:03,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532971306] [2025-02-05 20:12:03,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:12:03,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-02-05 20:12:03,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:12:03,047 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-02-05 20:12:03,047 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=362, Unknown=0, NotChecked=0, Total=420 [2025-02-05 20:12:03,047 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-02-05 20:12:03,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:12:03,530 INFO L93 Difference]: Finished difference Result 1045 states and 1518 transitions. [2025-02-05 20:12:03,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-02-05 20:12:03,530 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-02-05 20:12:03,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:12:03,533 INFO L225 Difference]: With dead ends: 1045 [2025-02-05 20:12:03,533 INFO L226 Difference]: Without dead ends: 861 [2025-02-05 20:12:03,534 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=62, Invalid=400, Unknown=0, NotChecked=0, Total=462 [2025-02-05 20:12:03,535 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 173 mSDsluCounter, 1011 mSDsCounter, 0 mSdLazyCounter, 812 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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-02-05 20:12:03,535 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-02-05 20:12:03,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 861 states. [2025-02-05 20:12:03,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 861 to 620. [2025-02-05 20:12:03,547 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-02-05 20:12:03,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 903 transitions. [2025-02-05 20:12:03,549 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 903 transitions. Word has length 57 [2025-02-05 20:12:03,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:12:03,549 INFO L471 AbstractCegarLoop]: Abstraction has 620 states and 903 transitions. [2025-02-05 20:12:03,549 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-02-05 20:12:03,549 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 903 transitions. [2025-02-05 20:12:03,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-02-05 20:12:03,550 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:12:03,550 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-02-05 20:12:03,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 20:12:03,551 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:12:03,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:12:03,551 INFO L85 PathProgramCache]: Analyzing trace with hash -522979323, now seen corresponding path program 1 times [2025-02-05 20:12:03,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:12:03,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685995336] [2025-02-05 20:12:03,551 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:12:03,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:12:03,570 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-02-05 20:12:03,587 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-02-05 20:12:03,587 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:12:03,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:12:04,550 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:12:04,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:12:04,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685995336] [2025-02-05 20:12:04,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685995336] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:12:04,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:12:04,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2025-02-05 20:12:04,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012795514] [2025-02-05 20:12:04,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:12:04,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-02-05 20:12:04,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:12:04,553 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-02-05 20:12:04,553 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=327, Unknown=0, NotChecked=0, Total=380 [2025-02-05 20:12:04,553 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-02-05 20:12:04,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:12:04,945 INFO L93 Difference]: Finished difference Result 984 states and 1429 transitions. [2025-02-05 20:12:04,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-02-05 20:12:04,946 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-02-05 20:12:04,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:12:04,950 INFO L225 Difference]: With dead ends: 984 [2025-02-05 20:12:04,951 INFO L226 Difference]: Without dead ends: 831 [2025-02-05 20:12:04,952 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2025-02-05 20:12:04,953 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 143 mSDsluCounter, 1157 mSDsCounter, 0 mSdLazyCounter, 816 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.4s IncrementalHoareTripleChecker+Time [2025-02-05 20:12:04,953 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.4s Time] [2025-02-05 20:12:04,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 831 states. [2025-02-05 20:12:04,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 831 to 689. [2025-02-05 20:12:04,967 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-02-05 20:12:04,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 689 states to 689 states and 1005 transitions. [2025-02-05 20:12:04,969 INFO L78 Accepts]: Start accepts. Automaton has 689 states and 1005 transitions. Word has length 57 [2025-02-05 20:12:04,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:12:04,970 INFO L471 AbstractCegarLoop]: Abstraction has 689 states and 1005 transitions. [2025-02-05 20:12:04,970 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-02-05 20:12:04,970 INFO L276 IsEmpty]: Start isEmpty. Operand 689 states and 1005 transitions. [2025-02-05 20:12:04,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-02-05 20:12:04,971 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:12:04,971 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-02-05 20:12:04,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 20:12:04,972 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:12:04,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:12:04,972 INFO L85 PathProgramCache]: Analyzing trace with hash 662714919, now seen corresponding path program 1 times [2025-02-05 20:12:04,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:12:04,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782586849] [2025-02-05 20:12:04,972 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:12:04,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:12:04,988 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-02-05 20:12:05,010 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-02-05 20:12:05,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:12:05,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:12:05,335 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:12:05,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:12:05,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782586849] [2025-02-05 20:12:05,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782586849] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:12:05,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:12:05,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-05 20:12:05,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650945302] [2025-02-05 20:12:05,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:12:05,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 20:12:05,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:12:05,337 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 20:12:05,337 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-02-05 20:12:05,337 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-02-05 20:12:05,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:12:05,490 INFO L93 Difference]: Finished difference Result 1048 states and 1527 transitions. [2025-02-05 20:12:05,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-05 20:12:05,490 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-02-05 20:12:05,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:12:05,494 INFO L225 Difference]: With dead ends: 1048 [2025-02-05 20:12:05,494 INFO L226 Difference]: Without dead ends: 820 [2025-02-05 20:12:05,496 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-02-05 20:12:05,496 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-02-05 20:12:05,497 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-02-05 20:12:05,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 820 states. [2025-02-05 20:12:05,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 820 to 751. [2025-02-05 20:12:05,510 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-02-05 20:12:05,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 751 states to 751 states and 1091 transitions. [2025-02-05 20:12:05,511 INFO L78 Accepts]: Start accepts. Automaton has 751 states and 1091 transitions. Word has length 57 [2025-02-05 20:12:05,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:12:05,512 INFO L471 AbstractCegarLoop]: Abstraction has 751 states and 1091 transitions. [2025-02-05 20:12:05,512 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-02-05 20:12:05,512 INFO L276 IsEmpty]: Start isEmpty. Operand 751 states and 1091 transitions. [2025-02-05 20:12:05,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-02-05 20:12:05,514 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:12:05,514 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-02-05 20:12:05,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 20:12:05,514 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:12:05,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:12:05,515 INFO L85 PathProgramCache]: Analyzing trace with hash -689980222, now seen corresponding path program 1 times [2025-02-05 20:12:05,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:12:05,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679818338] [2025-02-05 20:12:05,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:12:05,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:12:05,529 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-02-05 20:12:05,545 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-02-05 20:12:05,545 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:12:05,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:12:05,848 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:12:05,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:12:05,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679818338] [2025-02-05 20:12:05,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679818338] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:12:05,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:12:05,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-05 20:12:05,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47859675] [2025-02-05 20:12:05,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:12:05,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-05 20:12:05,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:12:05,854 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-05 20:12:05,854 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-02-05 20:12:05,854 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-02-05 20:12:06,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:12:06,014 INFO L93 Difference]: Finished difference Result 1030 states and 1493 transitions. [2025-02-05 20:12:06,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-05 20:12:06,014 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-02-05 20:12:06,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:12:06,017 INFO L225 Difference]: With dead ends: 1030 [2025-02-05 20:12:06,017 INFO L226 Difference]: Without dead ends: 811 [2025-02-05 20:12:06,019 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-02-05 20:12:06,019 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-02-05 20:12:06,020 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-02-05 20:12:06,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 811 states. [2025-02-05 20:12:06,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 811 to 739. [2025-02-05 20:12:06,031 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-02-05 20:12:06,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 739 states to 739 states and 1062 transitions. [2025-02-05 20:12:06,033 INFO L78 Accepts]: Start accepts. Automaton has 739 states and 1062 transitions. Word has length 57 [2025-02-05 20:12:06,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:12:06,033 INFO L471 AbstractCegarLoop]: Abstraction has 739 states and 1062 transitions. [2025-02-05 20:12:06,033 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-02-05 20:12:06,033 INFO L276 IsEmpty]: Start isEmpty. Operand 739 states and 1062 transitions. [2025-02-05 20:12:06,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-02-05 20:12:06,035 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:12:06,035 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-02-05 20:12:06,035 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-05 20:12:06,035 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:12:06,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:12:06,036 INFO L85 PathProgramCache]: Analyzing trace with hash -1385252832, now seen corresponding path program 1 times [2025-02-05 20:12:06,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:12:06,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912300458] [2025-02-05 20:12:06,036 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:12:06,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:12:06,065 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-02-05 20:12:06,074 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-02-05 20:12:06,074 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:12:06,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:12:06,176 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:12:06,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:12:06,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912300458] [2025-02-05 20:12:06,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912300458] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:12:06,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:12:06,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 20:12:06,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216241060] [2025-02-05 20:12:06,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:12:06,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 20:12:06,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:12:06,178 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 20:12:06,178 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 20:12:06,178 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-02-05 20:12:06,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:12:06,264 INFO L93 Difference]: Finished difference Result 1039 states and 1491 transitions. [2025-02-05 20:12:06,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 20:12:06,264 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-02-05 20:12:06,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:12:06,267 INFO L225 Difference]: With dead ends: 1039 [2025-02-05 20:12:06,267 INFO L226 Difference]: Without dead ends: 746 [2025-02-05 20:12:06,268 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-02-05 20:12:06,269 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 39 mSDsluCounter, 392 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-02-05 20:12:06,269 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-02-05 20:12:06,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 746 states. [2025-02-05 20:12:06,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 746 to 744. [2025-02-05 20:12:06,281 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-02-05 20:12:06,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 744 states to 744 states and 1051 transitions. [2025-02-05 20:12:06,282 INFO L78 Accepts]: Start accepts. Automaton has 744 states and 1051 transitions. Word has length 57 [2025-02-05 20:12:06,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:12:06,282 INFO L471 AbstractCegarLoop]: Abstraction has 744 states and 1051 transitions. [2025-02-05 20:12:06,283 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-02-05 20:12:06,283 INFO L276 IsEmpty]: Start isEmpty. Operand 744 states and 1051 transitions. [2025-02-05 20:12:06,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-02-05 20:12:06,284 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:12:06,284 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-02-05 20:12:06,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-05 20:12:06,284 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:12:06,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:12:06,285 INFO L85 PathProgramCache]: Analyzing trace with hash 1195507845, now seen corresponding path program 1 times [2025-02-05 20:12:06,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:12:06,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354885843] [2025-02-05 20:12:06,285 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:12:06,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:12:06,301 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-02-05 20:12:06,324 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-02-05 20:12:06,324 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:12:06,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:12:06,457 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:12:06,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:12:06,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354885843] [2025-02-05 20:12:06,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354885843] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:12:06,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:12:06,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 20:12:06,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933851017] [2025-02-05 20:12:06,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:12:06,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 20:12:06,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:12:06,458 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 20:12:06,458 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 20:12:06,459 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-02-05 20:12:06,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:12:06,554 INFO L93 Difference]: Finished difference Result 972 states and 1374 transitions. [2025-02-05 20:12:06,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 20:12:06,555 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-02-05 20:12:06,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:12:06,557 INFO L225 Difference]: With dead ends: 972 [2025-02-05 20:12:06,557 INFO L226 Difference]: Without dead ends: 666 [2025-02-05 20:12:06,558 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-02-05 20:12:06,559 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 31 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-02-05 20:12:06,559 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-02-05 20:12:06,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2025-02-05 20:12:06,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 664. [2025-02-05 20:12:06,572 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-02-05 20:12:06,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 664 states to 664 states and 923 transitions. [2025-02-05 20:12:06,574 INFO L78 Accepts]: Start accepts. Automaton has 664 states and 923 transitions. Word has length 57 [2025-02-05 20:12:06,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:12:06,574 INFO L471 AbstractCegarLoop]: Abstraction has 664 states and 923 transitions. [2025-02-05 20:12:06,574 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-02-05 20:12:06,574 INFO L276 IsEmpty]: Start isEmpty. Operand 664 states and 923 transitions. [2025-02-05 20:12:06,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-02-05 20:12:06,576 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:12:06,576 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-02-05 20:12:06,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-05 20:12:06,576 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:12:06,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:12:06,577 INFO L85 PathProgramCache]: Analyzing trace with hash 643680566, now seen corresponding path program 1 times [2025-02-05 20:12:06,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:12:06,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613366065] [2025-02-05 20:12:06,578 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:12:06,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:12:06,595 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-02-05 20:12:06,610 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-02-05 20:12:06,610 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:12:06,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:12:06,853 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:12:06,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:12:06,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613366065] [2025-02-05 20:12:06,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613366065] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:12:06,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:12:06,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 20:12:06,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285540342] [2025-02-05 20:12:06,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:12:06,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 20:12:06,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:12:06,856 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 20:12:06,856 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-05 20:12:06,856 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-02-05 20:12:06,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:12:06,945 INFO L93 Difference]: Finished difference Result 954 states and 1323 transitions. [2025-02-05 20:12:06,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 20:12:06,945 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-02-05 20:12:06,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:12:06,947 INFO L225 Difference]: With dead ends: 954 [2025-02-05 20:12:06,948 INFO L226 Difference]: Without dead ends: 678 [2025-02-05 20:12:06,948 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-02-05 20:12:06,949 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 31 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-02-05 20:12:06,949 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-02-05 20:12:06,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 678 states. [2025-02-05 20:12:06,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 678 to 676. [2025-02-05 20:12:06,959 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-02-05 20:12:06,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 676 states to 676 states and 915 transitions. [2025-02-05 20:12:06,961 INFO L78 Accepts]: Start accepts. Automaton has 676 states and 915 transitions. Word has length 57 [2025-02-05 20:12:06,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:12:06,961 INFO L471 AbstractCegarLoop]: Abstraction has 676 states and 915 transitions. [2025-02-05 20:12:06,961 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-02-05 20:12:06,961 INFO L276 IsEmpty]: Start isEmpty. Operand 676 states and 915 transitions. [2025-02-05 20:12:06,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-02-05 20:12:06,962 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:12:06,963 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-02-05 20:12:06,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-05 20:12:06,964 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:12:06,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:12:06,965 INFO L85 PathProgramCache]: Analyzing trace with hash 1052018257, now seen corresponding path program 1 times [2025-02-05 20:12:06,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:12:06,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855340439] [2025-02-05 20:12:06,965 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:12:06,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:12:06,980 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-02-05 20:12:07,010 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-02-05 20:12:07,011 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:12:07,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:12:07,213 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:12:07,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:12:07,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855340439] [2025-02-05 20:12:07,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855340439] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:12:07,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:12:07,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 20:12:07,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144826391] [2025-02-05 20:12:07,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:12:07,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 20:12:07,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:12:07,215 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 20:12:07,215 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-05 20:12:07,215 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-02-05 20:12:07,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:12:07,307 INFO L93 Difference]: Finished difference Result 926 states and 1267 transitions. [2025-02-05 20:12:07,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 20:12:07,310 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-02-05 20:12:07,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:12:07,312 INFO L225 Difference]: With dead ends: 926 [2025-02-05 20:12:07,312 INFO L226 Difference]: Without dead ends: 673 [2025-02-05 20:12:07,313 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-02-05 20:12:07,314 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-02-05 20:12:07,314 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-02-05 20:12:07,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2025-02-05 20:12:07,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 671. [2025-02-05 20:12:07,325 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-02-05 20:12:07,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 671 states to 671 states and 897 transitions. [2025-02-05 20:12:07,326 INFO L78 Accepts]: Start accepts. Automaton has 671 states and 897 transitions. Word has length 57 [2025-02-05 20:12:07,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:12:07,327 INFO L471 AbstractCegarLoop]: Abstraction has 671 states and 897 transitions. [2025-02-05 20:12:07,327 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-02-05 20:12:07,327 INFO L276 IsEmpty]: Start isEmpty. Operand 671 states and 897 transitions. [2025-02-05 20:12:07,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-02-05 20:12:07,328 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:12:07,328 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-02-05 20:12:07,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-05 20:12:07,329 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:12:07,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:12:07,330 INFO L85 PathProgramCache]: Analyzing trace with hash -421295245, now seen corresponding path program 1 times [2025-02-05 20:12:07,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:12:07,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191358553] [2025-02-05 20:12:07,330 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:12:07,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:12:07,349 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-02-05 20:12:07,362 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-02-05 20:12:07,362 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:12:07,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:12:07,831 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:12:07,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:12:07,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191358553] [2025-02-05 20:12:07,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191358553] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:12:07,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:12:07,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-02-05 20:12:07,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244714198] [2025-02-05 20:12:07,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:12:07,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-02-05 20:12:07,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:12:07,832 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-02-05 20:12:07,833 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2025-02-05 20:12:07,833 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-02-05 20:12:08,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:12:08,024 INFO L93 Difference]: Finished difference Result 1003 states and 1376 transitions. [2025-02-05 20:12:08,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-02-05 20:12:08,024 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-02-05 20:12:08,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:12:08,026 INFO L225 Difference]: With dead ends: 1003 [2025-02-05 20:12:08,026 INFO L226 Difference]: Without dead ends: 802 [2025-02-05 20:12:08,027 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-02-05 20:12:08,027 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-02-05 20:12:08,027 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-02-05 20:12:08,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 802 states. [2025-02-05 20:12:08,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 802 to 742. [2025-02-05 20:12:08,039 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-02-05 20:12:08,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 742 states to 742 states and 989 transitions. [2025-02-05 20:12:08,041 INFO L78 Accepts]: Start accepts. Automaton has 742 states and 989 transitions. Word has length 57 [2025-02-05 20:12:08,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:12:08,041 INFO L471 AbstractCegarLoop]: Abstraction has 742 states and 989 transitions. [2025-02-05 20:12:08,041 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-02-05 20:12:08,041 INFO L276 IsEmpty]: Start isEmpty. Operand 742 states and 989 transitions. [2025-02-05 20:12:08,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-02-05 20:12:08,043 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:12:08,043 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-02-05 20:12:08,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-05 20:12:08,043 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:12:08,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:12:08,043 INFO L85 PathProgramCache]: Analyzing trace with hash -29588648, now seen corresponding path program 1 times [2025-02-05 20:12:08,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:12:08,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445204484] [2025-02-05 20:12:08,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:12:08,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:12:08,071 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-02-05 20:12:08,089 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-02-05 20:12:08,089 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:12:08,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:12:08,585 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:12:08,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:12:08,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445204484] [2025-02-05 20:12:08,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445204484] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:12:08,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:12:08,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-05 20:12:08,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977998028] [2025-02-05 20:12:08,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:12:08,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-05 20:12:08,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:12:08,587 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-05 20:12:08,588 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2025-02-05 20:12:08,588 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-02-05 20:12:08,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:12:08,761 INFO L93 Difference]: Finished difference Result 945 states and 1272 transitions. [2025-02-05 20:12:08,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-05 20:12:08,762 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-02-05 20:12:08,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:12:08,764 INFO L225 Difference]: With dead ends: 945 [2025-02-05 20:12:08,764 INFO L226 Difference]: Without dead ends: 780 [2025-02-05 20:12:08,764 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-02-05 20:12:08,764 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-02-05 20:12:08,765 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-02-05 20:12:08,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 780 states. [2025-02-05 20:12:08,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 780 to 746. [2025-02-05 20:12:08,773 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-02-05 20:12:08,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 746 states to 746 states and 990 transitions. [2025-02-05 20:12:08,775 INFO L78 Accepts]: Start accepts. Automaton has 746 states and 990 transitions. Word has length 57 [2025-02-05 20:12:08,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:12:08,775 INFO L471 AbstractCegarLoop]: Abstraction has 746 states and 990 transitions. [2025-02-05 20:12:08,775 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-02-05 20:12:08,775 INFO L276 IsEmpty]: Start isEmpty. Operand 746 states and 990 transitions. [2025-02-05 20:12:08,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-02-05 20:12:08,777 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:12:08,777 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-02-05 20:12:08,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-05 20:12:08,777 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:12:08,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:12:08,778 INFO L85 PathProgramCache]: Analyzing trace with hash -950389509, now seen corresponding path program 1 times [2025-02-05 20:12:08,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:12:08,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773043914] [2025-02-05 20:12:08,778 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:12:08,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:12:08,792 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-02-05 20:12:08,808 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-02-05 20:12:08,808 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:12:08,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:12:09,140 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:12:09,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:12:09,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773043914] [2025-02-05 20:12:09,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773043914] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:12:09,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:12:09,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 20:12:09,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142849193] [2025-02-05 20:12:09,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:12:09,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 20:12:09,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:12:09,143 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 20:12:09,143 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-02-05 20:12:09,143 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-02-05 20:12:09,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:12:09,462 INFO L93 Difference]: Finished difference Result 1303 states and 1752 transitions. [2025-02-05 20:12:09,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 20:12:09,463 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-02-05 20:12:09,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:12:09,465 INFO L225 Difference]: With dead ends: 1303 [2025-02-05 20:12:09,465 INFO L226 Difference]: Without dead ends: 1170 [2025-02-05 20:12:09,466 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-02-05 20:12:09,466 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.3s IncrementalHoareTripleChecker+Time [2025-02-05 20:12:09,466 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.3s Time] [2025-02-05 20:12:09,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1170 states. [2025-02-05 20:12:09,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1170 to 1021. [2025-02-05 20:12:09,484 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-02-05 20:12:09,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1021 states to 1021 states and 1364 transitions. [2025-02-05 20:12:09,486 INFO L78 Accepts]: Start accepts. Automaton has 1021 states and 1364 transitions. Word has length 58 [2025-02-05 20:12:09,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:12:09,487 INFO L471 AbstractCegarLoop]: Abstraction has 1021 states and 1364 transitions. [2025-02-05 20:12:09,487 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-02-05 20:12:09,487 INFO L276 IsEmpty]: Start isEmpty. Operand 1021 states and 1364 transitions. [2025-02-05 20:12:09,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-02-05 20:12:09,492 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:12:09,492 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-02-05 20:12:09,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-02-05 20:12:09,492 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:12:09,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:12:09,493 INFO L85 PathProgramCache]: Analyzing trace with hash -1977507922, now seen corresponding path program 1 times [2025-02-05 20:12:09,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:12:09,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928585718] [2025-02-05 20:12:09,493 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:12:09,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:12:09,508 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-02-05 20:12:09,521 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-02-05 20:12:09,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:12:09,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:12:10,062 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:12:10,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:12:10,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928585718] [2025-02-05 20:12:10,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928585718] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:12:10,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:12:10,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2025-02-05 20:12:10,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989243583] [2025-02-05 20:12:10,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:12:10,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-02-05 20:12:10,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:12:10,064 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-02-05 20:12:10,065 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=449, Unknown=0, NotChecked=0, Total=506 [2025-02-05 20:12:10,066 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-02-05 20:12:10,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:12:10,254 INFO L93 Difference]: Finished difference Result 1408 states and 1916 transitions. [2025-02-05 20:12:10,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-02-05 20:12:10,255 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-02-05 20:12:10,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:12:10,258 INFO L225 Difference]: With dead ends: 1408 [2025-02-05 20:12:10,258 INFO L226 Difference]: Without dead ends: 1185 [2025-02-05 20:12:10,258 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=449, Unknown=0, NotChecked=0, Total=506 [2025-02-05 20:12:10,259 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 62 mSDsluCounter, 827 mSDsCounter, 0 mSdLazyCounter, 488 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-02-05 20:12:10,259 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-02-05 20:12:10,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1185 states. [2025-02-05 20:12:10,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1185 to 1063. [2025-02-05 20:12:10,270 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-02-05 20:12:10,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1063 states to 1063 states and 1426 transitions. [2025-02-05 20:12:10,272 INFO L78 Accepts]: Start accepts. Automaton has 1063 states and 1426 transitions. Word has length 58 [2025-02-05 20:12:10,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:12:10,272 INFO L471 AbstractCegarLoop]: Abstraction has 1063 states and 1426 transitions. [2025-02-05 20:12:10,272 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-02-05 20:12:10,272 INFO L276 IsEmpty]: Start isEmpty. Operand 1063 states and 1426 transitions. [2025-02-05 20:12:10,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-02-05 20:12:10,274 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:12:10,274 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-02-05 20:12:10,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-02-05 20:12:10,275 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:12:10,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:12:10,276 INFO L85 PathProgramCache]: Analyzing trace with hash -439438171, now seen corresponding path program 1 times [2025-02-05 20:12:10,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:12:10,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316667554] [2025-02-05 20:12:10,276 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:12:10,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:12:10,296 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-02-05 20:12:10,319 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-02-05 20:12:10,319 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:12:10,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:12:10,870 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:12:10,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:12:10,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316667554] [2025-02-05 20:12:10,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316667554] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:12:10,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:12:10,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-02-05 20:12:10,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827673531] [2025-02-05 20:12:10,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:12:10,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-05 20:12:10,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:12:10,873 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-05 20:12:10,874 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2025-02-05 20:12:10,874 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-02-05 20:12:11,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:12:11,061 INFO L93 Difference]: Finished difference Result 1410 states and 1904 transitions. [2025-02-05 20:12:11,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-05 20:12:11,062 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-02-05 20:12:11,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:12:11,064 INFO L225 Difference]: With dead ends: 1410 [2025-02-05 20:12:11,064 INFO L226 Difference]: Without dead ends: 1174 [2025-02-05 20:12:11,065 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-02-05 20:12:11,065 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.2s IncrementalHoareTripleChecker+Time [2025-02-05 20:12:11,065 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.2s Time] [2025-02-05 20:12:11,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1174 states. [2025-02-05 20:12:11,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1174 to 1079. [2025-02-05 20:12:11,075 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-02-05 20:12:11,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1079 states to 1079 states and 1442 transitions. [2025-02-05 20:12:11,077 INFO L78 Accepts]: Start accepts. Automaton has 1079 states and 1442 transitions. Word has length 58 [2025-02-05 20:12:11,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:12:11,077 INFO L471 AbstractCegarLoop]: Abstraction has 1079 states and 1442 transitions. [2025-02-05 20:12:11,077 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-02-05 20:12:11,077 INFO L276 IsEmpty]: Start isEmpty. Operand 1079 states and 1442 transitions. [2025-02-05 20:12:11,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-02-05 20:12:11,079 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:12:11,079 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-02-05 20:12:11,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-02-05 20:12:11,080 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:12:11,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:12:11,080 INFO L85 PathProgramCache]: Analyzing trace with hash -611580680, now seen corresponding path program 1 times [2025-02-05 20:12:11,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:12:11,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818369589] [2025-02-05 20:12:11,080 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:12:11,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:12:11,096 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-02-05 20:12:11,115 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-02-05 20:12:11,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:12:11,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:12:11,691 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:12:11,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:12:11,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818369589] [2025-02-05 20:12:11,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818369589] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:12:11,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:12:11,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2025-02-05 20:12:11,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499787141] [2025-02-05 20:12:11,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:12:11,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-02-05 20:12:11,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:12:11,692 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-02-05 20:12:11,693 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=354, Unknown=0, NotChecked=0, Total=420 [2025-02-05 20:12:11,693 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-02-05 20:12:11,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:12:11,936 INFO L93 Difference]: Finished difference Result 1513 states and 2046 transitions. [2025-02-05 20:12:11,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-02-05 20:12:11,937 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-02-05 20:12:11,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:12:11,940 INFO L225 Difference]: With dead ends: 1513 [2025-02-05 20:12:11,940 INFO L226 Difference]: Without dead ends: 1292 [2025-02-05 20:12:11,941 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-02-05 20:12:11,941 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 134 mSDsluCounter, 976 mSDsCounter, 0 mSdLazyCounter, 577 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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-02-05 20:12:11,941 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-02-05 20:12:11,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1292 states. [2025-02-05 20:12:11,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1292 to 1138. [2025-02-05 20:12:11,951 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-02-05 20:12:11,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1138 states to 1138 states and 1526 transitions. [2025-02-05 20:12:11,953 INFO L78 Accepts]: Start accepts. Automaton has 1138 states and 1526 transitions. Word has length 58 [2025-02-05 20:12:11,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:12:11,953 INFO L471 AbstractCegarLoop]: Abstraction has 1138 states and 1526 transitions. [2025-02-05 20:12:11,953 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-02-05 20:12:11,954 INFO L276 IsEmpty]: Start isEmpty. Operand 1138 states and 1526 transitions. [2025-02-05 20:12:11,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-02-05 20:12:11,955 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:12:11,955 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-02-05 20:12:11,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-02-05 20:12:11,956 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:12:11,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:12:11,956 INFO L85 PathProgramCache]: Analyzing trace with hash 919621756, now seen corresponding path program 1 times [2025-02-05 20:12:11,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:12:11,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698790828] [2025-02-05 20:12:11,957 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:12:11,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:12:11,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-02-05 20:12:11,990 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-02-05 20:12:11,990 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:12:11,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:12:12,325 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:12:12,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:12:12,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698790828] [2025-02-05 20:12:12,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698790828] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:12:12,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:12:12,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-05 20:12:12,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766479626] [2025-02-05 20:12:12,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:12:12,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 20:12:12,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:12:12,327 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 20:12:12,327 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-02-05 20:12:12,327 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-02-05 20:12:12,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:12:12,446 INFO L93 Difference]: Finished difference Result 1431 states and 1935 transitions. [2025-02-05 20:12:12,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-05 20:12:12,447 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-02-05 20:12:12,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:12:12,449 INFO L225 Difference]: With dead ends: 1431 [2025-02-05 20:12:12,449 INFO L226 Difference]: Without dead ends: 1111 [2025-02-05 20:12:12,450 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-02-05 20:12:12,450 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-02-05 20:12:12,451 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-02-05 20:12:12,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1111 states. [2025-02-05 20:12:12,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1111 to 1069. [2025-02-05 20:12:12,460 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-02-05 20:12:12,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1069 states to 1069 states and 1431 transitions. [2025-02-05 20:12:12,461 INFO L78 Accepts]: Start accepts. Automaton has 1069 states and 1431 transitions. Word has length 58 [2025-02-05 20:12:12,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:12:12,462 INFO L471 AbstractCegarLoop]: Abstraction has 1069 states and 1431 transitions. [2025-02-05 20:12:12,462 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-02-05 20:12:12,462 INFO L276 IsEmpty]: Start isEmpty. Operand 1069 states and 1431 transitions. [2025-02-05 20:12:12,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-02-05 20:12:12,463 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:12:12,464 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-02-05 20:12:12,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-02-05 20:12:12,464 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:12:12,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:12:12,464 INFO L85 PathProgramCache]: Analyzing trace with hash 663620049, now seen corresponding path program 1 times [2025-02-05 20:12:12,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:12:12,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375433489] [2025-02-05 20:12:12,465 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:12:12,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:12:12,480 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-02-05 20:12:12,492 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-02-05 20:12:12,492 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:12:12,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:12:13,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-02-05 20:12:13,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:12:13,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375433489] [2025-02-05 20:12:13,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375433489] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:12:13,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:12:13,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2025-02-05 20:12:13,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047443263] [2025-02-05 20:12:13,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:12:13,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-02-05 20:12:13,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:12:13,094 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-02-05 20:12:13,094 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=320, Unknown=0, NotChecked=0, Total=380 [2025-02-05 20:12:13,094 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-02-05 20:12:13,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:12:13,345 INFO L93 Difference]: Finished difference Result 1348 states and 1828 transitions. [2025-02-05 20:12:13,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-02-05 20:12:13,345 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-02-05 20:12:13,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:12:13,348 INFO L225 Difference]: With dead ends: 1348 [2025-02-05 20:12:13,348 INFO L226 Difference]: Without dead ends: 1128 [2025-02-05 20:12:13,348 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 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-02-05 20:12:13,349 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-02-05 20:12:13,349 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-02-05 20:12:13,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1128 states. [2025-02-05 20:12:13,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1128 to 1065. [2025-02-05 20:12:13,359 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-02-05 20:12:13,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1065 states to 1065 states and 1426 transitions. [2025-02-05 20:12:13,361 INFO L78 Accepts]: Start accepts. Automaton has 1065 states and 1426 transitions. Word has length 58 [2025-02-05 20:12:13,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:12:13,361 INFO L471 AbstractCegarLoop]: Abstraction has 1065 states and 1426 transitions. [2025-02-05 20:12:13,361 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-02-05 20:12:13,361 INFO L276 IsEmpty]: Start isEmpty. Operand 1065 states and 1426 transitions. [2025-02-05 20:12:13,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-02-05 20:12:13,363 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:12:13,363 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-02-05 20:12:13,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-02-05 20:12:13,363 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:12:13,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:12:13,364 INFO L85 PathProgramCache]: Analyzing trace with hash -917611852, now seen corresponding path program 1 times [2025-02-05 20:12:13,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:12:13,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263108038] [2025-02-05 20:12:13,364 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:12:13,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:12:13,379 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-02-05 20:12:13,395 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-02-05 20:12:13,395 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:12:13,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:12:14,459 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:12:14,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:12:14,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263108038] [2025-02-05 20:12:14,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263108038] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:12:14,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:12:14,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2025-02-05 20:12:14,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680189326] [2025-02-05 20:12:14,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:12:14,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-02-05 20:12:14,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:12:14,461 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-02-05 20:12:14,461 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=444, Unknown=0, NotChecked=0, Total=506 [2025-02-05 20:12:14,462 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-02-05 20:12:14,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:12:14,986 INFO L93 Difference]: Finished difference Result 1412 states and 1929 transitions. [2025-02-05 20:12:14,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-02-05 20:12:14,986 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-02-05 20:12:14,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:12:14,989 INFO L225 Difference]: With dead ends: 1412 [2025-02-05 20:12:14,989 INFO L226 Difference]: Without dead ends: 1192 [2025-02-05 20:12:14,990 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=62, Invalid=444, Unknown=0, NotChecked=0, Total=506 [2025-02-05 20:12:14,990 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.5s IncrementalHoareTripleChecker+Time [2025-02-05 20:12:14,990 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.5s Time] [2025-02-05 20:12:14,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1192 states. [2025-02-05 20:12:14,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1192 to 1132. [2025-02-05 20:12:14,999 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-02-05 20:12:15,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1132 states to 1132 states and 1522 transitions. [2025-02-05 20:12:15,000 INFO L78 Accepts]: Start accepts. Automaton has 1132 states and 1522 transitions. Word has length 58 [2025-02-05 20:12:15,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:12:15,001 INFO L471 AbstractCegarLoop]: Abstraction has 1132 states and 1522 transitions. [2025-02-05 20:12:15,001 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-02-05 20:12:15,001 INFO L276 IsEmpty]: Start isEmpty. Operand 1132 states and 1522 transitions. [2025-02-05 20:12:15,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-02-05 20:12:15,002 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:12:15,002 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-02-05 20:12:15,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-02-05 20:12:15,002 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:12:15,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:12:15,003 INFO L85 PathProgramCache]: Analyzing trace with hash 2024660303, now seen corresponding path program 1 times [2025-02-05 20:12:15,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:12:15,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359199194] [2025-02-05 20:12:15,003 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:12:15,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:12:15,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-02-05 20:12:15,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-02-05 20:12:15,032 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:12:15,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:12:15,334 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:12:15,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:12:15,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359199194] [2025-02-05 20:12:15,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359199194] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:12:15,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:12:15,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-05 20:12:15,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944434844] [2025-02-05 20:12:15,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:12:15,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-05 20:12:15,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:12:15,335 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-05 20:12:15,336 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-02-05 20:12:15,336 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-02-05 20:12:15,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:12:15,457 INFO L93 Difference]: Finished difference Result 1535 states and 2103 transitions. [2025-02-05 20:12:15,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 20:12:15,458 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-02-05 20:12:15,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:12:15,460 INFO L225 Difference]: With dead ends: 1535 [2025-02-05 20:12:15,460 INFO L226 Difference]: Without dead ends: 1221 [2025-02-05 20:12:15,461 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-02-05 20:12:15,461 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-02-05 20:12:15,461 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-02-05 20:12:15,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1221 states. [2025-02-05 20:12:15,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1221 to 1198. [2025-02-05 20:12:15,473 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-02-05 20:12:15,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1198 states to 1198 states and 1595 transitions. [2025-02-05 20:12:15,474 INFO L78 Accepts]: Start accepts. Automaton has 1198 states and 1595 transitions. Word has length 58 [2025-02-05 20:12:15,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:12:15,474 INFO L471 AbstractCegarLoop]: Abstraction has 1198 states and 1595 transitions. [2025-02-05 20:12:15,474 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-02-05 20:12:15,474 INFO L276 IsEmpty]: Start isEmpty. Operand 1198 states and 1595 transitions. [2025-02-05 20:12:15,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-02-05 20:12:15,475 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:12:15,475 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-02-05 20:12:15,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-02-05 20:12:15,475 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:12:15,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:12:15,476 INFO L85 PathProgramCache]: Analyzing trace with hash -459175569, now seen corresponding path program 1 times [2025-02-05 20:12:15,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:12:15,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370046818] [2025-02-05 20:12:15,476 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:12:15,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:12:15,490 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-02-05 20:12:15,513 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-02-05 20:12:15,513 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:12:15,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:12:15,757 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:12:15,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:12:15,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370046818] [2025-02-05 20:12:15,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370046818] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 20:12:15,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [777351176] [2025-02-05 20:12:15,757 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:12:15,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:12:15,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:12:15,760 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 20:12:15,762 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-05 20:12:15,955 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-02-05 20:12:16,014 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-02-05 20:12:16,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:12:16,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:12:16,018 INFO L256 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 64 conjuncts are in the unsatisfiable core [2025-02-05 20:12:16,024 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 20:12:16,591 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:12:16,592 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 20:12:16,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [777351176] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:12:16,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 20:12:16,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [7] total 17 [2025-02-05 20:12:16,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299175534] [2025-02-05 20:12:16,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:12:16,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-05 20:12:16,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:12:16,592 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-05 20:12:16,593 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2025-02-05 20:12:16,593 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-02-05 20:12:17,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:12:17,012 INFO L93 Difference]: Finished difference Result 1903 states and 2556 transitions. [2025-02-05 20:12:17,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 20:12:17,012 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-02-05 20:12:17,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:12:17,015 INFO L225 Difference]: With dead ends: 1903 [2025-02-05 20:12:17,016 INFO L226 Difference]: Without dead ends: 1679 [2025-02-05 20:12:17,016 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=64, Invalid=398, Unknown=0, NotChecked=0, Total=462 [2025-02-05 20:12:17,017 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 285 mSDsluCounter, 780 mSDsCounter, 0 mSdLazyCounter, 796 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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-02-05 20:12:17,017 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-02-05 20:12:17,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1679 states. [2025-02-05 20:12:17,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1679 to 1280. [2025-02-05 20:12:17,028 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-02-05 20:12:17,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1280 states to 1280 states and 1705 transitions. [2025-02-05 20:12:17,029 INFO L78 Accepts]: Start accepts. Automaton has 1280 states and 1705 transitions. Word has length 58 [2025-02-05 20:12:17,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:12:17,029 INFO L471 AbstractCegarLoop]: Abstraction has 1280 states and 1705 transitions. [2025-02-05 20:12:17,029 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-02-05 20:12:17,029 INFO L276 IsEmpty]: Start isEmpty. Operand 1280 states and 1705 transitions. [2025-02-05 20:12:17,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-02-05 20:12:17,030 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:12:17,031 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-02-05 20:12:17,040 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-05 20:12:17,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:12:17,231 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:12:17,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:12:17,232 INFO L85 PathProgramCache]: Analyzing trace with hash -1811870710, now seen corresponding path program 1 times [2025-02-05 20:12:17,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:12:17,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927396383] [2025-02-05 20:12:17,232 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:12:17,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:12:17,248 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-02-05 20:12:17,265 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-02-05 20:12:17,265 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:12:17,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:12:17,545 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:12:17,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:12:17,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927396383] [2025-02-05 20:12:17,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927396383] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:12:17,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:12:17,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-05 20:12:17,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002946412] [2025-02-05 20:12:17,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:12:17,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-05 20:12:17,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:12:17,547 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-05 20:12:17,547 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2025-02-05 20:12:17,547 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-02-05 20:12:17,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:12:17,634 INFO L93 Difference]: Finished difference Result 1551 states and 2103 transitions. [2025-02-05 20:12:17,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 20:12:17,635 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-02-05 20:12:17,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:12:17,637 INFO L225 Difference]: With dead ends: 1551 [2025-02-05 20:12:17,637 INFO L226 Difference]: Without dead ends: 1298 [2025-02-05 20:12:17,638 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-02-05 20:12:17,638 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-02-05 20:12:17,638 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-02-05 20:12:17,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1298 states. [2025-02-05 20:12:17,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1298 to 1270. [2025-02-05 20:12:17,646 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-02-05 20:12:17,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1270 states to 1270 states and 1689 transitions. [2025-02-05 20:12:17,647 INFO L78 Accepts]: Start accepts. Automaton has 1270 states and 1689 transitions. Word has length 58 [2025-02-05 20:12:17,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:12:17,647 INFO L471 AbstractCegarLoop]: Abstraction has 1270 states and 1689 transitions. [2025-02-05 20:12:17,647 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-02-05 20:12:17,647 INFO L276 IsEmpty]: Start isEmpty. Operand 1270 states and 1689 transitions. [2025-02-05 20:12:17,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-02-05 20:12:17,648 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:12:17,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-02-05 20:12:17,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-02-05 20:12:17,649 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:12:17,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:12:17,649 INFO L85 PathProgramCache]: Analyzing trace with hash 1300397295, now seen corresponding path program 1 times [2025-02-05 20:12:17,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:12:17,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759160277] [2025-02-05 20:12:17,649 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:12:17,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:12:17,664 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-02-05 20:12:17,673 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-02-05 20:12:17,674 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:12:17,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:12:18,100 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:12:18,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:12:18,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759160277] [2025-02-05 20:12:18,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759160277] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:12:18,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:12:18,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2025-02-05 20:12:18,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464555414] [2025-02-05 20:12:18,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:12:18,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-02-05 20:12:18,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:12:18,101 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-02-05 20:12:18,101 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2025-02-05 20:12:18,101 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-02-05 20:12:18,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:12:18,326 INFO L93 Difference]: Finished difference Result 1715 states and 2299 transitions. [2025-02-05 20:12:18,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-02-05 20:12:18,327 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-02-05 20:12:18,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:12:18,331 INFO L225 Difference]: With dead ends: 1715 [2025-02-05 20:12:18,331 INFO L226 Difference]: Without dead ends: 1458 [2025-02-05 20:12:18,331 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-02-05 20:12:18,332 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-02-05 20:12:18,332 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-02-05 20:12:18,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1458 states. [2025-02-05 20:12:18,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1458 to 1250. [2025-02-05 20:12:18,340 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-02-05 20:12:18,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1250 states to 1250 states and 1676 transitions. [2025-02-05 20:12:18,342 INFO L78 Accepts]: Start accepts. Automaton has 1250 states and 1676 transitions. Word has length 58 [2025-02-05 20:12:18,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:12:18,342 INFO L471 AbstractCegarLoop]: Abstraction has 1250 states and 1676 transitions. [2025-02-05 20:12:18,342 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-02-05 20:12:18,342 INFO L276 IsEmpty]: Start isEmpty. Operand 1250 states and 1676 transitions. [2025-02-05 20:12:18,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-02-05 20:12:18,343 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:12:18,343 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-02-05 20:12:18,343 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-02-05 20:12:18,343 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:12:18,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:12:18,344 INFO L85 PathProgramCache]: Analyzing trace with hash 273278882, now seen corresponding path program 1 times [2025-02-05 20:12:18,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:12:18,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818724218] [2025-02-05 20:12:18,344 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:12:18,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:12:18,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-02-05 20:12:18,362 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-02-05 20:12:18,362 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:12:18,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:12:18,825 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:12:18,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:12:18,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818724218] [2025-02-05 20:12:18,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818724218] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:12:18,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:12:18,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2025-02-05 20:12:18,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866289749] [2025-02-05 20:12:18,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:12:18,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-02-05 20:12:18,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:12:18,826 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-02-05 20:12:18,826 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=400, Unknown=0, NotChecked=0, Total=462 [2025-02-05 20:12:18,827 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-02-05 20:12:19,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:12:19,113 INFO L93 Difference]: Finished difference Result 1729 states and 2348 transitions. [2025-02-05 20:12:19,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-02-05 20:12:19,113 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-02-05 20:12:19,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:12:19,117 INFO L225 Difference]: With dead ends: 1729 [2025-02-05 20:12:19,117 INFO L226 Difference]: Without dead ends: 1472 [2025-02-05 20:12:19,118 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=400, Unknown=0, NotChecked=0, Total=462 [2025-02-05 20:12:19,118 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.3s IncrementalHoareTripleChecker+Time [2025-02-05 20:12:19,119 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.3s Time] [2025-02-05 20:12:19,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1472 states. [2025-02-05 20:12:19,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1472 to 1330. [2025-02-05 20:12:19,130 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-02-05 20:12:19,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1330 states to 1330 states and 1784 transitions. [2025-02-05 20:12:19,131 INFO L78 Accepts]: Start accepts. Automaton has 1330 states and 1784 transitions. Word has length 58 [2025-02-05 20:12:19,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:12:19,131 INFO L471 AbstractCegarLoop]: Abstraction has 1330 states and 1784 transitions. [2025-02-05 20:12:19,131 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-02-05 20:12:19,131 INFO L276 IsEmpty]: Start isEmpty. Operand 1330 states and 1784 transitions. [2025-02-05 20:12:19,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-02-05 20:12:19,133 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:12:19,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-02-05 20:12:19,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-02-05 20:12:19,133 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:12:19,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:12:19,134 INFO L85 PathProgramCache]: Analyzing trace with hash 1384314476, now seen corresponding path program 1 times [2025-02-05 20:12:19,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:12:19,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059888799] [2025-02-05 20:12:19,134 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:12:19,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:12:19,148 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-02-05 20:12:19,161 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-02-05 20:12:19,161 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:12:19,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:12:19,776 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:12:19,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:12:19,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059888799] [2025-02-05 20:12:19,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059888799] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:12:19,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:12:19,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2025-02-05 20:12:19,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087898609] [2025-02-05 20:12:19,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:12:19,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-02-05 20:12:19,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:12:19,777 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-02-05 20:12:19,777 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=320, Unknown=0, NotChecked=0, Total=380 [2025-02-05 20:12:19,777 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-02-05 20:12:20,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:12:20,075 INFO L93 Difference]: Finished difference Result 1651 states and 2235 transitions. [2025-02-05 20:12:20,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-02-05 20:12:20,076 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-02-05 20:12:20,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:12:20,079 INFO L225 Difference]: With dead ends: 1651 [2025-02-05 20:12:20,079 INFO L226 Difference]: Without dead ends: 1401 [2025-02-05 20:12:20,079 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-02-05 20:12:20,080 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.3s IncrementalHoareTripleChecker+Time [2025-02-05 20:12:20,080 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.3s Time] [2025-02-05 20:12:20,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1401 states. [2025-02-05 20:12:20,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1401 to 1338. [2025-02-05 20:12:20,088 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-02-05 20:12:20,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1338 states to 1338 states and 1796 transitions. [2025-02-05 20:12:20,090 INFO L78 Accepts]: Start accepts. Automaton has 1338 states and 1796 transitions. Word has length 58 [2025-02-05 20:12:20,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:12:20,090 INFO L471 AbstractCegarLoop]: Abstraction has 1338 states and 1796 transitions. [2025-02-05 20:12:20,090 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-02-05 20:12:20,090 INFO L276 IsEmpty]: Start isEmpty. Operand 1338 states and 1796 transitions. [2025-02-05 20:12:20,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-02-05 20:12:20,092 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:12:20,092 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-02-05 20:12:20,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-02-05 20:12:20,092 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:12:20,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:12:20,092 INFO L85 PathProgramCache]: Analyzing trace with hash -2040315303, now seen corresponding path program 1 times [2025-02-05 20:12:20,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:12:20,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752952513] [2025-02-05 20:12:20,092 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:12:20,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:12:20,106 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-02-05 20:12:20,123 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-02-05 20:12:20,123 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:12:20,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:12:20,474 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:12:20,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:12:20,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752952513] [2025-02-05 20:12:20,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752952513] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:12:20,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:12:20,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-05 20:12:20,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944034750] [2025-02-05 20:12:20,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:12:20,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 20:12:20,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:12:20,477 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 20:12:20,477 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2025-02-05 20:12:20,477 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-02-05 20:12:20,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:12:20,684 INFO L93 Difference]: Finished difference Result 2008 states and 2730 transitions. [2025-02-05 20:12:20,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 20:12:20,685 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-02-05 20:12:20,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:12:20,688 INFO L225 Difference]: With dead ends: 2008 [2025-02-05 20:12:20,688 INFO L226 Difference]: Without dead ends: 1520 [2025-02-05 20:12:20,689 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-02-05 20:12:20,689 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 132 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 428 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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-02-05 20:12:20,689 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-02-05 20:12:20,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1520 states. [2025-02-05 20:12:20,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1520 to 1492. [2025-02-05 20:12:20,707 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-02-05 20:12:20,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1492 states to 1492 states and 1958 transitions. [2025-02-05 20:12:20,708 INFO L78 Accepts]: Start accepts. Automaton has 1492 states and 1958 transitions. Word has length 58 [2025-02-05 20:12:20,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:12:20,708 INFO L471 AbstractCegarLoop]: Abstraction has 1492 states and 1958 transitions. [2025-02-05 20:12:20,708 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-02-05 20:12:20,708 INFO L276 IsEmpty]: Start isEmpty. Operand 1492 states and 1958 transitions. [2025-02-05 20:12:20,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-02-05 20:12:20,709 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:12:20,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] [2025-02-05 20:12:20,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-02-05 20:12:20,709 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:12:20,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:12:20,710 INFO L85 PathProgramCache]: Analyzing trace with hash -1631977612, now seen corresponding path program 1 times [2025-02-05 20:12:20,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:12:20,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194704872] [2025-02-05 20:12:20,710 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:12:20,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:12:20,721 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-02-05 20:12:20,731 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-02-05 20:12:20,731 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:12:20,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:12:20,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-02-05 20:12:20,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:12:20,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194704872] [2025-02-05 20:12:20,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194704872] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:12:20,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:12:20,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 20:12:20,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365733521] [2025-02-05 20:12:20,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:12:20,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 20:12:20,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:12:20,865 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 20:12:20,865 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-02-05 20:12:20,865 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-02-05 20:12:20,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:12:20,943 INFO L93 Difference]: Finished difference Result 1952 states and 2613 transitions. [2025-02-05 20:12:20,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 20:12:20,943 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-02-05 20:12:20,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:12:20,946 INFO L225 Difference]: With dead ends: 1952 [2025-02-05 20:12:20,946 INFO L226 Difference]: Without dead ends: 1468 [2025-02-05 20:12:20,947 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-02-05 20:12:20,947 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 30 mSDsluCounter, 544 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-02-05 20:12:20,947 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-02-05 20:12:20,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1468 states. [2025-02-05 20:12:20,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1468 to 1468. [2025-02-05 20:12:20,958 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-02-05 20:12:20,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1468 states to 1468 states and 1893 transitions. [2025-02-05 20:12:20,960 INFO L78 Accepts]: Start accepts. Automaton has 1468 states and 1893 transitions. Word has length 58 [2025-02-05 20:12:20,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:12:20,960 INFO L471 AbstractCegarLoop]: Abstraction has 1468 states and 1893 transitions. [2025-02-05 20:12:20,960 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-02-05 20:12:20,960 INFO L276 IsEmpty]: Start isEmpty. Operand 1468 states and 1893 transitions. [2025-02-05 20:12:20,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-02-05 20:12:20,962 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:12:20,962 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-02-05 20:12:20,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-02-05 20:12:20,962 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:12:20,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:12:20,962 INFO L85 PathProgramCache]: Analyzing trace with hash 1088205701, now seen corresponding path program 1 times [2025-02-05 20:12:20,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:12:20,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280493771] [2025-02-05 20:12:20,962 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:12:20,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:12:20,977 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-02-05 20:12:20,995 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-02-05 20:12:20,995 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:12:20,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:12:21,216 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:12:21,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:12:21,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280493771] [2025-02-05 20:12:21,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280493771] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:12:21,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:12:21,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-05 20:12:21,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202446660] [2025-02-05 20:12:21,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:12:21,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 20:12:21,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:12:21,217 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 20:12:21,217 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2025-02-05 20:12:21,217 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-02-05 20:12:21,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:12:21,412 INFO L93 Difference]: Finished difference Result 2154 states and 2813 transitions. [2025-02-05 20:12:21,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 20:12:21,413 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-02-05 20:12:21,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:12:21,416 INFO L225 Difference]: With dead ends: 2154 [2025-02-05 20:12:21,416 INFO L226 Difference]: Without dead ends: 1858 [2025-02-05 20:12:21,417 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-02-05 20:12:21,417 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-02-05 20:12:21,417 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-02-05 20:12:21,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1858 states. [2025-02-05 20:12:21,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1858 to 1817. [2025-02-05 20:12:21,427 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-02-05 20:12:21,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1817 states to 1817 states and 2329 transitions. [2025-02-05 20:12:21,429 INFO L78 Accepts]: Start accepts. Automaton has 1817 states and 2329 transitions. Word has length 58 [2025-02-05 20:12:21,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:12:21,429 INFO L471 AbstractCegarLoop]: Abstraction has 1817 states and 2329 transitions. [2025-02-05 20:12:21,429 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-02-05 20:12:21,429 INFO L276 IsEmpty]: Start isEmpty. Operand 1817 states and 2329 transitions. [2025-02-05 20:12:21,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-02-05 20:12:21,430 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:12:21,430 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-02-05 20:12:21,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-02-05 20:12:21,431 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:12:21,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:12:21,431 INFO L85 PathProgramCache]: Analyzing trace with hash 316401097, now seen corresponding path program 1 times [2025-02-05 20:12:21,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:12:21,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200358950] [2025-02-05 20:12:21,431 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:12:21,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:12:21,447 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-02-05 20:12:21,460 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-02-05 20:12:21,461 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:12:21,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:12:21,772 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:12:21,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:12:21,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200358950] [2025-02-05 20:12:21,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200358950] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:12:21,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:12:21,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-05 20:12:21,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072361948] [2025-02-05 20:12:21,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:12:21,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-05 20:12:21,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:12:21,774 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-05 20:12:21,774 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2025-02-05 20:12:21,774 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-02-05 20:12:21,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:12:21,879 INFO L93 Difference]: Finished difference Result 2227 states and 2901 transitions. [2025-02-05 20:12:21,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-05 20:12:21,879 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-02-05 20:12:21,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:12:21,881 INFO L225 Difference]: With dead ends: 2227 [2025-02-05 20:12:21,882 INFO L226 Difference]: Without dead ends: 1857 [2025-02-05 20:12:21,882 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-02-05 20:12:21,882 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-02-05 20:12:21,883 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-02-05 20:12:21,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1857 states. [2025-02-05 20:12:21,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1857 to 1801. [2025-02-05 20:12:21,892 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-02-05 20:12:21,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1801 states to 1801 states and 2309 transitions. [2025-02-05 20:12:21,894 INFO L78 Accepts]: Start accepts. Automaton has 1801 states and 2309 transitions. Word has length 58 [2025-02-05 20:12:21,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:12:21,895 INFO L471 AbstractCegarLoop]: Abstraction has 1801 states and 2309 transitions. [2025-02-05 20:12:21,895 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-02-05 20:12:21,895 INFO L276 IsEmpty]: Start isEmpty. Operand 1801 states and 2309 transitions. [2025-02-05 20:12:21,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-02-05 20:12:21,897 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:12:21,897 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-02-05 20:12:21,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-02-05 20:12:21,897 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:12:21,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:12:21,897 INFO L85 PathProgramCache]: Analyzing trace with hash -1840834353, now seen corresponding path program 1 times [2025-02-05 20:12:21,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:12:21,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760893290] [2025-02-05 20:12:21,897 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:12:21,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:12:21,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-02-05 20:12:21,930 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-02-05 20:12:21,930 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:12:21,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:12:22,146 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:12:22,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:12:22,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760893290] [2025-02-05 20:12:22,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760893290] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 20:12:22,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [300918361] [2025-02-05 20:12:22,147 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:12:22,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:12:22,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:12:22,149 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 20:12:22,157 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-05 20:12:22,365 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-02-05 20:12:22,422 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-02-05 20:12:22,422 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:12:22,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:12:22,425 INFO L256 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-02-05 20:12:22,429 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 20:12:22,782 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:12:22,783 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 20:12:22,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [300918361] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:12:22,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 20:12:22,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [7] total 14 [2025-02-05 20:12:22,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703792921] [2025-02-05 20:12:22,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:12:22,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 20:12:22,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:12:22,784 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 20:12:22,784 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2025-02-05 20:12:22,784 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-02-05 20:12:23,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:12:23,152 INFO L93 Difference]: Finished difference Result 3123 states and 4039 transitions. [2025-02-05 20:12:23,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 20:12:23,153 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-02-05 20:12:23,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:12:23,156 INFO L225 Difference]: With dead ends: 3123 [2025-02-05 20:12:23,156 INFO L226 Difference]: Without dead ends: 2771 [2025-02-05 20:12:23,157 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2025-02-05 20:12:23,158 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 159 mSDsluCounter, 594 mSDsCounter, 0 mSdLazyCounter, 636 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.3s IncrementalHoareTripleChecker+Time [2025-02-05 20:12:23,158 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.3s Time] [2025-02-05 20:12:23,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2771 states. [2025-02-05 20:12:23,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2771 to 2610. [2025-02-05 20:12:23,175 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-02-05 20:12:23,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2610 states to 2610 states and 3346 transitions. [2025-02-05 20:12:23,177 INFO L78 Accepts]: Start accepts. Automaton has 2610 states and 3346 transitions. Word has length 58 [2025-02-05 20:12:23,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:12:23,177 INFO L471 AbstractCegarLoop]: Abstraction has 2610 states and 3346 transitions. [2025-02-05 20:12:23,177 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-02-05 20:12:23,178 INFO L276 IsEmpty]: Start isEmpty. Operand 2610 states and 3346 transitions. [2025-02-05 20:12:23,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-02-05 20:12:23,180 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:12:23,180 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-02-05 20:12:23,189 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-05 20:12:23,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:12:23,380 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:12:23,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:12:23,381 INFO L85 PathProgramCache]: Analyzing trace with hash 1670693499, now seen corresponding path program 1 times [2025-02-05 20:12:23,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:12:23,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703508095] [2025-02-05 20:12:23,381 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:12:23,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:12:23,396 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-02-05 20:12:23,402 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-02-05 20:12:23,403 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:12:23,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:12:23,812 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:12:23,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:12:23,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703508095] [2025-02-05 20:12:23,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703508095] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:12:23,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:12:23,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2025-02-05 20:12:23,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725521786] [2025-02-05 20:12:23,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:12:23,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-02-05 20:12:23,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:12:23,813 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-02-05 20:12:23,813 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=329, Unknown=0, NotChecked=0, Total=380 [2025-02-05 20:12:23,813 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-02-05 20:12:24,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:12:24,036 INFO L93 Difference]: Finished difference Result 3537 states and 4604 transitions. [2025-02-05 20:12:24,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-02-05 20:12:24,036 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-02-05 20:12:24,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:12:24,040 INFO L225 Difference]: With dead ends: 3537 [2025-02-05 20:12:24,040 INFO L226 Difference]: Without dead ends: 3006 [2025-02-05 20:12:24,041 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-02-05 20:12:24,042 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 74 mSDsluCounter, 1070 mSDsCounter, 0 mSdLazyCounter, 580 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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-02-05 20:12:24,042 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-02-05 20:12:24,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3006 states. [2025-02-05 20:12:24,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3006 to 2792. [2025-02-05 20:12:24,062 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-02-05 20:12:24,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2792 states to 2792 states and 3561 transitions. [2025-02-05 20:12:24,066 INFO L78 Accepts]: Start accepts. Automaton has 2792 states and 3561 transitions. Word has length 59 [2025-02-05 20:12:24,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:12:24,066 INFO L471 AbstractCegarLoop]: Abstraction has 2792 states and 3561 transitions. [2025-02-05 20:12:24,066 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-02-05 20:12:24,066 INFO L276 IsEmpty]: Start isEmpty. Operand 2792 states and 3561 transitions. [2025-02-05 20:12:24,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-02-05 20:12:24,070 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:12:24,070 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-02-05 20:12:24,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2025-02-05 20:12:24,070 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:12:24,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:12:24,070 INFO L85 PathProgramCache]: Analyzing trace with hash 1214031720, now seen corresponding path program 1 times [2025-02-05 20:12:24,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:12:24,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168119] [2025-02-05 20:12:24,070 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:12:24,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:12:24,086 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-02-05 20:12:24,101 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-02-05 20:12:24,101 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:12:24,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:12:24,813 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:12:24,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:12:24,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168119] [2025-02-05 20:12:24,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168119] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:12:24,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:12:24,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2025-02-05 20:12:24,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595171659] [2025-02-05 20:12:24,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:12:24,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-02-05 20:12:24,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:12:24,814 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-02-05 20:12:24,814 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=362, Unknown=0, NotChecked=0, Total=420 [2025-02-05 20:12:24,815 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-02-05 20:12:25,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:12:25,151 INFO L93 Difference]: Finished difference Result 3490 states and 4530 transitions. [2025-02-05 20:12:25,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-02-05 20:12:25,152 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-02-05 20:12:25,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:12:25,157 INFO L225 Difference]: With dead ends: 3490 [2025-02-05 20:12:25,157 INFO L226 Difference]: Without dead ends: 2968 [2025-02-05 20:12:25,158 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-02-05 20:12:25,161 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 87 mSDsluCounter, 911 mSDsCounter, 0 mSdLazyCounter, 681 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.3s IncrementalHoareTripleChecker+Time [2025-02-05 20:12:25,161 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.3s Time] [2025-02-05 20:12:25,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2968 states. [2025-02-05 20:12:25,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2968 to 2768. [2025-02-05 20:12:25,184 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-02-05 20:12:25,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2768 states to 2768 states and 3528 transitions. [2025-02-05 20:12:25,187 INFO L78 Accepts]: Start accepts. Automaton has 2768 states and 3528 transitions. Word has length 59 [2025-02-05 20:12:25,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:12:25,188 INFO L471 AbstractCegarLoop]: Abstraction has 2768 states and 3528 transitions. [2025-02-05 20:12:25,188 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-02-05 20:12:25,188 INFO L276 IsEmpty]: Start isEmpty. Operand 2768 states and 3528 transitions. [2025-02-05 20:12:25,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-02-05 20:12:25,190 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:12:25,191 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-02-05 20:12:25,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2025-02-05 20:12:25,191 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:12:25,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:12:25,191 INFO L85 PathProgramCache]: Analyzing trace with hash 1084093678, now seen corresponding path program 1 times [2025-02-05 20:12:25,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:12:25,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184409624] [2025-02-05 20:12:25,191 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:12:25,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:12:25,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-02-05 20:12:25,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-02-05 20:12:25,223 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:12:25,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:12:25,629 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:12:25,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:12:25,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184409624] [2025-02-05 20:12:25,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184409624] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:12:25,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:12:25,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-05 20:12:25,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733079616] [2025-02-05 20:12:25,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:12:25,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-05 20:12:25,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:12:25,631 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-05 20:12:25,631 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2025-02-05 20:12:25,631 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-02-05 20:12:25,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:12:25,951 INFO L93 Difference]: Finished difference Result 3511 states and 4579 transitions. [2025-02-05 20:12:25,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 20:12:25,952 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-02-05 20:12:25,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:12:25,957 INFO L225 Difference]: With dead ends: 3511 [2025-02-05 20:12:25,957 INFO L226 Difference]: Without dead ends: 2979 [2025-02-05 20:12:25,958 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-02-05 20:12:25,961 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.3s IncrementalHoareTripleChecker+Time [2025-02-05 20:12:25,961 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.3s Time] [2025-02-05 20:12:25,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2979 states. [2025-02-05 20:12:25,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2979 to 2781. [2025-02-05 20:12:25,985 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-02-05 20:12:25,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2781 states to 2781 states and 3545 transitions. [2025-02-05 20:12:25,988 INFO L78 Accepts]: Start accepts. Automaton has 2781 states and 3545 transitions. Word has length 59 [2025-02-05 20:12:25,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:12:25,988 INFO L471 AbstractCegarLoop]: Abstraction has 2781 states and 3545 transitions. [2025-02-05 20:12:25,988 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-02-05 20:12:25,988 INFO L276 IsEmpty]: Start isEmpty. Operand 2781 states and 3545 transitions. [2025-02-05 20:12:25,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-02-05 20:12:25,991 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:12:25,991 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-02-05 20:12:25,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2025-02-05 20:12:25,992 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:12:25,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:12:25,992 INFO L85 PathProgramCache]: Analyzing trace with hash 911951169, now seen corresponding path program 1 times [2025-02-05 20:12:25,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:12:25,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549731061] [2025-02-05 20:12:25,992 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:12:25,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:12:26,007 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-02-05 20:12:26,025 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-02-05 20:12:26,026 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:12:26,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:12:26,654 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:12:26,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:12:26,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549731061] [2025-02-05 20:12:26,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549731061] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:12:26,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:12:26,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2025-02-05 20:12:26,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010717499] [2025-02-05 20:12:26,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:12:26,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-02-05 20:12:26,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:12:26,656 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-02-05 20:12:26,656 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2025-02-05 20:12:26,656 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-02-05 20:12:27,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:12:27,301 INFO L93 Difference]: Finished difference Result 3491 states and 4548 transitions. [2025-02-05 20:12:27,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-02-05 20:12:27,301 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-02-05 20:12:27,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:12:27,307 INFO L225 Difference]: With dead ends: 3491 [2025-02-05 20:12:27,307 INFO L226 Difference]: Without dead ends: 2956 [2025-02-05 20:12:27,308 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=118, Invalid=584, Unknown=0, NotChecked=0, Total=702 [2025-02-05 20:12:27,309 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 290 mSDsluCounter, 748 mSDsCounter, 0 mSdLazyCounter, 832 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.5s IncrementalHoareTripleChecker+Time [2025-02-05 20:12:27,309 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.5s Time] [2025-02-05 20:12:27,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2956 states. [2025-02-05 20:12:27,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2956 to 2695. [2025-02-05 20:12:27,333 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-02-05 20:12:27,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2695 states to 2695 states and 3447 transitions. [2025-02-05 20:12:27,338 INFO L78 Accepts]: Start accepts. Automaton has 2695 states and 3447 transitions. Word has length 59 [2025-02-05 20:12:27,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:12:27,338 INFO L471 AbstractCegarLoop]: Abstraction has 2695 states and 3447 transitions. [2025-02-05 20:12:27,338 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-02-05 20:12:27,338 INFO L276 IsEmpty]: Start isEmpty. Operand 2695 states and 3447 transitions. [2025-02-05 20:12:27,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-02-05 20:12:27,341 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:12:27,342 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-02-05 20:12:27,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2025-02-05 20:12:27,342 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:12:27,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:12:27,343 INFO L85 PathProgramCache]: Analyzing trace with hash 478165220, now seen corresponding path program 1 times [2025-02-05 20:12:27,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:12:27,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892061274] [2025-02-05 20:12:27,343 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:12:27,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:12:27,373 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-02-05 20:12:27,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-02-05 20:12:27,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:12:27,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:12:27,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-02-05 20:12:27,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:12:27,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892061274] [2025-02-05 20:12:27,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892061274] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:12:27,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:12:27,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 20:12:27,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977498392] [2025-02-05 20:12:27,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:12:27,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 20:12:27,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:12:27,524 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 20:12:27,524 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-05 20:12:27,524 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-02-05 20:12:27,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:12:27,699 INFO L93 Difference]: Finished difference Result 3466 states and 4509 transitions. [2025-02-05 20:12:27,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 20:12:27,699 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-02-05 20:12:27,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:12:27,702 INFO L225 Difference]: With dead ends: 3466 [2025-02-05 20:12:27,702 INFO L226 Difference]: Without dead ends: 2492 [2025-02-05 20:12:27,703 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-02-05 20:12:27,703 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.2s IncrementalHoareTripleChecker+Time [2025-02-05 20:12:27,703 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.2s Time] [2025-02-05 20:12:27,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2492 states. [2025-02-05 20:12:27,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2492 to 2488. [2025-02-05 20:12:27,721 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-02-05 20:12:27,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2488 states to 2488 states and 3183 transitions. [2025-02-05 20:12:27,724 INFO L78 Accepts]: Start accepts. Automaton has 2488 states and 3183 transitions. Word has length 59 [2025-02-05 20:12:27,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:12:27,725 INFO L471 AbstractCegarLoop]: Abstraction has 2488 states and 3183 transitions. [2025-02-05 20:12:27,725 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-02-05 20:12:27,725 INFO L276 IsEmpty]: Start isEmpty. Operand 2488 states and 3183 transitions. [2025-02-05 20:12:27,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-02-05 20:12:27,728 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:12:27,728 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-02-05 20:12:27,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2025-02-05 20:12:27,728 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:12:27,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:12:27,729 INFO L85 PathProgramCache]: Analyzing trace with hash -825867889, now seen corresponding path program 1 times [2025-02-05 20:12:27,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:12:27,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115938431] [2025-02-05 20:12:27,729 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:12:27,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:12:27,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-02-05 20:12:27,770 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-02-05 20:12:27,771 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:12:27,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:12:28,081 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:12:28,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:12:28,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115938431] [2025-02-05 20:12:28,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115938431] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:12:28,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:12:28,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-05 20:12:28,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742195887] [2025-02-05 20:12:28,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:12:28,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-05 20:12:28,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:12:28,082 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-05 20:12:28,082 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-02-05 20:12:28,082 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-02-05 20:12:28,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:12:28,177 INFO L93 Difference]: Finished difference Result 3143 states and 4100 transitions. [2025-02-05 20:12:28,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-05 20:12:28,177 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-02-05 20:12:28,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:12:28,180 INFO L225 Difference]: With dead ends: 3143 [2025-02-05 20:12:28,180 INFO L226 Difference]: Without dead ends: 2450 [2025-02-05 20:12:28,183 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-02-05 20:12:28,183 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-02-05 20:12:28,183 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-02-05 20:12:28,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2450 states. [2025-02-05 20:12:28,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2450 to 2298. [2025-02-05 20:12:28,200 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-02-05 20:12:28,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2298 states to 2298 states and 2904 transitions. [2025-02-05 20:12:28,203 INFO L78 Accepts]: Start accepts. Automaton has 2298 states and 2904 transitions. Word has length 59 [2025-02-05 20:12:28,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:12:28,203 INFO L471 AbstractCegarLoop]: Abstraction has 2298 states and 2904 transitions. [2025-02-05 20:12:28,203 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-02-05 20:12:28,204 INFO L276 IsEmpty]: Start isEmpty. Operand 2298 states and 2904 transitions. [2025-02-05 20:12:28,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-02-05 20:12:28,206 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:12:28,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] [2025-02-05 20:12:28,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2025-02-05 20:12:28,206 INFO L396 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:12:28,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:12:28,206 INFO L85 PathProgramCache]: Analyzing trace with hash 500754996, now seen corresponding path program 1 times [2025-02-05 20:12:28,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:12:28,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722101695] [2025-02-05 20:12:28,207 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:12:28,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:12:28,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-02-05 20:12:28,245 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-02-05 20:12:28,245 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:12:28,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:12:28,594 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:12:28,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:12:28,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722101695] [2025-02-05 20:12:28,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722101695] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:12:28,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:12:28,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-05 20:12:28,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552597736] [2025-02-05 20:12:28,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:12:28,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-05 20:12:28,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:12:28,595 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-05 20:12:28,595 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-02-05 20:12:28,595 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-02-05 20:12:28,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:12:28,735 INFO L93 Difference]: Finished difference Result 2883 states and 3724 transitions. [2025-02-05 20:12:28,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-05 20:12:28,736 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-02-05 20:12:28,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:12:28,740 INFO L225 Difference]: With dead ends: 2883 [2025-02-05 20:12:28,740 INFO L226 Difference]: Without dead ends: 2286 [2025-02-05 20:12:28,741 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-02-05 20:12:28,742 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-02-05 20:12:28,742 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-02-05 20:12:28,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2286 states. [2025-02-05 20:12:28,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2286 to 2116. [2025-02-05 20:12:28,773 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-02-05 20:12:28,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2116 states to 2116 states and 2691 transitions. [2025-02-05 20:12:28,777 INFO L78 Accepts]: Start accepts. Automaton has 2116 states and 2691 transitions. Word has length 59 [2025-02-05 20:12:28,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:12:28,777 INFO L471 AbstractCegarLoop]: Abstraction has 2116 states and 2691 transitions. [2025-02-05 20:12:28,777 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-02-05 20:12:28,777 INFO L276 IsEmpty]: Start isEmpty. Operand 2116 states and 2691 transitions. [2025-02-05 20:12:28,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-02-05 20:12:28,781 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:12:28,781 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-02-05 20:12:28,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2025-02-05 20:12:28,781 INFO L396 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:12:28,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:12:28,782 INFO L85 PathProgramCache]: Analyzing trace with hash 1605793543, now seen corresponding path program 1 times [2025-02-05 20:12:28,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:12:28,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251281972] [2025-02-05 20:12:28,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:12:28,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:12:28,802 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-02-05 20:12:28,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-02-05 20:12:28,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:12:28,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:12:28,954 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:12:28,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:12:28,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251281972] [2025-02-05 20:12:28,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251281972] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:12:28,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:12:28,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 20:12:28,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649333416] [2025-02-05 20:12:28,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:12:28,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 20:12:28,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:12:28,955 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 20:12:28,955 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-05 20:12:28,955 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-02-05 20:12:29,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:12:29,077 INFO L93 Difference]: Finished difference Result 2707 states and 3518 transitions. [2025-02-05 20:12:29,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 20:12:29,077 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-02-05 20:12:29,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:12:29,080 INFO L225 Difference]: With dead ends: 2707 [2025-02-05 20:12:29,080 INFO L226 Difference]: Without dead ends: 2031 [2025-02-05 20:12:29,081 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-02-05 20:12:29,081 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-02-05 20:12:29,082 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-02-05 20:12:29,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2031 states. [2025-02-05 20:12:29,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2031 to 2027. [2025-02-05 20:12:29,097 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-02-05 20:12:29,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2027 states to 2027 states and 2571 transitions. [2025-02-05 20:12:29,099 INFO L78 Accepts]: Start accepts. Automaton has 2027 states and 2571 transitions. Word has length 59 [2025-02-05 20:12:29,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:12:29,099 INFO L471 AbstractCegarLoop]: Abstraction has 2027 states and 2571 transitions. [2025-02-05 20:12:29,099 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-02-05 20:12:29,099 INFO L276 IsEmpty]: Start isEmpty. Operand 2027 states and 2571 transitions. [2025-02-05 20:12:29,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-02-05 20:12:29,101 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:12:29,101 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-02-05 20:12:29,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2025-02-05 20:12:29,102 INFO L396 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:12:29,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:12:29,102 INFO L85 PathProgramCache]: Analyzing trace with hash -600751252, now seen corresponding path program 1 times [2025-02-05 20:12:29,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:12:29,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737853344] [2025-02-05 20:12:29,102 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:12:29,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:12:29,117 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-02-05 20:12:29,135 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-02-05 20:12:29,135 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:12:29,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:12:29,851 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:12:29,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:12:29,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737853344] [2025-02-05 20:12:29,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737853344] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:12:29,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:12:29,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2025-02-05 20:12:29,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540195652] [2025-02-05 20:12:29,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:12:29,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-02-05 20:12:29,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:12:29,852 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-02-05 20:12:29,852 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=354, Unknown=0, NotChecked=0, Total=420 [2025-02-05 20:12:29,852 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-02-05 20:12:30,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:12:30,100 INFO L93 Difference]: Finished difference Result 2708 states and 3499 transitions. [2025-02-05 20:12:30,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-02-05 20:12:30,101 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-02-05 20:12:30,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:12:30,104 INFO L225 Difference]: With dead ends: 2708 [2025-02-05 20:12:30,104 INFO L226 Difference]: Without dead ends: 2204 [2025-02-05 20:12:30,105 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-02-05 20:12:30,105 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-02-05 20:12:30,105 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-02-05 20:12:30,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2204 states. [2025-02-05 20:12:30,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2204 to 2090. [2025-02-05 20:12:30,119 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-02-05 20:12:30,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2090 states to 2090 states and 2647 transitions. [2025-02-05 20:12:30,122 INFO L78 Accepts]: Start accepts. Automaton has 2090 states and 2647 transitions. Word has length 59 [2025-02-05 20:12:30,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:12:30,122 INFO L471 AbstractCegarLoop]: Abstraction has 2090 states and 2647 transitions. [2025-02-05 20:12:30,122 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-02-05 20:12:30,122 INFO L276 IsEmpty]: Start isEmpty. Operand 2090 states and 2647 transitions. [2025-02-05 20:12:30,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-02-05 20:12:30,124 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:12:30,124 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-02-05 20:12:30,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2025-02-05 20:12:30,125 INFO L396 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:12:30,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:12:30,125 INFO L85 PathProgramCache]: Analyzing trace with hash -142314969, now seen corresponding path program 1 times [2025-02-05 20:12:30,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:12:30,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394527404] [2025-02-05 20:12:30,125 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:12:30,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:12:30,140 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-02-05 20:12:30,159 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-02-05 20:12:30,159 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:12:30,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:12:30,443 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:12:30,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:12:30,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394527404] [2025-02-05 20:12:30,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394527404] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:12:30,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:12:30,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 20:12:30,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206946444] [2025-02-05 20:12:30,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:12:30,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 20:12:30,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:12:30,444 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 20:12:30,444 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-02-05 20:12:30,444 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-02-05 20:12:30,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:12:30,612 INFO L93 Difference]: Finished difference Result 3017 states and 3929 transitions. [2025-02-05 20:12:30,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 20:12:30,613 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-02-05 20:12:30,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:12:30,615 INFO L225 Difference]: With dead ends: 3017 [2025-02-05 20:12:30,615 INFO L226 Difference]: Without dead ends: 2513 [2025-02-05 20:12:30,616 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-02-05 20:12:30,616 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-02-05 20:12:30,616 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-02-05 20:12:30,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2513 states. [2025-02-05 20:12:30,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2513 to 2355. [2025-02-05 20:12:30,634 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-02-05 20:12:30,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2355 states to 2355 states and 3013 transitions. [2025-02-05 20:12:30,637 INFO L78 Accepts]: Start accepts. Automaton has 2355 states and 3013 transitions. Word has length 59 [2025-02-05 20:12:30,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:12:30,637 INFO L471 AbstractCegarLoop]: Abstraction has 2355 states and 3013 transitions. [2025-02-05 20:12:30,637 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-02-05 20:12:30,637 INFO L276 IsEmpty]: Start isEmpty. Operand 2355 states and 3013 transitions. [2025-02-05 20:12:30,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-02-05 20:12:30,639 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:12:30,640 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-02-05 20:12:30,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2025-02-05 20:12:30,640 INFO L396 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:12:30,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:12:30,640 INFO L85 PathProgramCache]: Analyzing trace with hash -249230859, now seen corresponding path program 1 times [2025-02-05 20:12:30,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:12:30,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12733149] [2025-02-05 20:12:30,640 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:12:30,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:12:30,657 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-02-05 20:12:30,677 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-02-05 20:12:30,677 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:12:30,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:12:31,415 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:12:31,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:12:31,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12733149] [2025-02-05 20:12:31,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12733149] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:12:31,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:12:31,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2025-02-05 20:12:31,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181333449] [2025-02-05 20:12:31,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:12:31,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-02-05 20:12:31,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:12:31,416 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-02-05 20:12:31,416 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=327, Unknown=0, NotChecked=0, Total=420 [2025-02-05 20:12:31,416 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-02-05 20:12:31,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:12:31,822 INFO L93 Difference]: Finished difference Result 3422 states and 4506 transitions. [2025-02-05 20:12:31,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-02-05 20:12:31,823 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-02-05 20:12:31,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:12:31,825 INFO L225 Difference]: With dead ends: 3422 [2025-02-05 20:12:31,825 INFO L226 Difference]: Without dead ends: 2698 [2025-02-05 20:12:31,826 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-02-05 20:12:31,826 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 340 mSDsluCounter, 1599 mSDsCounter, 0 mSdLazyCounter, 876 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.4s IncrementalHoareTripleChecker+Time [2025-02-05 20:12:31,826 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.4s Time] [2025-02-05 20:12:31,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2698 states. [2025-02-05 20:12:31,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2698 to 2380. [2025-02-05 20:12:31,846 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-02-05 20:12:31,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2380 states to 2380 states and 3053 transitions. [2025-02-05 20:12:31,849 INFO L78 Accepts]: Start accepts. Automaton has 2380 states and 3053 transitions. Word has length 59 [2025-02-05 20:12:31,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:12:31,849 INFO L471 AbstractCegarLoop]: Abstraction has 2380 states and 3053 transitions. [2025-02-05 20:12:31,849 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-02-05 20:12:31,849 INFO L276 IsEmpty]: Start isEmpty. Operand 2380 states and 3053 transitions. [2025-02-05 20:12:31,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-02-05 20:12:31,851 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:12:31,851 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-02-05 20:12:31,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2025-02-05 20:12:31,851 INFO L396 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:12:31,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:12:31,851 INFO L85 PathProgramCache]: Analyzing trace with hash -215178839, now seen corresponding path program 1 times [2025-02-05 20:12:31,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:12:31,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263901718] [2025-02-05 20:12:31,851 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:12:31,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:12:31,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-02-05 20:12:31,870 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-02-05 20:12:31,870 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:12:31,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:12:32,379 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:12:32,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:12:32,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263901718] [2025-02-05 20:12:32,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263901718] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:12:32,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:12:32,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2025-02-05 20:12:32,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236616979] [2025-02-05 20:12:32,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:12:32,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-02-05 20:12:32,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:12:32,380 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-02-05 20:12:32,380 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=354, Unknown=0, NotChecked=0, Total=420 [2025-02-05 20:12:32,380 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-02-05 20:12:32,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:12:32,652 INFO L93 Difference]: Finished difference Result 3248 states and 4279 transitions. [2025-02-05 20:12:32,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-02-05 20:12:32,653 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-02-05 20:12:32,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:12:32,654 INFO L225 Difference]: With dead ends: 3248 [2025-02-05 20:12:32,655 INFO L226 Difference]: Without dead ends: 2485 [2025-02-05 20:12:32,655 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=354, Unknown=0, NotChecked=0, Total=420 [2025-02-05 20:12:32,656 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.3s IncrementalHoareTripleChecker+Time [2025-02-05 20:12:32,656 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.3s Time] [2025-02-05 20:12:32,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2485 states. [2025-02-05 20:12:32,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2485 to 2384. [2025-02-05 20:12:32,670 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-02-05 20:12:32,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2384 states to 2384 states and 3061 transitions. [2025-02-05 20:12:32,673 INFO L78 Accepts]: Start accepts. Automaton has 2384 states and 3061 transitions. Word has length 59 [2025-02-05 20:12:32,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:12:32,673 INFO L471 AbstractCegarLoop]: Abstraction has 2384 states and 3061 transitions. [2025-02-05 20:12:32,673 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-02-05 20:12:32,673 INFO L276 IsEmpty]: Start isEmpty. Operand 2384 states and 3061 transitions. [2025-02-05 20:12:32,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-02-05 20:12:32,676 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:12:32,676 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-02-05 20:12:32,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2025-02-05 20:12:32,677 INFO L396 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:12:32,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:12:32,677 INFO L85 PathProgramCache]: Analyzing trace with hash -290556444, now seen corresponding path program 1 times [2025-02-05 20:12:32,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:12:32,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323951886] [2025-02-05 20:12:32,677 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:12:32,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:12:32,695 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-02-05 20:12:32,709 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-02-05 20:12:32,709 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:12:32,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:12:33,461 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:12:33,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:12:33,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323951886] [2025-02-05 20:12:33,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323951886] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:12:33,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:12:33,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2025-02-05 20:12:33,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408193612] [2025-02-05 20:12:33,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:12:33,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-02-05 20:12:33,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:12:33,462 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-02-05 20:12:33,462 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=327, Unknown=0, NotChecked=0, Total=380 [2025-02-05 20:12:33,462 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-02-05 20:12:33,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:12:33,791 INFO L93 Difference]: Finished difference Result 3219 states and 4236 transitions. [2025-02-05 20:12:33,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-02-05 20:12:33,791 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-02-05 20:12:33,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:12:33,793 INFO L225 Difference]: With dead ends: 3219 [2025-02-05 20:12:33,793 INFO L226 Difference]: Without dead ends: 2456 [2025-02-05 20:12:33,794 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-02-05 20:12:33,794 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 78 mSDsluCounter, 1053 mSDsCounter, 0 mSdLazyCounter, 715 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.3s IncrementalHoareTripleChecker+Time [2025-02-05 20:12:33,794 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.3s Time] [2025-02-05 20:12:33,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2456 states. [2025-02-05 20:12:33,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2456 to 2384. [2025-02-05 20:12:33,810 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-02-05 20:12:33,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2384 states to 2384 states and 3061 transitions. [2025-02-05 20:12:33,812 INFO L78 Accepts]: Start accepts. Automaton has 2384 states and 3061 transitions. Word has length 60 [2025-02-05 20:12:33,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:12:33,812 INFO L471 AbstractCegarLoop]: Abstraction has 2384 states and 3061 transitions. [2025-02-05 20:12:33,812 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-02-05 20:12:33,812 INFO L276 IsEmpty]: Start isEmpty. Operand 2384 states and 3061 transitions. [2025-02-05 20:12:33,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-02-05 20:12:33,814 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:12:33,814 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-02-05 20:12:33,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2025-02-05 20:12:33,814 INFO L396 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:12:33,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:12:33,815 INFO L85 PathProgramCache]: Analyzing trace with hash 950816561, now seen corresponding path program 1 times [2025-02-05 20:12:33,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:12:33,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236555012] [2025-02-05 20:12:33,815 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:12:33,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:12:33,827 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-02-05 20:12:33,838 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-02-05 20:12:33,838 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:12:33,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:12:34,705 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:12:34,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:12:34,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236555012] [2025-02-05 20:12:34,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236555012] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:12:34,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:12:34,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2025-02-05 20:12:34,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439246428] [2025-02-05 20:12:34,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:12:34,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-02-05 20:12:34,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:12:34,705 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-02-05 20:12:34,706 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=362, Unknown=0, NotChecked=0, Total=420 [2025-02-05 20:12:34,706 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-02-05 20:12:35,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:12:35,109 INFO L93 Difference]: Finished difference Result 3341 states and 4398 transitions. [2025-02-05 20:12:35,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-02-05 20:12:35,109 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-02-05 20:12:35,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:12:35,111 INFO L225 Difference]: With dead ends: 3341 [2025-02-05 20:12:35,111 INFO L226 Difference]: Without dead ends: 2578 [2025-02-05 20:12:35,112 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=62, Invalid=400, Unknown=0, NotChecked=0, Total=462 [2025-02-05 20:12:35,112 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.4s IncrementalHoareTripleChecker+Time [2025-02-05 20:12:35,112 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.4s Time] [2025-02-05 20:12:35,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2578 states. [2025-02-05 20:12:35,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2578 to 2378. [2025-02-05 20:12:35,126 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-02-05 20:12:35,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2378 states to 2378 states and 3055 transitions. [2025-02-05 20:12:35,128 INFO L78 Accepts]: Start accepts. Automaton has 2378 states and 3055 transitions. Word has length 60 [2025-02-05 20:12:35,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:12:35,128 INFO L471 AbstractCegarLoop]: Abstraction has 2378 states and 3055 transitions. [2025-02-05 20:12:35,128 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-02-05 20:12:35,128 INFO L276 IsEmpty]: Start isEmpty. Operand 2378 states and 3055 transitions. [2025-02-05 20:12:35,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-02-05 20:12:35,130 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:12:35,130 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-02-05 20:12:35,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2025-02-05 20:12:35,130 INFO L396 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:12:35,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:12:35,131 INFO L85 PathProgramCache]: Analyzing trace with hash 127359844, now seen corresponding path program 1 times [2025-02-05 20:12:35,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:12:35,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090898119] [2025-02-05 20:12:35,131 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:12:35,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:12:35,144 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-02-05 20:12:35,164 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-02-05 20:12:35,164 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:12:35,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:12:35,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-02-05 20:12:35,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:12:35,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090898119] [2025-02-05 20:12:35,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2090898119] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:12:35,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:12:35,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2025-02-05 20:12:35,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699510986] [2025-02-05 20:12:35,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:12:35,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-02-05 20:12:35,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:12:35,587 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-02-05 20:12:35,587 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2025-02-05 20:12:35,587 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-02-05 20:12:35,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:12:35,832 INFO L93 Difference]: Finished difference Result 3274 states and 4317 transitions. [2025-02-05 20:12:35,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-02-05 20:12:35,832 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-02-05 20:12:35,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:12:35,834 INFO L225 Difference]: With dead ends: 3274 [2025-02-05 20:12:35,834 INFO L226 Difference]: Without dead ends: 2503 [2025-02-05 20:12:35,835 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-02-05 20:12:35,836 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-02-05 20:12:35,836 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-02-05 20:12:35,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2503 states. [2025-02-05 20:12:35,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2503 to 2441. [2025-02-05 20:12:35,852 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-02-05 20:12:35,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2441 states to 2441 states and 3138 transitions. [2025-02-05 20:12:35,854 INFO L78 Accepts]: Start accepts. Automaton has 2441 states and 3138 transitions. Word has length 60 [2025-02-05 20:12:35,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:12:35,854 INFO L471 AbstractCegarLoop]: Abstraction has 2441 states and 3138 transitions. [2025-02-05 20:12:35,854 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-02-05 20:12:35,854 INFO L276 IsEmpty]: Start isEmpty. Operand 2441 states and 3138 transitions. [2025-02-05 20:12:35,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-02-05 20:12:35,856 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:12:35,856 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-02-05 20:12:35,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2025-02-05 20:12:35,856 INFO L396 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:12:35,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:12:35,857 INFO L85 PathProgramCache]: Analyzing trace with hash -1076494273, now seen corresponding path program 1 times [2025-02-05 20:12:35,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:12:35,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301866103] [2025-02-05 20:12:35,857 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:12:35,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:12:35,869 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-02-05 20:12:35,881 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-02-05 20:12:35,881 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:12:35,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:12:36,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-02-05 20:12:36,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:12:36,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301866103] [2025-02-05 20:12:36,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301866103] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:12:36,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:12:36,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2025-02-05 20:12:36,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416865429] [2025-02-05 20:12:36,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:12:36,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-02-05 20:12:36,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:12:36,439 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-02-05 20:12:36,439 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2025-02-05 20:12:36,439 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-02-05 20:12:36,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:12:36,728 INFO L93 Difference]: Finished difference Result 3238 states and 4268 transitions. [2025-02-05 20:12:36,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-02-05 20:12:36,729 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-02-05 20:12:36,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:12:36,731 INFO L225 Difference]: With dead ends: 3238 [2025-02-05 20:12:36,731 INFO L226 Difference]: Without dead ends: 2475 [2025-02-05 20:12:36,732 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2025-02-05 20:12:36,733 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.3s IncrementalHoareTripleChecker+Time [2025-02-05 20:12:36,733 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.3s Time] [2025-02-05 20:12:36,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2475 states. [2025-02-05 20:12:36,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2475 to 2427. [2025-02-05 20:12:36,757 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-02-05 20:12:36,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2427 states to 2427 states and 3123 transitions. [2025-02-05 20:12:36,760 INFO L78 Accepts]: Start accepts. Automaton has 2427 states and 3123 transitions. Word has length 60 [2025-02-05 20:12:36,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:12:36,760 INFO L471 AbstractCegarLoop]: Abstraction has 2427 states and 3123 transitions. [2025-02-05 20:12:36,760 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-02-05 20:12:36,760 INFO L276 IsEmpty]: Start isEmpty. Operand 2427 states and 3123 transitions. [2025-02-05 20:12:36,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-02-05 20:12:36,762 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:12:36,762 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-02-05 20:12:36,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2025-02-05 20:12:36,763 INFO L396 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:12:36,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:12:36,763 INFO L85 PathProgramCache]: Analyzing trace with hash 1281840220, now seen corresponding path program 1 times [2025-02-05 20:12:36,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:12:36,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154769641] [2025-02-05 20:12:36,763 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:12:36,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:12:36,782 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-02-05 20:12:36,799 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-02-05 20:12:36,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:12:36,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:12:37,467 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:12:37,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:12:37,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154769641] [2025-02-05 20:12:37,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1154769641] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:12:37,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:12:37,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2025-02-05 20:12:37,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819569282] [2025-02-05 20:12:37,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:12:37,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-02-05 20:12:37,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:12:37,470 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-02-05 20:12:37,470 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=400, Unknown=0, NotChecked=0, Total=462 [2025-02-05 20:12:37,470 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-02-05 20:12:37,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:12:37,756 INFO L93 Difference]: Finished difference Result 3248 states and 4287 transitions. [2025-02-05 20:12:37,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-02-05 20:12:37,757 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-02-05 20:12:37,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:12:37,759 INFO L225 Difference]: With dead ends: 3248 [2025-02-05 20:12:37,759 INFO L226 Difference]: Without dead ends: 2485 [2025-02-05 20:12:37,760 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=400, Unknown=0, NotChecked=0, Total=462 [2025-02-05 20:12:37,760 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.3s IncrementalHoareTripleChecker+Time [2025-02-05 20:12:37,760 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.3s Time] [2025-02-05 20:12:37,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2485 states. [2025-02-05 20:12:37,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2485 to 2434. [2025-02-05 20:12:37,774 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-02-05 20:12:37,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2434 states to 2434 states and 3132 transitions. [2025-02-05 20:12:37,775 INFO L78 Accepts]: Start accepts. Automaton has 2434 states and 3132 transitions. Word has length 60 [2025-02-05 20:12:37,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:12:37,775 INFO L471 AbstractCegarLoop]: Abstraction has 2434 states and 3132 transitions. [2025-02-05 20:12:37,776 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-02-05 20:12:37,776 INFO L276 IsEmpty]: Start isEmpty. Operand 2434 states and 3132 transitions. [2025-02-05 20:12:37,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-02-05 20:12:37,777 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:12:37,777 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-02-05 20:12:37,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2025-02-05 20:12:37,777 INFO L396 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:12:37,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:12:37,778 INFO L85 PathProgramCache]: Analyzing trace with hash -364321389, now seen corresponding path program 1 times [2025-02-05 20:12:37,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:12:37,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468986874] [2025-02-05 20:12:37,778 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:12:37,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:12:37,791 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-02-05 20:12:37,805 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-02-05 20:12:37,805 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:12:37,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:12:38,224 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:12:38,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:12:38,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468986874] [2025-02-05 20:12:38,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468986874] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:12:38,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:12:38,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2025-02-05 20:12:38,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772797746] [2025-02-05 20:12:38,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:12:38,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-02-05 20:12:38,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:12:38,225 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-02-05 20:12:38,225 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2025-02-05 20:12:38,225 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-02-05 20:12:38,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:12:38,468 INFO L93 Difference]: Finished difference Result 3376 states and 4439 transitions. [2025-02-05 20:12:38,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-02-05 20:12:38,469 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-02-05 20:12:38,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:12:38,471 INFO L225 Difference]: With dead ends: 3376 [2025-02-05 20:12:38,471 INFO L226 Difference]: Without dead ends: 2605 [2025-02-05 20:12:38,472 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-02-05 20:12:38,472 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 72 mSDsluCounter, 985 mSDsCounter, 0 mSdLazyCounter, 498 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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-02-05 20:12:38,472 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-02-05 20:12:38,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2605 states. [2025-02-05 20:12:38,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2605 to 2406. [2025-02-05 20:12:38,490 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-02-05 20:12:38,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2406 states to 2406 states and 3104 transitions. [2025-02-05 20:12:38,493 INFO L78 Accepts]: Start accepts. Automaton has 2406 states and 3104 transitions. Word has length 60 [2025-02-05 20:12:38,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:12:38,493 INFO L471 AbstractCegarLoop]: Abstraction has 2406 states and 3104 transitions. [2025-02-05 20:12:38,493 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-02-05 20:12:38,493 INFO L276 IsEmpty]: Start isEmpty. Operand 2406 states and 3104 transitions. [2025-02-05 20:12:38,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-02-05 20:12:38,494 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:12:38,495 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-02-05 20:12:38,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2025-02-05 20:12:38,495 INFO L396 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:12:38,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:12:38,495 INFO L85 PathProgramCache]: Analyzing trace with hash -536463898, now seen corresponding path program 1 times [2025-02-05 20:12:38,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:12:38,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335582474] [2025-02-05 20:12:38,495 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:12:38,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:12:38,508 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-02-05 20:12:38,520 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-02-05 20:12:38,520 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:12:38,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:12:39,004 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:12:39,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:12:39,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335582474] [2025-02-05 20:12:39,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335582474] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:12:39,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:12:39,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2025-02-05 20:12:39,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851515530] [2025-02-05 20:12:39,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:12:39,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-02-05 20:12:39,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:12:39,005 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-02-05 20:12:39,005 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=400, Unknown=0, NotChecked=0, Total=462 [2025-02-05 20:12:39,005 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-02-05 20:12:39,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:12:39,211 INFO L93 Difference]: Finished difference Result 3340 states and 4399 transitions. [2025-02-05 20:12:39,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-02-05 20:12:39,211 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-02-05 20:12:39,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:12:39,213 INFO L225 Difference]: With dead ends: 3340 [2025-02-05 20:12:39,213 INFO L226 Difference]: Without dead ends: 2577 [2025-02-05 20:12:39,215 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-02-05 20:12:39,215 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 70 mSDsluCounter, 878 mSDsCounter, 0 mSdLazyCounter, 525 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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-02-05 20:12:39,215 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-02-05 20:12:39,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2577 states. [2025-02-05 20:12:39,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2577 to 2406. [2025-02-05 20:12:39,229 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-02-05 20:12:39,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2406 states to 2406 states and 3104 transitions. [2025-02-05 20:12:39,231 INFO L78 Accepts]: Start accepts. Automaton has 2406 states and 3104 transitions. Word has length 60 [2025-02-05 20:12:39,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:12:39,231 INFO L471 AbstractCegarLoop]: Abstraction has 2406 states and 3104 transitions. [2025-02-05 20:12:39,231 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-02-05 20:12:39,231 INFO L276 IsEmpty]: Start isEmpty. Operand 2406 states and 3104 transitions. [2025-02-05 20:12:39,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-02-05 20:12:39,232 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:12:39,232 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-02-05 20:12:39,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2025-02-05 20:12:39,232 INFO L396 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:12:39,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:12:39,233 INFO L85 PathProgramCache]: Analyzing trace with hash 949090798, now seen corresponding path program 1 times [2025-02-05 20:12:39,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:12:39,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872560528] [2025-02-05 20:12:39,233 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:12:39,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:12:39,245 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-02-05 20:12:39,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-02-05 20:12:39,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:12:39,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:12:39,707 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:12:39,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:12:39,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872560528] [2025-02-05 20:12:39,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872560528] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:12:39,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:12:39,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-02-05 20:12:39,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19626166] [2025-02-05 20:12:39,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:12:39,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-02-05 20:12:39,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:12:39,708 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-02-05 20:12:39,708 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2025-02-05 20:12:39,708 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-02-05 20:12:40,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:12:40,093 INFO L93 Difference]: Finished difference Result 4295 states and 5690 transitions. [2025-02-05 20:12:40,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-02-05 20:12:40,093 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-02-05 20:12:40,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:12:40,096 INFO L225 Difference]: With dead ends: 4295 [2025-02-05 20:12:40,096 INFO L226 Difference]: Without dead ends: 3529 [2025-02-05 20:12:40,097 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=468, Unknown=0, NotChecked=0, Total=552 [2025-02-05 20:12:40,097 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 219 mSDsluCounter, 992 mSDsCounter, 0 mSdLazyCounter, 809 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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-02-05 20:12:40,097 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-02-05 20:12:40,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3529 states. [2025-02-05 20:12:40,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3529 to 2927. [2025-02-05 20:12:40,114 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-02-05 20:12:40,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2927 states to 2927 states and 3797 transitions. [2025-02-05 20:12:40,117 INFO L78 Accepts]: Start accepts. Automaton has 2927 states and 3797 transitions. Word has length 60 [2025-02-05 20:12:40,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:12:40,117 INFO L471 AbstractCegarLoop]: Abstraction has 2927 states and 3797 transitions. [2025-02-05 20:12:40,117 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-02-05 20:12:40,117 INFO L276 IsEmpty]: Start isEmpty. Operand 2927 states and 3797 transitions. [2025-02-05 20:12:40,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-02-05 20:12:40,119 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:12:40,119 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-02-05 20:12:40,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2025-02-05 20:12:40,119 INFO L396 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:12:40,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:12:40,120 INFO L85 PathProgramCache]: Analyzing trace with hash 117746771, now seen corresponding path program 1 times [2025-02-05 20:12:40,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:12:40,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816013019] [2025-02-05 20:12:40,120 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:12:40,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:12:40,131 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-02-05 20:12:40,141 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-02-05 20:12:40,141 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:12:40,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:12:40,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-02-05 20:12:40,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:12:40,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816013019] [2025-02-05 20:12:40,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816013019] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:12:40,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:12:40,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2025-02-05 20:12:40,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145888023] [2025-02-05 20:12:40,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:12:40,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-02-05 20:12:40,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:12:40,866 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-02-05 20:12:40,867 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=448, Unknown=0, NotChecked=0, Total=506 [2025-02-05 20:12:40,867 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-02-05 20:12:41,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:12:41,270 INFO L93 Difference]: Finished difference Result 4117 states and 5449 transitions. [2025-02-05 20:12:41,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-02-05 20:12:41,271 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-02-05 20:12:41,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:12:41,273 INFO L225 Difference]: With dead ends: 4117 [2025-02-05 20:12:41,273 INFO L226 Difference]: Without dead ends: 3128 [2025-02-05 20:12:41,274 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=62, Invalid=490, Unknown=0, NotChecked=0, Total=552 [2025-02-05 20:12:41,275 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-02-05 20:12:41,275 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-02-05 20:12:41,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3128 states. [2025-02-05 20:12:41,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3128 to 2963. [2025-02-05 20:12:41,291 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-02-05 20:12:41,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2963 states to 2963 states and 3837 transitions. [2025-02-05 20:12:41,293 INFO L78 Accepts]: Start accepts. Automaton has 2963 states and 3837 transitions. Word has length 60 [2025-02-05 20:12:41,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:12:41,294 INFO L471 AbstractCegarLoop]: Abstraction has 2963 states and 3837 transitions. [2025-02-05 20:12:41,294 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-02-05 20:12:41,294 INFO L276 IsEmpty]: Start isEmpty. Operand 2963 states and 3837 transitions. [2025-02-05 20:12:41,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-02-05 20:12:41,295 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:12:41,295 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-02-05 20:12:41,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2025-02-05 20:12:41,296 INFO L396 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:12:41,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:12:41,296 INFO L85 PathProgramCache]: Analyzing trace with hash 1359119776, now seen corresponding path program 1 times [2025-02-05 20:12:41,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:12:41,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518921725] [2025-02-05 20:12:41,296 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:12:41,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:12:41,312 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-02-05 20:12:41,326 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-02-05 20:12:41,326 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:12:41,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:12:42,071 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:12:42,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:12:42,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518921725] [2025-02-05 20:12:42,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518921725] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:12:42,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:12:42,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2025-02-05 20:12:42,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448521795] [2025-02-05 20:12:42,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:12:42,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-02-05 20:12:42,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:12:42,072 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-02-05 20:12:42,073 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=406, Unknown=0, NotChecked=0, Total=462 [2025-02-05 20:12:42,073 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-02-05 20:12:42,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:12:42,547 INFO L93 Difference]: Finished difference Result 4345 states and 5769 transitions. [2025-02-05 20:12:42,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-02-05 20:12:42,548 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-02-05 20:12:42,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:12:42,550 INFO L225 Difference]: With dead ends: 4345 [2025-02-05 20:12:42,550 INFO L226 Difference]: Without dead ends: 3354 [2025-02-05 20:12:42,552 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=60, Invalid=446, Unknown=0, NotChecked=0, Total=506 [2025-02-05 20:12:42,552 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 82 mSDsluCounter, 1512 mSDsCounter, 0 mSdLazyCounter, 1116 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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-02-05 20:12:42,552 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-02-05 20:12:42,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3354 states. [2025-02-05 20:12:42,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3354 to 3103. [2025-02-05 20:12:42,579 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-02-05 20:12:42,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3103 states to 3103 states and 4022 transitions. [2025-02-05 20:12:42,584 INFO L78 Accepts]: Start accepts. Automaton has 3103 states and 4022 transitions. Word has length 60 [2025-02-05 20:12:42,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:12:42,585 INFO L471 AbstractCegarLoop]: Abstraction has 3103 states and 4022 transitions. [2025-02-05 20:12:42,585 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-02-05 20:12:42,585 INFO L276 IsEmpty]: Start isEmpty. Operand 3103 states and 4022 transitions. [2025-02-05 20:12:42,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-02-05 20:12:42,588 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:12:42,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] [2025-02-05 20:12:42,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2025-02-05 20:12:42,588 INFO L396 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:12:42,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:12:42,588 INFO L85 PathProgramCache]: Analyzing trace with hash -960161182, now seen corresponding path program 1 times [2025-02-05 20:12:42,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:12:42,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888994767] [2025-02-05 20:12:42,589 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:12:42,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:12:42,618 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-02-05 20:12:42,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-02-05 20:12:42,631 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:12:42,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:12:43,204 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:12:43,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:12:43,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888994767] [2025-02-05 20:12:43,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888994767] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:12:43,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:12:43,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2025-02-05 20:12:43,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731399785] [2025-02-05 20:12:43,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:12:43,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-02-05 20:12:43,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:12:43,205 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-02-05 20:12:43,205 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=400, Unknown=0, NotChecked=0, Total=462 [2025-02-05 20:12:43,206 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-02-05 20:12:43,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:12:43,490 INFO L93 Difference]: Finished difference Result 4186 states and 5550 transitions. [2025-02-05 20:12:43,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-02-05 20:12:43,490 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-02-05 20:12:43,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:12:43,492 INFO L225 Difference]: With dead ends: 4186 [2025-02-05 20:12:43,493 INFO L226 Difference]: Without dead ends: 3197 [2025-02-05 20:12:43,494 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=400, Unknown=0, NotChecked=0, Total=462 [2025-02-05 20:12:43,494 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.3s IncrementalHoareTripleChecker+Time [2025-02-05 20:12:43,494 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.3s Time] [2025-02-05 20:12:43,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3197 states. [2025-02-05 20:12:43,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3197 to 3098. [2025-02-05 20:12:43,523 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-02-05 20:12:43,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3098 states to 3098 states and 4017 transitions. [2025-02-05 20:12:43,526 INFO L78 Accepts]: Start accepts. Automaton has 3098 states and 4017 transitions. Word has length 60 [2025-02-05 20:12:43,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:12:43,526 INFO L471 AbstractCegarLoop]: Abstraction has 3098 states and 4017 transitions. [2025-02-05 20:12:43,526 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-02-05 20:12:43,526 INFO L276 IsEmpty]: Start isEmpty. Operand 3098 states and 4017 transitions. [2025-02-05 20:12:43,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-02-05 20:12:43,528 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:12:43,528 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-02-05 20:12:43,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2025-02-05 20:12:43,528 INFO L396 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:12:43,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:12:43,528 INFO L85 PathProgramCache]: Analyzing trace with hash -486341525, now seen corresponding path program 1 times [2025-02-05 20:12:43,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:12:43,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958021365] [2025-02-05 20:12:43,529 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:12:43,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:12:43,543 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-02-05 20:12:43,555 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-02-05 20:12:43,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:12:43,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:12:44,022 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:12:44,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:12:44,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958021365] [2025-02-05 20:12:44,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958021365] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:12:44,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:12:44,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2025-02-05 20:12:44,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810580931] [2025-02-05 20:12:44,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:12:44,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-02-05 20:12:44,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:12:44,023 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-02-05 20:12:44,023 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=332, Unknown=0, NotChecked=0, Total=380 [2025-02-05 20:12:44,023 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-02-05 20:12:44,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:12:44,254 INFO L93 Difference]: Finished difference Result 4202 states and 5578 transitions. [2025-02-05 20:12:44,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-02-05 20:12:44,254 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-02-05 20:12:44,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:12:44,256 INFO L225 Difference]: With dead ends: 4202 [2025-02-05 20:12:44,256 INFO L226 Difference]: Without dead ends: 3049 [2025-02-05 20:12:44,257 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-02-05 20:12:44,257 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 76 mSDsluCounter, 1075 mSDsCounter, 0 mSdLazyCounter, 603 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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-02-05 20:12:44,258 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-02-05 20:12:44,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3049 states. [2025-02-05 20:12:44,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3049 to 2878. [2025-02-05 20:12:44,279 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-02-05 20:12:44,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2878 states to 2878 states and 3736 transitions. [2025-02-05 20:12:44,283 INFO L78 Accepts]: Start accepts. Automaton has 2878 states and 3736 transitions. Word has length 60 [2025-02-05 20:12:44,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:12:44,283 INFO L471 AbstractCegarLoop]: Abstraction has 2878 states and 3736 transitions. [2025-02-05 20:12:44,283 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-02-05 20:12:44,283 INFO L276 IsEmpty]: Start isEmpty. Operand 2878 states and 3736 transitions. [2025-02-05 20:12:44,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-02-05 20:12:44,285 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:12:44,286 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-02-05 20:12:44,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2025-02-05 20:12:44,286 INFO L396 AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:12:44,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:12:44,286 INFO L85 PathProgramCache]: Analyzing trace with hash 1583508649, now seen corresponding path program 1 times [2025-02-05 20:12:44,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:12:44,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560005165] [2025-02-05 20:12:44,287 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:12:44,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:12:44,310 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-02-05 20:12:44,333 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-02-05 20:12:44,334 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:12:44,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:12:44,601 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:12:44,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:12:44,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560005165] [2025-02-05 20:12:44,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560005165] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 20:12:44,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [693327593] [2025-02-05 20:12:44,602 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:12:44,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:12:44,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:12:44,604 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 20:12:44,604 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-05 20:12:44,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-02-05 20:12:44,918 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-02-05 20:12:44,918 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:12:44,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:12:44,920 INFO L256 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 60 conjuncts are in the unsatisfiable core [2025-02-05 20:12:44,923 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 20:12:45,507 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:12:45,507 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 20:12:45,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [693327593] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:12:45,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 20:12:45,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [6] total 17 [2025-02-05 20:12:45,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679541362] [2025-02-05 20:12:45,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:12:45,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-05 20:12:45,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:12:45,508 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-05 20:12:45,508 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2025-02-05 20:12:45,508 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-02-05 20:12:45,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:12:45,934 INFO L93 Difference]: Finished difference Result 4133 states and 5485 transitions. [2025-02-05 20:12:45,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-05 20:12:45,934 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-02-05 20:12:45,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:12:45,937 INFO L225 Difference]: With dead ends: 4133 [2025-02-05 20:12:45,937 INFO L226 Difference]: Without dead ends: 3144 [2025-02-05 20:12:45,938 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-02-05 20:12:45,939 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.4s IncrementalHoareTripleChecker+Time [2025-02-05 20:12:45,939 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.4s Time] [2025-02-05 20:12:45,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3144 states. [2025-02-05 20:12:45,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3144 to 2954. [2025-02-05 20:12:45,957 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-02-05 20:12:45,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2954 states to 2954 states and 3827 transitions. [2025-02-05 20:12:45,959 INFO L78 Accepts]: Start accepts. Automaton has 2954 states and 3827 transitions. Word has length 60 [2025-02-05 20:12:45,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:12:45,960 INFO L471 AbstractCegarLoop]: Abstraction has 2954 states and 3827 transitions. [2025-02-05 20:12:45,960 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-02-05 20:12:45,960 INFO L276 IsEmpty]: Start isEmpty. Operand 2954 states and 3827 transitions. [2025-02-05 20:12:45,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-02-05 20:12:45,961 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:12:45,962 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-02-05 20:12:45,969 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-05 20:12:46,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable66 [2025-02-05 20:12:46,162 INFO L396 AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:12:46,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:12:46,163 INFO L85 PathProgramCache]: Analyzing trace with hash 556390236, now seen corresponding path program 1 times [2025-02-05 20:12:46,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:12:46,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725447222] [2025-02-05 20:12:46,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:12:46,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:12:46,177 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-02-05 20:12:46,192 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-02-05 20:12:46,192 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:12:46,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:12:46,659 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:12:46,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:12:46,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725447222] [2025-02-05 20:12:46,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725447222] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:12:46,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:12:46,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-05 20:12:46,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140844039] [2025-02-05 20:12:46,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:12:46,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 20:12:46,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:12:46,660 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 20:12:46,660 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-02-05 20:12:46,660 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)