./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.ufo.UNBOUNDED.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_opt-floodmax.3.ufo.UNBOUNDED.pals.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 558f970b63375a18824a4471ce91e71e4e14632a20bfa5002df552fa8b202ea3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 14:53:45,566 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 14:53:45,614 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 14:53:45,619 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 14:53:45,619 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 14:53:45,640 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 14:53:45,640 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 14:53:45,641 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 14:53:45,641 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 14:53:45,641 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 14:53:45,641 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 14:53:45,641 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 14:53:45,641 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 14:53:45,641 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 14:53:45,641 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 14:53:45,642 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 14:53:45,642 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 14:53:45,642 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 14:53:45,642 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 14:53:45,642 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 14:53:45,642 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 14:53:45,642 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 14:53:45,642 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 14:53:45,642 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 14:53:45,642 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 14:53:45,642 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 14:53:45,643 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 14:53:45,643 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 14:53:45,643 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 14:53:45,643 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 14:53:45,643 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 14:53:45,643 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 14:53:45,643 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:53:45,643 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 14:53:45,643 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 14:53:45,643 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 14:53:45,643 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 14:53:45,643 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 14:53:45,643 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 14:53:45,643 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 14:53:45,643 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 14:53:45,643 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 14:53:45,643 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 14:53:45,643 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 -> 558f970b63375a18824a4471ce91e71e4e14632a20bfa5002df552fa8b202ea3 [2025-03-03 14:53:45,897 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 14:53:45,907 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 14:53:45,910 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 14:53:45,912 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 14:53:45,913 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 14:53:45,915 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.ufo.UNBOUNDED.pals.c [2025-03-03 14:53:47,079 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d651fb3f3/edc1ed5e1a2649579b37bad04bcde7fe/FLAG3ae0ecf0e [2025-03-03 14:53:47,339 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 14:53:47,340 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.ufo.UNBOUNDED.pals.c [2025-03-03 14:53:47,348 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d651fb3f3/edc1ed5e1a2649579b37bad04bcde7fe/FLAG3ae0ecf0e [2025-03-03 14:53:47,366 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d651fb3f3/edc1ed5e1a2649579b37bad04bcde7fe [2025-03-03 14:53:47,368 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 14:53:47,370 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 14:53:47,371 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 14:53:47,371 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 14:53:47,374 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 14:53:47,375 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:53:47" (1/1) ... [2025-03-03 14:53:47,376 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f713cbb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:53:47, skipping insertion in model container [2025-03-03 14:53:47,376 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:53:47" (1/1) ... [2025-03-03 14:53:47,402 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 14:53:47,591 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_opt-floodmax.3.ufo.UNBOUNDED.pals.c[14509,14522] [2025-03-03 14:53:47,594 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:53:47,604 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 14:53:47,643 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_opt-floodmax.3.ufo.UNBOUNDED.pals.c[14509,14522] [2025-03-03 14:53:47,644 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:53:47,661 INFO L204 MainTranslator]: Completed translation [2025-03-03 14:53:47,662 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:53:47 WrapperNode [2025-03-03 14:53:47,662 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 14:53:47,663 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 14:53:47,663 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 14:53:47,663 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 14:53:47,668 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:53:47" (1/1) ... [2025-03-03 14:53:47,681 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:53:47" (1/1) ... [2025-03-03 14:53:47,706 INFO L138 Inliner]: procedures = 23, calls = 14, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 493 [2025-03-03 14:53:47,707 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 14:53:47,707 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 14:53:47,707 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 14:53:47,707 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 14:53:47,713 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:53:47" (1/1) ... [2025-03-03 14:53:47,714 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:53:47" (1/1) ... [2025-03-03 14:53:47,716 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:53:47" (1/1) ... [2025-03-03 14:53:47,727 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:53:47,727 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:53:47" (1/1) ... [2025-03-03 14:53:47,727 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:53:47" (1/1) ... [2025-03-03 14:53:47,735 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:53:47" (1/1) ... [2025-03-03 14:53:47,741 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:53:47" (1/1) ... [2025-03-03 14:53:47,742 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:53:47" (1/1) ... [2025-03-03 14:53:47,743 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:53:47" (1/1) ... [2025-03-03 14:53:47,747 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 14:53:47,747 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 14:53:47,747 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 14:53:47,748 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 14:53:47,752 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:53:47" (1/1) ... [2025-03-03 14:53:47,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:53:47,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:53:47,786 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:53:47,796 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:53:47,815 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 14:53:47,815 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 14:53:47,815 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 14:53:47,815 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 14:53:47,904 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 14:53:47,907 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 14:53:48,465 INFO L? ?]: Removed 48 outVars from TransFormulas that were not future-live. [2025-03-03 14:53:48,465 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 14:53:48,474 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 14:53:48,476 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 14:53:48,477 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:53:48 BoogieIcfgContainer [2025-03-03 14:53:48,477 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 14:53:48,479 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 14:53:48,479 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 14:53:48,483 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 14:53:48,483 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 02:53:47" (1/3) ... [2025-03-03 14:53:48,484 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@547cd06c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:53:48, skipping insertion in model container [2025-03-03 14:53:48,484 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:53:47" (2/3) ... [2025-03-03 14:53:48,484 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@547cd06c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:53:48, skipping insertion in model container [2025-03-03 14:53:48,485 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:53:48" (3/3) ... [2025-03-03 14:53:48,486 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.3.ufo.UNBOUNDED.pals.c [2025-03-03 14:53:48,498 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 14:53:48,502 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_opt-floodmax.3.ufo.UNBOUNDED.pals.c that has 1 procedures, 136 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 14:53:48,557 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 14:53:48,568 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;@2afbc8d1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 14:53:48,568 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 14:53:48,571 INFO L276 IsEmpty]: Start isEmpty. Operand has 136 states, 134 states have (on average 1.7686567164179106) internal successors, (237), 135 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have 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:48,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-03 14:53:48,576 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:53:48,577 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:53:48,578 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:53:48,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:53:48,582 INFO L85 PathProgramCache]: Analyzing trace with hash 1452200164, now seen corresponding path program 1 times [2025-03-03 14:53:48,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:53:48,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709344693] [2025-03-03 14:53:48,590 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:53:48,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:53:48,671 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-03 14:53:48,732 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-03 14:53:48,733 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:53:48,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:53:48,870 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:53:48,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:53:48,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709344693] [2025-03-03 14:53:48,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709344693] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:53:48,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:53:48,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 14:53:48,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79668811] [2025-03-03 14:53:48,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:53:48,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 14:53:48,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:53:48,893 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 14:53:48,893 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 14:53:48,895 INFO L87 Difference]: Start difference. First operand has 136 states, 134 states have (on average 1.7686567164179106) internal successors, (237), 135 states have internal predecessors, (237), 0 states have call successors, (0), 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 18.5) internal successors, (37), 2 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:53:48,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:53:48,929 INFO L93 Difference]: Finished difference Result 210 states and 364 transitions. [2025-03-03 14:53:48,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 14:53:48,932 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2025-03-03 14:53:48,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:53:48,940 INFO L225 Difference]: With dead ends: 210 [2025-03-03 14:53:48,941 INFO L226 Difference]: Without dead ends: 133 [2025-03-03 14:53:48,943 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:53:48,948 INFO L435 NwaCegarLoop]: 232 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, 232 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:53:48,948 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:53:48,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2025-03-03 14:53:48,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2025-03-03 14:53:48,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 132 states have (on average 1.7575757575757576) internal successors, (232), 132 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have 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:48,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 232 transitions. [2025-03-03 14:53:48,981 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 232 transitions. Word has length 37 [2025-03-03 14:53:48,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:53:48,981 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 232 transitions. [2025-03-03 14:53:48,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:53:48,982 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 232 transitions. [2025-03-03 14:53:48,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-03 14:53:48,983 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:53:48,983 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:53:48,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 14:53:48,983 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:53:48,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:53:48,984 INFO L85 PathProgramCache]: Analyzing trace with hash 1043375939, now seen corresponding path program 1 times [2025-03-03 14:53:48,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:53:48,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295655933] [2025-03-03 14:53:48,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:53:48,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:53:49,013 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-03 14:53:49,067 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-03 14:53:49,067 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:53:49,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:53:49,274 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:53:49,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:53:49,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295655933] [2025-03-03 14:53:49,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295655933] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:53:49,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:53:49,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:53:49,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621257245] [2025-03-03 14:53:49,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:53:49,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:53:49,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:53:49,278 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:53:49,278 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:53:49,278 INFO L87 Difference]: Start difference. First operand 133 states and 232 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:53:49,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:53:49,359 INFO L93 Difference]: Finished difference Result 210 states and 360 transitions. [2025-03-03 14:53:49,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:53:49,360 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2025-03-03 14:53:49,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:53:49,361 INFO L225 Difference]: With dead ends: 210 [2025-03-03 14:53:49,363 INFO L226 Difference]: Without dead ends: 133 [2025-03-03 14:53:49,363 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:53:49,364 INFO L435 NwaCegarLoop]: 230 mSDtfsCounter, 0 mSDsluCounter, 655 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 885 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:53:49,364 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 885 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:53:49,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2025-03-03 14:53:49,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2025-03-03 14:53:49,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 132 states have (on average 1.5303030303030303) internal successors, (202), 132 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have 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:49,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 202 transitions. [2025-03-03 14:53:49,388 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 202 transitions. Word has length 37 [2025-03-03 14:53:49,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:53:49,388 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 202 transitions. [2025-03-03 14:53:49,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:53:49,389 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 202 transitions. [2025-03-03 14:53:49,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-03 14:53:49,390 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:53:49,390 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:53:49,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 14:53:49,390 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:53:49,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:53:49,391 INFO L85 PathProgramCache]: Analyzing trace with hash 1970382673, now seen corresponding path program 1 times [2025-03-03 14:53:49,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:53:49,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827685557] [2025-03-03 14:53:49,391 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:53:49,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:53:49,406 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-03 14:53:49,432 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-03 14:53:49,433 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:53:49,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:53:49,550 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:53:49,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:53:49,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827685557] [2025-03-03 14:53:49,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827685557] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:53:49,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:53:49,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:53:49,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942678817] [2025-03-03 14:53:49,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:53:49,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:53:49,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:53:49,551 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:53:49,551 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:53:49,551 INFO L87 Difference]: Start difference. First operand 133 states and 202 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:53:49,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:53:49,610 INFO L93 Difference]: Finished difference Result 269 states and 432 transitions. [2025-03-03 14:53:49,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:53:49,611 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:53:49,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:53:49,612 INFO L225 Difference]: With dead ends: 269 [2025-03-03 14:53:49,612 INFO L226 Difference]: Without dead ends: 196 [2025-03-03 14:53:49,613 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:53:49,613 INFO L435 NwaCegarLoop]: 195 mSDtfsCounter, 97 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:53:49,613 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 352 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:53:49,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2025-03-03 14:53:49,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 193. [2025-03-03 14:53:49,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 192 states have (on average 1.5625) internal successors, (300), 192 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have 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:49,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 300 transitions. [2025-03-03 14:53:49,628 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 300 transitions. Word has length 66 [2025-03-03 14:53:49,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:53:49,628 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 300 transitions. [2025-03-03 14:53:49,628 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:53:49,628 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 300 transitions. [2025-03-03 14:53:49,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-03 14:53:49,630 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:53:49,630 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:53:49,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 14:53:49,630 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:53:49,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:53:49,631 INFO L85 PathProgramCache]: Analyzing trace with hash 1529305302, now seen corresponding path program 1 times [2025-03-03 14:53:49,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:53:49,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792977860] [2025-03-03 14:53:49,631 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:53:49,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:53:49,645 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-03 14:53:49,660 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-03 14:53:49,660 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:53:49,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:53:49,763 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:53:49,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:53:49,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792977860] [2025-03-03 14:53:49,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792977860] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:53:49,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:53:49,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:53:49,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361633798] [2025-03-03 14:53:49,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:53:49,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:53:49,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:53:49,767 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:53:49,767 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:53:49,767 INFO L87 Difference]: Start difference. First operand 193 states and 300 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:53:49,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:53:49,820 INFO L93 Difference]: Finished difference Result 443 states and 716 transitions. [2025-03-03 14:53:49,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:53:49,823 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:53:49,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:53:49,825 INFO L225 Difference]: With dead ends: 443 [2025-03-03 14:53:49,825 INFO L226 Difference]: Without dead ends: 310 [2025-03-03 14:53:49,826 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:53:49,827 INFO L435 NwaCegarLoop]: 199 mSDtfsCounter, 99 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:53:49,827 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 365 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:53:49,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2025-03-03 14:53:49,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 306. [2025-03-03 14:53:49,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 305 states have (on average 1.5967213114754097) internal successors, (487), 305 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:53:49,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 487 transitions. [2025-03-03 14:53:49,850 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 487 transitions. Word has length 68 [2025-03-03 14:53:49,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:53:49,850 INFO L471 AbstractCegarLoop]: Abstraction has 306 states and 487 transitions. [2025-03-03 14:53:49,850 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:53:49,851 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 487 transitions. [2025-03-03 14:53:49,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-03 14:53:49,852 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:53:49,852 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:53:49,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 14:53:49,852 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:53:49,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:53:49,853 INFO L85 PathProgramCache]: Analyzing trace with hash 814568027, now seen corresponding path program 1 times [2025-03-03 14:53:49,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:53:49,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702545760] [2025-03-03 14:53:49,853 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:53:49,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:53:49,868 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-03 14:53:49,877 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-03 14:53:49,878 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:53:49,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:53:49,950 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:53:49,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:53:49,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702545760] [2025-03-03 14:53:49,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702545760] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:53:49,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:53:49,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:53:49,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195918495] [2025-03-03 14:53:49,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:53:49,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:53:49,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:53:49,952 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:53:49,953 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:53:49,953 INFO L87 Difference]: Start difference. First operand 306 states and 487 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have 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:49,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:53:49,990 INFO L93 Difference]: Finished difference Result 766 states and 1249 transitions. [2025-03-03 14:53:49,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:53:49,990 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2025-03-03 14:53:49,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:53:49,993 INFO L225 Difference]: With dead ends: 766 [2025-03-03 14:53:49,994 INFO L226 Difference]: Without dead ends: 520 [2025-03-03 14:53:49,995 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:53:49,997 INFO L435 NwaCegarLoop]: 199 mSDtfsCounter, 93 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:53:49,997 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 366 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:53:49,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2025-03-03 14:53:50,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 514. [2025-03-03 14:53:50,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 514 states, 513 states have (on average 1.612085769980507) internal successors, (827), 513 states have internal predecessors, (827), 0 states have call successors, (0), 0 states have 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:50,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 514 states to 514 states and 827 transitions. [2025-03-03 14:53:50,015 INFO L78 Accepts]: Start accepts. Automaton has 514 states and 827 transitions. Word has length 70 [2025-03-03 14:53:50,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:53:50,015 INFO L471 AbstractCegarLoop]: Abstraction has 514 states and 827 transitions. [2025-03-03 14:53:50,015 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have 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:50,015 INFO L276 IsEmpty]: Start isEmpty. Operand 514 states and 827 transitions. [2025-03-03 14:53:50,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-03 14:53:50,017 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:53:50,017 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:53:50,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 14:53:50,017 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:53:50,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:53:50,018 INFO L85 PathProgramCache]: Analyzing trace with hash -842124320, now seen corresponding path program 1 times [2025-03-03 14:53:50,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:53:50,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64425565] [2025-03-03 14:53:50,018 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:53:50,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:53:50,033 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-03 14:53:50,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-03 14:53:50,047 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:53:50,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:53:50,210 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:53:50,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:53:50,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64425565] [2025-03-03 14:53:50,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64425565] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:53:50,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:53:50,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:53:50,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327199220] [2025-03-03 14:53:50,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:53:50,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:53:50,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:53:50,215 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:53:50,215 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:53:50,215 INFO L87 Difference]: Start difference. First operand 514 states and 827 transitions. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have 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:50,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:53:50,395 INFO L93 Difference]: Finished difference Result 2190 states and 3633 transitions. [2025-03-03 14:53:50,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 14:53:50,395 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2025-03-03 14:53:50,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:53:50,404 INFO L225 Difference]: With dead ends: 2190 [2025-03-03 14:53:50,404 INFO L226 Difference]: Without dead ends: 1736 [2025-03-03 14:53:50,406 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:53:50,406 INFO L435 NwaCegarLoop]: 198 mSDtfsCounter, 716 mSDsluCounter, 1160 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 716 SdHoareTripleChecker+Valid, 1358 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:53:50,408 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [716 Valid, 1358 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:53:50,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1736 states. [2025-03-03 14:53:50,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1736 to 912. [2025-03-03 14:53:50,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 912 states, 911 states have (on average 1.628979143798024) internal successors, (1484), 911 states have internal predecessors, (1484), 0 states have call successors, (0), 0 states have 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:50,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 912 states to 912 states and 1484 transitions. [2025-03-03 14:53:50,453 INFO L78 Accepts]: Start accepts. Automaton has 912 states and 1484 transitions. Word has length 72 [2025-03-03 14:53:50,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:53:50,454 INFO L471 AbstractCegarLoop]: Abstraction has 912 states and 1484 transitions. [2025-03-03 14:53:50,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have 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:50,454 INFO L276 IsEmpty]: Start isEmpty. Operand 912 states and 1484 transitions. [2025-03-03 14:53:50,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-03 14:53:50,457 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:53:50,457 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:53:50,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 14:53:50,457 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:53:50,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:53:50,458 INFO L85 PathProgramCache]: Analyzing trace with hash -285194949, now seen corresponding path program 1 times [2025-03-03 14:53:50,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:53:50,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337372560] [2025-03-03 14:53:50,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:53:50,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:53:50,475 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-03 14:53:50,487 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-03 14:53:50,487 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:53:50,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:53:50,571 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:53:50,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:53:50,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337372560] [2025-03-03 14:53:50,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337372560] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:53:50,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:53:50,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:53:50,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948238622] [2025-03-03 14:53:50,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:53:50,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:53:50,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:53:50,573 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:53:50,573 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:53:50,573 INFO L87 Difference]: Start difference. First operand 912 states and 1484 transitions. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have 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:50,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:53:50,660 INFO L93 Difference]: Finished difference Result 2654 states and 4394 transitions. [2025-03-03 14:53:50,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:53:50,661 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2025-03-03 14:53:50,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:53:50,667 INFO L225 Difference]: With dead ends: 2654 [2025-03-03 14:53:50,667 INFO L226 Difference]: Without dead ends: 1802 [2025-03-03 14:53:50,669 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:53:50,671 INFO L435 NwaCegarLoop]: 197 mSDtfsCounter, 357 mSDsluCounter, 457 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 357 SdHoareTripleChecker+Valid, 654 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:53:50,671 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [357 Valid, 654 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:53:50,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1802 states. [2025-03-03 14:53:50,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1802 to 1348. [2025-03-03 14:53:50,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1348 states, 1347 states have (on average 1.6384558277654047) internal successors, (2207), 1347 states have internal predecessors, (2207), 0 states have call successors, (0), 0 states have 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:50,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1348 states to 1348 states and 2207 transitions. [2025-03-03 14:53:50,718 INFO L78 Accepts]: Start accepts. Automaton has 1348 states and 2207 transitions. Word has length 73 [2025-03-03 14:53:50,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:53:50,718 INFO L471 AbstractCegarLoop]: Abstraction has 1348 states and 2207 transitions. [2025-03-03 14:53:50,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have 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:50,719 INFO L276 IsEmpty]: Start isEmpty. Operand 1348 states and 2207 transitions. [2025-03-03 14:53:50,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-03 14:53:50,720 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:53:50,720 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:53:50,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 14:53:50,721 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:53:50,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:53:50,722 INFO L85 PathProgramCache]: Analyzing trace with hash -202100674, now seen corresponding path program 1 times [2025-03-03 14:53:50,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:53:50,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723443215] [2025-03-03 14:53:50,722 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:53:50,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:53:50,735 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-03 14:53:50,748 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-03 14:53:50,751 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:53:50,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:53:50,836 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:53:50,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:53:50,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723443215] [2025-03-03 14:53:50,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723443215] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:53:50,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:53:50,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:53:50,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999619090] [2025-03-03 14:53:50,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:53:50,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:53:50,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:53:50,838 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:53:50,838 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:53:50,838 INFO L87 Difference]: Start difference. First operand 1348 states and 2207 transitions. Second operand has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have 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:50,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:53:50,933 INFO L93 Difference]: Finished difference Result 3908 states and 6458 transitions. [2025-03-03 14:53:50,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:53:50,933 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2025-03-03 14:53:50,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:53:50,942 INFO L225 Difference]: With dead ends: 3908 [2025-03-03 14:53:50,943 INFO L226 Difference]: Without dead ends: 2620 [2025-03-03 14:53:50,945 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:53:50,946 INFO L435 NwaCegarLoop]: 193 mSDtfsCounter, 357 mSDsluCounter, 459 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 357 SdHoareTripleChecker+Valid, 652 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:53:50,946 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [357 Valid, 652 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:53:50,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2620 states. [2025-03-03 14:53:51,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2620 to 1972. [2025-03-03 14:53:51,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1972 states, 1971 states have (on average 1.637239979705733) internal successors, (3227), 1971 states have internal predecessors, (3227), 0 states have call successors, (0), 0 states have 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:51,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1972 states to 1972 states and 3227 transitions. [2025-03-03 14:53:51,013 INFO L78 Accepts]: Start accepts. Automaton has 1972 states and 3227 transitions. Word has length 74 [2025-03-03 14:53:51,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:53:51,014 INFO L471 AbstractCegarLoop]: Abstraction has 1972 states and 3227 transitions. [2025-03-03 14:53:51,014 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have 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:51,014 INFO L276 IsEmpty]: Start isEmpty. Operand 1972 states and 3227 transitions. [2025-03-03 14:53:51,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-03 14:53:51,017 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:53:51,018 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:53:51,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 14:53:51,018 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:53:51,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:53:51,018 INFO L85 PathProgramCache]: Analyzing trace with hash -1922992487, now seen corresponding path program 1 times [2025-03-03 14:53:51,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:53:51,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264619923] [2025-03-03 14:53:51,019 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:53:51,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:53:51,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-03 14:53:51,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-03 14:53:51,051 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:53:51,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:53:51,118 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:53:51,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:53:51,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264619923] [2025-03-03 14:53:51,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264619923] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:53:51,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:53:51,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:53:51,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348276144] [2025-03-03 14:53:51,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:53:51,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:53:51,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:53:51,119 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:53:51,120 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:53:51,120 INFO L87 Difference]: Start difference. First operand 1972 states and 3227 transitions. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have 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:51,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:53:51,230 INFO L93 Difference]: Finished difference Result 5692 states and 9382 transitions. [2025-03-03 14:53:51,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:53:51,231 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2025-03-03 14:53:51,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:53:51,243 INFO L225 Difference]: With dead ends: 5692 [2025-03-03 14:53:51,243 INFO L226 Difference]: Without dead ends: 3780 [2025-03-03 14:53:51,247 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:53:51,250 INFO L435 NwaCegarLoop]: 193 mSDtfsCounter, 355 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 355 SdHoareTripleChecker+Valid, 654 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:53:51,250 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [355 Valid, 654 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:53:51,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3780 states. [2025-03-03 14:53:51,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3780 to 2860. [2025-03-03 14:53:51,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2860 states, 2859 states have (on average 1.634487583071004) internal successors, (4673), 2859 states have internal predecessors, (4673), 0 states have call successors, (0), 0 states have 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:51,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2860 states to 2860 states and 4673 transitions. [2025-03-03 14:53:51,348 INFO L78 Accepts]: Start accepts. Automaton has 2860 states and 4673 transitions. Word has length 75 [2025-03-03 14:53:51,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:53:51,348 INFO L471 AbstractCegarLoop]: Abstraction has 2860 states and 4673 transitions. [2025-03-03 14:53:51,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have 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:51,348 INFO L276 IsEmpty]: Start isEmpty. Operand 2860 states and 4673 transitions. [2025-03-03 14:53:51,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-03 14:53:51,350 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:53:51,350 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:53:51,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 14:53:51,350 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:53:51,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:53:51,352 INFO L85 PathProgramCache]: Analyzing trace with hash 40102235, now seen corresponding path program 1 times [2025-03-03 14:53:51,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:53:51,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973056343] [2025-03-03 14:53:51,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:53:51,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:53:51,368 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-03 14:53:51,381 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-03 14:53:51,381 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:53:51,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:53:51,434 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:53:51,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:53:51,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973056343] [2025-03-03 14:53:51,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973056343] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:53:51,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:53:51,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:53:51,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267951482] [2025-03-03 14:53:51,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:53:51,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:53:51,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:53:51,436 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:53:51,436 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:53:51,436 INFO L87 Difference]: Start difference. First operand 2860 states and 4673 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:53:51,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:53:51,496 INFO L93 Difference]: Finished difference Result 6485 states and 10687 transitions. [2025-03-03 14:53:51,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:53:51,496 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2025-03-03 14:53:51,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:53:51,510 INFO L225 Difference]: With dead ends: 6485 [2025-03-03 14:53:51,511 INFO L226 Difference]: Without dead ends: 4424 [2025-03-03 14:53:51,515 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:53:51,516 INFO L435 NwaCegarLoop]: 285 mSDtfsCounter, 104 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:53:51,516 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 461 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:53:51,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4424 states. [2025-03-03 14:53:51,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4424 to 4422. [2025-03-03 14:53:51,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4422 states, 4421 states have (on average 1.6315313277539019) internal successors, (7213), 4421 states have internal predecessors, (7213), 0 states have call successors, (0), 0 states have 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:51,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4422 states to 4422 states and 7213 transitions. [2025-03-03 14:53:51,615 INFO L78 Accepts]: Start accepts. Automaton has 4422 states and 7213 transitions. Word has length 76 [2025-03-03 14:53:51,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:53:51,616 INFO L471 AbstractCegarLoop]: Abstraction has 4422 states and 7213 transitions. [2025-03-03 14:53:51,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:53:51,616 INFO L276 IsEmpty]: Start isEmpty. Operand 4422 states and 7213 transitions. [2025-03-03 14:53:51,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-03 14:53:51,617 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:53:51,617 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:53:51,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 14:53:51,617 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:53:51,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:53:51,617 INFO L85 PathProgramCache]: Analyzing trace with hash 1065286811, now seen corresponding path program 1 times [2025-03-03 14:53:51,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:53:51,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492065772] [2025-03-03 14:53:51,618 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:53:51,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:53:51,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-03 14:53:51,635 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-03 14:53:51,635 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:53:51,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:53:51,665 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:53:51,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:53:51,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492065772] [2025-03-03 14:53:51,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492065772] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:53:51,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:53:51,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:53:51,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343142650] [2025-03-03 14:53:51,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:53:51,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:53:51,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:53:51,666 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:53:51,666 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:53:51,666 INFO L87 Difference]: Start difference. First operand 4422 states and 7213 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:53:51,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:53:51,746 INFO L93 Difference]: Finished difference Result 9899 states and 16167 transitions. [2025-03-03 14:53:51,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:53:51,747 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2025-03-03 14:53:51,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:53:51,769 INFO L225 Difference]: With dead ends: 9899 [2025-03-03 14:53:51,769 INFO L226 Difference]: Without dead ends: 6744 [2025-03-03 14:53:51,776 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:53:51,777 INFO L435 NwaCegarLoop]: 281 mSDtfsCounter, 98 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:53:51,777 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 458 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:53:51,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6744 states. [2025-03-03 14:53:51,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6744 to 6742. [2025-03-03 14:53:51,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6742 states, 6741 states have (on average 1.6181575433911883) internal successors, (10908), 6741 states have internal predecessors, (10908), 0 states have call successors, (0), 0 states have 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:51,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6742 states to 6742 states and 10908 transitions. [2025-03-03 14:53:51,923 INFO L78 Accepts]: Start accepts. Automaton has 6742 states and 10908 transitions. Word has length 76 [2025-03-03 14:53:51,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:53:51,923 INFO L471 AbstractCegarLoop]: Abstraction has 6742 states and 10908 transitions. [2025-03-03 14:53:51,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:53:51,924 INFO L276 IsEmpty]: Start isEmpty. Operand 6742 states and 10908 transitions. [2025-03-03 14:53:51,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-03 14:53:51,924 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:53:51,924 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:53:51,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 14:53:51,924 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:53:51,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:53:51,925 INFO L85 PathProgramCache]: Analyzing trace with hash -432439333, now seen corresponding path program 1 times [2025-03-03 14:53:51,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:53:51,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707455809] [2025-03-03 14:53:51,925 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:53:51,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:53:51,935 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-03 14:53:51,942 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-03 14:53:51,942 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:53:51,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:53:52,003 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:53:52,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:53:52,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707455809] [2025-03-03 14:53:52,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707455809] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:53:52,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:53:52,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:53:52,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372436143] [2025-03-03 14:53:52,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:53:52,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:53:52,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:53:52,005 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:53:52,005 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:53:52,005 INFO L87 Difference]: Start difference. First operand 6742 states and 10908 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:53:52,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:53:52,137 INFO L93 Difference]: Finished difference Result 15008 states and 24288 transitions. [2025-03-03 14:53:52,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:53:52,138 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2025-03-03 14:53:52,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:53:52,172 INFO L225 Difference]: With dead ends: 15008 [2025-03-03 14:53:52,172 INFO L226 Difference]: Without dead ends: 10171 [2025-03-03 14:53:52,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:53:52,183 INFO L435 NwaCegarLoop]: 269 mSDtfsCounter, 92 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:53:52,183 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 447 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:53:52,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10171 states. [2025-03-03 14:53:52,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10171 to 10169. [2025-03-03 14:53:52,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10169 states, 10168 states have (on average 1.6009047993705743) internal successors, (16278), 10168 states have internal predecessors, (16278), 0 states have call successors, (0), 0 states have 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:52,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10169 states to 10169 states and 16278 transitions. [2025-03-03 14:53:52,465 INFO L78 Accepts]: Start accepts. Automaton has 10169 states and 16278 transitions. Word has length 76 [2025-03-03 14:53:52,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:53:52,465 INFO L471 AbstractCegarLoop]: Abstraction has 10169 states and 16278 transitions. [2025-03-03 14:53:52,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:53:52,466 INFO L276 IsEmpty]: Start isEmpty. Operand 10169 states and 16278 transitions. [2025-03-03 14:53:52,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-03 14:53:52,467 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:53:52,467 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:53:52,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 14:53:52,467 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:53:52,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:53:52,467 INFO L85 PathProgramCache]: Analyzing trace with hash 288360439, now seen corresponding path program 1 times [2025-03-03 14:53:52,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:53:52,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393621288] [2025-03-03 14:53:52,468 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:53:52,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:53:52,477 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-03 14:53:52,487 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-03 14:53:52,487 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:53:52,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:53:52,705 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:53:52,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:53:52,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393621288] [2025-03-03 14:53:52,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393621288] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:53:52,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:53:52,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:53:52,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44726044] [2025-03-03 14:53:52,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:53:52,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:53:52,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:53:52,707 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:53:52,707 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:53:52,707 INFO L87 Difference]: Start difference. First operand 10169 states and 16278 transitions. Second operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:53:52,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:53:52,900 INFO L93 Difference]: Finished difference Result 20262 states and 32453 transitions. [2025-03-03 14:53:52,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:53:52,901 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2025-03-03 14:53:52,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:53:52,921 INFO L225 Difference]: With dead ends: 20262 [2025-03-03 14:53:52,921 INFO L226 Difference]: Without dead ends: 10171 [2025-03-03 14:53:52,934 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:53:52,935 INFO L435 NwaCegarLoop]: 200 mSDtfsCounter, 189 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 538 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:53:52,935 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 538 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:53:52,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10171 states. [2025-03-03 14:53:53,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10171 to 10169. [2025-03-03 14:53:53,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10169 states, 10168 states have (on average 1.5886113296616837) internal successors, (16153), 10168 states have internal predecessors, (16153), 0 states have call successors, (0), 0 states have 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:53,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10169 states to 10169 states and 16153 transitions. [2025-03-03 14:53:53,257 INFO L78 Accepts]: Start accepts. Automaton has 10169 states and 16153 transitions. Word has length 77 [2025-03-03 14:53:53,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:53:53,257 INFO L471 AbstractCegarLoop]: Abstraction has 10169 states and 16153 transitions. [2025-03-03 14:53:53,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:53:53,258 INFO L276 IsEmpty]: Start isEmpty. Operand 10169 states and 16153 transitions. [2025-03-03 14:53:53,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-03 14:53:53,258 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:53:53,259 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:53:53,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 14:53:53,259 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:53:53,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:53:53,259 INFO L85 PathProgramCache]: Analyzing trace with hash -2017343017, now seen corresponding path program 1 times [2025-03-03 14:53:53,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:53:53,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553125158] [2025-03-03 14:53:53,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:53:53,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:53:53,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-03 14:53:53,288 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-03 14:53:53,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:53:53,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:53:53,474 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:53:53,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:53:53,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553125158] [2025-03-03 14:53:53,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553125158] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:53:53,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:53:53,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:53:53,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489184877] [2025-03-03 14:53:53,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:53:53,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:53:53,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:53:53,476 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:53:53,476 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:53:53,476 INFO L87 Difference]: Start difference. First operand 10169 states and 16153 transitions. Second operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:53:53,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:53:53,772 INFO L93 Difference]: Finished difference Result 29138 states and 46435 transitions. [2025-03-03 14:53:53,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:53:53,773 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2025-03-03 14:53:53,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:53:53,812 INFO L225 Difference]: With dead ends: 29138 [2025-03-03 14:53:53,812 INFO L226 Difference]: Without dead ends: 19047 [2025-03-03 14:53:53,829 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:53:53,830 INFO L435 NwaCegarLoop]: 192 mSDtfsCounter, 93 mSDsluCounter, 522 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 714 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:53:53,830 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 714 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:53:53,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19047 states. [2025-03-03 14:53:54,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19047 to 19045. [2025-03-03 14:53:54,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19045 states, 19044 states have (on average 1.5750892669607226) internal successors, (29996), 19044 states have internal predecessors, (29996), 0 states have call successors, (0), 0 states have 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:54,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19045 states to 19045 states and 29996 transitions. [2025-03-03 14:53:54,266 INFO L78 Accepts]: Start accepts. Automaton has 19045 states and 29996 transitions. Word has length 80 [2025-03-03 14:53:54,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:53:54,266 INFO L471 AbstractCegarLoop]: Abstraction has 19045 states and 29996 transitions. [2025-03-03 14:53:54,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:53:54,267 INFO L276 IsEmpty]: Start isEmpty. Operand 19045 states and 29996 transitions. [2025-03-03 14:53:54,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-03 14:53:54,267 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:53:54,267 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:53:54,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 14:53:54,267 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:53:54,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:53:54,268 INFO L85 PathProgramCache]: Analyzing trace with hash 1919260688, now seen corresponding path program 1 times [2025-03-03 14:53:54,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:53:54,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019851953] [2025-03-03 14:53:54,268 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:53:54,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:53:54,280 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-03 14:53:54,303 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-03 14:53:54,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:53:54,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:53:54,464 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:53:54,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:53:54,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019851953] [2025-03-03 14:53:54,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019851953] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:53:54,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:53:54,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:53:54,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782771344] [2025-03-03 14:53:54,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:53:54,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:53:54,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:53:54,465 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:53:54,466 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:53:54,466 INFO L87 Difference]: Start difference. First operand 19045 states and 29996 transitions. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:53:54,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:53:54,665 INFO L93 Difference]: Finished difference Result 20133 states and 31445 transitions. [2025-03-03 14:53:54,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:53:54,666 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2025-03-03 14:53:54,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:53:54,705 INFO L225 Difference]: With dead ends: 20133 [2025-03-03 14:53:54,706 INFO L226 Difference]: Without dead ends: 20131 [2025-03-03 14:53:54,715 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:53:54,716 INFO L435 NwaCegarLoop]: 199 mSDtfsCounter, 0 mSDsluCounter, 583 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 782 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:53:54,716 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 782 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:53:54,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20131 states. [2025-03-03 14:53:54,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20131 to 20131. [2025-03-03 14:53:55,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20131 states, 20130 states have (on average 1.5436164927968206) internal successors, (31073), 20130 states have internal predecessors, (31073), 0 states have call successors, (0), 0 states have 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:55,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20131 states to 20131 states and 31073 transitions. [2025-03-03 14:53:55,040 INFO L78 Accepts]: Start accepts. Automaton has 20131 states and 31073 transitions. Word has length 81 [2025-03-03 14:53:55,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:53:55,041 INFO L471 AbstractCegarLoop]: Abstraction has 20131 states and 31073 transitions. [2025-03-03 14:53:55,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:53:55,041 INFO L276 IsEmpty]: Start isEmpty. Operand 20131 states and 31073 transitions. [2025-03-03 14:53:55,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-03 14:53:55,042 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:53:55,043 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:53:55,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 14:53:55,043 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:53:55,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:53:55,043 INFO L85 PathProgramCache]: Analyzing trace with hash -460291343, now seen corresponding path program 1 times [2025-03-03 14:53:55,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:53:55,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315502822] [2025-03-03 14:53:55,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:53:55,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:53:55,098 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-03 14:53:55,108 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-03 14:53:55,108 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:53:55,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:53:55,208 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-03 14:53:55,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:53:55,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315502822] [2025-03-03 14:53:55,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315502822] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:53:55,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:53:55,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:53:55,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861783287] [2025-03-03 14:53:55,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:53:55,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:53:55,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:53:55,209 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:53:55,209 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:53:55,209 INFO L87 Difference]: Start difference. First operand 20131 states and 31073 transitions. Second operand has 5 states, 5 states have (on average 21.6) internal successors, (108), 5 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have 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:55,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:53:55,547 INFO L93 Difference]: Finished difference Result 49659 states and 76963 transitions. [2025-03-03 14:53:55,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:53:55,547 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.6) internal successors, (108), 5 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 109 [2025-03-03 14:53:55,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:53:55,715 INFO L225 Difference]: With dead ends: 49659 [2025-03-03 14:53:55,715 INFO L226 Difference]: Without dead ends: 39817 [2025-03-03 14:53:55,729 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:53:55,730 INFO L435 NwaCegarLoop]: 310 mSDtfsCounter, 450 mSDsluCounter, 566 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 450 SdHoareTripleChecker+Valid, 876 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:53:55,731 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [450 Valid, 876 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:53:55,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39817 states. [2025-03-03 14:53:56,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39817 to 31027. [2025-03-03 14:53:56,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31027 states, 31026 states have (on average 1.5411912589441115) internal successors, (47817), 31026 states have internal predecessors, (47817), 0 states have call successors, (0), 0 states have 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:56,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31027 states to 31027 states and 47817 transitions. [2025-03-03 14:53:56,391 INFO L78 Accepts]: Start accepts. Automaton has 31027 states and 47817 transitions. Word has length 109 [2025-03-03 14:53:56,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:53:56,391 INFO L471 AbstractCegarLoop]: Abstraction has 31027 states and 47817 transitions. [2025-03-03 14:53:56,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.6) internal successors, (108), 5 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have 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:56,391 INFO L276 IsEmpty]: Start isEmpty. Operand 31027 states and 47817 transitions. [2025-03-03 14:53:56,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-03 14:53:56,393 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:53:56,393 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:53:56,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 14:53:56,394 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:53:56,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:53:56,395 INFO L85 PathProgramCache]: Analyzing trace with hash 564893233, now seen corresponding path program 1 times [2025-03-03 14:53:56,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:53:56,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6075174] [2025-03-03 14:53:56,395 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:53:56,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:53:56,407 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-03 14:53:56,420 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-03 14:53:56,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:53:56,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:53:56,541 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-03 14:53:56,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:53:56,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6075174] [2025-03-03 14:53:56,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6075174] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:53:56,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:53:56,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:53:56,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656791026] [2025-03-03 14:53:56,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:53:56,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:53:56,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:53:56,543 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:53:56,543 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:53:56,543 INFO L87 Difference]: Start difference. First operand 31027 states and 47817 transitions. Second operand has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have 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:57,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:53:57,049 INFO L93 Difference]: Finished difference Result 55735 states and 86393 transitions. [2025-03-03 14:53:57,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:53:57,050 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 109 [2025-03-03 14:53:57,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:53:57,136 INFO L225 Difference]: With dead ends: 55735 [2025-03-03 14:53:57,136 INFO L226 Difference]: Without dead ends: 46153 [2025-03-03 14:53:57,154 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:53:57,155 INFO L435 NwaCegarLoop]: 316 mSDtfsCounter, 443 mSDsluCounter, 615 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 443 SdHoareTripleChecker+Valid, 931 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:53:57,155 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [443 Valid, 931 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:53:57,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46153 states. [2025-03-03 14:53:57,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46153 to 42179. [2025-03-03 14:53:57,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42179 states, 42178 states have (on average 1.542960785243492) internal successors, (65079), 42178 states have internal predecessors, (65079), 0 states have call successors, (0), 0 states have 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:57,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42179 states to 42179 states and 65079 transitions. [2025-03-03 14:53:57,941 INFO L78 Accepts]: Start accepts. Automaton has 42179 states and 65079 transitions. Word has length 109 [2025-03-03 14:53:57,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:53:57,942 INFO L471 AbstractCegarLoop]: Abstraction has 42179 states and 65079 transitions. [2025-03-03 14:53:57,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have 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:57,942 INFO L276 IsEmpty]: Start isEmpty. Operand 42179 states and 65079 transitions. [2025-03-03 14:53:57,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-03 14:53:57,943 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:53:57,944 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:53:57,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 14:53:57,944 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:53:57,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:53:57,944 INFO L85 PathProgramCache]: Analyzing trace with hash -932832911, now seen corresponding path program 1 times [2025-03-03 14:53:57,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:53:57,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715769802] [2025-03-03 14:53:57,945 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:53:57,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:53:57,953 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-03 14:53:57,962 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-03 14:53:57,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:53:57,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:53:58,056 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-03 14:53:58,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:53:58,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715769802] [2025-03-03 14:53:58,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715769802] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:53:58,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:53:58,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:53:58,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412818441] [2025-03-03 14:53:58,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:53:58,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:53:58,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:53:58,057 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:53:58,058 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:53:58,058 INFO L87 Difference]: Start difference. First operand 42179 states and 65079 transitions. Second operand has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 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:53:58,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:53:58,656 INFO L93 Difference]: Finished difference Result 59599 states and 92385 transitions. [2025-03-03 14:53:58,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:53:58,657 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 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 109 [2025-03-03 14:53:58,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:53:58,767 INFO L225 Difference]: With dead ends: 59599 [2025-03-03 14:53:58,768 INFO L226 Difference]: Without dead ends: 50017 [2025-03-03 14:53:58,789 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:53:58,790 INFO L435 NwaCegarLoop]: 317 mSDtfsCounter, 456 mSDsluCounter, 565 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 456 SdHoareTripleChecker+Valid, 882 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:53:58,790 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [456 Valid, 882 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:53:58,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50017 states. [2025-03-03 14:53:59,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50017 to 48411. [2025-03-03 14:53:59,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48411 states, 48410 states have (on average 1.5449493906217724) internal successors, (74791), 48410 states have internal predecessors, (74791), 0 states have call successors, (0), 0 states have 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:59,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48411 states to 48411 states and 74791 transitions. [2025-03-03 14:53:59,740 INFO L78 Accepts]: Start accepts. Automaton has 48411 states and 74791 transitions. Word has length 109 [2025-03-03 14:53:59,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:53:59,741 INFO L471 AbstractCegarLoop]: Abstraction has 48411 states and 74791 transitions. [2025-03-03 14:53:59,741 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 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:53:59,741 INFO L276 IsEmpty]: Start isEmpty. Operand 48411 states and 74791 transitions. [2025-03-03 14:53:59,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-03 14:53:59,743 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:53:59,744 INFO L218 NwaCegarLoop]: trace histogram [2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:53:59,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 14:53:59,744 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:53:59,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:53:59,744 INFO L85 PathProgramCache]: Analyzing trace with hash -1333274550, now seen corresponding path program 1 times [2025-03-03 14:53:59,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:53:59,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735564023] [2025-03-03 14:53:59,745 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:53:59,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:53:59,756 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-03 14:53:59,895 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-03 14:53:59,895 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:53:59,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:53:59,967 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-03 14:53:59,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:53:59,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735564023] [2025-03-03 14:53:59,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735564023] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:53:59,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:53:59,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:53:59,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503121720] [2025-03-03 14:53:59,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:53:59,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:53:59,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:53:59,969 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:53:59,969 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:53:59,969 INFO L87 Difference]: Start difference. First operand 48411 states and 74791 transitions. Second operand has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have 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:54:00,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:54:00,431 INFO L93 Difference]: Finished difference Result 79154 states and 122950 transitions. [2025-03-03 14:54:00,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:54:00,432 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 110 [2025-03-03 14:54:00,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:54:00,564 INFO L225 Difference]: With dead ends: 79154 [2025-03-03 14:54:00,565 INFO L226 Difference]: Without dead ends: 62976 [2025-03-03 14:54:00,594 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:54:00,595 INFO L435 NwaCegarLoop]: 305 mSDtfsCounter, 196 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 607 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:54:00,595 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 607 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:54:00,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62976 states. [2025-03-03 14:54:01,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62976 to 61372. [2025-03-03 14:54:01,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61372 states, 61371 states have (on average 1.5451434716722883) internal successors, (94827), 61371 states have internal predecessors, (94827), 0 states have call successors, (0), 0 states have 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:54:01,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61372 states to 61372 states and 94827 transitions. [2025-03-03 14:54:01,528 INFO L78 Accepts]: Start accepts. Automaton has 61372 states and 94827 transitions. Word has length 110 [2025-03-03 14:54:01,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:54:01,528 INFO L471 AbstractCegarLoop]: Abstraction has 61372 states and 94827 transitions. [2025-03-03 14:54:01,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have 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:54:01,529 INFO L276 IsEmpty]: Start isEmpty. Operand 61372 states and 94827 transitions. [2025-03-03 14:54:01,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-03 14:54:01,530 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:54:01,531 INFO L218 NwaCegarLoop]: trace histogram [2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:54:01,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-03 14:54:01,531 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:54:01,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:54:01,532 INFO L85 PathProgramCache]: Analyzing trace with hash -1121923637, now seen corresponding path program 1 times [2025-03-03 14:54:01,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:54:01,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211978940] [2025-03-03 14:54:01,532 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:54:01,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:54:01,545 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-03 14:54:01,556 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-03 14:54:01,556 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:54:01,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:54:01,600 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-03 14:54:01,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:54:01,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211978940] [2025-03-03 14:54:01,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211978940] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:54:01,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:54:01,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:54:01,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866691524] [2025-03-03 14:54:01,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:54:01,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:54:01,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:54:01,602 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:54:01,602 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:54:01,602 INFO L87 Difference]: Start difference. First operand 61372 states and 94827 transitions. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have 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:54:02,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:54:02,713 INFO L93 Difference]: Finished difference Result 132988 states and 206196 transitions. [2025-03-03 14:54:02,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:54:02,713 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 110 [2025-03-03 14:54:02,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:54:02,909 INFO L225 Difference]: With dead ends: 132988 [2025-03-03 14:54:02,910 INFO L226 Difference]: Without dead ends: 103954 [2025-03-03 14:54:02,945 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:54:02,946 INFO L435 NwaCegarLoop]: 201 mSDtfsCounter, 81 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:54:02,946 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 371 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:54:03,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103954 states. [2025-03-03 14:54:04,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103954 to 103676. [2025-03-03 14:54:04,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103676 states, 103675 states have (on average 1.5447986496262358) internal successors, (160157), 103675 states have internal predecessors, (160157), 0 states have call successors, (0), 0 states have 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:54:04,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103676 states to 103676 states and 160157 transitions. [2025-03-03 14:54:04,659 INFO L78 Accepts]: Start accepts. Automaton has 103676 states and 160157 transitions. Word has length 110 [2025-03-03 14:54:04,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:54:04,659 INFO L471 AbstractCegarLoop]: Abstraction has 103676 states and 160157 transitions. [2025-03-03 14:54:04,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have 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:54:04,659 INFO L276 IsEmpty]: Start isEmpty. Operand 103676 states and 160157 transitions. [2025-03-03 14:54:04,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-03 14:54:04,662 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:54:04,662 INFO L218 NwaCegarLoop]: trace histogram [2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:54:04,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-03 14:54:04,662 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:54:04,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:54:04,662 INFO L85 PathProgramCache]: Analyzing trace with hash 665586502, now seen corresponding path program 1 times [2025-03-03 14:54:04,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:54:04,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736399829] [2025-03-03 14:54:04,663 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:54:04,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:54:04,674 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-03 14:54:04,684 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-03 14:54:04,684 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:54:04,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:54:04,727 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:54:04,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:54:04,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736399829] [2025-03-03 14:54:04,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736399829] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:54:04,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:54:04,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:54:04,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456041342] [2025-03-03 14:54:04,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:54:04,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:54:04,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:54:04,730 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:54:04,730 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:54:04,730 INFO L87 Difference]: Start difference. First operand 103676 states and 160157 transitions. Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have 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:54:06,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:54:06,920 INFO L93 Difference]: Finished difference Result 308726 states and 475922 transitions. [2025-03-03 14:54:06,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:54:06,921 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 111 [2025-03-03 14:54:06,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:54:07,280 INFO L225 Difference]: With dead ends: 308726 [2025-03-03 14:54:07,280 INFO L226 Difference]: Without dead ends: 205122 [2025-03-03 14:54:07,391 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:54:07,392 INFO L435 NwaCegarLoop]: 258 mSDtfsCounter, 132 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:54:07,392 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 452 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:54:07,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205122 states. [2025-03-03 14:54:10,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205122 to 205120. [2025-03-03 14:54:10,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205120 states, 205119 states have (on average 1.5291123689175552) internal successors, (313650), 205119 states have internal predecessors, (313650), 0 states have call successors, (0), 0 states have 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:54:11,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205120 states to 205120 states and 313650 transitions. [2025-03-03 14:54:11,205 INFO L78 Accepts]: Start accepts. Automaton has 205120 states and 313650 transitions. Word has length 111 [2025-03-03 14:54:11,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:54:11,205 INFO L471 AbstractCegarLoop]: Abstraction has 205120 states and 313650 transitions. [2025-03-03 14:54:11,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have 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:54:11,206 INFO L276 IsEmpty]: Start isEmpty. Operand 205120 states and 313650 transitions. [2025-03-03 14:54:11,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-03 14:54:11,434 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:54:11,434 INFO L218 NwaCegarLoop]: trace histogram [2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:54:11,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-03 14:54:11,434 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:54:11,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:54:11,435 INFO L85 PathProgramCache]: Analyzing trace with hash 757077958, now seen corresponding path program 1 times [2025-03-03 14:54:11,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:54:11,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008325343] [2025-03-03 14:54:11,435 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:54:11,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:54:11,446 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-03 14:54:11,456 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-03 14:54:11,456 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:54:11,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:54:11,491 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:54:11,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:54:11,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008325343] [2025-03-03 14:54:11,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008325343] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:54:11,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:54:11,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:54:11,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61098678] [2025-03-03 14:54:11,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:54:11,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:54:11,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:54:11,493 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:54:11,493 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:54:11,493 INFO L87 Difference]: Start difference. First operand 205120 states and 313650 transitions. Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have 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:54:15,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:54:15,436 INFO L93 Difference]: Finished difference Result 610797 states and 931927 transitions. [2025-03-03 14:54:15,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:54:15,436 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 111 [2025-03-03 14:54:15,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:54:16,279 INFO L225 Difference]: With dead ends: 610797 [2025-03-03 14:54:16,279 INFO L226 Difference]: Without dead ends: 405811 [2025-03-03 14:54:16,529 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:54:16,531 INFO L435 NwaCegarLoop]: 284 mSDtfsCounter, 151 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 478 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:54:16,531 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 478 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:54:17,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405811 states. [2025-03-03 14:54:22,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405811 to 405809. [2025-03-03 14:54:23,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 405809 states, 405808 states have (on average 1.513102255253716) internal successors, (614029), 405808 states have internal predecessors, (614029), 0 states have call successors, (0), 0 states have 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:54:24,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405809 states to 405809 states and 614029 transitions. [2025-03-03 14:54:24,307 INFO L78 Accepts]: Start accepts. Automaton has 405809 states and 614029 transitions. Word has length 111 [2025-03-03 14:54:24,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:54:24,307 INFO L471 AbstractCegarLoop]: Abstraction has 405809 states and 614029 transitions. [2025-03-03 14:54:24,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have 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:54:24,307 INFO L276 IsEmpty]: Start isEmpty. Operand 405809 states and 614029 transitions. [2025-03-03 14:54:24,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-03 14:54:24,313 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:54:24,313 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:54:24,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-03 14:54:24,314 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:54:24,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:54:24,314 INFO L85 PathProgramCache]: Analyzing trace with hash -972930481, now seen corresponding path program 1 times [2025-03-03 14:54:24,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:54:24,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995523430] [2025-03-03 14:54:24,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:54:24,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:54:24,326 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-03 14:54:24,350 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-03 14:54:24,350 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:54:24,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:54:24,454 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-03 14:54:24,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:54:24,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995523430] [2025-03-03 14:54:24,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995523430] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:54:24,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:54:24,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:54:24,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923859115] [2025-03-03 14:54:24,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:54:24,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:54:24,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:54:24,455 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:54:24,455 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:54:24,455 INFO L87 Difference]: Start difference. First operand 405809 states and 614029 transitions. Second operand has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)