./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/psyco/psyco_net_1.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/psyco/psyco_net_1.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 de2f4457e683c9057510f44fdcfcada297661f8afdeccfe707ab5df57f434b62 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 11:16:02,002 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 11:16:02,047 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 11:16:02,057 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 11:16:02,058 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 11:16:02,076 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 11:16:02,078 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 11:16:02,078 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 11:16:02,078 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 11:16:02,079 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 11:16:02,079 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 11:16:02,079 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 11:16:02,079 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 11:16:02,079 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 11:16:02,080 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 11:16:02,080 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 11:16:02,080 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 11:16:02,080 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 11:16:02,080 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 11:16:02,080 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 11:16:02,081 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 11:16:02,081 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 11:16:02,081 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 11:16:02,081 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 11:16:02,081 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 11:16:02,081 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 11:16:02,081 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 11:16:02,081 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 11:16:02,081 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 11:16:02,081 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 11:16:02,081 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 11:16:02,082 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 11:16:02,082 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 11:16:02,082 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 11:16:02,082 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 11:16:02,082 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 11:16:02,082 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 11:16:02,082 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 11:16:02,082 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 11:16:02,082 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 11:16:02,082 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 11:16:02,082 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 11:16:02,082 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 11:16:02,082 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 -> de2f4457e683c9057510f44fdcfcada297661f8afdeccfe707ab5df57f434b62 [2025-03-03 11:16:02,307 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 11:16:02,314 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 11:16:02,317 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 11:16:02,318 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 11:16:02,318 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 11:16:02,319 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/psyco/psyco_net_1.c [2025-03-03 11:16:03,498 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a38e6adb/06e1c51c9af545a4b644689a517602b1/FLAGdfa2f710f [2025-03-03 11:16:04,102 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 11:16:04,103 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/psyco/psyco_net_1.c [2025-03-03 11:16:04,198 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a38e6adb/06e1c51c9af545a4b644689a517602b1/FLAGdfa2f710f [2025-03-03 11:16:04,578 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a38e6adb/06e1c51c9af545a4b644689a517602b1 [2025-03-03 11:16:04,580 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 11:16:04,581 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 11:16:04,582 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 11:16:04,582 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 11:16:04,585 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 11:16:04,585 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:16:04" (1/1) ... [2025-03-03 11:16:04,586 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2121aaf3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:16:04, skipping insertion in model container [2025-03-03 11:16:04,586 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:16:04" (1/1) ... [2025-03-03 11:16:04,784 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 11:16:05,759 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/psyco/psyco_net_1.c[2349407,2349420] [2025-03-03 11:16:05,812 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 11:16:05,821 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 11:16:06,335 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/psyco/psyco_net_1.c[2349407,2349420] [2025-03-03 11:16:06,364 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 11:16:06,377 INFO L204 MainTranslator]: Completed translation [2025-03-03 11:16:06,378 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:16:06 WrapperNode [2025-03-03 11:16:06,378 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 11:16:06,379 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 11:16:06,380 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 11:16:06,380 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 11:16:06,384 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:16:06" (1/1) ... [2025-03-03 11:16:06,479 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:16:06" (1/1) ... [2025-03-03 11:16:07,180 INFO L138 Inliner]: procedures = 12, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 53156 [2025-03-03 11:16:07,180 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 11:16:07,181 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 11:16:07,181 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 11:16:07,181 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 11:16:07,191 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:16:06" (1/1) ... [2025-03-03 11:16:07,195 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:16:06" (1/1) ... [2025-03-03 11:16:07,353 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:16:06" (1/1) ... [2025-03-03 11:16:07,545 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 11:16:07,545 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:16:06" (1/1) ... [2025-03-03 11:16:07,545 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:16:06" (1/1) ... [2025-03-03 11:16:07,759 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:16:06" (1/1) ... [2025-03-03 11:16:07,791 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:16:06" (1/1) ... [2025-03-03 11:16:07,823 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:16:06" (1/1) ... [2025-03-03 11:16:07,861 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:16:06" (1/1) ... [2025-03-03 11:16:07,935 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 11:16:07,937 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 11:16:07,938 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 11:16:07,938 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 11:16:07,939 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:16:06" (1/1) ... [2025-03-03 11:16:07,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 11:16:07,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 11:16:07,964 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 11:16:07,966 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 11:16:07,986 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 11:16:07,986 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 11:16:07,986 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 11:16:07,986 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 11:16:08,407 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 11:16:08,409 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 11:16:20,281 INFO L? ?]: Removed 10714 outVars from TransFormulas that were not future-live. [2025-03-03 11:16:20,281 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 11:16:20,381 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 11:16:20,381 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 11:16:20,381 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:16:20 BoogieIcfgContainer [2025-03-03 11:16:20,382 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 11:16:20,383 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 11:16:20,383 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 11:16:20,387 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 11:16:20,387 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 11:16:04" (1/3) ... [2025-03-03 11:16:20,387 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f048cdb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:16:20, skipping insertion in model container [2025-03-03 11:16:20,387 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:16:06" (2/3) ... [2025-03-03 11:16:20,387 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f048cdb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:16:20, skipping insertion in model container [2025-03-03 11:16:20,387 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:16:20" (3/3) ... [2025-03-03 11:16:20,388 INFO L128 eAbstractionObserver]: Analyzing ICFG psyco_net_1.c [2025-03-03 11:16:20,399 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 11:16:20,402 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG psyco_net_1.c that has 1 procedures, 9211 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 11:16:20,563 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 11:16:20,572 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;@47d33771, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 11:16:20,573 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 11:16:20,597 INFO L276 IsEmpty]: Start isEmpty. Operand has 9211 states, 9209 states have (on average 1.999348463459659) internal successors, (18412), 9210 states have internal predecessors, (18412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:16:20,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-03 11:16:20,600 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:16:20,601 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 11:16:20,601 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:16:20,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:16:20,604 INFO L85 PathProgramCache]: Analyzing trace with hash -1097502616, now seen corresponding path program 1 times [2025-03-03 11:16:20,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:16:20,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479353733] [2025-03-03 11:16:20,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:16:20,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:16:20,686 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-03 11:16:20,720 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-03 11:16:20,721 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:16:20,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:16:20,799 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 11:16:20,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:16:20,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479353733] [2025-03-03 11:16:20,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479353733] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:16:20,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:16:20,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 11:16:20,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768923953] [2025-03-03 11:16:20,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:16:20,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 11:16:20,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:16:20,815 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 11:16:20,815 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 11:16:20,837 INFO L87 Difference]: Start difference. First operand has 9211 states, 9209 states have (on average 1.999348463459659) internal successors, (18412), 9210 states have internal predecessors, (18412), 0 states have call successors, (0), 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 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:16:21,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:16:21,038 INFO L93 Difference]: Finished difference Result 17698 states and 35378 transitions. [2025-03-03 11:16:21,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 11:16:21,040 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 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 9 [2025-03-03 11:16:21,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:16:21,086 INFO L225 Difference]: With dead ends: 17698 [2025-03-03 11:16:21,086 INFO L226 Difference]: Without dead ends: 8280 [2025-03-03 11:16:21,105 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 11:16:21,108 INFO L435 NwaCegarLoop]: 14147 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, 14147 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 11:16:21,109 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 14147 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 11:16:21,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8280 states. [2025-03-03 11:16:21,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8280 to 8280. [2025-03-03 11:16:21,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8280 states, 8279 states have (on average 1.5698755888392317) internal successors, (12997), 8279 states have internal predecessors, (12997), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:16:21,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8280 states to 8280 states and 12997 transitions. [2025-03-03 11:16:21,322 INFO L78 Accepts]: Start accepts. Automaton has 8280 states and 12997 transitions. Word has length 9 [2025-03-03 11:16:21,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:16:21,322 INFO L471 AbstractCegarLoop]: Abstraction has 8280 states and 12997 transitions. [2025-03-03 11:16:21,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:16:21,323 INFO L276 IsEmpty]: Start isEmpty. Operand 8280 states and 12997 transitions. [2025-03-03 11:16:21,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-03 11:16:21,323 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:16:21,323 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 11:16:21,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 11:16:21,323 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:16:21,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:16:21,325 INFO L85 PathProgramCache]: Analyzing trace with hash 356396091, now seen corresponding path program 1 times [2025-03-03 11:16:21,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:16:21,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432237850] [2025-03-03 11:16:21,325 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:16:21,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:16:21,353 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-03 11:16:21,371 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-03 11:16:21,371 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:16:21,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:16:21,440 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 11:16:21,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:16:21,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432237850] [2025-03-03 11:16:21,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432237850] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:16:21,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:16:21,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 11:16:21,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433668558] [2025-03-03 11:16:21,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:16:21,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:16:21,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:16:21,442 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:16:21,442 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:16:21,442 INFO L87 Difference]: Start difference. First operand 8280 states and 12997 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:16:22,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:16:22,843 INFO L93 Difference]: Finished difference Result 16561 states and 25996 transitions. [2025-03-03 11:16:22,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:16:22,843 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2025-03-03 11:16:22,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:16:22,871 INFO L225 Difference]: With dead ends: 16561 [2025-03-03 11:16:22,871 INFO L226 Difference]: Without dead ends: 8283 [2025-03-03 11:16:22,882 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 11:16:22,883 INFO L435 NwaCegarLoop]: 12996 mSDtfsCounter, 4 mSDsluCounter, 11520 mSDsCounter, 0 mSdLazyCounter, 1473 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 24516 SdHoareTripleChecker+Invalid, 1474 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1473 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-03 11:16:22,883 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 24516 Invalid, 1474 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1473 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-03 11:16:22,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8283 states. [2025-03-03 11:16:22,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8283 to 8283. [2025-03-03 11:16:22,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8283 states, 8282 states have (on average 1.569669162038155) internal successors, (13000), 8282 states have internal predecessors, (13000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:16:23,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8283 states to 8283 states and 13000 transitions. [2025-03-03 11:16:23,008 INFO L78 Accepts]: Start accepts. Automaton has 8283 states and 13000 transitions. Word has length 10 [2025-03-03 11:16:23,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:16:23,008 INFO L471 AbstractCegarLoop]: Abstraction has 8283 states and 13000 transitions. [2025-03-03 11:16:23,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:16:23,009 INFO L276 IsEmpty]: Start isEmpty. Operand 8283 states and 13000 transitions. [2025-03-03 11:16:23,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-03 11:16:23,009 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:16:23,009 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 11:16:23,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 11:16:23,009 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:16:23,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:16:23,010 INFO L85 PathProgramCache]: Analyzing trace with hash -1994701043, now seen corresponding path program 1 times [2025-03-03 11:16:23,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:16:23,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935166459] [2025-03-03 11:16:23,010 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:16:23,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:16:23,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-03 11:16:23,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-03 11:16:23,055 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:16:23,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:16:23,142 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 11:16:23,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:16:23,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935166459] [2025-03-03 11:16:23,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935166459] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:16:23,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:16:23,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 11:16:23,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026439529] [2025-03-03 11:16:23,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:16:23,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:16:23,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:16:23,143 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:16:23,143 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:16:23,143 INFO L87 Difference]: Start difference. First operand 8283 states and 13000 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:16:24,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:16:24,492 INFO L93 Difference]: Finished difference Result 16569 states and 26005 transitions. [2025-03-03 11:16:24,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:16:24,493 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-03-03 11:16:24,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:16:24,518 INFO L225 Difference]: With dead ends: 16569 [2025-03-03 11:16:24,519 INFO L226 Difference]: Without dead ends: 8289 [2025-03-03 11:16:24,527 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 11:16:24,527 INFO L435 NwaCegarLoop]: 12995 mSDtfsCounter, 329 mSDsluCounter, 11197 mSDsCounter, 0 mSdLazyCounter, 1442 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 329 SdHoareTripleChecker+Valid, 24192 SdHoareTripleChecker+Invalid, 1478 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 1442 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-03 11:16:24,528 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [329 Valid, 24192 Invalid, 1478 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 1442 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-03 11:16:24,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8289 states. [2025-03-03 11:16:24,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8289 to 8287. [2025-03-03 11:16:24,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8287 states, 8286 states have (on average 1.5693941588221096) internal successors, (13004), 8286 states have internal predecessors, (13004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:16:24,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8287 states to 8287 states and 13004 transitions. [2025-03-03 11:16:24,625 INFO L78 Accepts]: Start accepts. Automaton has 8287 states and 13004 transitions. Word has length 15 [2025-03-03 11:16:24,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:16:24,626 INFO L471 AbstractCegarLoop]: Abstraction has 8287 states and 13004 transitions. [2025-03-03 11:16:24,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:16:24,626 INFO L276 IsEmpty]: Start isEmpty. Operand 8287 states and 13004 transitions. [2025-03-03 11:16:24,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-03 11:16:24,626 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:16:24,626 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 11:16:24,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 11:16:24,627 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:16:24,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:16:24,627 INFO L85 PathProgramCache]: Analyzing trace with hash 574990734, now seen corresponding path program 1 times [2025-03-03 11:16:24,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:16:24,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348472193] [2025-03-03 11:16:24,627 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:16:24,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:16:24,656 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-03 11:16:24,668 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-03 11:16:24,669 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:16:24,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:16:24,710 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 11:16:24,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:16:24,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348472193] [2025-03-03 11:16:24,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348472193] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:16:24,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:16:24,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 11:16:24,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189108546] [2025-03-03 11:16:24,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:16:24,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:16:24,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:16:24,712 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:16:24,712 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:16:24,712 INFO L87 Difference]: Start difference. First operand 8287 states and 13004 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:16:26,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:16:26,863 INFO L93 Difference]: Finished difference Result 16493 states and 25886 transitions. [2025-03-03 11:16:26,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:16:26,864 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-03-03 11:16:26,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:16:26,880 INFO L225 Difference]: With dead ends: 16493 [2025-03-03 11:16:26,880 INFO L226 Difference]: Without dead ends: 8167 [2025-03-03 11:16:26,887 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 11:16:26,889 INFO L435 NwaCegarLoop]: 9998 mSDtfsCounter, 10370 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 3164 mSolverCounterSat, 1749 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10370 SdHoareTripleChecker+Valid, 10000 SdHoareTripleChecker+Invalid, 4913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1749 IncrementalHoareTripleChecker+Valid, 3164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-03 11:16:26,890 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10370 Valid, 10000 Invalid, 4913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1749 Valid, 3164 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-03 11:16:26,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8167 states. [2025-03-03 11:16:26,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8167 to 8165. [2025-03-03 11:16:26,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8165 states, 8164 states have (on average 1.5165360117589417) internal successors, (12381), 8164 states have internal predecessors, (12381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:16:26,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8165 states to 8165 states and 12381 transitions. [2025-03-03 11:16:26,985 INFO L78 Accepts]: Start accepts. Automaton has 8165 states and 12381 transitions. Word has length 19 [2025-03-03 11:16:26,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:16:26,985 INFO L471 AbstractCegarLoop]: Abstraction has 8165 states and 12381 transitions. [2025-03-03 11:16:26,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:16:26,986 INFO L276 IsEmpty]: Start isEmpty. Operand 8165 states and 12381 transitions. [2025-03-03 11:16:26,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-03 11:16:26,986 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:16:26,986 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 11:16:26,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 11:16:26,987 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:16:26,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:16:26,987 INFO L85 PathProgramCache]: Analyzing trace with hash -533530074, now seen corresponding path program 1 times [2025-03-03 11:16:26,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:16:26,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476424845] [2025-03-03 11:16:26,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:16:26,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:16:27,015 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-03 11:16:27,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-03 11:16:27,030 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:16:27,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:16:27,075 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 11:16:27,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:16:27,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476424845] [2025-03-03 11:16:27,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476424845] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:16:27,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:16:27,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 11:16:27,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489087355] [2025-03-03 11:16:27,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:16:27,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:16:27,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:16:27,077 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:16:27,077 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:16:27,077 INFO L87 Difference]: Start difference. First operand 8165 states and 12381 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:16:29,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:16:29,357 INFO L93 Difference]: Finished difference Result 24489 states and 37137 transitions. [2025-03-03 11:16:29,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:16:29,357 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 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 23 [2025-03-03 11:16:29,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:16:29,383 INFO L225 Difference]: With dead ends: 24489 [2025-03-03 11:16:29,383 INFO L226 Difference]: Without dead ends: 16277 [2025-03-03 11:16:29,392 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 11:16:29,392 INFO L435 NwaCegarLoop]: 10924 mSDtfsCounter, 10931 mSDsluCounter, 10881 mSDsCounter, 0 mSdLazyCounter, 2893 mSolverCounterSat, 1345 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10931 SdHoareTripleChecker+Valid, 21805 SdHoareTripleChecker+Invalid, 4238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1345 IncrementalHoareTripleChecker+Valid, 2893 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-03 11:16:29,393 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10931 Valid, 21805 Invalid, 4238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1345 Valid, 2893 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-03 11:16:29,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16277 states. [2025-03-03 11:16:29,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16277 to 14963. [2025-03-03 11:16:29,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14963 states, 14962 states have (on average 1.5566100788664616) internal successors, (23290), 14962 states have internal predecessors, (23290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:16:29,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14963 states to 14963 states and 23290 transitions. [2025-03-03 11:16:29,558 INFO L78 Accepts]: Start accepts. Automaton has 14963 states and 23290 transitions. Word has length 23 [2025-03-03 11:16:29,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:16:29,558 INFO L471 AbstractCegarLoop]: Abstraction has 14963 states and 23290 transitions. [2025-03-03 11:16:29,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:16:29,558 INFO L276 IsEmpty]: Start isEmpty. Operand 14963 states and 23290 transitions. [2025-03-03 11:16:29,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-03 11:16:29,559 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:16:29,559 INFO L218 NwaCegarLoop]: trace histogram [2, 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 11:16:29,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 11:16:29,559 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:16:29,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:16:29,560 INFO L85 PathProgramCache]: Analyzing trace with hash -1536179598, now seen corresponding path program 1 times [2025-03-03 11:16:29,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:16:29,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665327644] [2025-03-03 11:16:29,560 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:16:29,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:16:29,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-03 11:16:29,591 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-03 11:16:29,594 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:16:29,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:16:29,673 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 11:16:29,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:16:29,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665327644] [2025-03-03 11:16:29,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665327644] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:16:29,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:16:29,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 11:16:29,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339240384] [2025-03-03 11:16:29,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:16:29,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:16:29,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:16:29,674 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:16:29,674 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:16:29,674 INFO L87 Difference]: Start difference. First operand 14963 states and 23290 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:16:32,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:16:32,907 INFO L93 Difference]: Finished difference Result 37763 states and 58560 transitions. [2025-03-03 11:16:32,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:16:32,907 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-03-03 11:16:32,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:16:32,943 INFO L225 Difference]: With dead ends: 37763 [2025-03-03 11:16:32,943 INFO L226 Difference]: Without dead ends: 22521 [2025-03-03 11:16:32,954 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 11:16:32,955 INFO L435 NwaCegarLoop]: 10503 mSDtfsCounter, 10112 mSDsluCounter, 9629 mSDsCounter, 0 mSdLazyCounter, 4519 mSolverCounterSat, 1455 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10112 SdHoareTripleChecker+Valid, 20132 SdHoareTripleChecker+Invalid, 5974 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1455 IncrementalHoareTripleChecker+Valid, 4519 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2025-03-03 11:16:32,955 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10112 Valid, 20132 Invalid, 5974 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1455 Valid, 4519 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2025-03-03 11:16:32,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22521 states. [2025-03-03 11:16:33,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22521 to 21281. [2025-03-03 11:16:33,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21281 states, 21280 states have (on average 1.5518796992481203) internal successors, (33024), 21280 states have internal predecessors, (33024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:16:33,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21281 states to 21281 states and 33024 transitions. [2025-03-03 11:16:33,169 INFO L78 Accepts]: Start accepts. Automaton has 21281 states and 33024 transitions. Word has length 25 [2025-03-03 11:16:33,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:16:33,170 INFO L471 AbstractCegarLoop]: Abstraction has 21281 states and 33024 transitions. [2025-03-03 11:16:33,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:16:33,170 INFO L276 IsEmpty]: Start isEmpty. Operand 21281 states and 33024 transitions. [2025-03-03 11:16:33,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-03 11:16:33,172 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:16:33,172 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 11:16:33,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 11:16:33,172 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:16:33,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:16:33,173 INFO L85 PathProgramCache]: Analyzing trace with hash 1758813016, now seen corresponding path program 1 times [2025-03-03 11:16:33,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:16:33,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370103096] [2025-03-03 11:16:33,173 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:16:33,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:16:33,202 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-03 11:16:33,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-03 11:16:33,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:16:33,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:16:33,262 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 11:16:33,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:16:33,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370103096] [2025-03-03 11:16:33,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370103096] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:16:33,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:16:33,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 11:16:33,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782061548] [2025-03-03 11:16:33,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:16:33,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:16:33,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:16:33,264 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:16:33,264 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:16:33,264 INFO L87 Difference]: Start difference. First operand 21281 states and 33024 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:16:37,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:16:37,187 INFO L93 Difference]: Finished difference Result 63807 states and 99006 transitions. [2025-03-03 11:16:37,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:16:37,187 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 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 30 [2025-03-03 11:16:37,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:16:37,278 INFO L225 Difference]: With dead ends: 63807 [2025-03-03 11:16:37,279 INFO L226 Difference]: Without dead ends: 42529 [2025-03-03 11:16:37,298 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 11:16:37,299 INFO L435 NwaCegarLoop]: 21590 mSDtfsCounter, 10226 mSDsluCounter, 9573 mSDsCounter, 0 mSdLazyCounter, 6371 mSolverCounterSat, 1148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10226 SdHoareTripleChecker+Valid, 31163 SdHoareTripleChecker+Invalid, 7519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1148 IncrementalHoareTripleChecker+Valid, 6371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2025-03-03 11:16:37,299 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10226 Valid, 31163 Invalid, 7519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1148 Valid, 6371 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2025-03-03 11:16:37,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42529 states. [2025-03-03 11:16:37,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42529 to 40445. [2025-03-03 11:16:37,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40445 states, 40444 states have (on average 1.5746464246859855) internal successors, (63685), 40444 states have internal predecessors, (63685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:16:37,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40445 states to 40445 states and 63685 transitions. [2025-03-03 11:16:37,777 INFO L78 Accepts]: Start accepts. Automaton has 40445 states and 63685 transitions. Word has length 30 [2025-03-03 11:16:37,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:16:37,777 INFO L471 AbstractCegarLoop]: Abstraction has 40445 states and 63685 transitions. [2025-03-03 11:16:37,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:16:37,777 INFO L276 IsEmpty]: Start isEmpty. Operand 40445 states and 63685 transitions. [2025-03-03 11:16:37,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-03 11:16:37,778 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:16:37,778 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 11:16:37,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 11:16:37,778 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:16:37,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:16:37,778 INFO L85 PathProgramCache]: Analyzing trace with hash 1377517053, now seen corresponding path program 1 times [2025-03-03 11:16:37,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:16:37,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530385826] [2025-03-03 11:16:37,779 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:16:37,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:16:37,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-03 11:16:37,810 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-03 11:16:37,810 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:16:37,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:16:37,871 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-03 11:16:37,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:16:37,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530385826] [2025-03-03 11:16:37,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530385826] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:16:37,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:16:37,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 11:16:37,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675953211] [2025-03-03 11:16:37,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:16:37,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:16:37,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:16:37,872 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:16:37,872 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:16:37,873 INFO L87 Difference]: Start difference. First operand 40445 states and 63685 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:16:38,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:16:38,893 INFO L93 Difference]: Finished difference Result 80919 states and 127422 transitions. [2025-03-03 11:16:38,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:16:38,893 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2025-03-03 11:16:38,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:16:38,941 INFO L225 Difference]: With dead ends: 80919 [2025-03-03 11:16:38,941 INFO L226 Difference]: Without dead ends: 40477 [2025-03-03 11:16:38,970 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 11:16:38,971 INFO L435 NwaCegarLoop]: 12342 mSDtfsCounter, 305 mSDsluCounter, 10699 mSDsCounter, 0 mSdLazyCounter, 1308 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 23041 SdHoareTripleChecker+Invalid, 1348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 1308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 11:16:38,971 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [305 Valid, 23041 Invalid, 1348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 1308 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 11:16:38,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40477 states. [2025-03-03 11:16:39,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40477 to 40475. [2025-03-03 11:16:39,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40475 states, 40474 states have (on average 1.5742204872263676) internal successors, (63715), 40474 states have internal predecessors, (63715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:16:39,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40475 states to 40475 states and 63715 transitions. [2025-03-03 11:16:39,499 INFO L78 Accepts]: Start accepts. Automaton has 40475 states and 63715 transitions. Word has length 36 [2025-03-03 11:16:39,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:16:39,499 INFO L471 AbstractCegarLoop]: Abstraction has 40475 states and 63715 transitions. [2025-03-03 11:16:39,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:16:39,499 INFO L276 IsEmpty]: Start isEmpty. Operand 40475 states and 63715 transitions. [2025-03-03 11:16:39,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-03-03 11:16:39,502 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:16:39,502 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 11:16:39,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 11:16:39,504 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:16:39,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:16:39,504 INFO L85 PathProgramCache]: Analyzing trace with hash 1370897542, now seen corresponding path program 1 times [2025-03-03 11:16:39,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:16:39,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906553534] [2025-03-03 11:16:39,505 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:16:39,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:16:39,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-03 11:16:39,534 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-03 11:16:39,534 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:16:39,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:16:39,569 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 11:16:39,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:16:39,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906553534] [2025-03-03 11:16:39,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906553534] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:16:39,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:16:39,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 11:16:39,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66993995] [2025-03-03 11:16:39,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:16:39,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:16:39,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:16:39,571 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:16:39,571 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:16:39,571 INFO L87 Difference]: Start difference. First operand 40475 states and 63715 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:16:41,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:16:41,934 INFO L93 Difference]: Finished difference Result 109023 states and 171833 transitions. [2025-03-03 11:16:41,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:16:41,934 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 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 39 [2025-03-03 11:16:41,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:16:42,021 INFO L225 Difference]: With dead ends: 109023 [2025-03-03 11:16:42,021 INFO L226 Difference]: Without dead ends: 68501 [2025-03-03 11:16:42,044 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 11:16:42,044 INFO L435 NwaCegarLoop]: 10924 mSDtfsCounter, 10915 mSDsluCounter, 10881 mSDsCounter, 0 mSdLazyCounter, 2829 mSolverCounterSat, 1313 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10915 SdHoareTripleChecker+Valid, 21805 SdHoareTripleChecker+Invalid, 4142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1313 IncrementalHoareTripleChecker+Valid, 2829 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-03 11:16:42,044 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10915 Valid, 21805 Invalid, 4142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1313 Valid, 2829 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-03 11:16:42,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68501 states. [2025-03-03 11:16:42,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68501 to 66771. [2025-03-03 11:16:42,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66771 states, 66770 states have (on average 1.5851280515201438) internal successors, (105839), 66770 states have internal predecessors, (105839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:16:42,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66771 states to 66771 states and 105839 transitions. [2025-03-03 11:16:42,943 INFO L78 Accepts]: Start accepts. Automaton has 66771 states and 105839 transitions. Word has length 39 [2025-03-03 11:16:42,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:16:42,944 INFO L471 AbstractCegarLoop]: Abstraction has 66771 states and 105839 transitions. [2025-03-03 11:16:42,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:16:42,944 INFO L276 IsEmpty]: Start isEmpty. Operand 66771 states and 105839 transitions. [2025-03-03 11:16:42,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-03 11:16:42,945 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:16:42,945 INFO L218 NwaCegarLoop]: trace histogram [3, 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] [2025-03-03 11:16:42,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 11:16:42,945 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:16:42,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:16:42,946 INFO L85 PathProgramCache]: Analyzing trace with hash -1735448455, now seen corresponding path program 1 times [2025-03-03 11:16:42,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:16:42,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612253980] [2025-03-03 11:16:42,946 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:16:42,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:16:42,981 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-03 11:16:42,999 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-03 11:16:42,999 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:16:42,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:16:43,102 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-03 11:16:43,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:16:43,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612253980] [2025-03-03 11:16:43,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612253980] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:16:43,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:16:43,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 11:16:43,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296053821] [2025-03-03 11:16:43,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:16:43,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:16:43,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:16:43,103 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:16:43,106 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:16:43,107 INFO L87 Difference]: Start difference. First operand 66771 states and 105839 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:16:44,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:16:44,639 INFO L93 Difference]: Finished difference Result 129327 states and 204980 transitions. [2025-03-03 11:16:44,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:16:44,640 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 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 46 [2025-03-03 11:16:44,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:16:44,705 INFO L225 Difference]: With dead ends: 129327 [2025-03-03 11:16:44,705 INFO L226 Difference]: Without dead ends: 62559 [2025-03-03 11:16:44,720 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 11:16:44,720 INFO L435 NwaCegarLoop]: 12047 mSDtfsCounter, 10323 mSDsluCounter, 551 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 1190 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10323 SdHoareTripleChecker+Valid, 12598 SdHoareTripleChecker+Invalid, 1333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1190 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 11:16:44,720 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10323 Valid, 12598 Invalid, 1333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1190 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 11:16:44,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62559 states. [2025-03-03 11:16:45,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62559 to 62557. [2025-03-03 11:16:45,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62557 states, 62556 states have (on average 1.5842285312360125) internal successors, (99103), 62556 states have internal predecessors, (99103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:16:45,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62557 states to 62557 states and 99103 transitions. [2025-03-03 11:16:45,254 INFO L78 Accepts]: Start accepts. Automaton has 62557 states and 99103 transitions. Word has length 46 [2025-03-03 11:16:45,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:16:45,254 INFO L471 AbstractCegarLoop]: Abstraction has 62557 states and 99103 transitions. [2025-03-03 11:16:45,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:16:45,254 INFO L276 IsEmpty]: Start isEmpty. Operand 62557 states and 99103 transitions. [2025-03-03 11:16:45,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-03 11:16:45,255 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:16:45,255 INFO L218 NwaCegarLoop]: trace histogram [3, 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] [2025-03-03 11:16:45,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 11:16:45,255 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:16:45,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:16:45,256 INFO L85 PathProgramCache]: Analyzing trace with hash -867245318, now seen corresponding path program 1 times [2025-03-03 11:16:45,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:16:45,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87020624] [2025-03-03 11:16:45,256 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:16:45,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:16:45,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-03 11:16:45,437 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-03 11:16:45,442 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:16:45,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:16:45,585 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 11:16:45,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:16:45,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87020624] [2025-03-03 11:16:45,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87020624] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:16:45,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:16:45,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 11:16:45,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811679793] [2025-03-03 11:16:45,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:16:45,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 11:16:45,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:16:45,586 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 11:16:45,586 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 11:16:45,587 INFO L87 Difference]: Start difference. First operand 62557 states and 99103 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:16:49,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:16:49,359 INFO L93 Difference]: Finished difference Result 119614 states and 189347 transitions. [2025-03-03 11:16:49,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 11:16:49,360 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2025-03-03 11:16:49,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:16:49,435 INFO L225 Difference]: With dead ends: 119614 [2025-03-03 11:16:49,435 INFO L226 Difference]: Without dead ends: 62793 [2025-03-03 11:16:49,472 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 11:16:49,472 INFO L435 NwaCegarLoop]: 9462 mSDtfsCounter, 19672 mSDsluCounter, 9233 mSDsCounter, 0 mSdLazyCounter, 4620 mSolverCounterSat, 2448 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19672 SdHoareTripleChecker+Valid, 18695 SdHoareTripleChecker+Invalid, 7068 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2448 IncrementalHoareTripleChecker+Valid, 4620 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2025-03-03 11:16:49,472 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19672 Valid, 18695 Invalid, 7068 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2448 Valid, 4620 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2025-03-03 11:16:49,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62793 states. [2025-03-03 11:16:49,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62793 to 60395. [2025-03-03 11:16:50,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60395 states, 60394 states have (on average 1.5627380203331456) internal successors, (94380), 60394 states have internal predecessors, (94380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:16:50,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60395 states to 60395 states and 94380 transitions. [2025-03-03 11:16:50,103 INFO L78 Accepts]: Start accepts. Automaton has 60395 states and 94380 transitions. Word has length 52 [2025-03-03 11:16:50,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:16:50,104 INFO L471 AbstractCegarLoop]: Abstraction has 60395 states and 94380 transitions. [2025-03-03 11:16:50,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:16:50,104 INFO L276 IsEmpty]: Start isEmpty. Operand 60395 states and 94380 transitions. [2025-03-03 11:16:50,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-03 11:16:50,104 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:16:50,104 INFO L218 NwaCegarLoop]: trace histogram [3, 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] [2025-03-03 11:16:50,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 11:16:50,105 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:16:50,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:16:50,105 INFO L85 PathProgramCache]: Analyzing trace with hash 890997142, now seen corresponding path program 1 times [2025-03-03 11:16:50,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:16:50,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146896072] [2025-03-03 11:16:50,105 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:16:50,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:16:50,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-03 11:16:50,144 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-03 11:16:50,144 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:16:50,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:16:50,176 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-03 11:16:50,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:16:50,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146896072] [2025-03-03 11:16:50,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146896072] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:16:50,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:16:50,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 11:16:50,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465538237] [2025-03-03 11:16:50,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:16:50,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:16:50,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:16:50,177 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:16:50,177 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:16:50,177 INFO L87 Difference]: Start difference. First operand 60395 states and 94380 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:16:51,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:16:51,291 INFO L93 Difference]: Finished difference Result 120432 states and 188193 transitions. [2025-03-03 11:16:51,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:16:51,291 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2025-03-03 11:16:51,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:16:51,364 INFO L225 Difference]: With dead ends: 120432 [2025-03-03 11:16:51,364 INFO L226 Difference]: Without dead ends: 60457 [2025-03-03 11:16:51,405 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 11:16:51,405 INFO L435 NwaCegarLoop]: 11637 mSDtfsCounter, 277 mSDsluCounter, 10274 mSDsCounter, 0 mSdLazyCounter, 1028 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 21911 SdHoareTripleChecker+Invalid, 1093 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 1028 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 11:16:51,405 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 21911 Invalid, 1093 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 1028 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 11:16:51,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60457 states. [2025-03-03 11:16:51,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60457 to 60455. [2025-03-03 11:16:51,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60455 states, 60454 states have (on average 1.5621795083865417) internal successors, (94440), 60454 states have internal predecessors, (94440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:16:52,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60455 states to 60455 states and 94440 transitions. [2025-03-03 11:16:52,050 INFO L78 Accepts]: Start accepts. Automaton has 60455 states and 94440 transitions. Word has length 53 [2025-03-03 11:16:52,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:16:52,050 INFO L471 AbstractCegarLoop]: Abstraction has 60455 states and 94440 transitions. [2025-03-03 11:16:52,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:16:52,051 INFO L276 IsEmpty]: Start isEmpty. Operand 60455 states and 94440 transitions. [2025-03-03 11:16:52,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-03 11:16:52,051 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:16:52,051 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 11:16:52,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 11:16:52,051 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:16:52,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:16:52,052 INFO L85 PathProgramCache]: Analyzing trace with hash 51408783, now seen corresponding path program 1 times [2025-03-03 11:16:52,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:16:52,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794688921] [2025-03-03 11:16:52,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:16:52,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:16:52,075 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-03 11:16:52,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-03 11:16:52,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:16:52,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:16:52,132 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-03 11:16:52,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:16:52,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794688921] [2025-03-03 11:16:52,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794688921] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:16:52,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:16:52,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 11:16:52,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708426672] [2025-03-03 11:16:52,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:16:52,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:16:52,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:16:52,133 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:16:52,133 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:16:52,133 INFO L87 Difference]: Start difference. First operand 60455 states and 94440 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:16:54,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:16:54,690 INFO L93 Difference]: Finished difference Result 110047 states and 171350 transitions. [2025-03-03 11:16:54,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:16:54,690 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2025-03-03 11:16:54,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:16:54,768 INFO L225 Difference]: With dead ends: 110047 [2025-03-03 11:16:54,768 INFO L226 Difference]: Without dead ends: 61421 [2025-03-03 11:16:54,800 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 11:16:54,801 INFO L435 NwaCegarLoop]: 10159 mSDtfsCounter, 9658 mSDsluCounter, 9402 mSDsCounter, 0 mSdLazyCounter, 2921 mSolverCounterSat, 1080 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9658 SdHoareTripleChecker+Valid, 19561 SdHoareTripleChecker+Invalid, 4001 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1080 IncrementalHoareTripleChecker+Valid, 2921 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-03 11:16:54,801 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9658 Valid, 19561 Invalid, 4001 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1080 Valid, 2921 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-03 11:16:54,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61421 states. [2025-03-03 11:16:55,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61421 to 60199. [2025-03-03 11:16:55,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60199 states, 60198 states have (on average 1.5518123525698528) internal successors, (93416), 60198 states have internal predecessors, (93416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:16:55,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60199 states to 60199 states and 93416 transitions. [2025-03-03 11:16:55,535 INFO L78 Accepts]: Start accepts. Automaton has 60199 states and 93416 transitions. Word has length 58 [2025-03-03 11:16:55,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:16:55,535 INFO L471 AbstractCegarLoop]: Abstraction has 60199 states and 93416 transitions. [2025-03-03 11:16:55,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:16:55,535 INFO L276 IsEmpty]: Start isEmpty. Operand 60199 states and 93416 transitions. [2025-03-03 11:16:55,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-03 11:16:55,536 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:16:55,536 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 11:16:55,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 11:16:55,536 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:16:55,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:16:55,537 INFO L85 PathProgramCache]: Analyzing trace with hash 1080508004, now seen corresponding path program 1 times [2025-03-03 11:16:55,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:16:55,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039208842] [2025-03-03 11:16:55,537 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:16:55,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:16:55,562 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-03 11:16:55,568 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-03 11:16:55,568 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:16:55,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:16:55,616 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 11:16:55,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:16:55,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039208842] [2025-03-03 11:16:55,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039208842] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:16:55,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:16:55,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 11:16:55,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195999434] [2025-03-03 11:16:55,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:16:55,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:16:55,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:16:55,617 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:16:55,617 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:16:55,617 INFO L87 Difference]: Start difference. First operand 60199 states and 93416 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:16:58,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:16:58,572 INFO L93 Difference]: Finished difference Result 122230 states and 188541 transitions. [2025-03-03 11:16:58,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:16:58,572 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2025-03-03 11:16:58,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:16:58,644 INFO L225 Difference]: With dead ends: 122230 [2025-03-03 11:16:58,644 INFO L226 Difference]: Without dead ends: 62411 [2025-03-03 11:16:58,682 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 11:16:58,682 INFO L435 NwaCegarLoop]: 10086 mSDtfsCounter, 9795 mSDsluCounter, 9166 mSDsCounter, 0 mSdLazyCounter, 3959 mSolverCounterSat, 846 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9795 SdHoareTripleChecker+Valid, 19252 SdHoareTripleChecker+Invalid, 4805 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 846 IncrementalHoareTripleChecker+Valid, 3959 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-03-03 11:16:58,682 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9795 Valid, 19252 Invalid, 4805 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [846 Valid, 3959 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-03-03 11:16:58,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62411 states. [2025-03-03 11:16:59,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62411 to 59893. [2025-03-03 11:16:59,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59893 states, 59892 states have (on average 1.5482702197288452) internal successors, (92729), 59892 states have internal predecessors, (92729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:16:59,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59893 states to 59893 states and 92729 transitions. [2025-03-03 11:16:59,202 INFO L78 Accepts]: Start accepts. Automaton has 59893 states and 92729 transitions. Word has length 64 [2025-03-03 11:16:59,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:16:59,202 INFO L471 AbstractCegarLoop]: Abstraction has 59893 states and 92729 transitions. [2025-03-03 11:16:59,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:16:59,202 INFO L276 IsEmpty]: Start isEmpty. Operand 59893 states and 92729 transitions. [2025-03-03 11:16:59,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-03 11:16:59,203 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:16:59,203 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 11:16:59,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 11:16:59,203 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:16:59,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:16:59,203 INFO L85 PathProgramCache]: Analyzing trace with hash 1693316576, now seen corresponding path program 1 times [2025-03-03 11:16:59,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:16:59,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270750605] [2025-03-03 11:16:59,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:16:59,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:16:59,226 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-03 11:16:59,234 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-03 11:16:59,234 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:16:59,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:16:59,359 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 11:16:59,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:16:59,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270750605] [2025-03-03 11:16:59,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270750605] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:16:59,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:16:59,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 11:16:59,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863380973] [2025-03-03 11:16:59,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:16:59,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 11:16:59,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:16:59,360 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 11:16:59,360 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 11:16:59,360 INFO L87 Difference]: Start difference. First operand 59893 states and 92729 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 11:17:03,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:17:03,348 INFO L93 Difference]: Finished difference Result 86159 states and 132265 transitions. [2025-03-03 11:17:03,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:17:03,349 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 11:17:03,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:17:03,426 INFO L225 Difference]: With dead ends: 86159 [2025-03-03 11:17:03,426 INFO L226 Difference]: Without dead ends: 61151 [2025-03-03 11:17:03,449 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 11:17:03,449 INFO L435 NwaCegarLoop]: 19396 mSDtfsCounter, 18349 mSDsluCounter, 8528 mSDsCounter, 0 mSdLazyCounter, 5149 mSolverCounterSat, 1469 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18349 SdHoareTripleChecker+Valid, 27924 SdHoareTripleChecker+Invalid, 6618 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1469 IncrementalHoareTripleChecker+Valid, 5149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2025-03-03 11:17:03,449 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18349 Valid, 27924 Invalid, 6618 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1469 Valid, 5149 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2025-03-03 11:17:03,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61151 states. [2025-03-03 11:17:04,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61151 to 59877. [2025-03-03 11:17:04,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59877 states, 59876 states have (on average 1.5470138285790633) internal successors, (92629), 59876 states have internal predecessors, (92629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:17:04,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59877 states to 59877 states and 92629 transitions. [2025-03-03 11:17:04,158 INFO L78 Accepts]: Start accepts. Automaton has 59877 states and 92629 transitions. Word has length 74 [2025-03-03 11:17:04,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:17:04,158 INFO L471 AbstractCegarLoop]: Abstraction has 59877 states and 92629 transitions. [2025-03-03 11:17:04,158 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 11:17:04,158 INFO L276 IsEmpty]: Start isEmpty. Operand 59877 states and 92629 transitions. [2025-03-03 11:17:04,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-03 11:17:04,159 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:17:04,159 INFO L218 NwaCegarLoop]: trace histogram [3, 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] [2025-03-03 11:17:04,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 11:17:04,159 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:17:04,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:17:04,160 INFO L85 PathProgramCache]: Analyzing trace with hash 94560878, now seen corresponding path program 1 times [2025-03-03 11:17:04,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:17:04,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185295260] [2025-03-03 11:17:04,160 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:17:04,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:17:04,186 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-03 11:17:04,192 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-03 11:17:04,192 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:17:04,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:17:04,226 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-03 11:17:04,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:17:04,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185295260] [2025-03-03 11:17:04,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1185295260] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:17:04,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:17:04,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 11:17:04,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496268305] [2025-03-03 11:17:04,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:17:04,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:17:04,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:17:04,227 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:17:04,227 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:17:04,227 INFO L87 Difference]: Start difference. First operand 59877 states and 92629 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 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 11:17:05,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:17:05,413 INFO L93 Difference]: Finished difference Result 117122 states and 181193 transitions. [2025-03-03 11:17:05,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:17:05,414 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 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 81 [2025-03-03 11:17:05,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:17:05,479 INFO L225 Difference]: With dead ends: 117122 [2025-03-03 11:17:05,479 INFO L226 Difference]: Without dead ends: 57643 [2025-03-03 11:17:05,499 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 11:17:05,499 INFO L435 NwaCegarLoop]: 11156 mSDtfsCounter, 9552 mSDsluCounter, 765 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 807 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9552 SdHoareTripleChecker+Valid, 11921 SdHoareTripleChecker+Invalid, 990 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 807 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 11:17:05,499 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9552 Valid, 11921 Invalid, 990 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [807 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 11:17:05,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57643 states. [2025-03-03 11:17:06,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57643 to 57641. [2025-03-03 11:17:06,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57641 states, 57640 states have (on average 1.5460444136016656) internal successors, (89114), 57640 states have internal predecessors, (89114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:17:06,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57641 states to 57641 states and 89114 transitions. [2025-03-03 11:17:06,142 INFO L78 Accepts]: Start accepts. Automaton has 57641 states and 89114 transitions. Word has length 81 [2025-03-03 11:17:06,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:17:06,142 INFO L471 AbstractCegarLoop]: Abstraction has 57641 states and 89114 transitions. [2025-03-03 11:17:06,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 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 11:17:06,142 INFO L276 IsEmpty]: Start isEmpty. Operand 57641 states and 89114 transitions. [2025-03-03 11:17:06,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-03-03 11:17:06,143 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:17:06,144 INFO L218 NwaCegarLoop]: trace histogram [3, 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 11:17:06,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 11:17:06,144 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:17:06,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:17:06,144 INFO L85 PathProgramCache]: Analyzing trace with hash 1803631257, now seen corresponding path program 1 times [2025-03-03 11:17:06,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:17:06,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808079360] [2025-03-03 11:17:06,144 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:17:06,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:17:06,168 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-03 11:17:06,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-03 11:17:06,174 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:17:06,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:17:06,199 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-03 11:17:06,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:17:06,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808079360] [2025-03-03 11:17:06,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808079360] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:17:06,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:17:06,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 11:17:06,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283693309] [2025-03-03 11:17:06,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:17:06,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:17:06,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:17:06,200 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:17:06,200 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:17:06,200 INFO L87 Difference]: Start difference. First operand 57641 states and 89114 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:17:07,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:17:07,336 INFO L93 Difference]: Finished difference Result 114966 states and 177748 transitions. [2025-03-03 11:17:07,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:17:07,336 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 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 84 [2025-03-03 11:17:07,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:17:07,421 INFO L225 Difference]: With dead ends: 114966 [2025-03-03 11:17:07,421 INFO L226 Difference]: Without dead ends: 57723 [2025-03-03 11:17:07,449 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 11:17:07,450 INFO L435 NwaCegarLoop]: 11227 mSDtfsCounter, 276 mSDsluCounter, 9968 mSDsCounter, 0 mSdLazyCounter, 961 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 21195 SdHoareTripleChecker+Invalid, 992 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 961 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 11:17:07,450 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [276 Valid, 21195 Invalid, 992 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 961 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 11:17:07,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57723 states. [2025-03-03 11:17:08,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57723 to 57721. [2025-03-03 11:17:08,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57721 states, 57720 states have (on average 1.5452875952875953) internal successors, (89194), 57720 states have internal predecessors, (89194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:17:08,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57721 states to 57721 states and 89194 transitions. [2025-03-03 11:17:08,161 INFO L78 Accepts]: Start accepts. Automaton has 57721 states and 89194 transitions. Word has length 84 [2025-03-03 11:17:08,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:17:08,161 INFO L471 AbstractCegarLoop]: Abstraction has 57721 states and 89194 transitions. [2025-03-03 11:17:08,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:17:08,161 INFO L276 IsEmpty]: Start isEmpty. Operand 57721 states and 89194 transitions. [2025-03-03 11:17:08,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-03 11:17:08,162 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:17:08,162 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 11:17:08,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 11:17:08,162 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:17:08,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:17:08,163 INFO L85 PathProgramCache]: Analyzing trace with hash 1197169411, now seen corresponding path program 1 times [2025-03-03 11:17:08,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:17:08,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345306703] [2025-03-03 11:17:08,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:17:08,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:17:08,192 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-03 11:17:08,200 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-03 11:17:08,200 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:17:08,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:17:08,401 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 11:17:08,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:17:08,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345306703] [2025-03-03 11:17:08,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345306703] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:17:08,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:17:08,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 11:17:08,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626737267] [2025-03-03 11:17:08,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:17:08,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 11:17:08,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:17:08,403 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 11:17:08,403 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 11:17:08,403 INFO L87 Difference]: Start difference. First operand 57721 states and 89194 transitions. Second operand has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:17:12,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:17:12,049 INFO L93 Difference]: Finished difference Result 82681 states and 126798 transitions. [2025-03-03 11:17:12,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 11:17:12,049 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2025-03-03 11:17:12,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:17:12,098 INFO L225 Difference]: With dead ends: 82681 [2025-03-03 11:17:12,098 INFO L226 Difference]: Without dead ends: 36252 [2025-03-03 11:17:12,122 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 11:17:12,122 INFO L435 NwaCegarLoop]: 8734 mSDtfsCounter, 17799 mSDsluCounter, 8369 mSDsCounter, 0 mSdLazyCounter, 5629 mSolverCounterSat, 1678 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17799 SdHoareTripleChecker+Valid, 17103 SdHoareTripleChecker+Invalid, 7307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1678 IncrementalHoareTripleChecker+Valid, 5629 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2025-03-03 11:17:12,122 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17799 Valid, 17103 Invalid, 7307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1678 Valid, 5629 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2025-03-03 11:17:12,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36252 states. [2025-03-03 11:17:12,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36252 to 35099. [2025-03-03 11:17:12,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35099 states, 35098 states have (on average 1.520969855832241) internal successors, (53383), 35098 states have internal predecessors, (53383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:17:12,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35099 states to 35099 states and 53383 transitions. [2025-03-03 11:17:12,448 INFO L78 Accepts]: Start accepts. Automaton has 35099 states and 53383 transitions. Word has length 88 [2025-03-03 11:17:12,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:17:12,448 INFO L471 AbstractCegarLoop]: Abstraction has 35099 states and 53383 transitions. [2025-03-03 11:17:12,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:17:12,448 INFO L276 IsEmpty]: Start isEmpty. Operand 35099 states and 53383 transitions. [2025-03-03 11:17:12,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-03 11:17:12,449 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:17:12,449 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 11:17:12,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 11:17:12,449 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:17:12,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:17:12,450 INFO L85 PathProgramCache]: Analyzing trace with hash -488700849, now seen corresponding path program 1 times [2025-03-03 11:17:12,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:17:12,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446516954] [2025-03-03 11:17:12,450 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:17:12,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:17:12,478 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-03 11:17:12,486 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-03 11:17:12,486 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:17:12,486 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:17:12,823 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 11:17:12,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:17:12,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446516954] [2025-03-03 11:17:12,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446516954] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:17:12,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:17:12,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 11:17:12,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104386214] [2025-03-03 11:17:12,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:17:12,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 11:17:12,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:17:12,825 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 11:17:12,826 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 11:17:12,826 INFO L87 Difference]: Start difference. First operand 35099 states and 53383 transitions. Second operand has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:17:16,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:17:16,419 INFO L93 Difference]: Finished difference Result 48619 states and 72989 transitions. [2025-03-03 11:17:16,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 11:17:16,419 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 90 [2025-03-03 11:17:16,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:17:16,450 INFO L225 Difference]: With dead ends: 48619 [2025-03-03 11:17:16,450 INFO L226 Difference]: Without dead ends: 24952 [2025-03-03 11:17:16,464 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 11:17:16,464 INFO L435 NwaCegarLoop]: 16028 mSDtfsCounter, 18439 mSDsluCounter, 8367 mSDsCounter, 0 mSdLazyCounter, 6552 mSolverCounterSat, 1650 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18439 SdHoareTripleChecker+Valid, 24395 SdHoareTripleChecker+Invalid, 8202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1650 IncrementalHoareTripleChecker+Valid, 6552 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2025-03-03 11:17:16,464 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18439 Valid, 24395 Invalid, 8202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1650 Valid, 6552 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2025-03-03 11:17:16,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24952 states. [2025-03-03 11:17:16,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24952 to 23799. [2025-03-03 11:17:16,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23799 states, 23798 states have (on average 1.5068913354063367) internal successors, (35861), 23798 states have internal predecessors, (35861), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:17:16,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23799 states to 23799 states and 35861 transitions. [2025-03-03 11:17:16,698 INFO L78 Accepts]: Start accepts. Automaton has 23799 states and 35861 transitions. Word has length 90 [2025-03-03 11:17:16,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:17:16,698 INFO L471 AbstractCegarLoop]: Abstraction has 23799 states and 35861 transitions. [2025-03-03 11:17:16,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:17:16,698 INFO L276 IsEmpty]: Start isEmpty. Operand 23799 states and 35861 transitions. [2025-03-03 11:17:16,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-03 11:17:16,699 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:17:16,699 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 11:17:16,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-03 11:17:16,699 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:17:16,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:17:16,700 INFO L85 PathProgramCache]: Analyzing trace with hash 828006768, now seen corresponding path program 1 times [2025-03-03 11:17:16,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:17:16,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183370351] [2025-03-03 11:17:16,700 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:17:16,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:17:16,731 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-03 11:17:16,744 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-03 11:17:16,744 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:17:16,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:17:16,784 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 11:17:16,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:17:16,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183370351] [2025-03-03 11:17:16,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183370351] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:17:16,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:17:16,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 11:17:16,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027595533] [2025-03-03 11:17:16,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:17:16,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:17:16,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:17:16,785 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:17:16,785 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:17:16,785 INFO L87 Difference]: Start difference. First operand 23799 states and 35861 transitions. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:17:17,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:17:17,582 INFO L93 Difference]: Finished difference Result 24572 states and 36973 transitions. [2025-03-03 11:17:17,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:17:17,583 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 98 [2025-03-03 11:17:17,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:17:17,616 INFO L225 Difference]: With dead ends: 24572 [2025-03-03 11:17:17,616 INFO L226 Difference]: Without dead ends: 24570 [2025-03-03 11:17:17,625 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 11:17:17,625 INFO L435 NwaCegarLoop]: 10884 mSDtfsCounter, 886 mSDsluCounter, 10116 mSDsCounter, 0 mSdLazyCounter, 1006 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 886 SdHoareTripleChecker+Valid, 21000 SdHoareTripleChecker+Invalid, 1128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 1006 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 11:17:17,625 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [886 Valid, 21000 Invalid, 1128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 1006 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 11:17:17,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24570 states. [2025-03-03 11:17:17,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24570 to 24570. [2025-03-03 11:17:18,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24570 states, 24569 states have (on average 1.5044975375473157) internal successors, (36964), 24569 states have internal predecessors, (36964), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:17:18,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24570 states to 24570 states and 36964 transitions. [2025-03-03 11:17:18,041 INFO L78 Accepts]: Start accepts. Automaton has 24570 states and 36964 transitions. Word has length 98 [2025-03-03 11:17:18,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:17:18,041 INFO L471 AbstractCegarLoop]: Abstraction has 24570 states and 36964 transitions. [2025-03-03 11:17:18,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:17:18,041 INFO L276 IsEmpty]: Start isEmpty. Operand 24570 states and 36964 transitions. [2025-03-03 11:17:18,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-03-03 11:17:18,043 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:17:18,043 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 11:17:18,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-03 11:17:18,043 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:17:18,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:17:18,043 INFO L85 PathProgramCache]: Analyzing trace with hash 567097613, now seen corresponding path program 1 times [2025-03-03 11:17:18,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:17:18,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958753395] [2025-03-03 11:17:18,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:17:18,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:17:18,074 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-03 11:17:18,080 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-03 11:17:18,080 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:17:18,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:17:18,116 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-03 11:17:18,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:17:18,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958753395] [2025-03-03 11:17:18,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958753395] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:17:18,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:17:18,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 11:17:18,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459409876] [2025-03-03 11:17:18,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:17:18,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:17:18,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:17:18,117 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:17:18,117 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:17:18,117 INFO L87 Difference]: Start difference. First operand 24570 states and 36964 transitions. Second operand has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:17:18,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:17:18,813 INFO L93 Difference]: Finished difference Result 42966 states and 64448 transitions. [2025-03-03 11:17:18,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:17:18,813 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 114 [2025-03-03 11:17:18,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:17:18,835 INFO L225 Difference]: With dead ends: 42966 [2025-03-03 11:17:18,836 INFO L226 Difference]: Without dead ends: 19565 [2025-03-03 11:17:18,852 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 11:17:18,853 INFO L435 NwaCegarLoop]: 11006 mSDtfsCounter, 290 mSDsluCounter, 9828 mSDsCounter, 0 mSdLazyCounter, 872 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 20834 SdHoareTripleChecker+Invalid, 898 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 872 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 11:17:18,853 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [290 Valid, 20834 Invalid, 898 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 872 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 11:17:18,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19565 states. [2025-03-03 11:17:19,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19565 to 19563. [2025-03-03 11:17:19,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19563 states, 19562 states have (on average 1.4900828136182394) internal successors, (29149), 19562 states have internal predecessors, (29149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:17:19,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19563 states to 19563 states and 29149 transitions. [2025-03-03 11:17:19,131 INFO L78 Accepts]: Start accepts. Automaton has 19563 states and 29149 transitions. Word has length 114 [2025-03-03 11:17:19,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:17:19,131 INFO L471 AbstractCegarLoop]: Abstraction has 19563 states and 29149 transitions. [2025-03-03 11:17:19,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:17:19,132 INFO L276 IsEmpty]: Start isEmpty. Operand 19563 states and 29149 transitions. [2025-03-03 11:17:19,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-03 11:17:19,133 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:17:19,133 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:17:19,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-03 11:17:19,134 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:17:19,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:17:19,134 INFO L85 PathProgramCache]: Analyzing trace with hash -193250321, now seen corresponding path program 1 times [2025-03-03 11:17:19,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:17:19,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536444306] [2025-03-03 11:17:19,134 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:17:19,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:17:19,164 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-03 11:17:19,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-03 11:17:19,174 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:17:19,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:17:19,228 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 11:17:19,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:17:19,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536444306] [2025-03-03 11:17:19,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536444306] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:17:19,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:17:19,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 11:17:19,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111040000] [2025-03-03 11:17:19,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:17:19,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:17:19,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:17:19,229 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:17:19,229 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:17:19,229 INFO L87 Difference]: Start difference. First operand 19563 states and 29149 transitions. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:17:19,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:17:19,856 INFO L93 Difference]: Finished difference Result 36148 states and 53944 transitions. [2025-03-03 11:17:19,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:17:19,858 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 0 states have call successors, (0), 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 136 [2025-03-03 11:17:19,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:17:19,879 INFO L225 Difference]: With dead ends: 36148 [2025-03-03 11:17:19,879 INFO L226 Difference]: Without dead ends: 17944 [2025-03-03 11:17:19,892 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 11:17:19,893 INFO L435 NwaCegarLoop]: 10567 mSDtfsCounter, 8617 mSDsluCounter, 1218 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 642 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8617 SdHoareTripleChecker+Valid, 11785 SdHoareTripleChecker+Invalid, 875 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 642 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 11:17:19,893 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8617 Valid, 11785 Invalid, 875 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [642 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 11:17:19,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17944 states. [2025-03-03 11:17:20,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17944 to 17942. [2025-03-03 11:17:20,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17942 states, 17941 states have (on average 1.4900507218103785) internal successors, (26733), 17941 states have internal predecessors, (26733), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:17:20,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17942 states to 17942 states and 26733 transitions. [2025-03-03 11:17:20,063 INFO L78 Accepts]: Start accepts. Automaton has 17942 states and 26733 transitions. Word has length 136 [2025-03-03 11:17:20,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:17:20,063 INFO L471 AbstractCegarLoop]: Abstraction has 17942 states and 26733 transitions. [2025-03-03 11:17:20,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:17:20,063 INFO L276 IsEmpty]: Start isEmpty. Operand 17942 states and 26733 transitions. [2025-03-03 11:17:20,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-03-03 11:17:20,065 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:17:20,065 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:17:20,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-03 11:17:20,066 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:17:20,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:17:20,066 INFO L85 PathProgramCache]: Analyzing trace with hash -1155820640, now seen corresponding path program 1 times [2025-03-03 11:17:20,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:17:20,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069992261] [2025-03-03 11:17:20,066 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:17:20,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:17:20,162 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-03 11:17:20,175 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-03 11:17:20,176 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:17:20,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:17:20,235 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 11:17:20,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:17:20,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069992261] [2025-03-03 11:17:20,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069992261] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:17:20,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:17:20,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 11:17:20,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044346514] [2025-03-03 11:17:20,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:17:20,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:17:20,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:17:20,237 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:17:20,237 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:17:20,237 INFO L87 Difference]: Start difference. First operand 17942 states and 26733 transitions. Second operand has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:17:20,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:17:20,991 INFO L93 Difference]: Finished difference Result 29250 states and 43528 transitions. [2025-03-03 11:17:20,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:17:20,992 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 138 [2025-03-03 11:17:20,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:17:21,008 INFO L225 Difference]: With dead ends: 29250 [2025-03-03 11:17:21,008 INFO L226 Difference]: Without dead ends: 13058 [2025-03-03 11:17:21,020 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 11:17:21,020 INFO L435 NwaCegarLoop]: 10288 mSDtfsCounter, 291 mSDsluCounter, 9133 mSDsCounter, 0 mSdLazyCounter, 848 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 19421 SdHoareTripleChecker+Invalid, 876 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 848 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 11:17:21,020 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [291 Valid, 19421 Invalid, 876 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 848 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 11:17:21,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13058 states. [2025-03-03 11:17:21,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13058 to 13056. [2025-03-03 11:17:21,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13056 states, 13055 states have (on average 1.478207583301417) internal successors, (19298), 13055 states have internal predecessors, (19298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:17:21,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13056 states to 13056 states and 19298 transitions. [2025-03-03 11:17:21,200 INFO L78 Accepts]: Start accepts. Automaton has 13056 states and 19298 transitions. Word has length 138 [2025-03-03 11:17:21,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:17:21,200 INFO L471 AbstractCegarLoop]: Abstraction has 13056 states and 19298 transitions. [2025-03-03 11:17:21,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:17:21,200 INFO L276 IsEmpty]: Start isEmpty. Operand 13056 states and 19298 transitions. [2025-03-03 11:17:21,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-03 11:17:21,202 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:17:21,202 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:17:21,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-03 11:17:21,203 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:17:21,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:17:21,203 INFO L85 PathProgramCache]: Analyzing trace with hash 59329461, now seen corresponding path program 1 times [2025-03-03 11:17:21,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:17:21,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87464406] [2025-03-03 11:17:21,203 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:17:21,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:17:21,244 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-03 11:17:21,256 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-03 11:17:21,256 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:17:21,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:17:21,318 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-03 11:17:21,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:17:21,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87464406] [2025-03-03 11:17:21,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87464406] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:17:21,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:17:21,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 11:17:21,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017425538] [2025-03-03 11:17:21,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:17:21,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:17:21,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:17:21,320 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:17:21,320 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:17:21,320 INFO L87 Difference]: Start difference. First operand 13056 states and 19298 transitions. Second operand has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:17:22,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:17:22,023 INFO L93 Difference]: Finished difference Result 23526 states and 34853 transitions. [2025-03-03 11:17:22,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:17:22,023 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 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 144 [2025-03-03 11:17:22,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:17:22,040 INFO L225 Difference]: With dead ends: 23526 [2025-03-03 11:17:22,040 INFO L226 Difference]: Without dead ends: 12415 [2025-03-03 11:17:22,049 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 11:17:22,050 INFO L435 NwaCegarLoop]: 10201 mSDtfsCounter, 7239 mSDsluCounter, 2218 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 569 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7239 SdHoareTripleChecker+Valid, 12419 SdHoareTripleChecker+Invalid, 940 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 569 IncrementalHoareTripleChecker+Valid, 371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 11:17:22,050 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7239 Valid, 12419 Invalid, 940 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [569 Valid, 371 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 11:17:22,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12415 states. [2025-03-03 11:17:22,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12415 to 12413. [2025-03-03 11:17:22,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12413 states, 12412 states have (on average 1.4769577827908476) internal successors, (18332), 12412 states have internal predecessors, (18332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:17:22,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12413 states to 12413 states and 18332 transitions. [2025-03-03 11:17:22,321 INFO L78 Accepts]: Start accepts. Automaton has 12413 states and 18332 transitions. Word has length 144 [2025-03-03 11:17:22,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:17:22,321 INFO L471 AbstractCegarLoop]: Abstraction has 12413 states and 18332 transitions. [2025-03-03 11:17:22,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:17:22,321 INFO L276 IsEmpty]: Start isEmpty. Operand 12413 states and 18332 transitions. [2025-03-03 11:17:22,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-03-03 11:17:22,323 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:17:22,323 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:17:22,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-03 11:17:22,324 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:17:22,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:17:22,324 INFO L85 PathProgramCache]: Analyzing trace with hash -355197433, now seen corresponding path program 1 times [2025-03-03 11:17:22,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:17:22,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433485660] [2025-03-03 11:17:22,324 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:17:22,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:17:22,360 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-03 11:17:22,369 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-03 11:17:22,369 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:17:22,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:17:22,410 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-03 11:17:22,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:17:22,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433485660] [2025-03-03 11:17:22,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433485660] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:17:22,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:17:22,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 11:17:22,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868522647] [2025-03-03 11:17:22,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:17:22,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:17:22,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:17:22,412 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:17:22,412 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:17:22,412 INFO L87 Difference]: Start difference. First operand 12413 states and 18332 transitions. Second operand has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:17:23,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:17:23,021 INFO L93 Difference]: Finished difference Result 22913 states and 33911 transitions. [2025-03-03 11:17:23,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:17:23,021 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 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 148 [2025-03-03 11:17:23,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:17:23,035 INFO L225 Difference]: With dead ends: 22913 [2025-03-03 11:17:23,035 INFO L226 Difference]: Without dead ends: 12445 [2025-03-03 11:17:23,043 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 11:17:23,044 INFO L435 NwaCegarLoop]: 10258 mSDtfsCounter, 247 mSDsluCounter, 9149 mSDsCounter, 0 mSdLazyCounter, 832 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 19407 SdHoareTripleChecker+Invalid, 880 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 832 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 11:17:23,044 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 19407 Invalid, 880 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 832 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 11:17:23,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12445 states. [2025-03-03 11:17:23,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12445 to 12443. [2025-03-03 11:17:23,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12443 states, 12442 states have (on average 1.4758077479504903) internal successors, (18362), 12442 states have internal predecessors, (18362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:17:23,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12443 states to 12443 states and 18362 transitions. [2025-03-03 11:17:23,162 INFO L78 Accepts]: Start accepts. Automaton has 12443 states and 18362 transitions. Word has length 148 [2025-03-03 11:17:23,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:17:23,162 INFO L471 AbstractCegarLoop]: Abstraction has 12443 states and 18362 transitions. [2025-03-03 11:17:23,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:17:23,163 INFO L276 IsEmpty]: Start isEmpty. Operand 12443 states and 18362 transitions. [2025-03-03 11:17:23,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-03-03 11:17:23,164 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:17:23,165 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:17:23,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-03 11:17:23,165 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:17:23,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:17:23,165 INFO L85 PathProgramCache]: Analyzing trace with hash -1777191804, now seen corresponding path program 1 times [2025-03-03 11:17:23,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:17:23,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661453948] [2025-03-03 11:17:23,165 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:17:23,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:17:23,195 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-03-03 11:17:23,203 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-03-03 11:17:23,204 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:17:23,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:17:23,246 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-03 11:17:23,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:17:23,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661453948] [2025-03-03 11:17:23,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661453948] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:17:23,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:17:23,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 11:17:23,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014641400] [2025-03-03 11:17:23,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:17:23,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:17:23,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:17:23,248 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:17:23,248 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:17:23,248 INFO L87 Difference]: Start difference. First operand 12443 states and 18362 transitions. Second operand has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)