./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_lcr.3_overflow.ufo.UNBOUNDED.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded/pals_lcr.3_overflow.ufo.UNBOUNDED.pals.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e5878b7d2af5fd4b66050c0dbed52215fb6ea8477622dc26391a98be7bc7f1ca --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 06:01:09,686 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 06:01:09,740 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 06:01:09,744 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 06:01:09,744 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 06:01:09,757 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 06:01:09,758 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 06:01:09,758 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 06:01:09,758 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 06:01:09,758 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 06:01:09,758 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 06:01:09,758 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 06:01:09,758 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 06:01:09,758 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 06:01:09,758 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 06:01:09,759 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 06:01:09,759 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 06:01:09,759 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 06:01:09,759 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 06:01:09,759 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 06:01:09,759 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 06:01:09,759 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 06:01:09,759 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 06:01:09,759 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 06:01:09,759 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 06:01:09,759 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 06:01:09,759 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 06:01:09,759 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 06:01:09,759 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 06:01:09,759 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 06:01:09,759 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 06:01:09,759 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 06:01:09,759 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 06:01:09,760 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 06:01:09,760 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 06:01:09,760 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 06:01:09,760 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 06:01:09,760 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 06:01:09,760 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 06:01:09,760 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 06:01:09,760 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 06:01:09,760 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 06:01:09,760 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 06:01:09,760 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e5878b7d2af5fd4b66050c0dbed52215fb6ea8477622dc26391a98be7bc7f1ca [2025-03-08 06:01:09,966 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 06:01:09,975 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 06:01:09,977 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 06:01:09,979 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 06:01:09,979 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 06:01:09,980 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_lcr.3_overflow.ufo.UNBOUNDED.pals.c [2025-03-08 06:01:11,175 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ddd000f7/755d15cb870b499caa991e2781057309/FLAG49d7651de [2025-03-08 06:01:11,414 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 06:01:11,419 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.3_overflow.ufo.UNBOUNDED.pals.c [2025-03-08 06:01:11,450 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ddd000f7/755d15cb870b499caa991e2781057309/FLAG49d7651de [2025-03-08 06:01:11,747 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ddd000f7/755d15cb870b499caa991e2781057309 [2025-03-08 06:01:11,748 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 06:01:11,749 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 06:01:11,750 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 06:01:11,751 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 06:01:11,754 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 06:01:11,754 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 06:01:11" (1/1) ... [2025-03-08 06:01:11,755 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d84384e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:01:11, skipping insertion in model container [2025-03-08 06:01:11,755 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 06:01:11" (1/1) ... [2025-03-08 06:01:11,771 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 06:01:11,929 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.3_overflow.ufo.UNBOUNDED.pals.c[6117,6130] [2025-03-08 06:01:11,934 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 06:01:11,942 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 06:01:11,981 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.3_overflow.ufo.UNBOUNDED.pals.c[6117,6130] [2025-03-08 06:01:11,983 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 06:01:11,996 INFO L204 MainTranslator]: Completed translation [2025-03-08 06:01:11,996 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:01:11 WrapperNode [2025-03-08 06:01:11,997 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 06:01:11,998 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 06:01:11,998 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 06:01:11,998 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 06:01:12,003 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:01:11" (1/1) ... [2025-03-08 06:01:12,011 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:01:11" (1/1) ... [2025-03-08 06:01:12,037 INFO L138 Inliner]: procedures = 23, calls = 14, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 217 [2025-03-08 06:01:12,038 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 06:01:12,038 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 06:01:12,039 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 06:01:12,039 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 06:01:12,046 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:01:11" (1/1) ... [2025-03-08 06:01:12,046 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:01:11" (1/1) ... [2025-03-08 06:01:12,052 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:01:11" (1/1) ... [2025-03-08 06:01:12,066 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 06:01:12,066 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:01:11" (1/1) ... [2025-03-08 06:01:12,066 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:01:11" (1/1) ... [2025-03-08 06:01:12,069 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:01:11" (1/1) ... [2025-03-08 06:01:12,070 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:01:11" (1/1) ... [2025-03-08 06:01:12,071 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:01:11" (1/1) ... [2025-03-08 06:01:12,071 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:01:11" (1/1) ... [2025-03-08 06:01:12,073 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 06:01:12,073 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 06:01:12,073 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 06:01:12,073 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 06:01:12,074 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:01:11" (1/1) ... [2025-03-08 06:01:12,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 06:01:12,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:01:12,100 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 06:01:12,104 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 06:01:12,121 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 06:01:12,121 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 06:01:12,121 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 06:01:12,121 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 06:01:12,167 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 06:01:12,168 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 06:01:12,438 INFO L? ?]: Removed 30 outVars from TransFormulas that were not future-live. [2025-03-08 06:01:12,438 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 06:01:12,451 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 06:01:12,451 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 06:01:12,452 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 06:01:12 BoogieIcfgContainer [2025-03-08 06:01:12,452 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 06:01:12,454 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 06:01:12,454 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 06:01:12,458 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 06:01:12,458 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 06:01:11" (1/3) ... [2025-03-08 06:01:12,459 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bb81e4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 06:01:12, skipping insertion in model container [2025-03-08 06:01:12,459 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:01:11" (2/3) ... [2025-03-08 06:01:12,459 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bb81e4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 06:01:12, skipping insertion in model container [2025-03-08 06:01:12,460 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 06:01:12" (3/3) ... [2025-03-08 06:01:12,461 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.3_overflow.ufo.UNBOUNDED.pals.c [2025-03-08 06:01:12,473 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 06:01:12,476 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.3_overflow.ufo.UNBOUNDED.pals.c that has 1 procedures, 55 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 06:01:12,524 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 06:01:12,534 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;@7794f989, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 06:01:12,535 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 06:01:12,537 INFO L276 IsEmpty]: Start isEmpty. Operand has 55 states, 53 states have (on average 1.6981132075471699) internal successors, (90), 54 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:01:12,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-08 06:01:12,542 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:01:12,542 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:01:12,542 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:01:12,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:01:12,547 INFO L85 PathProgramCache]: Analyzing trace with hash 1809136177, now seen corresponding path program 1 times [2025-03-08 06:01:12,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:01:12,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232405444] [2025-03-08 06:01:12,554 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:01:12,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:01:12,613 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-08 06:01:12,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-08 06:01:12,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:01:12,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:01:12,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:01:12,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:01:12,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232405444] [2025-03-08 06:01:12,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232405444] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:01:12,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:01:12,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 06:01:12,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354952360] [2025-03-08 06:01:12,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:01:12,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 06:01:12,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:01:12,717 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 06:01:12,717 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 06:01:12,719 INFO L87 Difference]: Start difference. First operand has 55 states, 53 states have (on average 1.6981132075471699) internal successors, (90), 54 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:01:12,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:01:12,729 INFO L93 Difference]: Finished difference Result 86 states and 140 transitions. [2025-03-08 06:01:12,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 06:01:12,730 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 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 19 [2025-03-08 06:01:12,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:01:12,735 INFO L225 Difference]: With dead ends: 86 [2025-03-08 06:01:12,735 INFO L226 Difference]: Without dead ends: 52 [2025-03-08 06:01:12,737 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 06:01:12,738 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:01:12,739 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:01:12,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2025-03-08 06:01:12,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2025-03-08 06:01:12,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 51 states have (on average 1.6666666666666667) internal successors, (85), 51 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:01:12,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 85 transitions. [2025-03-08 06:01:12,759 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 85 transitions. Word has length 19 [2025-03-08 06:01:12,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:01:12,759 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 85 transitions. [2025-03-08 06:01:12,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:01:12,760 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 85 transitions. [2025-03-08 06:01:12,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-08 06:01:12,760 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:01:12,760 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:01:12,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 06:01:12,760 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:01:12,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:01:12,761 INFO L85 PathProgramCache]: Analyzing trace with hash 1303577552, now seen corresponding path program 1 times [2025-03-08 06:01:12,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:01:12,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061220259] [2025-03-08 06:01:12,761 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:01:12,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:01:12,773 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-08 06:01:12,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-08 06:01:12,791 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:01:12,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:01:12,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:01:12,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:01:12,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061220259] [2025-03-08 06:01:12,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061220259] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:01:12,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:01:12,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:01:12,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659724317] [2025-03-08 06:01:12,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:01:12,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:01:12,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:01:12,933 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:01:12,933 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:01:12,933 INFO L87 Difference]: Start difference. First operand 52 states and 85 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:01:12,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:01:12,981 INFO L93 Difference]: Finished difference Result 86 states and 136 transitions. [2025-03-08 06:01:12,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 06:01:12,981 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 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 19 [2025-03-08 06:01:12,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:01:12,982 INFO L225 Difference]: With dead ends: 86 [2025-03-08 06:01:12,982 INFO L226 Difference]: Without dead ends: 52 [2025-03-08 06:01:12,982 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:01:12,983 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 0 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:01:12,983 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 311 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:01:12,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2025-03-08 06:01:12,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2025-03-08 06:01:12,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 51 states have (on average 1.3529411764705883) internal successors, (69), 51 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:01:12,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 69 transitions. [2025-03-08 06:01:12,988 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 69 transitions. Word has length 19 [2025-03-08 06:01:12,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:01:12,988 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 69 transitions. [2025-03-08 06:01:12,988 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:01:12,988 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 69 transitions. [2025-03-08 06:01:12,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-08 06:01:12,989 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:01:12,989 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:01:12,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 06:01:12,989 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:01:12,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:01:12,990 INFO L85 PathProgramCache]: Analyzing trace with hash 1708524963, now seen corresponding path program 1 times [2025-03-08 06:01:12,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:01:12,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891137357] [2025-03-08 06:01:12,990 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:01:12,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:01:13,007 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-08 06:01:13,019 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-08 06:01:13,020 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:01:13,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:01:13,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:01:13,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:01:13,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891137357] [2025-03-08 06:01:13,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891137357] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:01:13,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:01:13,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:01:13,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247751470] [2025-03-08 06:01:13,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:01:13,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:01:13,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:01:13,118 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:01:13,118 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:01:13,118 INFO L87 Difference]: Start difference. First operand 52 states and 69 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:01:13,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:01:13,228 INFO L93 Difference]: Finished difference Result 232 states and 351 transitions. [2025-03-08 06:01:13,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 06:01:13,228 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 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 34 [2025-03-08 06:01:13,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:01:13,230 INFO L225 Difference]: With dead ends: 232 [2025-03-08 06:01:13,230 INFO L226 Difference]: Without dead ends: 202 [2025-03-08 06:01:13,230 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-08 06:01:13,230 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 272 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:01:13,231 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [272 Valid, 426 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:01:13,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2025-03-08 06:01:13,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 80. [2025-03-08 06:01:13,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 79 states have (on average 1.4303797468354431) internal successors, (113), 79 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:01:13,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 113 transitions. [2025-03-08 06:01:13,240 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 113 transitions. Word has length 34 [2025-03-08 06:01:13,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:01:13,240 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 113 transitions. [2025-03-08 06:01:13,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:01:13,240 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 113 transitions. [2025-03-08 06:01:13,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-08 06:01:13,241 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:01:13,241 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:01:13,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 06:01:13,241 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:01:13,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:01:13,242 INFO L85 PathProgramCache]: Analyzing trace with hash -1959631714, now seen corresponding path program 1 times [2025-03-08 06:01:13,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:01:13,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702470912] [2025-03-08 06:01:13,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:01:13,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:01:13,251 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-08 06:01:13,264 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-08 06:01:13,264 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:01:13,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:01:13,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:01:13,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:01:13,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702470912] [2025-03-08 06:01:13,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702470912] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:01:13,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:01:13,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:01:13,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630043208] [2025-03-08 06:01:13,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:01:13,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:01:13,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:01:13,334 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:01:13,334 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:01:13,335 INFO L87 Difference]: Start difference. First operand 80 states and 113 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:01:13,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:01:13,356 INFO L93 Difference]: Finished difference Result 185 states and 276 transitions. [2025-03-08 06:01:13,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:01:13,360 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 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 36 [2025-03-08 06:01:13,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:01:13,362 INFO L225 Difference]: With dead ends: 185 [2025-03-08 06:01:13,362 INFO L226 Difference]: Without dead ends: 127 [2025-03-08 06:01:13,362 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:01:13,363 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 27 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:01:13,363 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 109 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:01:13,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2025-03-08 06:01:13,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 125. [2025-03-08 06:01:13,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 124 states have (on average 1.4596774193548387) internal successors, (181), 124 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:01:13,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 181 transitions. [2025-03-08 06:01:13,374 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 181 transitions. Word has length 36 [2025-03-08 06:01:13,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:01:13,374 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 181 transitions. [2025-03-08 06:01:13,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:01:13,374 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 181 transitions. [2025-03-08 06:01:13,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-08 06:01:13,375 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:01:13,375 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:01:13,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 06:01:13,375 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:01:13,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:01:13,376 INFO L85 PathProgramCache]: Analyzing trace with hash -1927308479, now seen corresponding path program 1 times [2025-03-08 06:01:13,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:01:13,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480227238] [2025-03-08 06:01:13,376 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:01:13,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:01:13,385 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-08 06:01:13,392 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-08 06:01:13,392 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:01:13,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:01:13,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:01:13,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:01:13,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480227238] [2025-03-08 06:01:13,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480227238] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:01:13,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:01:13,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:01:13,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881325058] [2025-03-08 06:01:13,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:01:13,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:01:13,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:01:13,566 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:01:13,567 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:01:13,567 INFO L87 Difference]: Start difference. First operand 125 states and 181 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:01:13,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:01:13,633 INFO L93 Difference]: Finished difference Result 230 states and 341 transitions. [2025-03-08 06:01:13,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 06:01:13,634 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 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 36 [2025-03-08 06:01:13,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:01:13,635 INFO L225 Difference]: With dead ends: 230 [2025-03-08 06:01:13,635 INFO L226 Difference]: Without dead ends: 127 [2025-03-08 06:01:13,636 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:01:13,637 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 36 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:01:13,637 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 193 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:01:13,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2025-03-08 06:01:13,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 125. [2025-03-08 06:01:13,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 124 states have (on average 1.4435483870967742) internal successors, (179), 124 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:01:13,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 179 transitions. [2025-03-08 06:01:13,647 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 179 transitions. Word has length 36 [2025-03-08 06:01:13,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:01:13,647 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 179 transitions. [2025-03-08 06:01:13,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:01:13,647 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 179 transitions. [2025-03-08 06:01:13,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-08 06:01:13,648 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:01:13,648 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:01:13,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 06:01:13,648 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:01:13,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:01:13,649 INFO L85 PathProgramCache]: Analyzing trace with hash 413517028, now seen corresponding path program 1 times [2025-03-08 06:01:13,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:01:13,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250830000] [2025-03-08 06:01:13,649 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:01:13,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:01:13,664 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-08 06:01:13,679 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-08 06:01:13,680 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:01:13,680 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:01:13,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:01:13,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:01:13,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250830000] [2025-03-08 06:01:13,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250830000] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:01:13,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:01:13,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:01:13,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664395115] [2025-03-08 06:01:13,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:01:13,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:01:13,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:01:13,811 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:01:13,811 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:01:13,812 INFO L87 Difference]: Start difference. First operand 125 states and 179 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:01:13,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:01:13,829 INFO L93 Difference]: Finished difference Result 133 states and 188 transitions. [2025-03-08 06:01:13,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 06:01:13,831 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 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 37 [2025-03-08 06:01:13,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:01:13,832 INFO L225 Difference]: With dead ends: 133 [2025-03-08 06:01:13,832 INFO L226 Difference]: Without dead ends: 131 [2025-03-08 06:01:13,832 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:01:13,833 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 0 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:01:13,833 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 255 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:01:13,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2025-03-08 06:01:13,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2025-03-08 06:01:13,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 130 states have (on average 1.4153846153846155) internal successors, (184), 130 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:01:13,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 184 transitions. [2025-03-08 06:01:13,841 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 184 transitions. Word has length 37 [2025-03-08 06:01:13,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:01:13,841 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 184 transitions. [2025-03-08 06:01:13,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:01:13,841 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 184 transitions. [2025-03-08 06:01:13,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-08 06:01:13,844 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:01:13,844 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:01:13,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 06:01:13,844 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:01:13,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:01:13,845 INFO L85 PathProgramCache]: Analyzing trace with hash -2107304257, now seen corresponding path program 1 times [2025-03-08 06:01:13,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:01:13,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363667426] [2025-03-08 06:01:13,845 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:01:13,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:01:13,854 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-08 06:01:13,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-08 06:01:13,859 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:01:13,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:01:13,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:01:13,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:01:13,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363667426] [2025-03-08 06:01:13,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363667426] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:01:13,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:01:13,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:01:13,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68419998] [2025-03-08 06:01:13,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:01:13,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:01:13,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:01:13,890 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:01:13,890 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:01:13,890 INFO L87 Difference]: Start difference. First operand 131 states and 184 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:01:13,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:01:13,909 INFO L93 Difference]: Finished difference Result 253 states and 365 transitions. [2025-03-08 06:01:13,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:01:13,910 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 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 38 [2025-03-08 06:01:13,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:01:13,910 INFO L225 Difference]: With dead ends: 253 [2025-03-08 06:01:13,911 INFO L226 Difference]: Without dead ends: 189 [2025-03-08 06:01:13,911 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:01:13,912 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 37 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:01:13,912 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 149 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:01:13,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2025-03-08 06:01:13,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 187. [2025-03-08 06:01:13,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 186 states have (on average 1.424731182795699) internal successors, (265), 186 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:01:13,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 265 transitions. [2025-03-08 06:01:13,924 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 265 transitions. Word has length 38 [2025-03-08 06:01:13,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:01:13,924 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 265 transitions. [2025-03-08 06:01:13,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:01:13,924 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 265 transitions. [2025-03-08 06:01:13,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-08 06:01:13,925 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:01:13,925 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:01:13,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 06:01:13,925 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:01:13,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:01:13,927 INFO L85 PathProgramCache]: Analyzing trace with hash -1692128385, now seen corresponding path program 1 times [2025-03-08 06:01:13,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:01:13,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27620356] [2025-03-08 06:01:13,927 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:01:13,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:01:13,936 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-08 06:01:13,943 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-08 06:01:13,943 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:01:13,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:01:13,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:01:13,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:01:13,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27620356] [2025-03-08 06:01:13,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27620356] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:01:13,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:01:13,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:01:13,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774524732] [2025-03-08 06:01:13,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:01:13,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:01:13,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:01:13,970 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:01:13,970 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:01:13,970 INFO L87 Difference]: Start difference. First operand 187 states and 265 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:01:13,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:01:13,982 INFO L93 Difference]: Finished difference Result 489 states and 705 transitions. [2025-03-08 06:01:13,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:01:13,982 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 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 38 [2025-03-08 06:01:13,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:01:13,984 INFO L225 Difference]: With dead ends: 489 [2025-03-08 06:01:13,984 INFO L226 Difference]: Without dead ends: 326 [2025-03-08 06:01:13,984 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:01:13,984 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 35 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:01:13,985 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 155 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:01:13,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2025-03-08 06:01:13,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 324. [2025-03-08 06:01:13,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 324 states, 323 states have (on average 1.414860681114551) internal successors, (457), 323 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:01:14,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 457 transitions. [2025-03-08 06:01:14,000 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 457 transitions. Word has length 38 [2025-03-08 06:01:14,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:01:14,001 INFO L471 AbstractCegarLoop]: Abstraction has 324 states and 457 transitions. [2025-03-08 06:01:14,001 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:01:14,001 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 457 transitions. [2025-03-08 06:01:14,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-08 06:01:14,003 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:01:14,003 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:01:14,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 06:01:14,003 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:01:14,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:01:14,004 INFO L85 PathProgramCache]: Analyzing trace with hash 2116120639, now seen corresponding path program 1 times [2025-03-08 06:01:14,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:01:14,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292420334] [2025-03-08 06:01:14,004 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:01:14,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:01:14,014 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-08 06:01:14,021 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-08 06:01:14,022 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:01:14,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:01:14,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:01:14,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:01:14,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292420334] [2025-03-08 06:01:14,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292420334] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:01:14,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:01:14,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:01:14,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884110091] [2025-03-08 06:01:14,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:01:14,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:01:14,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:01:14,063 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:01:14,063 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:01:14,063 INFO L87 Difference]: Start difference. First operand 324 states and 457 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:01:14,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:01:14,083 INFO L93 Difference]: Finished difference Result 876 states and 1239 transitions. [2025-03-08 06:01:14,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:01:14,084 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 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 38 [2025-03-08 06:01:14,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:01:14,086 INFO L225 Difference]: With dead ends: 876 [2025-03-08 06:01:14,086 INFO L226 Difference]: Without dead ends: 576 [2025-03-08 06:01:14,087 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:01:14,088 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 33 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:01:14,088 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 157 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:01:14,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2025-03-08 06:01:14,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 574. [2025-03-08 06:01:14,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 574 states, 573 states have (on average 1.3839441535776615) internal successors, (793), 573 states have internal predecessors, (793), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:01:14,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 793 transitions. [2025-03-08 06:01:14,104 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 793 transitions. Word has length 38 [2025-03-08 06:01:14,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:01:14,105 INFO L471 AbstractCegarLoop]: Abstraction has 574 states and 793 transitions. [2025-03-08 06:01:14,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:01:14,105 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 793 transitions. [2025-03-08 06:01:14,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-08 06:01:14,106 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:01:14,106 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:01:14,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 06:01:14,106 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:01:14,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:01:14,106 INFO L85 PathProgramCache]: Analyzing trace with hash 447497045, now seen corresponding path program 1 times [2025-03-08 06:01:14,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:01:14,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833152016] [2025-03-08 06:01:14,107 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:01:14,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:01:14,114 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-08 06:01:14,120 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-08 06:01:14,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:01:14,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:01:14,188 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 06:01:14,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:01:14,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833152016] [2025-03-08 06:01:14,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833152016] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:01:14,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:01:14,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:01:14,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918920173] [2025-03-08 06:01:14,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:01:14,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:01:14,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:01:14,190 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:01:14,190 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:01:14,190 INFO L87 Difference]: Start difference. First operand 574 states and 793 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:01:14,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:01:14,279 INFO L93 Difference]: Finished difference Result 2206 states and 3069 transitions. [2025-03-08 06:01:14,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 06:01:14,280 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 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 53 [2025-03-08 06:01:14,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:01:14,286 INFO L225 Difference]: With dead ends: 2206 [2025-03-08 06:01:14,286 INFO L226 Difference]: Without dead ends: 1804 [2025-03-08 06:01:14,287 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-08 06:01:14,287 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 161 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:01:14,288 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 282 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:01:14,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1804 states. [2025-03-08 06:01:14,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1804 to 1050. [2025-03-08 06:01:14,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1050 states, 1049 states have (on average 1.3813155386081983) internal successors, (1449), 1049 states have internal predecessors, (1449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:01:14,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1050 states to 1050 states and 1449 transitions. [2025-03-08 06:01:14,340 INFO L78 Accepts]: Start accepts. Automaton has 1050 states and 1449 transitions. Word has length 53 [2025-03-08 06:01:14,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:01:14,341 INFO L471 AbstractCegarLoop]: Abstraction has 1050 states and 1449 transitions. [2025-03-08 06:01:14,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:01:14,341 INFO L276 IsEmpty]: Start isEmpty. Operand 1050 states and 1449 transitions. [2025-03-08 06:01:14,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-08 06:01:14,342 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:01:14,342 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:01:14,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 06:01:14,342 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:01:14,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:01:14,343 INFO L85 PathProgramCache]: Analyzing trace with hash 862672917, now seen corresponding path program 1 times [2025-03-08 06:01:14,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:01:14,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935721355] [2025-03-08 06:01:14,343 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:01:14,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:01:14,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-08 06:01:14,362 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-08 06:01:14,362 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:01:14,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:01:14,457 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 06:01:14,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:01:14,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935721355] [2025-03-08 06:01:14,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935721355] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:01:14,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:01:14,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:01:14,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059625490] [2025-03-08 06:01:14,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:01:14,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:01:14,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:01:14,460 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:01:14,460 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:01:14,460 INFO L87 Difference]: Start difference. First operand 1050 states and 1449 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:01:14,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:01:14,552 INFO L93 Difference]: Finished difference Result 2754 states and 3829 transitions. [2025-03-08 06:01:14,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 06:01:14,552 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 0 states have call successors, (0), 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 53 [2025-03-08 06:01:14,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:01:14,560 INFO L225 Difference]: With dead ends: 2754 [2025-03-08 06:01:14,560 INFO L226 Difference]: Without dead ends: 2204 [2025-03-08 06:01:14,562 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-08 06:01:14,563 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 161 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:01:14,564 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 279 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:01:14,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2204 states. [2025-03-08 06:01:14,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2204 to 1798. [2025-03-08 06:01:14,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1798 states, 1797 states have (on average 1.3784084585420144) internal successors, (2477), 1797 states have internal predecessors, (2477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:01:14,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1798 states to 1798 states and 2477 transitions. [2025-03-08 06:01:14,636 INFO L78 Accepts]: Start accepts. Automaton has 1798 states and 2477 transitions. Word has length 53 [2025-03-08 06:01:14,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:01:14,636 INFO L471 AbstractCegarLoop]: Abstraction has 1798 states and 2477 transitions. [2025-03-08 06:01:14,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:01:14,636 INFO L276 IsEmpty]: Start isEmpty. Operand 1798 states and 2477 transitions. [2025-03-08 06:01:14,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-08 06:01:14,637 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:01:14,638 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:01:14,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 06:01:14,638 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:01:14,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:01:14,639 INFO L85 PathProgramCache]: Analyzing trace with hash 375954645, now seen corresponding path program 1 times [2025-03-08 06:01:14,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:01:14,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711094263] [2025-03-08 06:01:14,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:01:14,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:01:14,649 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-08 06:01:14,657 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-08 06:01:14,658 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:01:14,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:01:14,729 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-08 06:01:14,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:01:14,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711094263] [2025-03-08 06:01:14,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711094263] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:01:14,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:01:14,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:01:14,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293476888] [2025-03-08 06:01:14,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:01:14,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:01:14,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:01:14,731 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:01:14,732 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:01:14,732 INFO L87 Difference]: Start difference. First operand 1798 states and 2477 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:01:14,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:01:14,839 INFO L93 Difference]: Finished difference Result 3302 states and 4585 transitions. [2025-03-08 06:01:14,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 06:01:14,840 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 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 53 [2025-03-08 06:01:14,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:01:14,850 INFO L225 Difference]: With dead ends: 3302 [2025-03-08 06:01:14,850 INFO L226 Difference]: Without dead ends: 2752 [2025-03-08 06:01:14,853 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-08 06:01:14,853 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 167 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:01:14,853 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 280 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:01:14,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2752 states. [2025-03-08 06:01:14,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2752 to 2346. [2025-03-08 06:01:14,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2346 states, 2345 states have (on average 1.378678038379531) internal successors, (3233), 2345 states have internal predecessors, (3233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:01:14,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2346 states to 2346 states and 3233 transitions. [2025-03-08 06:01:14,935 INFO L78 Accepts]: Start accepts. Automaton has 2346 states and 3233 transitions. Word has length 53 [2025-03-08 06:01:14,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:01:14,935 INFO L471 AbstractCegarLoop]: Abstraction has 2346 states and 3233 transitions. [2025-03-08 06:01:14,935 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:01:14,935 INFO L276 IsEmpty]: Start isEmpty. Operand 2346 states and 3233 transitions. [2025-03-08 06:01:14,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-03-08 06:01:14,937 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:01:14,937 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:01:14,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 06:01:14,937 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:01:14,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:01:14,938 INFO L85 PathProgramCache]: Analyzing trace with hash -1516353032, now seen corresponding path program 1 times [2025-03-08 06:01:14,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:01:14,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785807593] [2025-03-08 06:01:14,938 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:01:14,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:01:14,948 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-08 06:01:14,961 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-08 06:01:14,962 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:01:14,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:01:15,021 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:01:15,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:01:15,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785807593] [2025-03-08 06:01:15,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785807593] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:01:15,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:01:15,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:01:15,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576129175] [2025-03-08 06:01:15,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:01:15,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:01:15,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:01:15,022 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:01:15,022 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:01:15,022 INFO L87 Difference]: Start difference. First operand 2346 states and 3233 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:01:15,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:01:15,078 INFO L93 Difference]: Finished difference Result 4670 states and 6443 transitions. [2025-03-08 06:01:15,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:01:15,079 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-03-08 06:01:15,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:01:15,086 INFO L225 Difference]: With dead ends: 4670 [2025-03-08 06:01:15,086 INFO L226 Difference]: Without dead ends: 2348 [2025-03-08 06:01:15,089 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:01:15,089 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 29 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:01:15,090 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 144 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:01:15,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2348 states. [2025-03-08 06:01:15,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2348 to 2346. [2025-03-08 06:01:15,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2346 states, 2345 states have (on average 1.3573560767590618) internal successors, (3183), 2345 states have internal predecessors, (3183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:01:15,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2346 states to 2346 states and 3183 transitions. [2025-03-08 06:01:15,173 INFO L78 Accepts]: Start accepts. Automaton has 2346 states and 3183 transitions. Word has length 54 [2025-03-08 06:01:15,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:01:15,174 INFO L471 AbstractCegarLoop]: Abstraction has 2346 states and 3183 transitions. [2025-03-08 06:01:15,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:01:15,174 INFO L276 IsEmpty]: Start isEmpty. Operand 2346 states and 3183 transitions. [2025-03-08 06:01:15,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-08 06:01:15,174 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:01:15,175 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:01:15,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 06:01:15,175 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:01:15,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:01:15,175 INFO L85 PathProgramCache]: Analyzing trace with hash 1252661555, now seen corresponding path program 1 times [2025-03-08 06:01:15,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:01:15,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939087061] [2025-03-08 06:01:15,175 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:01:15,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:01:15,183 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-08 06:01:15,189 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-08 06:01:15,190 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:01:15,190 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:01:15,225 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:01:15,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:01:15,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939087061] [2025-03-08 06:01:15,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939087061] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:01:15,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:01:15,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:01:15,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646804473] [2025-03-08 06:01:15,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:01:15,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:01:15,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:01:15,227 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:01:15,227 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:01:15,227 INFO L87 Difference]: Start difference. First operand 2346 states and 3183 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:01:15,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:01:15,255 INFO L93 Difference]: Finished difference Result 3265 states and 4443 transitions. [2025-03-08 06:01:15,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:01:15,255 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2025-03-08 06:01:15,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:01:15,258 INFO L225 Difference]: With dead ends: 3265 [2025-03-08 06:01:15,259 INFO L226 Difference]: Without dead ends: 943 [2025-03-08 06:01:15,261 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:01:15,261 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 23 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:01:15,261 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 141 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:01:15,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 943 states. [2025-03-08 06:01:15,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 943 to 935. [2025-03-08 06:01:15,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 935 states, 934 states have (on average 1.3468950749464668) internal successors, (1258), 934 states have internal predecessors, (1258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:01:15,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 935 states to 935 states and 1258 transitions. [2025-03-08 06:01:15,284 INFO L78 Accepts]: Start accepts. Automaton has 935 states and 1258 transitions. Word has length 55 [2025-03-08 06:01:15,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:01:15,284 INFO L471 AbstractCegarLoop]: Abstraction has 935 states and 1258 transitions. [2025-03-08 06:01:15,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:01:15,284 INFO L276 IsEmpty]: Start isEmpty. Operand 935 states and 1258 transitions. [2025-03-08 06:01:15,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-08 06:01:15,285 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:01:15,285 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:01:15,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 06:01:15,285 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:01:15,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:01:15,285 INFO L85 PathProgramCache]: Analyzing trace with hash -498144001, now seen corresponding path program 1 times [2025-03-08 06:01:15,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:01:15,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113193304] [2025-03-08 06:01:15,286 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:01:15,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:01:15,295 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-08 06:01:15,305 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-08 06:01:15,305 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:01:15,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:01:15,344 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:01:15,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:01:15,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113193304] [2025-03-08 06:01:15,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113193304] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:01:15,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:01:15,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:01:15,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928079605] [2025-03-08 06:01:15,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:01:15,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:01:15,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:01:15,344 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:01:15,345 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:01:15,345 INFO L87 Difference]: Start difference. First operand 935 states and 1258 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:01:15,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:01:15,360 INFO L93 Difference]: Finished difference Result 1389 states and 1872 transitions. [2025-03-08 06:01:15,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:01:15,361 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2025-03-08 06:01:15,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:01:15,362 INFO L225 Difference]: With dead ends: 1389 [2025-03-08 06:01:15,362 INFO L226 Difference]: Without dead ends: 487 [2025-03-08 06:01:15,363 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:01:15,363 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 25 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:01:15,364 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 120 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:01:15,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2025-03-08 06:01:15,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 485. [2025-03-08 06:01:15,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 485 states, 484 states have (on average 1.3161157024793388) internal successors, (637), 484 states have internal predecessors, (637), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:01:15,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 637 transitions. [2025-03-08 06:01:15,376 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 637 transitions. Word has length 56 [2025-03-08 06:01:15,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:01:15,376 INFO L471 AbstractCegarLoop]: Abstraction has 485 states and 637 transitions. [2025-03-08 06:01:15,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:01:15,376 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 637 transitions. [2025-03-08 06:01:15,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-08 06:01:15,377 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:01:15,377 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:01:15,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 06:01:15,377 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:01:15,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:01:15,378 INFO L85 PathProgramCache]: Analyzing trace with hash -1553446618, now seen corresponding path program 1 times [2025-03-08 06:01:15,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:01:15,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231961140] [2025-03-08 06:01:15,378 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:01:15,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:01:15,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-08 06:01:15,401 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-08 06:01:15,401 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:01:15,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:01:15,791 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:01:15,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:01:15,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231961140] [2025-03-08 06:01:15,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231961140] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 06:01:15,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1097988007] [2025-03-08 06:01:15,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:01:15,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:01:15,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:01:15,795 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 06:01:15,797 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 06:01:15,849 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-08 06:01:15,883 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-08 06:01:15,883 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:01:15,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:01:15,888 INFO L256 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-08 06:01:15,892 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 06:01:16,081 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 06:01:16,081 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 06:01:16,241 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 06:01:16,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1097988007] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 06:01:16,241 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 06:01:16,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 4] total 16 [2025-03-08 06:01:16,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118072673] [2025-03-08 06:01:16,242 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 06:01:16,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-08 06:01:16,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:01:16,242 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-08 06:01:16,243 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2025-03-08 06:01:16,243 INFO L87 Difference]: Start difference. First operand 485 states and 637 transitions. Second operand has 16 states, 16 states have (on average 9.875) internal successors, (158), 16 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:01:17,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:01:17,210 INFO L93 Difference]: Finished difference Result 2493 states and 3258 transitions. [2025-03-08 06:01:17,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-03-08 06:01:17,210 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 9.875) internal successors, (158), 16 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2025-03-08 06:01:17,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:01:17,216 INFO L225 Difference]: With dead ends: 2493 [2025-03-08 06:01:17,216 INFO L226 Difference]: Without dead ends: 2041 [2025-03-08 06:01:17,218 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 378 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=362, Invalid=1278, Unknown=0, NotChecked=0, Total=1640 [2025-03-08 06:01:17,218 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 945 mSDsluCounter, 454 mSDsCounter, 0 mSdLazyCounter, 514 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 945 SdHoareTripleChecker+Valid, 515 SdHoareTripleChecker+Invalid, 538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 514 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 06:01:17,218 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [945 Valid, 515 Invalid, 538 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 514 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 06:01:17,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2041 states. [2025-03-08 06:01:17,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2041 to 1923. [2025-03-08 06:01:17,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1923 states, 1922 states have (on average 1.2580645161290323) internal successors, (2418), 1922 states have internal predecessors, (2418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:01:17,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1923 states to 1923 states and 2418 transitions. [2025-03-08 06:01:17,270 INFO L78 Accepts]: Start accepts. Automaton has 1923 states and 2418 transitions. Word has length 58 [2025-03-08 06:01:17,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:01:17,270 INFO L471 AbstractCegarLoop]: Abstraction has 1923 states and 2418 transitions. [2025-03-08 06:01:17,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 9.875) internal successors, (158), 16 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:01:17,270 INFO L276 IsEmpty]: Start isEmpty. Operand 1923 states and 2418 transitions. [2025-03-08 06:01:17,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-03-08 06:01:17,271 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:01:17,271 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:01:17,278 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 06:01:17,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-08 06:01:17,472 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:01:17,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:01:17,473 INFO L85 PathProgramCache]: Analyzing trace with hash -690750486, now seen corresponding path program 1 times [2025-03-08 06:01:17,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:01:17,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703082595] [2025-03-08 06:01:17,473 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:01:17,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:01:17,481 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-08 06:01:17,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-08 06:01:17,503 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:01:17,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:01:17,772 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:01:17,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:01:17,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703082595] [2025-03-08 06:01:17,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703082595] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 06:01:17,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1836476636] [2025-03-08 06:01:17,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:01:17,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:01:17,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:01:17,774 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 06:01:17,776 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 06:01:17,820 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-08 06:01:17,862 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-08 06:01:17,862 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:01:17,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:01:17,867 INFO L256 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-08 06:01:17,869 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 06:01:18,327 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:01:18,328 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 06:01:19,049 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:01:19,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1836476636] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 06:01:19,049 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 06:01:19,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 13] total 30 [2025-03-08 06:01:19,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062107873] [2025-03-08 06:01:19,049 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 06:01:19,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-08 06:01:19,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:01:19,051 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-08 06:01:19,051 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=693, Unknown=0, NotChecked=0, Total=870 [2025-03-08 06:01:19,051 INFO L87 Difference]: Start difference. First operand 1923 states and 2418 transitions. Second operand has 30 states, 30 states have (on average 5.3) internal successors, (159), 30 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:01:19,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:01:19,507 INFO L93 Difference]: Finished difference Result 5260 states and 6658 transitions. [2025-03-08 06:01:19,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-08 06:01:19,507 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 5.3) internal successors, (159), 30 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2025-03-08 06:01:19,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:01:19,517 INFO L225 Difference]: With dead ends: 5260 [2025-03-08 06:01:19,517 INFO L226 Difference]: Without dead ends: 3773 [2025-03-08 06:01:19,519 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 401 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=470, Invalid=1422, Unknown=0, NotChecked=0, Total=1892 [2025-03-08 06:01:19,520 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 700 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 700 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:01:19,520 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [700 Valid, 483 Invalid, 388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 363 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 06:01:19,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3773 states. [2025-03-08 06:01:19,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3773 to 3707. [2025-03-08 06:01:19,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3707 states, 3706 states have (on average 1.2393416082029143) internal successors, (4593), 3706 states have internal predecessors, (4593), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:01:19,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3707 states to 3707 states and 4593 transitions. [2025-03-08 06:01:19,613 INFO L78 Accepts]: Start accepts. Automaton has 3707 states and 4593 transitions. Word has length 59 [2025-03-08 06:01:19,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:01:19,613 INFO L471 AbstractCegarLoop]: Abstraction has 3707 states and 4593 transitions. [2025-03-08 06:01:19,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 5.3) internal successors, (159), 30 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:01:19,613 INFO L276 IsEmpty]: Start isEmpty. Operand 3707 states and 4593 transitions. [2025-03-08 06:01:19,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-03-08 06:01:19,614 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:01:19,614 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:01:19,621 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 06:01:19,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-08 06:01:19,817 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:01:19,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:01:19,818 INFO L85 PathProgramCache]: Analyzing trace with hash 1590986250, now seen corresponding path program 1 times [2025-03-08 06:01:19,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:01:19,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017553940] [2025-03-08 06:01:19,818 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:01:19,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:01:19,826 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-08 06:01:19,841 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-08 06:01:19,841 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:01:19,841 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:01:20,104 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:01:20,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:01:20,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017553940] [2025-03-08 06:01:20,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017553940] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 06:01:20,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1073098743] [2025-03-08 06:01:20,105 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:01:20,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:01:20,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:01:20,107 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 06:01:20,109 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 06:01:20,148 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-08 06:01:20,185 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-08 06:01:20,186 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:01:20,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:01:20,187 INFO L256 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-08 06:01:20,188 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 06:01:20,453 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:01:20,453 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 06:01:20,842 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:01:20,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1073098743] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 06:01:20,843 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 06:01:20,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 21 [2025-03-08 06:01:20,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402612311] [2025-03-08 06:01:20,843 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 06:01:20,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-08 06:01:20,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:01:20,844 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-08 06:01:20,844 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=364, Unknown=0, NotChecked=0, Total=462 [2025-03-08 06:01:20,844 INFO L87 Difference]: Start difference. First operand 3707 states and 4593 transitions. Second operand has 22 states, 22 states have (on average 5.7727272727272725) internal successors, (127), 21 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:01:21,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:01:21,258 INFO L93 Difference]: Finished difference Result 10406 states and 13012 transitions. [2025-03-08 06:01:21,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 06:01:21,259 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 5.7727272727272725) internal successors, (127), 21 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2025-03-08 06:01:21,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:01:21,277 INFO L225 Difference]: With dead ends: 10406 [2025-03-08 06:01:21,277 INFO L226 Difference]: Without dead ends: 7368 [2025-03-08 06:01:21,283 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 104 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=273, Invalid=783, Unknown=0, NotChecked=0, Total=1056 [2025-03-08 06:01:21,284 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 596 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 367 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 596 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:01:21,284 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [596 Valid, 409 Invalid, 377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 367 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 06:01:21,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7368 states. [2025-03-08 06:01:21,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7368 to 7252. [2025-03-08 06:01:21,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7252 states, 7251 states have (on average 1.225348227830644) internal successors, (8885), 7251 states have internal predecessors, (8885), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:01:21,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7252 states to 7252 states and 8885 transitions. [2025-03-08 06:01:21,521 INFO L78 Accepts]: Start accepts. Automaton has 7252 states and 8885 transitions. Word has length 59 [2025-03-08 06:01:21,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:01:21,521 INFO L471 AbstractCegarLoop]: Abstraction has 7252 states and 8885 transitions. [2025-03-08 06:01:21,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 5.7727272727272725) internal successors, (127), 21 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:01:21,522 INFO L276 IsEmpty]: Start isEmpty. Operand 7252 states and 8885 transitions. [2025-03-08 06:01:21,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-08 06:01:21,522 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:01:21,522 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:01:21,530 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-08 06:01:21,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-08 06:01:21,723 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:01:21,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:01:21,723 INFO L85 PathProgramCache]: Analyzing trace with hash 1951007715, now seen corresponding path program 1 times [2025-03-08 06:01:21,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:01:21,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554314463] [2025-03-08 06:01:21,724 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:01:21,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:01:21,735 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-08 06:01:21,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-08 06:01:21,765 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:01:21,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:01:22,731 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:01:22,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:01:22,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554314463] [2025-03-08 06:01:22,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554314463] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 06:01:22,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2066659778] [2025-03-08 06:01:22,731 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:01:22,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:01:22,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:01:22,733 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 06:01:22,734 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 06:01:22,775 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-08 06:01:22,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-08 06:01:22,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:01:22,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:01:22,817 INFO L256 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-08 06:01:22,819 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 06:01:23,357 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:01:23,357 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 06:01:24,359 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:01:24,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2066659778] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 06:01:24,360 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 06:01:24,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 13, 13] total 44 [2025-03-08 06:01:24,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281355965] [2025-03-08 06:01:24,360 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 06:01:24,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2025-03-08 06:01:24,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:01:24,361 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2025-03-08 06:01:24,361 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=1737, Unknown=0, NotChecked=0, Total=1892 [2025-03-08 06:01:24,361 INFO L87 Difference]: Start difference. First operand 7252 states and 8885 transitions. Second operand has 44 states, 44 states have (on average 3.5) internal successors, (154), 44 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:01:30,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:01:30,726 INFO L93 Difference]: Finished difference Result 12385 states and 15231 transitions. [2025-03-08 06:01:30,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2025-03-08 06:01:30,726 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 3.5) internal successors, (154), 44 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2025-03-08 06:01:30,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:01:30,754 INFO L225 Difference]: With dead ends: 12385 [2025-03-08 06:01:30,754 INFO L226 Difference]: Without dead ends: 8903 [2025-03-08 06:01:30,761 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3113 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=2468, Invalid=9742, Unknown=0, NotChecked=0, Total=12210 [2025-03-08 06:01:30,761 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 2905 mSDsluCounter, 2403 mSDsCounter, 0 mSdLazyCounter, 2105 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2905 SdHoareTripleChecker+Valid, 2516 SdHoareTripleChecker+Invalid, 2218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 2105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:01:30,761 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2905 Valid, 2516 Invalid, 2218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 2105 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-08 06:01:30,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8903 states. [2025-03-08 06:01:30,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8903 to 6095. [2025-03-08 06:01:30,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6095 states, 6094 states have (on average 1.2190679356744338) internal successors, (7429), 6094 states have internal predecessors, (7429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:01:30,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6095 states to 6095 states and 7429 transitions. [2025-03-08 06:01:30,958 INFO L78 Accepts]: Start accepts. Automaton has 6095 states and 7429 transitions. Word has length 60 [2025-03-08 06:01:30,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:01:30,958 INFO L471 AbstractCegarLoop]: Abstraction has 6095 states and 7429 transitions. [2025-03-08 06:01:30,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 3.5) internal successors, (154), 44 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:01:30,958 INFO L276 IsEmpty]: Start isEmpty. Operand 6095 states and 7429 transitions. [2025-03-08 06:01:30,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-08 06:01:30,959 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:01:30,959 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:01:30,966 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-08 06:01:31,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:01:31,160 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:01:31,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:01:31,160 INFO L85 PathProgramCache]: Analyzing trace with hash -1133059932, now seen corresponding path program 1 times [2025-03-08 06:01:31,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:01:31,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713673570] [2025-03-08 06:01:31,160 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:01:31,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:01:31,167 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-08 06:01:31,185 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-08 06:01:31,185 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:01:31,185 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:01:31,656 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:01:31,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:01:31,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713673570] [2025-03-08 06:01:31,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713673570] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 06:01:31,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2094009187] [2025-03-08 06:01:31,656 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:01:31,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:01:31,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:01:31,659 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 06:01:31,661 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-08 06:01:31,702 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-08 06:01:31,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-08 06:01:31,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:01:31,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:01:31,782 INFO L256 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-03-08 06:01:31,784 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 06:01:33,034 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:01:33,035 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 06:01:34,329 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:01:34,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2094009187] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 06:01:34,329 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 06:01:34,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 18, 17] total 43 [2025-03-08 06:01:34,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139000465] [2025-03-08 06:01:34,329 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 06:01:34,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2025-03-08 06:01:34,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:01:34,330 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2025-03-08 06:01:34,331 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=1553, Unknown=0, NotChecked=0, Total=1806 [2025-03-08 06:01:34,331 INFO L87 Difference]: Start difference. First operand 6095 states and 7429 transitions. Second operand has 43 states, 43 states have (on average 3.697674418604651) internal successors, (159), 43 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:01:43,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:01:43,245 INFO L93 Difference]: Finished difference Result 10929 states and 13475 transitions. [2025-03-08 06:01:43,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2025-03-08 06:01:43,250 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 3.697674418604651) internal successors, (159), 43 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2025-03-08 06:01:43,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:01:43,260 INFO L225 Difference]: With dead ends: 10929 [2025-03-08 06:01:43,260 INFO L226 Difference]: Without dead ends: 6474 [2025-03-08 06:01:43,265 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6555 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=3887, Invalid=14203, Unknown=0, NotChecked=0, Total=18090 [2025-03-08 06:01:43,265 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 1561 mSDsluCounter, 1794 mSDsCounter, 0 mSdLazyCounter, 1877 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1561 SdHoareTripleChecker+Valid, 1884 SdHoareTripleChecker+Invalid, 1937 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 1877 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:01:43,266 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1561 Valid, 1884 Invalid, 1937 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 1877 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-08 06:01:43,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6474 states. [2025-03-08 06:01:43,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6474 to 5054. [2025-03-08 06:01:43,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5054 states, 5053 states have (on average 1.2291707896299229) internal successors, (6211), 5053 states have internal predecessors, (6211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:01:43,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5054 states to 5054 states and 6211 transitions. [2025-03-08 06:01:43,422 INFO L78 Accepts]: Start accepts. Automaton has 5054 states and 6211 transitions. Word has length 60 [2025-03-08 06:01:43,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:01:43,422 INFO L471 AbstractCegarLoop]: Abstraction has 5054 states and 6211 transitions. [2025-03-08 06:01:43,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 3.697674418604651) internal successors, (159), 43 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:01:43,423 INFO L276 IsEmpty]: Start isEmpty. Operand 5054 states and 6211 transitions. [2025-03-08 06:01:43,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-08 06:01:43,424 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:01:43,425 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:01:43,432 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-08 06:01:43,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:01:43,629 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:01:43,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:01:43,630 INFO L85 PathProgramCache]: Analyzing trace with hash 100282772, now seen corresponding path program 1 times [2025-03-08 06:01:43,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:01:43,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560805579] [2025-03-08 06:01:43,630 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:01:43,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:01:43,636 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-08 06:01:43,648 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-08 06:01:43,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:01:43,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:01:44,112 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 16 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:01:44,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:01:44,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560805579] [2025-03-08 06:01:44,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560805579] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 06:01:44,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1553197257] [2025-03-08 06:01:44,113 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:01:44,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:01:44,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:01:44,115 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 06:01:44,117 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-08 06:01:44,164 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-08 06:01:44,199 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-08 06:01:44,199 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:01:44,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:01:44,201 INFO L256 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-03-08 06:01:44,204 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 06:01:45,571 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 24 proven. 62 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:01:45,571 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 06:01:48,084 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 24 proven. 62 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:01:48,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1553197257] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 06:01:48,084 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 06:01:48,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 21, 22] total 54 [2025-03-08 06:01:48,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369519092] [2025-03-08 06:01:48,085 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 06:01:48,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2025-03-08 06:01:48,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:01:48,085 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2025-03-08 06:01:48,086 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=315, Invalid=2547, Unknown=0, NotChecked=0, Total=2862 [2025-03-08 06:01:48,086 INFO L87 Difference]: Start difference. First operand 5054 states and 6211 transitions. Second operand has 54 states, 54 states have (on average 5.111111111111111) internal successors, (276), 54 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:02:02,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:02:02,851 INFO L93 Difference]: Finished difference Result 9502 states and 11801 transitions. [2025-03-08 06:02:02,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2025-03-08 06:02:02,851 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 54 states have (on average 5.111111111111111) internal successors, (276), 54 states have internal predecessors, (276), 0 states have call successors, (0), 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 98 [2025-03-08 06:02:02,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:02:02,861 INFO L225 Difference]: With dead ends: 9502 [2025-03-08 06:02:02,861 INFO L226 Difference]: Without dead ends: 7697 [2025-03-08 06:02:02,866 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 328 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9085 ImplicationChecksByTransitivity, 14.2s TimeCoverageRelationStatistics Valid=5355, Invalid=25095, Unknown=0, NotChecked=0, Total=30450 [2025-03-08 06:02:02,867 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 2882 mSDsluCounter, 2603 mSDsCounter, 0 mSdLazyCounter, 2753 mSolverCounterSat, 176 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2882 SdHoareTripleChecker+Valid, 2715 SdHoareTripleChecker+Invalid, 2929 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 176 IncrementalHoareTripleChecker+Valid, 2753 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-08 06:02:02,867 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2882 Valid, 2715 Invalid, 2929 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [176 Valid, 2753 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-08 06:02:02,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7697 states. [2025-03-08 06:02:03,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7697 to 6025. [2025-03-08 06:02:03,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6025 states, 6024 states have (on average 1.2197875166002656) internal successors, (7348), 6024 states have internal predecessors, (7348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:02:03,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6025 states to 6025 states and 7348 transitions. [2025-03-08 06:02:03,109 INFO L78 Accepts]: Start accepts. Automaton has 6025 states and 7348 transitions. Word has length 98 [2025-03-08 06:02:03,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:02:03,109 INFO L471 AbstractCegarLoop]: Abstraction has 6025 states and 7348 transitions. [2025-03-08 06:02:03,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 5.111111111111111) internal successors, (276), 54 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:02:03,109 INFO L276 IsEmpty]: Start isEmpty. Operand 6025 states and 7348 transitions. [2025-03-08 06:02:03,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-08 06:02:03,110 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:02:03,111 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:02:03,118 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-08 06:02:03,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:02:03,311 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:02:03,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:02:03,312 INFO L85 PathProgramCache]: Analyzing trace with hash 703234937, now seen corresponding path program 1 times [2025-03-08 06:02:03,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:02:03,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439825216] [2025-03-08 06:02:03,312 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:02:03,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:02:03,319 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-08 06:02:03,329 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-08 06:02:03,329 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:02:03,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:02:03,928 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 34 proven. 53 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:02:03,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:02:03,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439825216] [2025-03-08 06:02:03,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439825216] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 06:02:03,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1584669841] [2025-03-08 06:02:03,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:02:03,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:02:03,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:02:03,930 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 06:02:03,931 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-08 06:02:03,979 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-08 06:02:04,013 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-08 06:02:04,013 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:02:04,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:02:04,015 INFO L256 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-03-08 06:02:04,017 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 06:02:05,473 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 16 proven. 71 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:02:05,473 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 06:02:08,271 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 16 proven. 71 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:02:08,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1584669841] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 06:02:08,271 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 06:02:08,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 25, 26] total 68 [2025-03-08 06:02:08,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720018191] [2025-03-08 06:02:08,272 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 06:02:08,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2025-03-08 06:02:08,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:02:08,272 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2025-03-08 06:02:08,273 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=320, Invalid=4236, Unknown=0, NotChecked=0, Total=4556 [2025-03-08 06:02:08,273 INFO L87 Difference]: Start difference. First operand 6025 states and 7348 transitions. Second operand has 68 states, 68 states have (on average 4.161764705882353) internal successors, (283), 68 states have internal predecessors, (283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:02:40,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:02:40,296 INFO L93 Difference]: Finished difference Result 23891 states and 29198 transitions. [2025-03-08 06:02:40,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 185 states. [2025-03-08 06:02:40,297 INFO L78 Accepts]: Start accepts. Automaton has has 68 states, 68 states have (on average 4.161764705882353) internal successors, (283), 68 states have internal predecessors, (283), 0 states have call successors, (0), 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 99 [2025-03-08 06:02:40,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:02:40,322 INFO L225 Difference]: With dead ends: 23891 [2025-03-08 06:02:40,322 INFO L226 Difference]: Without dead ends: 20827 [2025-03-08 06:02:40,330 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 398 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 249 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21377 ImplicationChecksByTransitivity, 30.6s TimeCoverageRelationStatistics Valid=7657, Invalid=55093, Unknown=0, NotChecked=0, Total=62750 [2025-03-08 06:02:40,332 INFO L435 NwaCegarLoop]: 170 mSDtfsCounter, 9194 mSDsluCounter, 4511 mSDsCounter, 0 mSdLazyCounter, 3761 mSolverCounterSat, 421 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9194 SdHoareTripleChecker+Valid, 4681 SdHoareTripleChecker+Invalid, 4182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 421 IncrementalHoareTripleChecker+Valid, 3761 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:02:40,332 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9194 Valid, 4681 Invalid, 4182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [421 Valid, 3761 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-08 06:02:40,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20827 states. [2025-03-08 06:02:40,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20827 to 9795. [2025-03-08 06:02:40,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9795 states, 9794 states have (on average 1.216254849908107) internal successors, (11912), 9794 states have internal predecessors, (11912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:02:40,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9795 states to 9795 states and 11912 transitions. [2025-03-08 06:02:40,925 INFO L78 Accepts]: Start accepts. Automaton has 9795 states and 11912 transitions. Word has length 99 [2025-03-08 06:02:40,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:02:40,925 INFO L471 AbstractCegarLoop]: Abstraction has 9795 states and 11912 transitions. [2025-03-08 06:02:40,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 68 states, 68 states have (on average 4.161764705882353) internal successors, (283), 68 states have internal predecessors, (283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:02:40,926 INFO L276 IsEmpty]: Start isEmpty. Operand 9795 states and 11912 transitions. [2025-03-08 06:02:40,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-08 06:02:40,927 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:02:40,927 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:02:40,934 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-08 06:02:41,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:02:41,128 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:02:41,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:02:41,128 INFO L85 PathProgramCache]: Analyzing trace with hash -506580488, now seen corresponding path program 1 times [2025-03-08 06:02:41,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:02:41,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766082264] [2025-03-08 06:02:41,128 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:02:41,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:02:41,138 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-08 06:02:41,150 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-08 06:02:41,150 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:02:41,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:02:41,519 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 31 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:02:41,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:02:41,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766082264] [2025-03-08 06:02:41,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766082264] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 06:02:41,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1151874355] [2025-03-08 06:02:41,520 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:02:41,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:02:41,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:02:41,522 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 06:02:41,523 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-08 06:02:41,573 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-08 06:02:41,607 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-08 06:02:41,607 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:02:41,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:02:41,609 INFO L256 TraceCheckSpWp]: Trace formula consists of 399 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-08 06:02:41,610 INFO L279 TraceCheckSpWp]: Computing forward predicates...