./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_lcr.6.1.ufo.BOUNDED-12.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded/pals_lcr.6.1.ufo.BOUNDED-12.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 b4e7977192ae56aeb09dc050b873d7b40c1e47d710f31b358c00a46d3bffe743 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 14:52:16,445 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 14:52:16,500 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 14:52:16,505 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 14:52:16,506 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 14:52:16,525 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 14:52:16,526 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 14:52:16,527 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 14:52:16,527 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 14:52:16,527 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 14:52:16,528 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 14:52:16,528 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 14:52:16,528 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 14:52:16,528 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 14:52:16,528 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 14:52:16,528 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 14:52:16,529 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 14:52:16,529 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 14:52:16,529 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 14:52:16,529 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 14:52:16,529 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 14:52:16,529 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 14:52:16,529 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 14:52:16,529 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 14:52:16,529 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 14:52:16,529 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 14:52:16,530 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 14:52:16,530 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 14:52:16,530 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 14:52:16,530 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 14:52:16,530 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 14:52:16,530 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 14:52:16,530 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:52:16,530 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 14:52:16,531 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 14:52:16,531 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 14:52:16,531 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 14:52:16,531 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 14:52:16,531 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 14:52:16,531 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 14:52:16,531 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 14:52:16,531 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 14:52:16,531 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 14:52:16,531 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/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 -> b4e7977192ae56aeb09dc050b873d7b40c1e47d710f31b358c00a46d3bffe743 [2025-03-03 14:52:16,748 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 14:52:16,757 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 14:52:16,758 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 14:52:16,760 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 14:52:16,760 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 14:52:16,761 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_lcr.6.1.ufo.BOUNDED-12.pals.c [2025-03-03 14:52:17,871 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/51c0c41e7/2b8b0cf033a44af8abb1f93f154302e7/FLAG8d4ef2218 [2025-03-03 14:52:18,162 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 14:52:18,163 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.6.1.ufo.BOUNDED-12.pals.c [2025-03-03 14:52:18,185 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/51c0c41e7/2b8b0cf033a44af8abb1f93f154302e7/FLAG8d4ef2218 [2025-03-03 14:52:18,452 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/51c0c41e7/2b8b0cf033a44af8abb1f93f154302e7 [2025-03-03 14:52:18,455 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 14:52:18,458 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 14:52:18,460 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 14:52:18,461 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 14:52:18,464 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 14:52:18,466 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:52:18" (1/1) ... [2025-03-03 14:52:18,466 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5335a5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:52:18, skipping insertion in model container [2025-03-03 14:52:18,466 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:52:18" (1/1) ... [2025-03-03 14:52:18,485 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 14:52:18,641 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.6.1.ufo.BOUNDED-12.pals.c[15112,15125] [2025-03-03 14:52:18,643 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:52:18,653 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 14:52:18,693 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.6.1.ufo.BOUNDED-12.pals.c[15112,15125] [2025-03-03 14:52:18,694 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:52:18,713 INFO L204 MainTranslator]: Completed translation [2025-03-03 14:52:18,713 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:52:18 WrapperNode [2025-03-03 14:52:18,714 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 14:52:18,715 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 14:52:18,716 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 14:52:18,716 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 14:52:18,721 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:52:18" (1/1) ... [2025-03-03 14:52:18,733 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:52:18" (1/1) ... [2025-03-03 14:52:18,760 INFO L138 Inliner]: procedures = 25, calls = 17, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 396 [2025-03-03 14:52:18,760 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 14:52:18,761 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 14:52:18,761 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 14:52:18,761 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 14:52:18,766 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:52:18" (1/1) ... [2025-03-03 14:52:18,767 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:52:18" (1/1) ... [2025-03-03 14:52:18,770 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:52:18" (1/1) ... [2025-03-03 14:52:18,779 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 14:52:18,782 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:52:18" (1/1) ... [2025-03-03 14:52:18,783 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:52:18" (1/1) ... [2025-03-03 14:52:18,787 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:52:18" (1/1) ... [2025-03-03 14:52:18,788 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:52:18" (1/1) ... [2025-03-03 14:52:18,794 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:52:18" (1/1) ... [2025-03-03 14:52:18,796 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:52:18" (1/1) ... [2025-03-03 14:52:18,798 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 14:52:18,800 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 14:52:18,801 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 14:52:18,801 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 14:52:18,802 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:52:18" (1/1) ... [2025-03-03 14:52:18,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:52:18,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:52:18,828 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 14:52:18,834 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 14:52:18,849 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 14:52:18,850 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 14:52:18,850 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 14:52:18,850 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 14:52:18,933 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 14:52:18,935 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 14:52:19,248 INFO L? ?]: Removed 45 outVars from TransFormulas that were not future-live. [2025-03-03 14:52:19,248 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 14:52:19,255 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 14:52:19,255 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 14:52:19,255 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:52:19 BoogieIcfgContainer [2025-03-03 14:52:19,255 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 14:52:19,257 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 14:52:19,257 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 14:52:19,261 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 14:52:19,261 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 02:52:18" (1/3) ... [2025-03-03 14:52:19,261 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1532052c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:52:19, skipping insertion in model container [2025-03-03 14:52:19,261 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:52:18" (2/3) ... [2025-03-03 14:52:19,262 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1532052c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:52:19, skipping insertion in model container [2025-03-03 14:52:19,262 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:52:19" (3/3) ... [2025-03-03 14:52:19,263 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.6.1.ufo.BOUNDED-12.pals.c [2025-03-03 14:52:19,274 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 14:52:19,276 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.6.1.ufo.BOUNDED-12.pals.c that has 1 procedures, 97 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 14:52:19,315 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 14:52:19,323 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;@a78ac8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 14:52:19,323 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 14:52:19,327 INFO L276 IsEmpty]: Start isEmpty. Operand has 97 states, 95 states have (on average 1.768421052631579) internal successors, (168), 96 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:52:19,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-03 14:52:19,331 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:52:19,331 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] [2025-03-03 14:52:19,332 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:52:19,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:52:19,335 INFO L85 PathProgramCache]: Analyzing trace with hash -1909763777, now seen corresponding path program 1 times [2025-03-03 14:52:19,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:52:19,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598396484] [2025-03-03 14:52:19,341 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:52:19,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:52:19,402 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-03 14:52:19,442 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-03 14:52:19,442 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:52:19,443 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:52:19,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:52:19,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:52:19,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598396484] [2025-03-03 14:52:19,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598396484] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:52:19,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:52:19,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 14:52:19,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196516836] [2025-03-03 14:52:19,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:52:19,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 14:52:19,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:52:19,556 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 14:52:19,556 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 14:52:19,558 INFO L87 Difference]: Start difference. First operand has 97 states, 95 states have (on average 1.768421052631579) internal successors, (168), 96 states have internal predecessors, (168), 0 states have call successors, (0), 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 12.5) internal successors, (25), 2 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:52:19,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:52:19,576 INFO L93 Difference]: Finished difference Result 149 states and 250 transitions. [2025-03-03 14:52:19,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 14:52:19,578 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-03-03 14:52:19,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:52:19,584 INFO L225 Difference]: With dead ends: 149 [2025-03-03 14:52:19,584 INFO L226 Difference]: Without dead ends: 94 [2025-03-03 14:52:19,588 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-03 14:52:19,590 INFO L435 NwaCegarLoop]: 166 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, 166 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-03 14:52:19,591 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:52:19,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2025-03-03 14:52:19,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2025-03-03 14:52:19,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 93 states have (on average 1.7526881720430108) internal successors, (163), 93 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:52:19,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 163 transitions. [2025-03-03 14:52:19,622 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 163 transitions. Word has length 25 [2025-03-03 14:52:19,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:52:19,623 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 163 transitions. [2025-03-03 14:52:19,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:52:19,624 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 163 transitions. [2025-03-03 14:52:19,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-03 14:52:19,625 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:52:19,625 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] [2025-03-03 14:52:19,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 14:52:19,626 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:52:19,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:52:19,627 INFO L85 PathProgramCache]: Analyzing trace with hash 1976379294, now seen corresponding path program 1 times [2025-03-03 14:52:19,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:52:19,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913280376] [2025-03-03 14:52:19,627 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:52:19,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:52:19,648 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-03 14:52:19,675 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-03 14:52:19,675 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:52:19,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:52:19,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:52:19,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:52:19,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913280376] [2025-03-03 14:52:19,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913280376] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:52:19,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:52:19,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:52:19,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494105173] [2025-03-03 14:52:19,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:52:19,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:52:19,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:52:19,902 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:52:19,903 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:52:19,903 INFO L87 Difference]: Start difference. First operand 94 states and 163 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:52:19,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:52:19,983 INFO L93 Difference]: Finished difference Result 146 states and 244 transitions. [2025-03-03 14:52:19,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:52:19,985 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-03-03 14:52:19,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:52:19,986 INFO L225 Difference]: With dead ends: 146 [2025-03-03 14:52:19,986 INFO L226 Difference]: Without dead ends: 94 [2025-03-03 14:52:19,986 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-03 14:52:19,987 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 0 mSDsluCounter, 438 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 599 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:52:19,987 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 599 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:52:19,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2025-03-03 14:52:19,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2025-03-03 14:52:19,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 93 states have (on average 1.3225806451612903) internal successors, (123), 93 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:52:19,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 123 transitions. [2025-03-03 14:52:19,997 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 123 transitions. Word has length 25 [2025-03-03 14:52:19,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:52:19,997 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 123 transitions. [2025-03-03 14:52:19,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:52:19,997 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 123 transitions. [2025-03-03 14:52:19,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-03 14:52:19,998 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:52:19,998 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:52:19,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 14:52:19,998 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:52:19,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:52:19,999 INFO L85 PathProgramCache]: Analyzing trace with hash -1401550392, now seen corresponding path program 1 times [2025-03-03 14:52:19,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:52:19,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485140446] [2025-03-03 14:52:19,999 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:52:19,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:52:20,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-03 14:52:20,043 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-03 14:52:20,043 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:52:20,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:52:20,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:52:20,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:52:20,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485140446] [2025-03-03 14:52:20,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485140446] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:52:20,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:52:20,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 14:52:20,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399454352] [2025-03-03 14:52:20,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:52:20,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 14:52:20,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:52:20,272 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 14:52:20,272 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:52:20,273 INFO L87 Difference]: Start difference. First operand 94 states and 123 transitions. Second operand has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:52:20,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:52:20,600 INFO L93 Difference]: Finished difference Result 670 states and 1047 transitions. [2025-03-03 14:52:20,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 14:52:20,600 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2025-03-03 14:52:20,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:52:20,604 INFO L225 Difference]: With dead ends: 670 [2025-03-03 14:52:20,604 INFO L226 Difference]: Without dead ends: 622 [2025-03-03 14:52:20,608 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=181, Unknown=0, NotChecked=0, Total=272 [2025-03-03 14:52:20,608 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 1001 mSDsluCounter, 2432 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1001 SdHoareTripleChecker+Valid, 2551 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 14:52:20,609 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1001 Valid, 2551 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 14:52:20,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 622 states. [2025-03-03 14:52:20,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 622 to 140. [2025-03-03 14:52:20,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 139 states have (on average 1.4172661870503598) internal successors, (197), 139 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:52:20,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 197 transitions. [2025-03-03 14:52:20,628 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 197 transitions. Word has length 64 [2025-03-03 14:52:20,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:52:20,628 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 197 transitions. [2025-03-03 14:52:20,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:52:20,628 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 197 transitions. [2025-03-03 14:52:20,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-03 14:52:20,629 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:52:20,629 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:52:20,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 14:52:20,630 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:52:20,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:52:20,630 INFO L85 PathProgramCache]: Analyzing trace with hash -1444809853, now seen corresponding path program 1 times [2025-03-03 14:52:20,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:52:20,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220805299] [2025-03-03 14:52:20,630 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:52:20,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:52:20,644 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-03 14:52:20,656 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-03 14:52:20,656 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:52:20,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:52:20,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:52:20,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:52:20,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220805299] [2025-03-03 14:52:20,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220805299] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:52:20,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:52:20,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:52:20,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820063762] [2025-03-03 14:52:20,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:52:20,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:52:20,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:52:20,709 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:52:20,709 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:52:20,710 INFO L87 Difference]: Start difference. First operand 140 states and 197 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:52:20,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:52:20,728 INFO L93 Difference]: Finished difference Result 317 states and 480 transitions. [2025-03-03 14:52:20,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:52:20,729 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2025-03-03 14:52:20,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:52:20,730 INFO L225 Difference]: With dead ends: 317 [2025-03-03 14:52:20,730 INFO L226 Difference]: Without dead ends: 223 [2025-03-03 14:52:20,731 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-03 14:52:20,731 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 51 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 193 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-03 14:52:20,732 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 193 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:52:20,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2025-03-03 14:52:20,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 221. [2025-03-03 14:52:20,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 220 states have (on average 1.4772727272727273) internal successors, (325), 220 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:52:20,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 325 transitions. [2025-03-03 14:52:20,746 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 325 transitions. Word has length 66 [2025-03-03 14:52:20,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:52:20,746 INFO L471 AbstractCegarLoop]: Abstraction has 221 states and 325 transitions. [2025-03-03 14:52:20,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:52:20,746 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 325 transitions. [2025-03-03 14:52:20,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-03 14:52:20,747 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:52:20,748 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:52:20,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 14:52:20,749 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:52:20,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:52:20,749 INFO L85 PathProgramCache]: Analyzing trace with hash -1412486618, now seen corresponding path program 1 times [2025-03-03 14:52:20,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:52:20,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800729410] [2025-03-03 14:52:20,750 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:52:20,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:52:20,760 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-03 14:52:20,772 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-03 14:52:20,773 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:52:20,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:52:21,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:52:21,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:52:21,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800729410] [2025-03-03 14:52:21,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800729410] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:52:21,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:52:21,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 14:52:21,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032121801] [2025-03-03 14:52:21,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:52:21,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 14:52:21,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:52:21,081 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 14:52:21,081 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:52:21,082 INFO L87 Difference]: Start difference. First operand 221 states and 325 transitions. Second operand has 8 states, 8 states have (on average 8.25) internal successors, (66), 8 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:52:21,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:52:21,282 INFO L93 Difference]: Finished difference Result 398 states and 605 transitions. [2025-03-03 14:52:21,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 14:52:21,283 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.25) internal successors, (66), 8 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2025-03-03 14:52:21,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:52:21,284 INFO L225 Difference]: With dead ends: 398 [2025-03-03 14:52:21,284 INFO L226 Difference]: Without dead ends: 223 [2025-03-03 14:52:21,285 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2025-03-03 14:52:21,285 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 146 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:52:21,285 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 483 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:52:21,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2025-03-03 14:52:21,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 221. [2025-03-03 14:52:21,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 220 states have (on average 1.4681818181818183) internal successors, (323), 220 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:52:21,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 323 transitions. [2025-03-03 14:52:21,292 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 323 transitions. Word has length 66 [2025-03-03 14:52:21,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:52:21,293 INFO L471 AbstractCegarLoop]: Abstraction has 221 states and 323 transitions. [2025-03-03 14:52:21,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.25) internal successors, (66), 8 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:52:21,293 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 323 transitions. [2025-03-03 14:52:21,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-03 14:52:21,294 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:52:21,294 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:52:21,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 14:52:21,294 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:52:21,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:52:21,295 INFO L85 PathProgramCache]: Analyzing trace with hash -806874465, now seen corresponding path program 1 times [2025-03-03 14:52:21,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:52:21,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054784226] [2025-03-03 14:52:21,295 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:52:21,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:52:21,304 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-03 14:52:21,315 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-03 14:52:21,315 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:52:21,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:52:21,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:52:21,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:52:21,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054784226] [2025-03-03 14:52:21,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054784226] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:52:21,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:52:21,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:52:21,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163117322] [2025-03-03 14:52:21,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:52:21,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:52:21,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:52:21,533 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:52:21,535 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:52:21,535 INFO L87 Difference]: Start difference. First operand 221 states and 323 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:52:21,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:52:21,553 INFO L93 Difference]: Finished difference Result 229 states and 332 transitions. [2025-03-03 14:52:21,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:52:21,554 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2025-03-03 14:52:21,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:52:21,555 INFO L225 Difference]: With dead ends: 229 [2025-03-03 14:52:21,555 INFO L226 Difference]: Without dead ends: 227 [2025-03-03 14:52:21,556 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-03 14:52:21,556 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 0 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 471 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-03 14:52:21,557 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 471 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:52:21,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2025-03-03 14:52:21,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 227. [2025-03-03 14:52:21,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 226 states have (on average 1.4513274336283186) internal successors, (328), 226 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:52:21,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 328 transitions. [2025-03-03 14:52:21,568 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 328 transitions. Word has length 67 [2025-03-03 14:52:21,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:52:21,568 INFO L471 AbstractCegarLoop]: Abstraction has 227 states and 328 transitions. [2025-03-03 14:52:21,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:52:21,569 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 328 transitions. [2025-03-03 14:52:21,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-03 14:52:21,569 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:52:21,569 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:52:21,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 14:52:21,569 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:52:21,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:52:21,570 INFO L85 PathProgramCache]: Analyzing trace with hash 296509988, now seen corresponding path program 1 times [2025-03-03 14:52:21,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:52:21,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014344982] [2025-03-03 14:52:21,570 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:52:21,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:52:21,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-03 14:52:21,590 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-03 14:52:21,590 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:52:21,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:52:21,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:52:21,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:52:21,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014344982] [2025-03-03 14:52:21,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014344982] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:52:21,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:52:21,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:52:21,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063522538] [2025-03-03 14:52:21,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:52:21,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:52:21,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:52:21,634 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:52:21,634 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:52:21,634 INFO L87 Difference]: Start difference. First operand 227 states and 328 transitions. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:52:21,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:52:21,651 INFO L93 Difference]: Finished difference Result 421 states and 629 transitions. [2025-03-03 14:52:21,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:52:21,652 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2025-03-03 14:52:21,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:52:21,653 INFO L225 Difference]: With dead ends: 421 [2025-03-03 14:52:21,653 INFO L226 Difference]: Without dead ends: 321 [2025-03-03 14:52:21,653 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-03 14:52:21,654 INFO L435 NwaCegarLoop]: 185 mSDtfsCounter, 67 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 263 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-03 14:52:21,654 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 263 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:52:21,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2025-03-03 14:52:21,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 319. [2025-03-03 14:52:21,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 318 states have (on average 1.4748427672955975) internal successors, (469), 318 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:52:21,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 469 transitions. [2025-03-03 14:52:21,662 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 469 transitions. Word has length 68 [2025-03-03 14:52:21,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:52:21,662 INFO L471 AbstractCegarLoop]: Abstraction has 319 states and 469 transitions. [2025-03-03 14:52:21,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:52:21,663 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 469 transitions. [2025-03-03 14:52:21,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-03 14:52:21,663 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:52:21,663 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:52:21,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 14:52:21,663 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:52:21,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:52:21,664 INFO L85 PathProgramCache]: Analyzing trace with hash 142141156, now seen corresponding path program 1 times [2025-03-03 14:52:21,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:52:21,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871807516] [2025-03-03 14:52:21,664 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:52:21,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:52:21,672 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-03 14:52:21,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-03 14:52:21,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:52:21,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:52:21,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:52:21,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:52:21,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871807516] [2025-03-03 14:52:21,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871807516] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:52:21,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:52:21,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:52:21,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919715906] [2025-03-03 14:52:21,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:52:21,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:52:21,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:52:21,721 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:52:21,721 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:52:21,721 INFO L87 Difference]: Start difference. First operand 319 states and 469 transitions. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:52:21,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:52:21,740 INFO L93 Difference]: Finished difference Result 837 states and 1269 transitions. [2025-03-03 14:52:21,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:52:21,741 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2025-03-03 14:52:21,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:52:21,743 INFO L225 Difference]: With dead ends: 837 [2025-03-03 14:52:21,743 INFO L226 Difference]: Without dead ends: 566 [2025-03-03 14:52:21,743 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-03 14:52:21,744 INFO L435 NwaCegarLoop]: 187 mSDtfsCounter, 65 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 269 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-03 14:52:21,744 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 269 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:52:21,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2025-03-03 14:52:21,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 564. [2025-03-03 14:52:21,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 564 states, 563 states have (on average 1.4937833037300177) internal successors, (841), 563 states have internal predecessors, (841), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:52:21,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 841 transitions. [2025-03-03 14:52:21,759 INFO L78 Accepts]: Start accepts. Automaton has 564 states and 841 transitions. Word has length 68 [2025-03-03 14:52:21,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:52:21,759 INFO L471 AbstractCegarLoop]: Abstraction has 564 states and 841 transitions. [2025-03-03 14:52:21,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:52:21,760 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 841 transitions. [2025-03-03 14:52:21,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-03 14:52:21,760 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:52:21,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:52:21,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 14:52:21,761 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:52:21,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:52:21,761 INFO L85 PathProgramCache]: Analyzing trace with hash -836789340, now seen corresponding path program 1 times [2025-03-03 14:52:21,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:52:21,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305277002] [2025-03-03 14:52:21,761 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:52:21,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:52:21,773 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-03 14:52:21,781 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-03 14:52:21,782 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:52:21,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:52:21,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:52:21,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:52:21,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305277002] [2025-03-03 14:52:21,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305277002] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:52:21,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:52:21,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:52:21,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754963141] [2025-03-03 14:52:21,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:52:21,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:52:21,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:52:21,823 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:52:21,823 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:52:21,823 INFO L87 Difference]: Start difference. First operand 564 states and 841 transitions. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:52:21,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:52:21,850 INFO L93 Difference]: Finished difference Result 1548 states and 2343 transitions. [2025-03-03 14:52:21,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:52:21,851 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2025-03-03 14:52:21,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:52:21,854 INFO L225 Difference]: With dead ends: 1548 [2025-03-03 14:52:21,854 INFO L226 Difference]: Without dead ends: 1032 [2025-03-03 14:52:21,855 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-03 14:52:21,855 INFO L435 NwaCegarLoop]: 185 mSDtfsCounter, 63 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 271 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-03 14:52:21,855 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 271 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:52:21,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1032 states. [2025-03-03 14:52:21,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1032 to 1030. [2025-03-03 14:52:21,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1030 states, 1029 states have (on average 1.4936831875607386) internal successors, (1537), 1029 states have internal predecessors, (1537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:52:21,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1030 states to 1030 states and 1537 transitions. [2025-03-03 14:52:21,884 INFO L78 Accepts]: Start accepts. Automaton has 1030 states and 1537 transitions. Word has length 68 [2025-03-03 14:52:21,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:52:21,885 INFO L471 AbstractCegarLoop]: Abstraction has 1030 states and 1537 transitions. [2025-03-03 14:52:21,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:52:21,885 INFO L276 IsEmpty]: Start isEmpty. Operand 1030 states and 1537 transitions. [2025-03-03 14:52:21,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-03 14:52:21,885 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:52:21,885 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:52:21,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 14:52:21,886 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:52:21,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:52:21,886 INFO L85 PathProgramCache]: Analyzing trace with hash -1284734876, now seen corresponding path program 1 times [2025-03-03 14:52:21,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:52:21,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317985100] [2025-03-03 14:52:21,886 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:52:21,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:52:21,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-03 14:52:21,903 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-03 14:52:21,903 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:52:21,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:52:21,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:52:21,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:52:21,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317985100] [2025-03-03 14:52:21,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317985100] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:52:21,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:52:21,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:52:21,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588723660] [2025-03-03 14:52:21,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:52:21,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:52:21,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:52:21,940 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:52:21,940 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:52:21,940 INFO L87 Difference]: Start difference. First operand 1030 states and 1537 transitions. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:52:21,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:52:21,982 INFO L93 Difference]: Finished difference Result 2898 states and 4347 transitions. [2025-03-03 14:52:21,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:52:21,983 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2025-03-03 14:52:21,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:52:21,990 INFO L225 Difference]: With dead ends: 2898 [2025-03-03 14:52:21,990 INFO L226 Difference]: Without dead ends: 1916 [2025-03-03 14:52:21,993 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-03 14:52:21,994 INFO L435 NwaCegarLoop]: 183 mSDtfsCounter, 61 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 273 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-03 14:52:21,994 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 273 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:52:21,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1916 states. [2025-03-03 14:52:22,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1916 to 1914. [2025-03-03 14:52:22,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1914 states, 1913 states have (on average 1.480920020909566) internal successors, (2833), 1913 states have internal predecessors, (2833), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:52:22,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1914 states to 1914 states and 2833 transitions. [2025-03-03 14:52:22,059 INFO L78 Accepts]: Start accepts. Automaton has 1914 states and 2833 transitions. Word has length 68 [2025-03-03 14:52:22,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:52:22,059 INFO L471 AbstractCegarLoop]: Abstraction has 1914 states and 2833 transitions. [2025-03-03 14:52:22,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:52:22,060 INFO L276 IsEmpty]: Start isEmpty. Operand 1914 states and 2833 transitions. [2025-03-03 14:52:22,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-03 14:52:22,060 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:52:22,060 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:52:22,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 14:52:22,061 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:52:22,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:52:22,061 INFO L85 PathProgramCache]: Analyzing trace with hash -869559004, now seen corresponding path program 1 times [2025-03-03 14:52:22,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:52:22,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376529827] [2025-03-03 14:52:22,061 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:52:22,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:52:22,071 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-03 14:52:22,078 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-03 14:52:22,078 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:52:22,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:52:22,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:52:22,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:52:22,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376529827] [2025-03-03 14:52:22,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376529827] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:52:22,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:52:22,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:52:22,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126116621] [2025-03-03 14:52:22,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:52:22,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:52:22,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:52:22,115 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:52:22,115 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:52:22,115 INFO L87 Difference]: Start difference. First operand 1914 states and 2833 transitions. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:52:22,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:52:22,180 INFO L93 Difference]: Finished difference Result 5454 states and 8067 transitions. [2025-03-03 14:52:22,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:52:22,181 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2025-03-03 14:52:22,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:52:22,191 INFO L225 Difference]: With dead ends: 5454 [2025-03-03 14:52:22,192 INFO L226 Difference]: Without dead ends: 3588 [2025-03-03 14:52:22,194 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-03 14:52:22,195 INFO L435 NwaCegarLoop]: 181 mSDtfsCounter, 59 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 275 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-03 14:52:22,195 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 275 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:52:22,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3588 states. [2025-03-03 14:52:22,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3588 to 3586. [2025-03-03 14:52:22,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3586 states, 3585 states have (on average 1.4596931659693166) internal successors, (5233), 3585 states have internal predecessors, (5233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:52:22,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3586 states to 3586 states and 5233 transitions. [2025-03-03 14:52:22,318 INFO L78 Accepts]: Start accepts. Automaton has 3586 states and 5233 transitions. Word has length 68 [2025-03-03 14:52:22,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:52:22,318 INFO L471 AbstractCegarLoop]: Abstraction has 3586 states and 5233 transitions. [2025-03-03 14:52:22,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:52:22,319 INFO L276 IsEmpty]: Start isEmpty. Operand 3586 states and 5233 transitions. [2025-03-03 14:52:22,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-03 14:52:22,319 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:52:22,319 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:52:22,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 14:52:22,319 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:52:22,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:52:22,320 INFO L85 PathProgramCache]: Analyzing trace with hash -1356277276, now seen corresponding path program 1 times [2025-03-03 14:52:22,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:52:22,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828219583] [2025-03-03 14:52:22,320 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:52:22,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:52:22,327 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-03 14:52:22,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-03 14:52:22,333 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:52:22,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:52:22,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:52:22,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:52:22,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828219583] [2025-03-03 14:52:22,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828219583] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:52:22,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:52:22,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:52:22,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044727859] [2025-03-03 14:52:22,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:52:22,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:52:22,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:52:22,362 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:52:22,362 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:52:22,362 INFO L87 Difference]: Start difference. First operand 3586 states and 5233 transitions. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:52:22,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:52:22,450 INFO L93 Difference]: Finished difference Result 10278 states and 14931 transitions. [2025-03-03 14:52:22,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:52:22,451 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2025-03-03 14:52:22,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:52:22,471 INFO L225 Difference]: With dead ends: 10278 [2025-03-03 14:52:22,471 INFO L226 Difference]: Without dead ends: 6740 [2025-03-03 14:52:22,476 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-03 14:52:22,477 INFO L435 NwaCegarLoop]: 179 mSDtfsCounter, 57 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 277 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-03 14:52:22,477 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 277 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:52:22,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6740 states. [2025-03-03 14:52:22,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6740 to 6738. [2025-03-03 14:52:22,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6738 states, 6737 states have (on average 1.4322398693780614) internal successors, (9649), 6737 states have internal predecessors, (9649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:52:22,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6738 states to 6738 states and 9649 transitions. [2025-03-03 14:52:22,655 INFO L78 Accepts]: Start accepts. Automaton has 6738 states and 9649 transitions. Word has length 68 [2025-03-03 14:52:22,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:52:22,655 INFO L471 AbstractCegarLoop]: Abstraction has 6738 states and 9649 transitions. [2025-03-03 14:52:22,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:52:22,656 INFO L276 IsEmpty]: Start isEmpty. Operand 6738 states and 9649 transitions. [2025-03-03 14:52:22,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-03 14:52:22,658 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:52:22,658 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:52:22,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 14:52:22,659 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:52:22,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:52:22,660 INFO L85 PathProgramCache]: Analyzing trace with hash 366305133, now seen corresponding path program 1 times [2025-03-03 14:52:22,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:52:22,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657167871] [2025-03-03 14:52:22,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:52:22,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:52:22,671 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-03 14:52:22,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-03 14:52:22,683 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:52:22,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:52:22,838 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-03 14:52:22,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:52:22,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657167871] [2025-03-03 14:52:22,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657167871] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:52:22,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:52:22,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 14:52:22,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212556508] [2025-03-03 14:52:22,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:52:22,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 14:52:22,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:52:22,840 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 14:52:22,840 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:52:22,840 INFO L87 Difference]: Start difference. First operand 6738 states and 9649 transitions. Second operand has 8 states, 8 states have (on average 11.0) internal successors, (88), 8 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:52:23,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:52:23,436 INFO L93 Difference]: Finished difference Result 46336 states and 66424 transitions. [2025-03-03 14:52:23,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 14:52:23,436 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.0) internal successors, (88), 8 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 89 [2025-03-03 14:52:23,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:52:23,529 INFO L225 Difference]: With dead ends: 46336 [2025-03-03 14:52:23,530 INFO L226 Difference]: Without dead ends: 41598 [2025-03-03 14:52:23,583 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-03-03 14:52:23,584 INFO L435 NwaCegarLoop]: 199 mSDtfsCounter, 827 mSDsluCounter, 1076 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 827 SdHoareTripleChecker+Valid, 1275 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:52:23,584 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [827 Valid, 1275 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:52:23,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41598 states. [2025-03-03 14:52:24,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41598 to 12466. [2025-03-03 14:52:24,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12466 states, 12465 states have (on average 1.4261532290413157) internal successors, (17777), 12465 states have internal predecessors, (17777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:52:24,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12466 states to 12466 states and 17777 transitions. [2025-03-03 14:52:24,235 INFO L78 Accepts]: Start accepts. Automaton has 12466 states and 17777 transitions. Word has length 89 [2025-03-03 14:52:24,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:52:24,235 INFO L471 AbstractCegarLoop]: Abstraction has 12466 states and 17777 transitions. [2025-03-03 14:52:24,238 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.0) internal successors, (88), 8 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:52:24,239 INFO L276 IsEmpty]: Start isEmpty. Operand 12466 states and 17777 transitions. [2025-03-03 14:52:24,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-03 14:52:24,242 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:52:24,242 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:52:24,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 14:52:24,242 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:52:24,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:52:24,243 INFO L85 PathProgramCache]: Analyzing trace with hash 211936301, now seen corresponding path program 1 times [2025-03-03 14:52:24,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:52:24,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697648293] [2025-03-03 14:52:24,243 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:52:24,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:52:24,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-03 14:52:24,261 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-03 14:52:24,261 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:52:24,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:52:24,384 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 14:52:24,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:52:24,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697648293] [2025-03-03 14:52:24,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697648293] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:52:24,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:52:24,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 14:52:24,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427618250] [2025-03-03 14:52:24,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:52:24,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 14:52:24,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:52:24,385 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 14:52:24,385 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:52:24,385 INFO L87 Difference]: Start difference. First operand 12466 states and 17777 transitions. Second operand has 8 states, 8 states have (on average 10.75) internal successors, (86), 8 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:52:25,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:52:25,027 INFO L93 Difference]: Finished difference Result 53024 states and 75960 transitions. [2025-03-03 14:52:25,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 14:52:25,029 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.75) internal successors, (86), 8 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 89 [2025-03-03 14:52:25,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:52:25,109 INFO L225 Difference]: With dead ends: 53024 [2025-03-03 14:52:25,109 INFO L226 Difference]: Without dead ends: 46334 [2025-03-03 14:52:25,123 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-03-03 14:52:25,124 INFO L435 NwaCegarLoop]: 198 mSDtfsCounter, 829 mSDsluCounter, 1040 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 829 SdHoareTripleChecker+Valid, 1238 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:52:25,124 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [829 Valid, 1238 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:52:25,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46334 states. [2025-03-03 14:52:25,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46334 to 21522. [2025-03-03 14:52:25,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21522 states, 21521 states have (on average 1.4222852097950838) internal successors, (30609), 21521 states have internal predecessors, (30609), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:52:25,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21522 states to 21522 states and 30609 transitions. [2025-03-03 14:52:25,926 INFO L78 Accepts]: Start accepts. Automaton has 21522 states and 30609 transitions. Word has length 89 [2025-03-03 14:52:25,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:52:25,927 INFO L471 AbstractCegarLoop]: Abstraction has 21522 states and 30609 transitions. [2025-03-03 14:52:25,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.75) internal successors, (86), 8 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:52:25,928 INFO L276 IsEmpty]: Start isEmpty. Operand 21522 states and 30609 transitions. [2025-03-03 14:52:25,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-03 14:52:25,932 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:52:25,932 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:52:25,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 14:52:25,933 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:52:25,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:52:25,933 INFO L85 PathProgramCache]: Analyzing trace with hash -766994195, now seen corresponding path program 1 times [2025-03-03 14:52:25,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:52:25,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814672231] [2025-03-03 14:52:25,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:52:25,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:52:25,946 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-03 14:52:25,958 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-03 14:52:25,959 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:52:25,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:52:26,112 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-03 14:52:26,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:52:26,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814672231] [2025-03-03 14:52:26,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814672231] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:52:26,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:52:26,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 14:52:26,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861602903] [2025-03-03 14:52:26,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:52:26,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 14:52:26,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:52:26,114 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 14:52:26,115 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:52:26,115 INFO L87 Difference]: Start difference. First operand 21522 states and 30609 transitions. Second operand has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:52:26,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:52:26,909 INFO L93 Difference]: Finished difference Result 59712 states and 85464 transitions. [2025-03-03 14:52:26,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 14:52:26,909 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 89 [2025-03-03 14:52:26,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:52:27,003 INFO L225 Difference]: With dead ends: 59712 [2025-03-03 14:52:27,004 INFO L226 Difference]: Without dead ends: 53022 [2025-03-03 14:52:27,017 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-03-03 14:52:27,018 INFO L435 NwaCegarLoop]: 196 mSDtfsCounter, 851 mSDsluCounter, 993 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 851 SdHoareTripleChecker+Valid, 1189 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:52:27,018 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [851 Valid, 1189 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:52:27,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53022 states. [2025-03-03 14:52:27,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53022 to 28210. [2025-03-03 14:52:27,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28210 states, 28209 states have (on average 1.4219929809635223) internal successors, (40113), 28209 states have internal predecessors, (40113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:52:27,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28210 states to 28210 states and 40113 transitions. [2025-03-03 14:52:27,697 INFO L78 Accepts]: Start accepts. Automaton has 28210 states and 40113 transitions. Word has length 89 [2025-03-03 14:52:27,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:52:27,697 INFO L471 AbstractCegarLoop]: Abstraction has 28210 states and 40113 transitions. [2025-03-03 14:52:27,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:52:27,697 INFO L276 IsEmpty]: Start isEmpty. Operand 28210 states and 40113 transitions. [2025-03-03 14:52:27,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-03 14:52:27,701 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:52:27,701 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:52:27,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 14:52:27,701 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:52:27,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:52:27,702 INFO L85 PathProgramCache]: Analyzing trace with hash -1214939731, now seen corresponding path program 1 times [2025-03-03 14:52:27,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:52:27,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296423853] [2025-03-03 14:52:27,702 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:52:27,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:52:27,713 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-03 14:52:27,723 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-03 14:52:27,723 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:52:27,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:52:27,845 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-03 14:52:27,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:52:27,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296423853] [2025-03-03 14:52:27,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296423853] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:52:27,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:52:27,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 14:52:27,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561862772] [2025-03-03 14:52:27,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:52:27,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 14:52:27,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:52:27,847 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 14:52:27,848 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:52:27,848 INFO L87 Difference]: Start difference. First operand 28210 states and 40113 transitions. Second operand has 8 states, 8 states have (on average 10.25) internal successors, (82), 8 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:52:28,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:52:28,943 INFO L93 Difference]: Finished difference Result 66400 states and 94968 transitions. [2025-03-03 14:52:28,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 14:52:28,944 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.25) internal successors, (82), 8 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 89 [2025-03-03 14:52:28,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:52:29,032 INFO L225 Difference]: With dead ends: 66400 [2025-03-03 14:52:29,032 INFO L226 Difference]: Without dead ends: 59710 [2025-03-03 14:52:29,054 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-03-03 14:52:29,055 INFO L435 NwaCegarLoop]: 194 mSDtfsCounter, 887 mSDsluCounter, 983 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 887 SdHoareTripleChecker+Valid, 1177 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:52:29,055 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [887 Valid, 1177 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:52:29,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59710 states. [2025-03-03 14:52:30,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59710 to 34898. [2025-03-03 14:52:30,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34898 states, 34897 states have (on average 1.4218127632747801) internal successors, (49617), 34897 states have internal predecessors, (49617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:52:30,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34898 states to 34898 states and 49617 transitions. [2025-03-03 14:52:30,079 INFO L78 Accepts]: Start accepts. Automaton has 34898 states and 49617 transitions. Word has length 89 [2025-03-03 14:52:30,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:52:30,079 INFO L471 AbstractCegarLoop]: Abstraction has 34898 states and 49617 transitions. [2025-03-03 14:52:30,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.25) internal successors, (82), 8 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:52:30,079 INFO L276 IsEmpty]: Start isEmpty. Operand 34898 states and 49617 transitions. [2025-03-03 14:52:30,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-03 14:52:30,083 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:52:30,083 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:52:30,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 14:52:30,084 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:52:30,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:52:30,084 INFO L85 PathProgramCache]: Analyzing trace with hash -799763859, now seen corresponding path program 1 times [2025-03-03 14:52:30,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:52:30,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885611539] [2025-03-03 14:52:30,084 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:52:30,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:52:30,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-03 14:52:30,102 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-03 14:52:30,103 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:52:30,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:52:30,218 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-03 14:52:30,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:52:30,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885611539] [2025-03-03 14:52:30,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885611539] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:52:30,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:52:30,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 14:52:30,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579748335] [2025-03-03 14:52:30,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:52:30,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 14:52:30,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:52:30,219 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 14:52:30,219 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:52:30,220 INFO L87 Difference]: Start difference. First operand 34898 states and 49617 transitions. Second operand has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:52:31,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:52:31,177 INFO L93 Difference]: Finished difference Result 73088 states and 104472 transitions. [2025-03-03 14:52:31,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 14:52:31,177 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 89 [2025-03-03 14:52:31,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:52:31,249 INFO L225 Difference]: With dead ends: 73088 [2025-03-03 14:52:31,250 INFO L226 Difference]: Without dead ends: 66398 [2025-03-03 14:52:31,264 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-03-03 14:52:31,264 INFO L435 NwaCegarLoop]: 192 mSDtfsCounter, 936 mSDsluCounter, 974 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 936 SdHoareTripleChecker+Valid, 1166 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:52:31,264 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [936 Valid, 1166 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:52:31,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66398 states. [2025-03-03 14:52:32,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66398 to 41586. [2025-03-03 14:52:32,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41586 states, 41585 states have (on average 1.4216905134062763) internal successors, (59121), 41585 states have internal predecessors, (59121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:52:32,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41586 states to 41586 states and 59121 transitions. [2025-03-03 14:52:32,207 INFO L78 Accepts]: Start accepts. Automaton has 41586 states and 59121 transitions. Word has length 89 [2025-03-03 14:52:32,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:52:32,207 INFO L471 AbstractCegarLoop]: Abstraction has 41586 states and 59121 transitions. [2025-03-03 14:52:32,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:52:32,207 INFO L276 IsEmpty]: Start isEmpty. Operand 41586 states and 59121 transitions. [2025-03-03 14:52:32,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-03 14:52:32,211 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:52:32,211 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:52:32,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 14:52:32,211 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:52:32,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:52:32,212 INFO L85 PathProgramCache]: Analyzing trace with hash -1286482131, now seen corresponding path program 1 times [2025-03-03 14:52:32,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:52:32,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566896475] [2025-03-03 14:52:32,212 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:52:32,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:52:32,220 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-03 14:52:32,227 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-03 14:52:32,227 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:52:32,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:52:32,338 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 14:52:32,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:52:32,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566896475] [2025-03-03 14:52:32,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [566896475] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:52:32,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:52:32,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 14:52:32,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24436270] [2025-03-03 14:52:32,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:52:32,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 14:52:32,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:52:32,340 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 14:52:32,340 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:52:32,340 INFO L87 Difference]: Start difference. First operand 41586 states and 59121 transitions. Second operand has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:52:33,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:52:33,663 INFO L93 Difference]: Finished difference Result 79776 states and 113976 transitions. [2025-03-03 14:52:33,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 14:52:33,664 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 89 [2025-03-03 14:52:33,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:52:33,749 INFO L225 Difference]: With dead ends: 79776 [2025-03-03 14:52:33,749 INFO L226 Difference]: Without dead ends: 73086 [2025-03-03 14:52:33,769 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-03-03 14:52:33,769 INFO L435 NwaCegarLoop]: 191 mSDtfsCounter, 851 mSDsluCounter, 1073 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 851 SdHoareTripleChecker+Valid, 1264 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:52:33,769 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [851 Valid, 1264 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:52:33,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73086 states. [2025-03-03 14:52:35,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73086 to 48274. [2025-03-03 14:52:35,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48274 states, 48273 states have (on average 1.421602137841029) internal successors, (68625), 48273 states have internal predecessors, (68625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:52:35,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48274 states to 48274 states and 68625 transitions. [2025-03-03 14:52:35,358 INFO L78 Accepts]: Start accepts. Automaton has 48274 states and 68625 transitions. Word has length 89 [2025-03-03 14:52:35,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:52:35,359 INFO L471 AbstractCegarLoop]: Abstraction has 48274 states and 68625 transitions. [2025-03-03 14:52:35,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:52:35,359 INFO L276 IsEmpty]: Start isEmpty. Operand 48274 states and 68625 transitions. [2025-03-03 14:52:35,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-03 14:52:35,365 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:52:35,366 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:52:35,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 14:52:35,366 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:52:35,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:52:35,366 INFO L85 PathProgramCache]: Analyzing trace with hash -1438763520, now seen corresponding path program 1 times [2025-03-03 14:52:35,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:52:35,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109280357] [2025-03-03 14:52:35,366 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:52:35,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:52:35,375 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-03 14:52:35,390 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-03 14:52:35,394 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:52:35,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:52:35,444 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:52:35,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:52:35,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109280357] [2025-03-03 14:52:35,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109280357] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:52:35,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:52:35,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:52:35,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187732720] [2025-03-03 14:52:35,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:52:35,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:52:35,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:52:35,446 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:52:35,446 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:52:35,446 INFO L87 Difference]: Start difference. First operand 48274 states and 68625 transitions. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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-03 14:52:36,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:52:36,203 INFO L93 Difference]: Finished difference Result 96502 states and 137203 transitions. [2025-03-03 14:52:36,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:52:36,204 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 90 [2025-03-03 14:52:36,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:52:36,256 INFO L225 Difference]: With dead ends: 96502 [2025-03-03 14:52:36,256 INFO L226 Difference]: Without dead ends: 48276 [2025-03-03 14:52:36,282 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-03 14:52:36,282 INFO L435 NwaCegarLoop]: 165 mSDtfsCounter, 53 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 276 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-03 14:52:36,283 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 276 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:52:36,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48276 states. [2025-03-03 14:52:37,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48276 to 48274. [2025-03-03 14:52:37,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48274 states, 48273 states have (on average 1.4073498643133844) internal successors, (67937), 48273 states have internal predecessors, (67937), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:52:37,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48274 states to 48274 states and 67937 transitions. [2025-03-03 14:52:37,273 INFO L78 Accepts]: Start accepts. Automaton has 48274 states and 67937 transitions. Word has length 90 [2025-03-03 14:52:37,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:52:37,273 INFO L471 AbstractCegarLoop]: Abstraction has 48274 states and 67937 transitions. [2025-03-03 14:52:37,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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-03 14:52:37,273 INFO L276 IsEmpty]: Start isEmpty. Operand 48274 states and 67937 transitions. [2025-03-03 14:52:37,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-03 14:52:37,276 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:52:37,276 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:52:37,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-03 14:52:37,276 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:52:37,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:52:37,276 INFO L85 PathProgramCache]: Analyzing trace with hash -1334968501, now seen corresponding path program 1 times [2025-03-03 14:52:37,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:52:37,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768906107] [2025-03-03 14:52:37,276 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:52:37,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:52:37,284 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-03 14:52:37,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-03 14:52:37,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:52:37,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:52:37,341 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:52:37,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:52:37,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768906107] [2025-03-03 14:52:37,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768906107] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:52:37,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:52:37,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:52:37,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729580328] [2025-03-03 14:52:37,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:52:37,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:52:37,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:52:37,343 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:52:37,343 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:52:37,343 INFO L87 Difference]: Start difference. First operand 48274 states and 67937 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:52:37,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:52:37,876 INFO L93 Difference]: Finished difference Result 66059 states and 93161 transitions. [2025-03-03 14:52:37,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:52:37,876 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2025-03-03 14:52:37,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:52:37,895 INFO L225 Difference]: With dead ends: 66059 [2025-03-03 14:52:37,895 INFO L226 Difference]: Without dead ends: 17833 [2025-03-03 14:52:37,923 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-03 14:52:37,923 INFO L435 NwaCegarLoop]: 163 mSDtfsCounter, 47 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 273 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-03 14:52:37,923 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 273 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:52:37,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17833 states. [2025-03-03 14:52:38,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17833 to 17825. [2025-03-03 14:52:38,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17825 states, 17824 states have (on average 1.4039497307001796) internal successors, (25024), 17824 states have internal predecessors, (25024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:52:38,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17825 states to 17825 states and 25024 transitions. [2025-03-03 14:52:38,412 INFO L78 Accepts]: Start accepts. Automaton has 17825 states and 25024 transitions. Word has length 91 [2025-03-03 14:52:38,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:52:38,412 INFO L471 AbstractCegarLoop]: Abstraction has 17825 states and 25024 transitions. [2025-03-03 14:52:38,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:52:38,412 INFO L276 IsEmpty]: Start isEmpty. Operand 17825 states and 25024 transitions. [2025-03-03 14:52:38,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-03 14:52:38,414 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:52:38,414 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:52:38,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-03 14:52:38,414 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:52:38,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:52:38,415 INFO L85 PathProgramCache]: Analyzing trace with hash -1232786841, now seen corresponding path program 1 times [2025-03-03 14:52:38,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:52:38,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292089843] [2025-03-03 14:52:38,415 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:52:38,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:52:38,424 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-03 14:52:38,434 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-03 14:52:38,434 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:52:38,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:52:38,499 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:52:38,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:52:38,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292089843] [2025-03-03 14:52:38,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292089843] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:52:38,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:52:38,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:52:38,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962851667] [2025-03-03 14:52:38,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:52:38,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:52:38,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:52:38,501 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:52:38,501 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:52:38,501 INFO L87 Difference]: Start difference. First operand 17825 states and 25024 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:52:38,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:52:38,712 INFO L93 Difference]: Finished difference Result 26709 states and 37506 transitions. [2025-03-03 14:52:38,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:52:38,712 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 92 [2025-03-03 14:52:38,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:52:38,724 INFO L225 Difference]: With dead ends: 26709 [2025-03-03 14:52:38,724 INFO L226 Difference]: Without dead ends: 8947 [2025-03-03 14:52:38,736 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-03 14:52:38,737 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 49 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 252 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-03 14:52:38,737 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 252 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:52:38,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8947 states. [2025-03-03 14:52:38,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8947 to 8945. [2025-03-03 14:52:38,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8945 states, 8944 states have (on average 1.389087656529517) internal successors, (12424), 8944 states have internal predecessors, (12424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:52:38,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8945 states to 8945 states and 12424 transitions. [2025-03-03 14:52:38,984 INFO L78 Accepts]: Start accepts. Automaton has 8945 states and 12424 transitions. Word has length 92 [2025-03-03 14:52:38,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:52:38,985 INFO L471 AbstractCegarLoop]: Abstraction has 8945 states and 12424 transitions. [2025-03-03 14:52:38,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:52:38,985 INFO L276 IsEmpty]: Start isEmpty. Operand 8945 states and 12424 transitions. [2025-03-03 14:52:38,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-03 14:52:38,986 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:52:38,986 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:52:38,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-03 14:52:38,986 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:52:38,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:52:38,987 INFO L85 PathProgramCache]: Analyzing trace with hash 911955950, now seen corresponding path program 1 times [2025-03-03 14:52:38,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:52:38,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363444179] [2025-03-03 14:52:38,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:52:38,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:52:38,996 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-03 14:52:39,006 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-03 14:52:39,006 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:52:39,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:52:39,063 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:52:39,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:52:39,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363444179] [2025-03-03 14:52:39,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363444179] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:52:39,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:52:39,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:52:39,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739403160] [2025-03-03 14:52:39,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:52:39,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:52:39,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:52:39,064 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:52:39,064 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:52:39,064 INFO L87 Difference]: Start difference. First operand 8945 states and 12424 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:52:39,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:52:39,170 INFO L93 Difference]: Finished difference Result 13389 states and 18606 transitions. [2025-03-03 14:52:39,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:52:39,171 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2025-03-03 14:52:39,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:52:39,177 INFO L225 Difference]: With dead ends: 13389 [2025-03-03 14:52:39,177 INFO L226 Difference]: Without dead ends: 4507 [2025-03-03 14:52:39,182 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-03 14:52:39,184 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 46 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 237 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-03 14:52:39,184 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 237 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:52:39,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4507 states. [2025-03-03 14:52:39,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4507 to 4505. [2025-03-03 14:52:39,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4505 states, 4504 states have (on average 1.3730017761989344) internal successors, (6184), 4504 states have internal predecessors, (6184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:52:39,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4505 states to 4505 states and 6184 transitions. [2025-03-03 14:52:39,365 INFO L78 Accepts]: Start accepts. Automaton has 4505 states and 6184 transitions. Word has length 94 [2025-03-03 14:52:39,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:52:39,365 INFO L471 AbstractCegarLoop]: Abstraction has 4505 states and 6184 transitions. [2025-03-03 14:52:39,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:52:39,365 INFO L276 IsEmpty]: Start isEmpty. Operand 4505 states and 6184 transitions. [2025-03-03 14:52:39,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-03 14:52:39,366 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:52:39,366 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:52:39,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-03 14:52:39,367 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:52:39,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:52:39,367 INFO L85 PathProgramCache]: Analyzing trace with hash -1244189035, now seen corresponding path program 1 times [2025-03-03 14:52:39,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:52:39,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387905900] [2025-03-03 14:52:39,368 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:52:39,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:52:39,376 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-03 14:52:39,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-03 14:52:39,385 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:52:39,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:52:39,427 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:52:39,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:52:39,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387905900] [2025-03-03 14:52:39,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387905900] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:52:39,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:52:39,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:52:39,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964042342] [2025-03-03 14:52:39,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:52:39,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:52:39,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:52:39,428 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:52:39,428 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:52:39,428 INFO L87 Difference]: Start difference. First operand 4505 states and 6184 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:52:39,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:52:39,480 INFO L93 Difference]: Finished difference Result 6729 states and 9246 transitions. [2025-03-03 14:52:39,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:52:39,481 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 96 [2025-03-03 14:52:39,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:52:39,484 INFO L225 Difference]: With dead ends: 6729 [2025-03-03 14:52:39,484 INFO L226 Difference]: Without dead ends: 2287 [2025-03-03 14:52:39,486 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-03 14:52:39,486 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 43 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 222 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-03 14:52:39,487 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 222 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:52:39,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2287 states. [2025-03-03 14:52:39,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2287 to 2285. [2025-03-03 14:52:39,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2285 states, 2284 states have (on average 1.3546409807355517) internal successors, (3094), 2284 states have internal predecessors, (3094), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:52:39,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2285 states to 2285 states and 3094 transitions. [2025-03-03 14:52:39,536 INFO L78 Accepts]: Start accepts. Automaton has 2285 states and 3094 transitions. Word has length 96 [2025-03-03 14:52:39,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:52:39,537 INFO L471 AbstractCegarLoop]: Abstraction has 2285 states and 3094 transitions. [2025-03-03 14:52:39,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:52:39,537 INFO L276 IsEmpty]: Start isEmpty. Operand 2285 states and 3094 transitions. [2025-03-03 14:52:39,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-03 14:52:39,537 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:52:39,538 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:52:39,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-03 14:52:39,538 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:52:39,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:52:39,538 INFO L85 PathProgramCache]: Analyzing trace with hash -941547940, now seen corresponding path program 1 times [2025-03-03 14:52:39,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:52:39,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415807922] [2025-03-03 14:52:39,539 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:52:39,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:52:39,547 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-03 14:52:39,554 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-03 14:52:39,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:52:39,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:52:39,599 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:52:39,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:52:39,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415807922] [2025-03-03 14:52:39,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415807922] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:52:39,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:52:39,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:52:39,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873360269] [2025-03-03 14:52:39,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:52:39,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:52:39,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:52:39,600 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:52:39,600 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:52:39,600 INFO L87 Difference]: Start difference. First operand 2285 states and 3094 transitions. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:52:39,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:52:39,625 INFO L93 Difference]: Finished difference Result 3399 states and 4611 transitions. [2025-03-03 14:52:39,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:52:39,625 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have 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-03 14:52:39,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:52:39,628 INFO L225 Difference]: With dead ends: 3399 [2025-03-03 14:52:39,628 INFO L226 Difference]: Without dead ends: 1177 [2025-03-03 14:52:39,629 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-03 14:52:39,630 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 40 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 207 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-03 14:52:39,630 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 207 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:52:39,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1177 states. [2025-03-03 14:52:39,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1177 to 1175. [2025-03-03 14:52:39,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1175 states, 1174 states have (on average 1.332197614991482) internal successors, (1564), 1174 states have internal predecessors, (1564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:52:39,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1175 states to 1175 states and 1564 transitions. [2025-03-03 14:52:39,649 INFO L78 Accepts]: Start accepts. Automaton has 1175 states and 1564 transitions. Word has length 98 [2025-03-03 14:52:39,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:52:39,649 INFO L471 AbstractCegarLoop]: Abstraction has 1175 states and 1564 transitions. [2025-03-03 14:52:39,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:52:39,649 INFO L276 IsEmpty]: Start isEmpty. Operand 1175 states and 1564 transitions. [2025-03-03 14:52:39,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-03 14:52:39,650 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:52:39,651 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:52:39,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-03 14:52:39,651 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:52:39,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:52:39,651 INFO L85 PathProgramCache]: Analyzing trace with hash 1832097603, now seen corresponding path program 1 times [2025-03-03 14:52:39,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:52:39,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722300521] [2025-03-03 14:52:39,651 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:52:39,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:52:39,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-03 14:52:39,671 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-03 14:52:39,675 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:52:39,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:52:39,752 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-03 14:52:39,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:52:39,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722300521] [2025-03-03 14:52:39,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722300521] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:52:39,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [842584234] [2025-03-03 14:52:39,753 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:52:39,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:52:39,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:52:39,755 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:52:39,758 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 14:52:39,823 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-03 14:52:39,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-03 14:52:39,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:52:39,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:52:39,871 INFO L256 TraceCheckSpWp]: Trace formula consists of 470 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-03 14:52:39,876 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:52:40,321 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 15 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:52:40,324 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:52:41,065 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 15 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:52:41,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [842584234] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:52:41,066 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:52:41,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 9, 9] total 20 [2025-03-03 14:52:41,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673109538] [2025-03-03 14:52:41,066 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:52:41,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-03 14:52:41,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:52:41,068 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-03 14:52:41,068 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=314, Unknown=0, NotChecked=0, Total=380 [2025-03-03 14:52:41,068 INFO L87 Difference]: Start difference. First operand 1175 states and 1564 transitions. Second operand has 20 states, 20 states have (on average 13.35) internal successors, (267), 20 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:52:41,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:52:41,763 INFO L93 Difference]: Finished difference Result 4591 states and 6057 transitions. [2025-03-03 14:52:41,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-03 14:52:41,763 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 13.35) internal successors, (267), 20 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2025-03-03 14:52:41,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:52:41,767 INFO L225 Difference]: With dead ends: 4591 [2025-03-03 14:52:41,767 INFO L226 Difference]: Without dead ends: 3479 [2025-03-03 14:52:41,768 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 326 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=394, Invalid=1246, Unknown=0, NotChecked=0, Total=1640 [2025-03-03 14:52:41,769 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 713 mSDsluCounter, 530 mSDsCounter, 0 mSdLazyCounter, 562 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 713 SdHoareTripleChecker+Valid, 616 SdHoareTripleChecker+Invalid, 577 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 562 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 14:52:41,769 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [713 Valid, 616 Invalid, 577 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 562 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 14:52:41,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3479 states. [2025-03-03 14:52:41,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3479 to 3271. [2025-03-03 14:52:41,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3271 states, 3270 states have (on average 1.2856269113149847) internal successors, (4204), 3270 states have internal predecessors, (4204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:52:41,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3271 states to 3271 states and 4204 transitions. [2025-03-03 14:52:41,831 INFO L78 Accepts]: Start accepts. Automaton has 3271 states and 4204 transitions. Word has length 100 [2025-03-03 14:52:41,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:52:41,832 INFO L471 AbstractCegarLoop]: Abstraction has 3271 states and 4204 transitions. [2025-03-03 14:52:41,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 13.35) internal successors, (267), 20 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:52:41,832 INFO L276 IsEmpty]: Start isEmpty. Operand 3271 states and 4204 transitions. [2025-03-03 14:52:41,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-03 14:52:41,833 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:52:41,833 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:52:41,841 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 14:52:42,033 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,SelfDestructingSolverStorable24 [2025-03-03 14:52:42,034 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:52:42,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:52:42,038 INFO L85 PathProgramCache]: Analyzing trace with hash -1474806611, now seen corresponding path program 1 times [2025-03-03 14:52:42,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:52:42,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892064831] [2025-03-03 14:52:42,038 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:52:42,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:52:42,050 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-03 14:52:42,059 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-03 14:52:42,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:52:42,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:52:42,378 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:52:42,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:52:42,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892064831] [2025-03-03 14:52:42,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892064831] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:52:42,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1580624018] [2025-03-03 14:52:42,379 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:52:42,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:52:42,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:52:42,381 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:52:42,382 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 14:52:42,447 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-03 14:52:42,489 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-03 14:52:42,489 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:52:42,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:52:42,491 INFO L256 TraceCheckSpWp]: Trace formula consists of 475 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-03 14:52:42,493 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:52:42,923 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:52:42,923 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:52:43,838 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:52:43,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1580624018] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:52:43,839 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:52:43,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 24 [2025-03-03 14:52:43,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786984505] [2025-03-03 14:52:43,839 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:52:43,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-03 14:52:43,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:52:43,840 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-03 14:52:43,840 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=514, Unknown=0, NotChecked=0, Total=600 [2025-03-03 14:52:43,840 INFO L87 Difference]: Start difference. First operand 3271 states and 4204 transitions. Second operand has 25 states, 25 states have (on average 11.52) internal successors, (288), 24 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:52:45,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:52:45,246 INFO L93 Difference]: Finished difference Result 15595 states and 20122 transitions. [2025-03-03 14:52:45,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-03-03 14:52:45,251 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 11.52) internal successors, (288), 24 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 101 [2025-03-03 14:52:45,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:52:45,270 INFO L225 Difference]: With dead ends: 15595 [2025-03-03 14:52:45,270 INFO L226 Difference]: Without dead ends: 12582 [2025-03-03 14:52:45,276 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 620 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=635, Invalid=2445, Unknown=0, NotChecked=0, Total=3080 [2025-03-03 14:52:45,277 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 2304 mSDsluCounter, 1024 mSDsCounter, 0 mSdLazyCounter, 905 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2304 SdHoareTripleChecker+Valid, 1122 SdHoareTripleChecker+Invalid, 936 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 905 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 14:52:45,277 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2304 Valid, 1122 Invalid, 936 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 905 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 14:52:45,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12582 states. [2025-03-03 14:52:45,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12582 to 12450. [2025-03-03 14:52:45,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12450 states, 12449 states have (on average 1.2626717005381958) internal successors, (15719), 12449 states have internal predecessors, (15719), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:52:45,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12450 states to 12450 states and 15719 transitions. [2025-03-03 14:52:45,531 INFO L78 Accepts]: Start accepts. Automaton has 12450 states and 15719 transitions. Word has length 101 [2025-03-03 14:52:45,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:52:45,531 INFO L471 AbstractCegarLoop]: Abstraction has 12450 states and 15719 transitions. [2025-03-03 14:52:45,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 11.52) internal successors, (288), 24 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:52:45,531 INFO L276 IsEmpty]: Start isEmpty. Operand 12450 states and 15719 transitions. [2025-03-03 14:52:45,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-03 14:52:45,533 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:52:45,533 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:52:45,540 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-03 14:52:45,733 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,SelfDestructingSolverStorable25 [2025-03-03 14:52:45,734 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:52:45,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:52:45,734 INFO L85 PathProgramCache]: Analyzing trace with hash 729837303, now seen corresponding path program 1 times [2025-03-03 14:52:45,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:52:45,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779298430] [2025-03-03 14:52:45,734 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:52:45,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:52:45,742 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-03 14:52:45,762 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-03 14:52:45,763 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:52:45,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:52:46,002 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 15 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:52:46,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:52:46,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779298430] [2025-03-03 14:52:46,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779298430] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:52:46,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [613736901] [2025-03-03 14:52:46,003 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:52:46,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:52:46,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:52:46,006 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:52:46,007 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 14:52:46,067 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-03 14:52:46,106 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-03 14:52:46,106 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:52:46,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:52:46,108 INFO L256 TraceCheckSpWp]: Trace formula consists of 477 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-03 14:52:46,110 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:52:46,362 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 15 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:52:46,362 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:52:46,997 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 15 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:52:46,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [613736901] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:52:46,997 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:52:46,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2025-03-03 14:52:46,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606537884] [2025-03-03 14:52:46,997 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:52:46,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-03 14:52:46,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:52:46,998 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-03 14:52:46,998 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=328, Unknown=0, NotChecked=0, Total=420 [2025-03-03 14:52:46,998 INFO L87 Difference]: Start difference. First operand 12450 states and 15719 transitions. Second operand has 21 states, 21 states have (on average 10.333333333333334) internal successors, (217), 20 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:52:47,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:52:47,683 INFO L93 Difference]: Finished difference Result 25594 states and 32655 transitions. [2025-03-03 14:52:47,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-03 14:52:47,684 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 10.333333333333334) internal successors, (217), 20 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 102 [2025-03-03 14:52:47,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:52:47,701 INFO L225 Difference]: With dead ends: 25594 [2025-03-03 14:52:47,701 INFO L226 Difference]: Without dead ends: 14728 [2025-03-03 14:52:47,710 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=215, Invalid=597, Unknown=0, NotChecked=0, Total=812 [2025-03-03 14:52:47,710 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 630 mSDsluCounter, 542 mSDsCounter, 0 mSdLazyCounter, 432 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 630 SdHoareTripleChecker+Valid, 632 SdHoareTripleChecker+Invalid, 441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 432 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 14:52:47,711 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [630 Valid, 632 Invalid, 441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 432 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 14:52:47,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14728 states. [2025-03-03 14:52:48,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14728 to 14724. [2025-03-03 14:52:48,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14724 states, 14723 states have (on average 1.2650275079807105) internal successors, (18625), 14723 states have internal predecessors, (18625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:52:48,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14724 states to 14724 states and 18625 transitions. [2025-03-03 14:52:48,222 INFO L78 Accepts]: Start accepts. Automaton has 14724 states and 18625 transitions. Word has length 102 [2025-03-03 14:52:48,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:52:48,222 INFO L471 AbstractCegarLoop]: Abstraction has 14724 states and 18625 transitions. [2025-03-03 14:52:48,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 10.333333333333334) internal successors, (217), 20 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:52:48,223 INFO L276 IsEmpty]: Start isEmpty. Operand 14724 states and 18625 transitions. [2025-03-03 14:52:48,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-03 14:52:48,224 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:52:48,224 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:52:48,230 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-03 14:52:48,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:52:48,425 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:52:48,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:52:48,425 INFO L85 PathProgramCache]: Analyzing trace with hash -459379502, now seen corresponding path program 1 times [2025-03-03 14:52:48,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:52:48,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303886272] [2025-03-03 14:52:48,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:52:48,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:52:48,434 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-03 14:52:48,456 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-03 14:52:48,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:52:48,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:52:48,794 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:52:48,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:52:48,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303886272] [2025-03-03 14:52:48,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303886272] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:52:48,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [861738890] [2025-03-03 14:52:48,795 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:52:48,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:52:48,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:52:48,797 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:52:48,799 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 14:52:48,867 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-03 14:52:48,912 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-03 14:52:48,912 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:52:48,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:52:48,914 INFO L256 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-03 14:52:48,917 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:52:50,391 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:52:50,391 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:52:51,766 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:52:51,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [861738890] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:52:51,767 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:52:51,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 15, 15] total 36 [2025-03-03 14:52:51,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734920861] [2025-03-03 14:52:51,767 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:52:51,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-03-03 14:52:51,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:52:51,768 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-03-03 14:52:51,768 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=1131, Unknown=0, NotChecked=0, Total=1332 [2025-03-03 14:52:51,768 INFO L87 Difference]: Start difference. First operand 14724 states and 18625 transitions. Second operand has 37 states, 37 states have (on average 7.1891891891891895) internal successors, (266), 36 states have internal predecessors, (266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:53:06,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:53:06,701 INFO L93 Difference]: Finished difference Result 88908 states and 114582 transitions. [2025-03-03 14:53:06,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 161 states. [2025-03-03 14:53:06,702 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 7.1891891891891895) internal successors, (266), 36 states have internal predecessors, (266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 103 [2025-03-03 14:53:06,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:53:06,776 INFO L225 Difference]: With dead ends: 88908 [2025-03-03 14:53:06,776 INFO L226 Difference]: Without dead ends: 74492 [2025-03-03 14:53:06,800 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 372 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 194 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13871 ImplicationChecksByTransitivity, 12.7s TimeCoverageRelationStatistics Valid=5998, Invalid=32222, Unknown=0, NotChecked=0, Total=38220 [2025-03-03 14:53:06,800 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 6256 mSDsluCounter, 2329 mSDsCounter, 0 mSdLazyCounter, 2596 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6256 SdHoareTripleChecker+Valid, 2466 SdHoareTripleChecker+Invalid, 2703 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 2596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-03 14:53:06,801 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6256 Valid, 2466 Invalid, 2703 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 2596 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-03 14:53:06,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74492 states. [2025-03-03 14:53:08,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74492 to 53981. [2025-03-03 14:53:08,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53981 states, 53980 states have (on average 1.2683401259725824) internal successors, (68465), 53980 states have internal predecessors, (68465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:53:08,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53981 states to 53981 states and 68465 transitions. [2025-03-03 14:53:08,200 INFO L78 Accepts]: Start accepts. Automaton has 53981 states and 68465 transitions. Word has length 103 [2025-03-03 14:53:08,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:53:08,201 INFO L471 AbstractCegarLoop]: Abstraction has 53981 states and 68465 transitions. [2025-03-03 14:53:08,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 7.1891891891891895) internal successors, (266), 36 states have internal predecessors, (266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:53:08,201 INFO L276 IsEmpty]: Start isEmpty. Operand 53981 states and 68465 transitions. [2025-03-03 14:53:08,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-03 14:53:08,203 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:53:08,203 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:53:08,209 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-03 14:53:08,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-03-03 14:53:08,403 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:53:08,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:53:08,404 INFO L85 PathProgramCache]: Analyzing trace with hash -1779851210, now seen corresponding path program 1 times [2025-03-03 14:53:08,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:53:08,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073561645] [2025-03-03 14:53:08,404 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:53:08,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:53:08,412 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-03 14:53:08,446 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-03 14:53:08,446 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:53:08,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:53:08,945 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:53:08,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:53:08,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073561645] [2025-03-03 14:53:08,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073561645] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:53:08,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [309131396] [2025-03-03 14:53:08,945 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:53:08,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:53:08,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:53:08,947 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-03 14:53:08,949 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-03 14:53:09,013 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-03 14:53:09,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-03 14:53:09,061 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:53:09,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:53:09,063 INFO L256 TraceCheckSpWp]: Trace formula consists of 483 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-03 14:53:09,065 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:53:09,716 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:53:09,716 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:53:10,731 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:53:10,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [309131396] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:53:10,731 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:53:10,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 36 [2025-03-03 14:53:10,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873832869] [2025-03-03 14:53:10,731 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:53:10,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-03-03 14:53:10,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:53:10,732 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-03-03 14:53:10,732 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=1141, Unknown=0, NotChecked=0, Total=1260 [2025-03-03 14:53:10,732 INFO L87 Difference]: Start difference. First operand 53981 states and 68465 transitions. Second operand has 36 states, 36 states have (on average 8.027777777777779) internal successors, (289), 36 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:53:18,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:53:18,483 INFO L93 Difference]: Finished difference Result 149247 states and 188298 transitions. [2025-03-03 14:53:18,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2025-03-03 14:53:18,484 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 8.027777777777779) internal successors, (289), 36 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2025-03-03 14:53:18,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:53:18,618 INFO L225 Difference]: With dead ends: 149247 [2025-03-03 14:53:18,618 INFO L226 Difference]: Without dead ends: 125671 [2025-03-03 14:53:18,659 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 301 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3811 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=2257, Invalid=10853, Unknown=0, NotChecked=0, Total=13110 [2025-03-03 14:53:18,659 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 6256 mSDsluCounter, 1419 mSDsCounter, 0 mSdLazyCounter, 2069 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6256 SdHoareTripleChecker+Valid, 1494 SdHoareTripleChecker+Invalid, 2153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 2069 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:53:18,659 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6256 Valid, 1494 Invalid, 2153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 2069 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 14:53:18,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125671 states. [2025-03-03 14:53:20,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125671 to 71349. [2025-03-03 14:53:21,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71349 states, 71348 states have (on average 1.2652772327185065) internal successors, (90275), 71348 states have internal predecessors, (90275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:53:21,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71349 states to 71349 states and 90275 transitions. [2025-03-03 14:53:21,129 INFO L78 Accepts]: Start accepts. Automaton has 71349 states and 90275 transitions. Word has length 105 [2025-03-03 14:53:21,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:53:21,129 INFO L471 AbstractCegarLoop]: Abstraction has 71349 states and 90275 transitions. [2025-03-03 14:53:21,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 8.027777777777779) internal successors, (289), 36 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:53:21,129 INFO L276 IsEmpty]: Start isEmpty. Operand 71349 states and 90275 transitions. [2025-03-03 14:53:21,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-03 14:53:21,131 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:53:21,131 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:53:21,138 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-03 14:53:21,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-03-03 14:53:21,332 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:53:21,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:53:21,333 INFO L85 PathProgramCache]: Analyzing trace with hash -1076368682, now seen corresponding path program 1 times [2025-03-03 14:53:21,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:53:21,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755876517] [2025-03-03 14:53:21,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:53:21,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:53:21,343 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-03 14:53:21,368 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-03 14:53:21,368 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:53:21,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:53:22,144 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:53:22,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:53:22,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755876517] [2025-03-03 14:53:22,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755876517] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:53:22,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [231342754] [2025-03-03 14:53:22,145 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:53:22,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:53:22,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:53:22,151 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-03 14:53:22,153 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-03 14:53:22,240 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-03 14:53:22,288 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-03 14:53:22,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:53:22,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:53:22,290 INFO L256 TraceCheckSpWp]: Trace formula consists of 483 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-03 14:53:22,292 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:53:22,888 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:53:22,888 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:53:23,509 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:53:23,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [231342754] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:53:23,509 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:53:23,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 13] total 35 [2025-03-03 14:53:23,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366604173] [2025-03-03 14:53:23,510 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:53:23,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-03-03 14:53:23,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:53:23,510 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-03-03 14:53:23,511 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=1072, Unknown=0, NotChecked=0, Total=1190 [2025-03-03 14:53:23,511 INFO L87 Difference]: Start difference. First operand 71349 states and 90275 transitions. Second operand has 35 states, 35 states have (on average 7.9714285714285715) internal successors, (279), 35 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:53:33,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:53:33,564 INFO L93 Difference]: Finished difference Result 224018 states and 283809 transitions. [2025-03-03 14:53:33,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2025-03-03 14:53:33,564 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 7.9714285714285715) internal successors, (279), 35 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2025-03-03 14:53:33,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:53:33,747 INFO L225 Difference]: With dead ends: 224018 [2025-03-03 14:53:33,747 INFO L226 Difference]: Without dead ends: 162910 [2025-03-03 14:53:33,787 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3857 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=2051, Invalid=10605, Unknown=0, NotChecked=0, Total=12656 [2025-03-03 14:53:33,788 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 3236 mSDsluCounter, 3681 mSDsCounter, 0 mSdLazyCounter, 4062 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3236 SdHoareTripleChecker+Valid, 3850 SdHoareTripleChecker+Invalid, 4128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 4062 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-03 14:53:33,788 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3236 Valid, 3850 Invalid, 4128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 4062 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-03 14:53:33,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162910 states. [2025-03-03 14:53:36,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162910 to 79832. [2025-03-03 14:53:36,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79832 states, 79831 states have (on average 1.2650474126592426) internal successors, (100990), 79831 states have internal predecessors, (100990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:53:36,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79832 states to 79832 states and 100990 transitions. [2025-03-03 14:53:36,848 INFO L78 Accepts]: Start accepts. Automaton has 79832 states and 100990 transitions. Word has length 105 [2025-03-03 14:53:36,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:53:36,848 INFO L471 AbstractCegarLoop]: Abstraction has 79832 states and 100990 transitions. [2025-03-03 14:53:36,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 7.9714285714285715) internal successors, (279), 35 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:53:36,848 INFO L276 IsEmpty]: Start isEmpty. Operand 79832 states and 100990 transitions. [2025-03-03 14:53:36,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-03 14:53:36,849 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:53:36,849 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:53:36,856 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-03 14:53:37,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:53:37,050 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:53:37,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:53:37,050 INFO L85 PathProgramCache]: Analyzing trace with hash 298725782, now seen corresponding path program 1 times [2025-03-03 14:53:37,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:53:37,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385339264] [2025-03-03 14:53:37,050 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:53:37,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:53:37,058 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-03 14:53:37,081 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-03 14:53:37,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:53:37,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:53:39,358 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:53:39,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:53:39,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385339264] [2025-03-03 14:53:39,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385339264] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:53:39,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [796401433] [2025-03-03 14:53:39,358 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:53:39,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:53:39,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:53:39,363 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-03 14:53:39,364 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-03 14:53:39,439 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-03 14:53:39,489 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-03 14:53:39,489 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:53:39,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:53:39,491 INFO L256 TraceCheckSpWp]: Trace formula consists of 483 conjuncts, 80 conjuncts are in the unsatisfiable core [2025-03-03 14:53:39,493 INFO L279 TraceCheckSpWp]: Computing forward predicates...