./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem17_label45.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem17_label45.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash bad588c9542390857efe8d001f4c41a270c4260c6e96db502f4ea1506acc7b02 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 00:14:34,839 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 00:14:34,891 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 00:14:34,897 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 00:14:34,900 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 00:14:34,920 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 00:14:34,920 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 00:14:34,920 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 00:14:34,920 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 00:14:34,920 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 00:14:34,921 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 00:14:34,921 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 00:14:34,921 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 00:14:34,921 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 00:14:34,921 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 00:14:34,921 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 00:14:34,921 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 00:14:34,921 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 00:14:34,922 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 00:14:34,922 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 00:14:34,922 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 00:14:34,922 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 00:14:34,922 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 00:14:34,922 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 00:14:34,922 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 00:14:34,922 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 00:14:34,922 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 00:14:34,922 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 00:14:34,922 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 00:14:34,923 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 00:14:34,923 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 00:14:34,923 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 00:14:34,923 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:14:34,923 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 00:14:34,923 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 00:14:34,923 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 00:14:34,923 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 00:14:34,923 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:14:34,923 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 00:14:34,924 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 00:14:34,924 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 00:14:34,924 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 00:14:34,924 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 00:14:34,924 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 00:14:34,924 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 00:14:34,924 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 00:14:34,924 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 00:14:34,924 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 00:14:34,924 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> bad588c9542390857efe8d001f4c41a270c4260c6e96db502f4ea1506acc7b02 [2025-01-09 00:14:35,158 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 00:14:35,163 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 00:14:35,165 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 00:14:35,165 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 00:14:35,166 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 00:14:35,166 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem17_label45.c [2025-01-09 00:14:36,363 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a9897a970/d58be1ea163c41dda0af90514b2a2a12/FLAGe7c616e49 [2025-01-09 00:14:36,750 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 00:14:36,751 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label45.c [2025-01-09 00:14:36,770 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a9897a970/d58be1ea163c41dda0af90514b2a2a12/FLAGe7c616e49 [2025-01-09 00:14:36,925 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a9897a970/d58be1ea163c41dda0af90514b2a2a12 [2025-01-09 00:14:36,927 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 00:14:36,928 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 00:14:36,929 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 00:14:36,929 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 00:14:36,931 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 00:14:36,932 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:14:36" (1/1) ... [2025-01-09 00:14:36,932 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4fd6818d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:14:36, skipping insertion in model container [2025-01-09 00:14:36,933 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:14:36" (1/1) ... [2025-01-09 00:14:37,006 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 00:14:37,159 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label45.c[7434,7447] [2025-01-09 00:14:37,499 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 00:14:37,507 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 00:14:37,556 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label45.c[7434,7447] [2025-01-09 00:14:37,787 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 00:14:37,806 INFO L204 MainTranslator]: Completed translation [2025-01-09 00:14:37,810 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:14:37 WrapperNode [2025-01-09 00:14:37,810 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 00:14:37,811 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 00:14:37,814 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 00:14:37,814 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 00:14:37,822 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:14:37" (1/1) ... [2025-01-09 00:14:37,857 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:14:37" (1/1) ... [2025-01-09 00:14:38,018 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 2610 [2025-01-09 00:14:38,019 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 00:14:38,020 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 00:14:38,020 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 00:14:38,020 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 00:14:38,026 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:14:37" (1/1) ... [2025-01-09 00:14:38,026 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:14:37" (1/1) ... [2025-01-09 00:14:38,130 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:14:37" (1/1) ... [2025-01-09 00:14:38,230 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-01-09 00:14:38,231 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:14:37" (1/1) ... [2025-01-09 00:14:38,231 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:14:37" (1/1) ... [2025-01-09 00:14:38,308 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:14:37" (1/1) ... [2025-01-09 00:14:38,322 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:14:37" (1/1) ... [2025-01-09 00:14:38,346 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:14:37" (1/1) ... [2025-01-09 00:14:38,367 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:14:37" (1/1) ... [2025-01-09 00:14:38,389 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:14:37" (1/1) ... [2025-01-09 00:14:38,450 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 00:14:38,452 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 00:14:38,452 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 00:14:38,452 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 00:14:38,453 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:14:37" (1/1) ... [2025-01-09 00:14:38,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:14:38,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:14:38,478 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 00:14:38,481 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 00:14:38,498 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 00:14:38,498 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 00:14:38,498 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 00:14:38,498 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 00:14:38,550 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 00:14:38,552 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 00:14:40,836 INFO L? ?]: Removed 372 outVars from TransFormulas that were not future-live. [2025-01-09 00:14:40,837 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 00:14:40,860 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 00:14:40,860 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 00:14:40,860 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:14:40 BoogieIcfgContainer [2025-01-09 00:14:40,864 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 00:14:40,865 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 00:14:40,865 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 00:14:40,869 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 00:14:40,869 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 12:14:36" (1/3) ... [2025-01-09 00:14:40,870 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27f26988 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:14:40, skipping insertion in model container [2025-01-09 00:14:40,870 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:14:37" (2/3) ... [2025-01-09 00:14:40,870 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27f26988 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:14:40, skipping insertion in model container [2025-01-09 00:14:40,870 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:14:40" (3/3) ... [2025-01-09 00:14:40,871 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem17_label45.c [2025-01-09 00:14:40,881 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 00:14:40,883 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem17_label45.c that has 1 procedures, 590 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 00:14:40,937 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 00:14:40,945 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;@542ce820, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 00:14:40,946 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 00:14:40,951 INFO L276 IsEmpty]: Start isEmpty. Operand has 590 states, 588 states have (on average 1.804421768707483) internal successors, (1061), 589 states have internal predecessors, (1061), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:14:40,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-01-09 00:14:40,956 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:14:40,956 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:14:40,956 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:14:40,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:14:40,960 INFO L85 PathProgramCache]: Analyzing trace with hash -2100804166, now seen corresponding path program 1 times [2025-01-09 00:14:40,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:14:40,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906704362] [2025-01-09 00:14:40,967 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:14:40,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:14:41,017 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-01-09 00:14:41,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-01-09 00:14:41,039 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:14:41,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:14:41,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:14:41,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:14:41,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906704362] [2025-01-09 00:14:41,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906704362] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:14:41,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:14:41,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:14:41,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727413006] [2025-01-09 00:14:41,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:14:41,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:14:41,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:14:41,279 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:14:41,280 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:14:41,282 INFO L87 Difference]: Start difference. First operand has 590 states, 588 states have (on average 1.804421768707483) internal successors, (1061), 589 states have internal predecessors, (1061), 0 states have call successors, (0), 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 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 2 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:14:43,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:14:43,285 INFO L93 Difference]: Finished difference Result 1642 states and 3021 transitions. [2025-01-09 00:14:43,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:14:43,287 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 2 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2025-01-09 00:14:43,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:14:43,297 INFO L225 Difference]: With dead ends: 1642 [2025-01-09 00:14:43,297 INFO L226 Difference]: Without dead ends: 975 [2025-01-09 00:14:43,300 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-01-09 00:14:43,302 INFO L435 NwaCegarLoop]: 474 mSDtfsCounter, 440 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 1413 mSolverCounterSat, 372 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 440 SdHoareTripleChecker+Valid, 550 SdHoareTripleChecker+Invalid, 1785 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 372 IncrementalHoareTripleChecker+Valid, 1413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-01-09 00:14:43,302 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [440 Valid, 550 Invalid, 1785 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [372 Valid, 1413 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-01-09 00:14:43,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 975 states. [2025-01-09 00:14:43,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 975 to 972. [2025-01-09 00:14:43,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 972 states, 971 states have (on average 1.5077239958805355) internal successors, (1464), 971 states have internal predecessors, (1464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:14:43,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 972 states to 972 states and 1464 transitions. [2025-01-09 00:14:43,383 INFO L78 Accepts]: Start accepts. Automaton has 972 states and 1464 transitions. Word has length 50 [2025-01-09 00:14:43,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:14:43,387 INFO L471 AbstractCegarLoop]: Abstraction has 972 states and 1464 transitions. [2025-01-09 00:14:43,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 2 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:14:43,387 INFO L276 IsEmpty]: Start isEmpty. Operand 972 states and 1464 transitions. [2025-01-09 00:14:43,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-01-09 00:14:43,393 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:14:43,393 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:14:43,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 00:14:43,393 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:14:43,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:14:43,394 INFO L85 PathProgramCache]: Analyzing trace with hash 1089906790, now seen corresponding path program 1 times [2025-01-09 00:14:43,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:14:43,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764555389] [2025-01-09 00:14:43,394 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:14:43,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:14:43,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-01-09 00:14:43,476 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-01-09 00:14:43,477 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:14:43,477 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:14:43,719 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:14:43,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:14:43,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764555389] [2025-01-09 00:14:43,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764555389] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:14:43,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:14:43,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:14:43,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177487490] [2025-01-09 00:14:43,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:14:43,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:14:43,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:14:43,723 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:14:43,723 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:14:43,723 INFO L87 Difference]: Start difference. First operand 972 states and 1464 transitions. Second operand has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:14:45,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:14:45,616 INFO L93 Difference]: Finished difference Result 2814 states and 4242 transitions. [2025-01-09 00:14:45,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:14:45,617 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 0 states have call successors, (0), 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 120 [2025-01-09 00:14:45,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:14:45,622 INFO L225 Difference]: With dead ends: 2814 [2025-01-09 00:14:45,622 INFO L226 Difference]: Without dead ends: 1844 [2025-01-09 00:14:45,623 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-01-09 00:14:45,624 INFO L435 NwaCegarLoop]: 852 mSDtfsCounter, 441 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 1283 mSolverCounterSat, 414 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 441 SdHoareTripleChecker+Valid, 920 SdHoareTripleChecker+Invalid, 1697 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 414 IncrementalHoareTripleChecker+Valid, 1283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-01-09 00:14:45,624 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [441 Valid, 920 Invalid, 1697 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [414 Valid, 1283 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-01-09 00:14:45,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1844 states. [2025-01-09 00:14:45,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1844 to 1842. [2025-01-09 00:14:45,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1842 states, 1841 states have (on average 1.3601303639326452) internal successors, (2504), 1841 states have internal predecessors, (2504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:14:45,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1842 states to 1842 states and 2504 transitions. [2025-01-09 00:14:45,648 INFO L78 Accepts]: Start accepts. Automaton has 1842 states and 2504 transitions. Word has length 120 [2025-01-09 00:14:45,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:14:45,649 INFO L471 AbstractCegarLoop]: Abstraction has 1842 states and 2504 transitions. [2025-01-09 00:14:45,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:14:45,649 INFO L276 IsEmpty]: Start isEmpty. Operand 1842 states and 2504 transitions. [2025-01-09 00:14:45,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-01-09 00:14:45,650 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:14:45,650 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:14:45,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 00:14:45,651 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:14:45,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:14:45,651 INFO L85 PathProgramCache]: Analyzing trace with hash -1562314583, now seen corresponding path program 1 times [2025-01-09 00:14:45,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:14:45,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157987780] [2025-01-09 00:14:45,651 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:14:45,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:14:45,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-01-09 00:14:45,681 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-01-09 00:14:45,681 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:14:45,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:14:45,768 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:14:45,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:14:45,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157987780] [2025-01-09 00:14:45,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157987780] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:14:45,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:14:45,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:14:45,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756442711] [2025-01-09 00:14:45,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:14:45,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:14:45,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:14:45,769 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:14:45,770 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:14:45,770 INFO L87 Difference]: Start difference. First operand 1842 states and 2504 transitions. Second operand has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 2 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:14:47,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:14:47,861 INFO L93 Difference]: Finished difference Result 5445 states and 7408 transitions. [2025-01-09 00:14:47,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:14:47,862 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 2 states have internal predecessors, (142), 0 states have call successors, (0), 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 142 [2025-01-09 00:14:47,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:14:47,888 INFO L225 Difference]: With dead ends: 5445 [2025-01-09 00:14:47,888 INFO L226 Difference]: Without dead ends: 3605 [2025-01-09 00:14:47,891 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-01-09 00:14:47,895 INFO L435 NwaCegarLoop]: 223 mSDtfsCounter, 440 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 1566 mSolverCounterSat, 291 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 440 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 1857 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 291 IncrementalHoareTripleChecker+Valid, 1566 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-01-09 00:14:47,896 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [440 Valid, 272 Invalid, 1857 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [291 Valid, 1566 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-01-09 00:14:47,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3605 states. [2025-01-09 00:14:47,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3605 to 3583. [2025-01-09 00:14:47,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3583 states, 3582 states have (on average 1.3358458961474038) internal successors, (4785), 3582 states have internal predecessors, (4785), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:14:48,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3583 states to 3583 states and 4785 transitions. [2025-01-09 00:14:48,009 INFO L78 Accepts]: Start accepts. Automaton has 3583 states and 4785 transitions. Word has length 142 [2025-01-09 00:14:48,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:14:48,010 INFO L471 AbstractCegarLoop]: Abstraction has 3583 states and 4785 transitions. [2025-01-09 00:14:48,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 2 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:14:48,010 INFO L276 IsEmpty]: Start isEmpty. Operand 3583 states and 4785 transitions. [2025-01-09 00:14:48,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-01-09 00:14:48,014 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:14:48,014 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:14:48,014 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 00:14:48,015 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:14:48,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:14:48,019 INFO L85 PathProgramCache]: Analyzing trace with hash 4021351, now seen corresponding path program 1 times [2025-01-09 00:14:48,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:14:48,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091020542] [2025-01-09 00:14:48,019 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:14:48,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:14:48,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-01-09 00:14:48,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-01-09 00:14:48,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:14:48,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:14:48,486 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:14:48,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:14:48,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091020542] [2025-01-09 00:14:48,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091020542] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:14:48,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:14:48,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:14:48,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382513559] [2025-01-09 00:14:48,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:14:48,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:14:48,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:14:48,488 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:14:48,488 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:14:48,488 INFO L87 Difference]: Start difference. First operand 3583 states and 4785 transitions. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 2 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:14:50,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:14:50,365 INFO L93 Difference]: Finished difference Result 8893 states and 11846 transitions. [2025-01-09 00:14:50,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:14:50,366 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 2 states have internal predecessors, (155), 0 states have call successors, (0), 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 155 [2025-01-09 00:14:50,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:14:50,377 INFO L225 Difference]: With dead ends: 8893 [2025-01-09 00:14:50,377 INFO L226 Difference]: Without dead ends: 5312 [2025-01-09 00:14:50,379 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-01-09 00:14:50,380 INFO L435 NwaCegarLoop]: 475 mSDtfsCounter, 352 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 1665 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 352 SdHoareTripleChecker+Valid, 537 SdHoareTripleChecker+Invalid, 1800 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 1665 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-01-09 00:14:50,380 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [352 Valid, 537 Invalid, 1800 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 1665 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-01-09 00:14:50,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5312 states. [2025-01-09 00:14:50,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5312 to 5292. [2025-01-09 00:14:50,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5292 states, 5291 states have (on average 1.2797202797202798) internal successors, (6771), 5291 states have internal predecessors, (6771), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:14:50,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5292 states to 5292 states and 6771 transitions. [2025-01-09 00:14:50,433 INFO L78 Accepts]: Start accepts. Automaton has 5292 states and 6771 transitions. Word has length 155 [2025-01-09 00:14:50,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:14:50,433 INFO L471 AbstractCegarLoop]: Abstraction has 5292 states and 6771 transitions. [2025-01-09 00:14:50,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 2 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:14:50,433 INFO L276 IsEmpty]: Start isEmpty. Operand 5292 states and 6771 transitions. [2025-01-09 00:14:50,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-01-09 00:14:50,434 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:14:50,434 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:14:50,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 00:14:50,435 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:14:50,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:14:50,435 INFO L85 PathProgramCache]: Analyzing trace with hash 1471707352, now seen corresponding path program 1 times [2025-01-09 00:14:50,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:14:50,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934414004] [2025-01-09 00:14:50,435 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:14:50,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:14:50,453 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-01-09 00:14:50,465 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-01-09 00:14:50,465 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:14:50,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:14:50,552 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:14:50,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:14:50,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934414004] [2025-01-09 00:14:50,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934414004] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:14:50,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:14:50,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:14:50,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975465973] [2025-01-09 00:14:50,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:14:50,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:14:50,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:14:50,555 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:14:50,555 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:14:50,555 INFO L87 Difference]: Start difference. First operand 5292 states and 6771 transitions. Second operand has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 2 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:14:52,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:14:52,116 INFO L93 Difference]: Finished difference Result 12705 states and 16558 transitions. [2025-01-09 00:14:52,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:14:52,117 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 2 states have internal predecessors, (161), 0 states have call successors, (0), 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 161 [2025-01-09 00:14:52,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:14:52,129 INFO L225 Difference]: With dead ends: 12705 [2025-01-09 00:14:52,129 INFO L226 Difference]: Without dead ends: 5711 [2025-01-09 00:14:52,133 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-01-09 00:14:52,135 INFO L435 NwaCegarLoop]: 515 mSDtfsCounter, 347 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 1081 mSolverCounterSat, 548 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 347 SdHoareTripleChecker+Valid, 590 SdHoareTripleChecker+Invalid, 1629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 548 IncrementalHoareTripleChecker+Valid, 1081 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-01-09 00:14:52,136 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [347 Valid, 590 Invalid, 1629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [548 Valid, 1081 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-01-09 00:14:52,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5711 states. [2025-01-09 00:14:52,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5711 to 4427. [2025-01-09 00:14:52,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4427 states, 4426 states have (on average 1.208992318120199) internal successors, (5351), 4426 states have internal predecessors, (5351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:14:52,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4427 states to 4427 states and 5351 transitions. [2025-01-09 00:14:52,182 INFO L78 Accepts]: Start accepts. Automaton has 4427 states and 5351 transitions. Word has length 161 [2025-01-09 00:14:52,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:14:52,183 INFO L471 AbstractCegarLoop]: Abstraction has 4427 states and 5351 transitions. [2025-01-09 00:14:52,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 2 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:14:52,183 INFO L276 IsEmpty]: Start isEmpty. Operand 4427 states and 5351 transitions. [2025-01-09 00:14:52,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2025-01-09 00:14:52,186 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:14:52,186 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:14:52,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 00:14:52,186 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:14:52,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:14:52,186 INFO L85 PathProgramCache]: Analyzing trace with hash 1625576349, now seen corresponding path program 1 times [2025-01-09 00:14:52,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:14:52,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373545209] [2025-01-09 00:14:52,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:14:52,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:14:52,204 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes. [2025-01-09 00:14:52,220 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements. [2025-01-09 00:14:52,220 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:14:52,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:14:52,399 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 163 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:14:52,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:14:52,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373545209] [2025-01-09 00:14:52,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373545209] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:14:52,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:14:52,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:14:52,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910971392] [2025-01-09 00:14:52,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:14:52,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:14:52,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:14:52,404 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:14:52,404 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:14:52,404 INFO L87 Difference]: Start difference. First operand 4427 states and 5351 transitions. Second operand has 3 states, 3 states have (on average 67.33333333333333) internal successors, (202), 3 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:14:53,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:14:53,801 INFO L93 Difference]: Finished difference Result 11399 states and 13997 transitions. [2025-01-09 00:14:53,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:14:53,801 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 67.33333333333333) internal successors, (202), 3 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 202 [2025-01-09 00:14:53,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:14:53,815 INFO L225 Difference]: With dead ends: 11399 [2025-01-09 00:14:53,815 INFO L226 Difference]: Without dead ends: 6974 [2025-01-09 00:14:53,819 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-01-09 00:14:53,819 INFO L435 NwaCegarLoop]: 724 mSDtfsCounter, 496 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 1136 mSolverCounterSat, 306 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 496 SdHoareTripleChecker+Valid, 782 SdHoareTripleChecker+Invalid, 1442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 306 IncrementalHoareTripleChecker+Valid, 1136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-01-09 00:14:53,821 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [496 Valid, 782 Invalid, 1442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [306 Valid, 1136 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-01-09 00:14:53,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6974 states. [2025-01-09 00:14:53,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6974 to 6974. [2025-01-09 00:14:53,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6974 states, 6973 states have (on average 1.1834217696830633) internal successors, (8252), 6973 states have internal predecessors, (8252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:14:53,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6974 states to 6974 states and 8252 transitions. [2025-01-09 00:14:53,896 INFO L78 Accepts]: Start accepts. Automaton has 6974 states and 8252 transitions. Word has length 202 [2025-01-09 00:14:53,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:14:53,897 INFO L471 AbstractCegarLoop]: Abstraction has 6974 states and 8252 transitions. [2025-01-09 00:14:53,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 67.33333333333333) internal successors, (202), 3 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:14:53,897 INFO L276 IsEmpty]: Start isEmpty. Operand 6974 states and 8252 transitions. [2025-01-09 00:14:53,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2025-01-09 00:14:53,901 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:14:53,901 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:14:53,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 00:14:53,902 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:14:53,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:14:53,902 INFO L85 PathProgramCache]: Analyzing trace with hash 1208838328, now seen corresponding path program 1 times [2025-01-09 00:14:53,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:14:53,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617685808] [2025-01-09 00:14:53,902 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:14:53,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:14:53,917 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-01-09 00:14:53,928 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-01-09 00:14:53,928 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:14:53,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:14:54,073 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-01-09 00:14:54,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:14:54,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617685808] [2025-01-09 00:14:54,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617685808] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:14:54,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:14:54,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:14:54,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106172321] [2025-01-09 00:14:54,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:14:54,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:14:54,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:14:54,074 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:14:54,074 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:14:54,074 INFO L87 Difference]: Start difference. First operand 6974 states and 8252 transitions. Second operand has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:14:55,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:14:55,489 INFO L93 Difference]: Finished difference Result 16914 states and 20159 transitions. [2025-01-09 00:14:55,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:14:55,490 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 0 states have call successors, (0), 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 204 [2025-01-09 00:14:55,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:14:55,513 INFO L225 Difference]: With dead ends: 16914 [2025-01-09 00:14:55,513 INFO L226 Difference]: Without dead ends: 9941 [2025-01-09 00:14:55,516 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-01-09 00:14:55,516 INFO L435 NwaCegarLoop]: 382 mSDtfsCounter, 401 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 1215 mSolverCounterSat, 274 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 401 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 1489 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 274 IncrementalHoareTripleChecker+Valid, 1215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-01-09 00:14:55,517 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [401 Valid, 444 Invalid, 1489 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [274 Valid, 1215 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-01-09 00:14:55,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9941 states. [2025-01-09 00:14:55,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9941 to 7373. [2025-01-09 00:14:55,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7373 states, 7372 states have (on average 1.1795984807379274) internal successors, (8696), 7372 states have internal predecessors, (8696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:14:55,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7373 states to 7373 states and 8696 transitions. [2025-01-09 00:14:55,582 INFO L78 Accepts]: Start accepts. Automaton has 7373 states and 8696 transitions. Word has length 204 [2025-01-09 00:14:55,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:14:55,582 INFO L471 AbstractCegarLoop]: Abstraction has 7373 states and 8696 transitions. [2025-01-09 00:14:55,583 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:14:55,583 INFO L276 IsEmpty]: Start isEmpty. Operand 7373 states and 8696 transitions. [2025-01-09 00:14:55,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2025-01-09 00:14:55,586 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:14:55,586 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:14:55,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 00:14:55,587 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:14:55,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:14:55,587 INFO L85 PathProgramCache]: Analyzing trace with hash -1303714, now seen corresponding path program 1 times [2025-01-09 00:14:55,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:14:55,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263642370] [2025-01-09 00:14:55,588 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:14:55,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:14:55,608 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 270 statements into 1 equivalence classes. [2025-01-09 00:14:55,625 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 270 of 270 statements. [2025-01-09 00:14:55,625 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:14:55,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:14:55,744 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-01-09 00:14:55,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:14:55,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263642370] [2025-01-09 00:14:55,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263642370] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:14:55,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:14:55,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:14:55,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054504282] [2025-01-09 00:14:55,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:14:55,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:14:55,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:14:55,746 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:14:55,746 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:14:55,746 INFO L87 Difference]: Start difference. First operand 7373 states and 8696 transitions. Second operand has 3 states, 3 states have (on average 63.0) internal successors, (189), 3 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:14:57,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:14:57,218 INFO L93 Difference]: Finished difference Result 16027 states and 18850 transitions. [2025-01-09 00:14:57,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:14:57,219 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 63.0) internal successors, (189), 3 states have internal predecessors, (189), 0 states have call successors, (0), 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 270 [2025-01-09 00:14:57,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:14:57,231 INFO L225 Difference]: With dead ends: 16027 [2025-01-09 00:14:57,231 INFO L226 Difference]: Without dead ends: 8656 [2025-01-09 00:14:57,237 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-01-09 00:14:57,237 INFO L435 NwaCegarLoop]: 833 mSDtfsCounter, 386 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 1342 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 386 SdHoareTripleChecker+Valid, 894 SdHoareTripleChecker+Invalid, 1401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 1342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-01-09 00:14:57,237 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [386 Valid, 894 Invalid, 1401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 1342 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-01-09 00:14:57,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8656 states. [2025-01-09 00:14:57,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8656 to 8225. [2025-01-09 00:14:57,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8225 states, 8224 states have (on average 1.1723005836575875) internal successors, (9641), 8224 states have internal predecessors, (9641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:14:57,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8225 states to 8225 states and 9641 transitions. [2025-01-09 00:14:57,300 INFO L78 Accepts]: Start accepts. Automaton has 8225 states and 9641 transitions. Word has length 270 [2025-01-09 00:14:57,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:14:57,301 INFO L471 AbstractCegarLoop]: Abstraction has 8225 states and 9641 transitions. [2025-01-09 00:14:57,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.0) internal successors, (189), 3 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:14:57,302 INFO L276 IsEmpty]: Start isEmpty. Operand 8225 states and 9641 transitions. [2025-01-09 00:14:57,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2025-01-09 00:14:57,304 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:14:57,304 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:14:57,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 00:14:57,305 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:14:57,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:14:57,305 INFO L85 PathProgramCache]: Analyzing trace with hash -1765839781, now seen corresponding path program 1 times [2025-01-09 00:14:57,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:14:57,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426897457] [2025-01-09 00:14:57,305 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:14:57,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:14:57,368 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 282 statements into 1 equivalence classes. [2025-01-09 00:14:57,398 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 282 of 282 statements. [2025-01-09 00:14:57,401 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:14:57,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:14:57,651 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 228 proven. 0 refuted. 0 times theorem prover too weak. 129 trivial. 0 not checked. [2025-01-09 00:14:57,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:14:57,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426897457] [2025-01-09 00:14:57,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426897457] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:14:57,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:14:57,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:14:57,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210409071] [2025-01-09 00:14:57,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:14:57,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:14:57,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:14:57,652 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:14:57,652 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:14:57,652 INFO L87 Difference]: Start difference. First operand 8225 states and 9641 transitions. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:14:59,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:14:59,043 INFO L93 Difference]: Finished difference Result 19849 states and 23600 transitions. [2025-01-09 00:14:59,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:14:59,043 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 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 282 [2025-01-09 00:14:59,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:14:59,056 INFO L225 Difference]: With dead ends: 19849 [2025-01-09 00:14:59,056 INFO L226 Difference]: Without dead ends: 11201 [2025-01-09 00:14:59,061 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-01-09 00:14:59,062 INFO L435 NwaCegarLoop]: 777 mSDtfsCounter, 383 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 1199 mSolverCounterSat, 258 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 383 SdHoareTripleChecker+Valid, 846 SdHoareTripleChecker+Invalid, 1457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 258 IncrementalHoareTripleChecker+Valid, 1199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-01-09 00:14:59,062 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [383 Valid, 846 Invalid, 1457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [258 Valid, 1199 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-01-09 00:14:59,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11201 states. [2025-01-09 00:14:59,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11201 to 11201. [2025-01-09 00:14:59,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11201 states, 11200 states have (on average 1.1403571428571428) internal successors, (12772), 11200 states have internal predecessors, (12772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:14:59,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11201 states to 11201 states and 12772 transitions. [2025-01-09 00:14:59,138 INFO L78 Accepts]: Start accepts. Automaton has 11201 states and 12772 transitions. Word has length 282 [2025-01-09 00:14:59,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:14:59,139 INFO L471 AbstractCegarLoop]: Abstraction has 11201 states and 12772 transitions. [2025-01-09 00:14:59,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:14:59,139 INFO L276 IsEmpty]: Start isEmpty. Operand 11201 states and 12772 transitions. [2025-01-09 00:14:59,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2025-01-09 00:14:59,143 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:14:59,143 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-01-09 00:14:59,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 00:14:59,143 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:14:59,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:14:59,144 INFO L85 PathProgramCache]: Analyzing trace with hash -2058632642, now seen corresponding path program 1 times [2025-01-09 00:14:59,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:14:59,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304474716] [2025-01-09 00:14:59,144 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:14:59,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:14:59,162 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 322 statements into 1 equivalence classes. [2025-01-09 00:14:59,177 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 322 of 322 statements. [2025-01-09 00:14:59,177 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:14:59,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:14:59,293 INFO L134 CoverageAnalysis]: Checked inductivity of 391 backedges. 143 proven. 0 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2025-01-09 00:14:59,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:14:59,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304474716] [2025-01-09 00:14:59,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304474716] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:14:59,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:14:59,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:14:59,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761352828] [2025-01-09 00:14:59,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:14:59,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:14:59,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:14:59,295 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:14:59,295 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:14:59,295 INFO L87 Difference]: Start difference. First operand 11201 states and 12772 transitions. Second operand has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:15:00,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:15:00,817 INFO L93 Difference]: Finished difference Result 27935 states and 32098 transitions. [2025-01-09 00:15:00,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:15:00,817 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 322 [2025-01-09 00:15:00,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:15:00,843 INFO L225 Difference]: With dead ends: 27935 [2025-01-09 00:15:00,843 INFO L226 Difference]: Without dead ends: 15859 [2025-01-09 00:15:00,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-01-09 00:15:00,853 INFO L435 NwaCegarLoop]: 611 mSDtfsCounter, 495 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 1183 mSolverCounterSat, 348 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 495 SdHoareTripleChecker+Valid, 641 SdHoareTripleChecker+Invalid, 1531 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 348 IncrementalHoareTripleChecker+Valid, 1183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-01-09 00:15:00,853 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [495 Valid, 641 Invalid, 1531 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [348 Valid, 1183 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-01-09 00:15:00,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15859 states. [2025-01-09 00:15:01,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15859 to 15003. [2025-01-09 00:15:01,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15003 states, 15002 states have (on average 1.1314491401146514) internal successors, (16974), 15002 states have internal predecessors, (16974), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:15:01,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15003 states to 15003 states and 16974 transitions. [2025-01-09 00:15:01,049 INFO L78 Accepts]: Start accepts. Automaton has 15003 states and 16974 transitions. Word has length 322 [2025-01-09 00:15:01,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:15:01,049 INFO L471 AbstractCegarLoop]: Abstraction has 15003 states and 16974 transitions. [2025-01-09 00:15:01,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:15:01,049 INFO L276 IsEmpty]: Start isEmpty. Operand 15003 states and 16974 transitions. [2025-01-09 00:15:01,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 390 [2025-01-09 00:15:01,054 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:15:01,054 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 00:15:01,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 00:15:01,054 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:15:01,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:15:01,055 INFO L85 PathProgramCache]: Analyzing trace with hash -1075400533, now seen corresponding path program 1 times [2025-01-09 00:15:01,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:15:01,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938799554] [2025-01-09 00:15:01,055 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:15:01,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:15:01,089 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 389 statements into 1 equivalence classes. [2025-01-09 00:15:01,120 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 389 of 389 statements. [2025-01-09 00:15:01,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:15:01,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:15:01,298 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:15:01,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:15:01,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938799554] [2025-01-09 00:15:01,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938799554] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:15:01,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:15:01,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:15:01,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30956165] [2025-01-09 00:15:01,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:15:01,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:15:01,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:15:01,300 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:15:01,300 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:15:01,300 INFO L87 Difference]: Start difference. First operand 15003 states and 16974 transitions. Second operand has 4 states, 4 states have (on average 97.25) internal successors, (389), 3 states have internal predecessors, (389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:15:03,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:15:03,431 INFO L93 Difference]: Finished difference Result 37693 states and 42495 transitions. [2025-01-09 00:15:03,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:15:03,431 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 97.25) internal successors, (389), 3 states have internal predecessors, (389), 0 states have call successors, (0), 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 389 [2025-01-09 00:15:03,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:15:03,452 INFO L225 Difference]: With dead ends: 37693 [2025-01-09 00:15:03,452 INFO L226 Difference]: Without dead ends: 22267 [2025-01-09 00:15:03,463 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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-01-09 00:15:03,464 INFO L435 NwaCegarLoop]: 250 mSDtfsCounter, 520 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 2391 mSolverCounterSat, 171 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 520 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 2562 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 171 IncrementalHoareTripleChecker+Valid, 2391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-01-09 00:15:03,464 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [520 Valid, 320 Invalid, 2562 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [171 Valid, 2391 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-01-09 00:15:03,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22267 states. [2025-01-09 00:15:03,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22267 to 21823. [2025-01-09 00:15:03,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21823 states, 21822 states have (on average 1.119420768032261) internal successors, (24428), 21822 states have internal predecessors, (24428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:15:03,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21823 states to 21823 states and 24428 transitions. [2025-01-09 00:15:03,708 INFO L78 Accepts]: Start accepts. Automaton has 21823 states and 24428 transitions. Word has length 389 [2025-01-09 00:15:03,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:15:03,712 INFO L471 AbstractCegarLoop]: Abstraction has 21823 states and 24428 transitions. [2025-01-09 00:15:03,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 97.25) internal successors, (389), 3 states have internal predecessors, (389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:15:03,712 INFO L276 IsEmpty]: Start isEmpty. Operand 21823 states and 24428 transitions. [2025-01-09 00:15:03,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 437 [2025-01-09 00:15:03,725 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:15:03,726 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:15:03,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 00:15:03,726 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:15:03,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:15:03,727 INFO L85 PathProgramCache]: Analyzing trace with hash -1924122396, now seen corresponding path program 1 times [2025-01-09 00:15:03,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:15:03,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114751022] [2025-01-09 00:15:03,727 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:15:03,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:15:03,789 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 436 statements into 1 equivalence classes. [2025-01-09 00:15:03,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 436 of 436 statements. [2025-01-09 00:15:03,837 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:15:03,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:15:04,340 INFO L134 CoverageAnalysis]: Checked inductivity of 455 backedges. 373 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-01-09 00:15:04,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:15:04,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114751022] [2025-01-09 00:15:04,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114751022] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:15:04,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:15:04,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:15:04,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892135250] [2025-01-09 00:15:04,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:15:04,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:15:04,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:15:04,343 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:15:04,343 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:15:04,343 INFO L87 Difference]: Start difference. First operand 21823 states and 24428 transitions. Second operand has 3 states, 3 states have (on average 118.33333333333333) internal successors, (355), 3 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:15:05,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:15:05,717 INFO L93 Difference]: Finished difference Result 49189 states and 55550 transitions. [2025-01-09 00:15:05,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:15:05,717 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 118.33333333333333) internal successors, (355), 3 states have internal predecessors, (355), 0 states have call successors, (0), 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 436 [2025-01-09 00:15:05,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:15:05,745 INFO L225 Difference]: With dead ends: 49189 [2025-01-09 00:15:05,745 INFO L226 Difference]: Without dead ends: 26943 [2025-01-09 00:15:05,760 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-01-09 00:15:05,761 INFO L435 NwaCegarLoop]: 700 mSDtfsCounter, 313 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 1224 mSolverCounterSat, 159 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 760 SdHoareTripleChecker+Invalid, 1383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 159 IncrementalHoareTripleChecker+Valid, 1224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 00:15:05,761 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [313 Valid, 760 Invalid, 1383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [159 Valid, 1224 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-09 00:15:05,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26943 states. [2025-01-09 00:15:06,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26943 to 26936. [2025-01-09 00:15:06,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26936 states, 26935 states have (on average 1.1173937256357898) internal successors, (30097), 26935 states have internal predecessors, (30097), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:15:06,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26936 states to 26936 states and 30097 transitions. [2025-01-09 00:15:06,065 INFO L78 Accepts]: Start accepts. Automaton has 26936 states and 30097 transitions. Word has length 436 [2025-01-09 00:15:06,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:15:06,066 INFO L471 AbstractCegarLoop]: Abstraction has 26936 states and 30097 transitions. [2025-01-09 00:15:06,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 118.33333333333333) internal successors, (355), 3 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:15:06,066 INFO L276 IsEmpty]: Start isEmpty. Operand 26936 states and 30097 transitions. [2025-01-09 00:15:06,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 450 [2025-01-09 00:15:06,076 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:15:06,076 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:15:06,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 00:15:06,076 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:15:06,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:15:06,077 INFO L85 PathProgramCache]: Analyzing trace with hash 1501192945, now seen corresponding path program 1 times [2025-01-09 00:15:06,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:15:06,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349977288] [2025-01-09 00:15:06,077 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:15:06,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:15:06,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 449 statements into 1 equivalence classes. [2025-01-09 00:15:06,145 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 449 of 449 statements. [2025-01-09 00:15:06,145 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:15:06,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:15:06,282 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 380 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-01-09 00:15:06,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:15:06,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349977288] [2025-01-09 00:15:06,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349977288] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:15:06,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:15:06,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:15:06,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33561960] [2025-01-09 00:15:06,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:15:06,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:15:06,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:15:06,284 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:15:06,284 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:15:06,285 INFO L87 Difference]: Start difference. First operand 26936 states and 30097 transitions. Second operand has 3 states, 3 states have (on average 122.66666666666667) internal successors, (368), 3 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:15:07,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:15:07,835 INFO L93 Difference]: Finished difference Result 64094 states and 71471 transitions. [2025-01-09 00:15:07,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:15:07,836 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 122.66666666666667) internal successors, (368), 3 states have internal predecessors, (368), 0 states have call successors, (0), 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 449 [2025-01-09 00:15:07,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:15:07,875 INFO L225 Difference]: With dead ends: 64094 [2025-01-09 00:15:07,876 INFO L226 Difference]: Without dead ends: 37160 [2025-01-09 00:15:07,894 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-01-09 00:15:07,895 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 352 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 1169 mSolverCounterSat, 286 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 352 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 1455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 286 IncrementalHoareTripleChecker+Valid, 1169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-01-09 00:15:07,895 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [352 Valid, 154 Invalid, 1455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [286 Valid, 1169 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-01-09 00:15:07,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37160 states. [2025-01-09 00:15:08,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37160 to 29046. [2025-01-09 00:15:08,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29046 states, 29045 states have (on average 1.115751420210019) internal successors, (32407), 29045 states have internal predecessors, (32407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:15:08,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29046 states to 29046 states and 32407 transitions. [2025-01-09 00:15:08,148 INFO L78 Accepts]: Start accepts. Automaton has 29046 states and 32407 transitions. Word has length 449 [2025-01-09 00:15:08,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:15:08,148 INFO L471 AbstractCegarLoop]: Abstraction has 29046 states and 32407 transitions. [2025-01-09 00:15:08,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 122.66666666666667) internal successors, (368), 3 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:15:08,148 INFO L276 IsEmpty]: Start isEmpty. Operand 29046 states and 32407 transitions. [2025-01-09 00:15:08,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 514 [2025-01-09 00:15:08,156 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:15:08,156 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:15:08,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 00:15:08,157 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:15:08,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:15:08,157 INFO L85 PathProgramCache]: Analyzing trace with hash -1445513358, now seen corresponding path program 1 times [2025-01-09 00:15:08,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:15:08,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457768050] [2025-01-09 00:15:08,158 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:15:08,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:15:08,186 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 513 statements into 1 equivalence classes. [2025-01-09 00:15:08,215 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 513 of 513 statements. [2025-01-09 00:15:08,215 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:15:08,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:15:08,436 INFO L134 CoverageAnalysis]: Checked inductivity of 767 backedges. 498 proven. 0 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked. [2025-01-09 00:15:08,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:15:08,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457768050] [2025-01-09 00:15:08,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457768050] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:15:08,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:15:08,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:15:08,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362991395] [2025-01-09 00:15:08,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:15:08,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:15:08,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:15:08,437 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:15:08,438 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:15:08,438 INFO L87 Difference]: Start difference. First operand 29046 states and 32407 transitions. Second operand has 3 states, 3 states have (on average 109.33333333333333) internal successors, (328), 3 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:15:09,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:15:09,863 INFO L93 Difference]: Finished difference Result 67034 states and 74966 transitions. [2025-01-09 00:15:09,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:15:09,863 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 109.33333333333333) internal successors, (328), 3 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 513 [2025-01-09 00:15:09,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:15:09,892 INFO L225 Difference]: With dead ends: 67034 [2025-01-09 00:15:09,893 INFO L226 Difference]: Without dead ends: 37990 [2025-01-09 00:15:09,905 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-01-09 00:15:09,906 INFO L435 NwaCegarLoop]: 293 mSDtfsCounter, 326 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 1192 mSolverCounterSat, 178 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 326 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 1370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 178 IncrementalHoareTripleChecker+Valid, 1192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-01-09 00:15:09,906 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [326 Valid, 345 Invalid, 1370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [178 Valid, 1192 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-01-09 00:15:09,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37990 states. [2025-01-09 00:15:10,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37990 to 33301. [2025-01-09 00:15:10,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33301 states, 33300 states have (on average 1.10012012012012) internal successors, (36634), 33300 states have internal predecessors, (36634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:15:10,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33301 states to 33301 states and 36634 transitions. [2025-01-09 00:15:10,141 INFO L78 Accepts]: Start accepts. Automaton has 33301 states and 36634 transitions. Word has length 513 [2025-01-09 00:15:10,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:15:10,141 INFO L471 AbstractCegarLoop]: Abstraction has 33301 states and 36634 transitions. [2025-01-09 00:15:10,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.33333333333333) internal successors, (328), 3 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:15:10,141 INFO L276 IsEmpty]: Start isEmpty. Operand 33301 states and 36634 transitions. [2025-01-09 00:15:10,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 568 [2025-01-09 00:15:10,151 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:15:10,151 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:15:10,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 00:15:10,152 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:15:10,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:15:10,152 INFO L85 PathProgramCache]: Analyzing trace with hash -1281235015, now seen corresponding path program 1 times [2025-01-09 00:15:10,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:15:10,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308055518] [2025-01-09 00:15:10,152 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:15:10,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:15:10,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 567 statements into 1 equivalence classes. [2025-01-09 00:15:10,203 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 567 of 567 statements. [2025-01-09 00:15:10,204 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:15:10,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:15:10,385 INFO L134 CoverageAnalysis]: Checked inductivity of 731 backedges. 610 proven. 0 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2025-01-09 00:15:10,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:15:10,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308055518] [2025-01-09 00:15:10,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308055518] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:15:10,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:15:10,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:15:10,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291495081] [2025-01-09 00:15:10,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:15:10,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:15:10,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:15:10,387 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:15:10,387 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:15:10,387 INFO L87 Difference]: Start difference. First operand 33301 states and 36634 transitions. Second operand has 3 states, 3 states have (on average 149.33333333333334) internal successors, (448), 3 states have internal predecessors, (448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:15:11,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:15:11,640 INFO L93 Difference]: Finished difference Result 75546 states and 83066 transitions. [2025-01-09 00:15:11,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:15:11,641 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 149.33333333333334) internal successors, (448), 3 states have internal predecessors, (448), 0 states have call successors, (0), 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 567 [2025-01-09 00:15:11,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:15:11,677 INFO L225 Difference]: With dead ends: 75546 [2025-01-09 00:15:11,678 INFO L226 Difference]: Without dead ends: 42247 [2025-01-09 00:15:11,695 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-01-09 00:15:11,696 INFO L435 NwaCegarLoop]: 732 mSDtfsCounter, 246 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 1263 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 783 SdHoareTripleChecker+Invalid, 1371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 1263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-09 00:15:11,696 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 783 Invalid, 1371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 1263 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-09 00:15:11,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42247 states. [2025-01-09 00:15:11,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42247 to 40536. [2025-01-09 00:15:11,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40536 states, 40535 states have (on average 1.0932527445417541) internal successors, (44315), 40535 states have internal predecessors, (44315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:15:11,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40536 states to 40536 states and 44315 transitions. [2025-01-09 00:15:11,992 INFO L78 Accepts]: Start accepts. Automaton has 40536 states and 44315 transitions. Word has length 567 [2025-01-09 00:15:11,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:15:11,992 INFO L471 AbstractCegarLoop]: Abstraction has 40536 states and 44315 transitions. [2025-01-09 00:15:11,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 149.33333333333334) internal successors, (448), 3 states have internal predecessors, (448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:15:11,993 INFO L276 IsEmpty]: Start isEmpty. Operand 40536 states and 44315 transitions. [2025-01-09 00:15:12,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 599 [2025-01-09 00:15:12,006 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:15:12,007 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:15:12,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 00:15:12,007 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:15:12,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:15:12,007 INFO L85 PathProgramCache]: Analyzing trace with hash 1451199502, now seen corresponding path program 1 times [2025-01-09 00:15:12,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:15:12,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052663626] [2025-01-09 00:15:12,008 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:15:12,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:15:12,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 598 statements into 1 equivalence classes. [2025-01-09 00:15:12,064 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 598 of 598 statements. [2025-01-09 00:15:12,064 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:15:12,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:15:12,445 INFO L134 CoverageAnalysis]: Checked inductivity of 802 backedges. 754 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-01-09 00:15:12,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:15:12,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052663626] [2025-01-09 00:15:12,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052663626] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:15:12,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:15:12,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 00:15:12,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59170392] [2025-01-09 00:15:12,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:15:12,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:15:12,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:15:12,448 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:15:12,448 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:15:12,448 INFO L87 Difference]: Start difference. First operand 40536 states and 44315 transitions. Second operand has 4 states, 4 states have (on average 137.75) internal successors, (551), 4 states have internal predecessors, (551), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:15:14,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:15:14,902 INFO L93 Difference]: Finished difference Result 94711 states and 103345 transitions. [2025-01-09 00:15:14,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:15:14,902 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 137.75) internal successors, (551), 4 states have internal predecessors, (551), 0 states have call successors, (0), 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 598 [2025-01-09 00:15:14,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:15:14,953 INFO L225 Difference]: With dead ends: 94711 [2025-01-09 00:15:14,953 INFO L226 Difference]: Without dead ends: 54177 [2025-01-09 00:15:14,981 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-01-09 00:15:14,981 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 690 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 2274 mSolverCounterSat, 373 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 690 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 2647 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 373 IncrementalHoareTripleChecker+Valid, 2274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-01-09 00:15:14,981 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [690 Valid, 179 Invalid, 2647 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [373 Valid, 2274 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-01-09 00:15:15,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54177 states. [2025-01-09 00:15:15,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54177 to 52038. [2025-01-09 00:15:15,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52038 states, 52037 states have (on average 1.0900320925495322) internal successors, (56722), 52037 states have internal predecessors, (56722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:15:15,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52038 states to 52038 states and 56722 transitions. [2025-01-09 00:15:15,401 INFO L78 Accepts]: Start accepts. Automaton has 52038 states and 56722 transitions. Word has length 598 [2025-01-09 00:15:15,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:15:15,402 INFO L471 AbstractCegarLoop]: Abstraction has 52038 states and 56722 transitions. [2025-01-09 00:15:15,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 137.75) internal successors, (551), 4 states have internal predecessors, (551), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:15:15,402 INFO L276 IsEmpty]: Start isEmpty. Operand 52038 states and 56722 transitions. [2025-01-09 00:15:15,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 610 [2025-01-09 00:15:15,416 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:15:15,416 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 00:15:15,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 00:15:15,416 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:15:15,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:15:15,417 INFO L85 PathProgramCache]: Analyzing trace with hash -1588744057, now seen corresponding path program 1 times [2025-01-09 00:15:15,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:15:15,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745088040] [2025-01-09 00:15:15,417 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:15:15,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:15:15,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 609 statements into 1 equivalence classes. [2025-01-09 00:15:15,472 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 609 of 609 statements. [2025-01-09 00:15:15,472 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:15:15,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:15:15,832 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 314 proven. 82 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-01-09 00:15:15,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:15:15,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745088040] [2025-01-09 00:15:15,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745088040] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:15:15,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1459877421] [2025-01-09 00:15:15,832 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:15:15,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:15:15,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:15:15,834 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 00:15:15,836 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 00:15:15,900 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 609 statements into 1 equivalence classes. [2025-01-09 00:15:15,984 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 609 of 609 statements. [2025-01-09 00:15:15,985 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:15:15,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:15:15,988 INFO L256 TraceCheckSpWp]: Trace formula consists of 745 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 00:15:15,997 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:15:16,510 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 362 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-01-09 00:15:16,510 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 00:15:16,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1459877421] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:15:16,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 00:15:16,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [3] total 6 [2025-01-09 00:15:16,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876102001] [2025-01-09 00:15:16,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:15:16,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:15:16,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:15:16,512 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:15:16,512 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 00:15:16,512 INFO L87 Difference]: Start difference. First operand 52038 states and 56722 transitions. Second operand has 4 states, 4 states have (on average 132.0) internal successors, (528), 4 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:15:18,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:15:18,786 INFO L93 Difference]: Finished difference Result 130077 states and 141660 transitions. [2025-01-09 00:15:18,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:15:18,786 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 132.0) internal successors, (528), 4 states have internal predecessors, (528), 0 states have call successors, (0), 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 609 [2025-01-09 00:15:18,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:15:18,859 INFO L225 Difference]: With dead ends: 130077 [2025-01-09 00:15:18,860 INFO L226 Difference]: Without dead ends: 77187 [2025-01-09 00:15:18,897 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 611 GetRequests, 607 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 00:15:18,898 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 618 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 2376 mSolverCounterSat, 529 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 618 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 2905 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 529 IncrementalHoareTripleChecker+Valid, 2376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-01-09 00:15:18,898 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [618 Valid, 137 Invalid, 2905 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [529 Valid, 2376 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-01-09 00:15:18,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77187 states. [2025-01-09 00:15:19,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77187 to 73316. [2025-01-09 00:15:19,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73316 states, 73315 states have (on average 1.0859169337788992) internal successors, (79614), 73315 states have internal predecessors, (79614), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:15:19,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73316 states to 73316 states and 79614 transitions. [2025-01-09 00:15:19,580 INFO L78 Accepts]: Start accepts. Automaton has 73316 states and 79614 transitions. Word has length 609 [2025-01-09 00:15:19,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:15:19,580 INFO L471 AbstractCegarLoop]: Abstraction has 73316 states and 79614 transitions. [2025-01-09 00:15:19,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 132.0) internal successors, (528), 4 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:15:19,581 INFO L276 IsEmpty]: Start isEmpty. Operand 73316 states and 79614 transitions. [2025-01-09 00:15:19,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 666 [2025-01-09 00:15:19,596 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:15:19,596 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:15:19,603 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 00:15:19,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-01-09 00:15:19,797 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:15:19,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:15:19,797 INFO L85 PathProgramCache]: Analyzing trace with hash -785273576, now seen corresponding path program 1 times [2025-01-09 00:15:19,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:15:19,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904440045] [2025-01-09 00:15:19,797 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:15:19,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:15:19,837 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 665 statements into 1 equivalence classes. [2025-01-09 00:15:19,855 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 665 of 665 statements. [2025-01-09 00:15:19,855 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:15:19,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:15:19,961 INFO L134 CoverageAnalysis]: Checked inductivity of 811 backedges. 518 proven. 0 refuted. 0 times theorem prover too weak. 293 trivial. 0 not checked. [2025-01-09 00:15:19,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:15:19,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904440045] [2025-01-09 00:15:19,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904440045] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:15:19,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:15:19,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:15:19,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304147711] [2025-01-09 00:15:19,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:15:19,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:15:19,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:15:19,963 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:15:19,963 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:15:19,963 INFO L87 Difference]: Start difference. First operand 73316 states and 79614 transitions. Second operand has 3 states, 3 states have (on average 152.0) internal successors, (456), 3 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:15:21,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:15:21,395 INFO L93 Difference]: Finished difference Result 150887 states and 164139 transitions. [2025-01-09 00:15:21,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:15:21,395 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 152.0) internal successors, (456), 3 states have internal predecessors, (456), 0 states have call successors, (0), 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 665 [2025-01-09 00:15:21,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:15:21,455 INFO L225 Difference]: With dead ends: 150887 [2025-01-09 00:15:21,456 INFO L226 Difference]: Without dead ends: 77573 [2025-01-09 00:15:21,476 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:15:21,477 INFO L435 NwaCegarLoop]: 644 mSDtfsCounter, 485 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 1138 mSolverCounterSat, 175 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 485 SdHoareTripleChecker+Valid, 686 SdHoareTripleChecker+Invalid, 1313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 175 IncrementalHoareTripleChecker+Valid, 1138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-09 00:15:21,477 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [485 Valid, 686 Invalid, 1313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [175 Valid, 1138 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-09 00:15:21,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77573 states. [2025-01-09 00:15:22,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77573 to 77565. [2025-01-09 00:15:22,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77565 states, 77564 states have (on average 1.0813521736888247) internal successors, (83874), 77564 states have internal predecessors, (83874), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:15:22,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77565 states to 77565 states and 83874 transitions. [2025-01-09 00:15:22,289 INFO L78 Accepts]: Start accepts. Automaton has 77565 states and 83874 transitions. Word has length 665 [2025-01-09 00:15:22,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:15:22,290 INFO L471 AbstractCegarLoop]: Abstraction has 77565 states and 83874 transitions. [2025-01-09 00:15:22,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 152.0) internal successors, (456), 3 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:15:22,290 INFO L276 IsEmpty]: Start isEmpty. Operand 77565 states and 83874 transitions. [2025-01-09 00:15:22,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 697 [2025-01-09 00:15:22,348 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:15:22,349 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:15:22,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 00:15:22,349 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:15:22,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:15:22,350 INFO L85 PathProgramCache]: Analyzing trace with hash -1095296378, now seen corresponding path program 1 times [2025-01-09 00:15:22,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:15:22,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330329221] [2025-01-09 00:15:22,350 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:15:22,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:15:22,432 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 696 statements into 1 equivalence classes. [2025-01-09 00:15:22,475 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 696 of 696 statements. [2025-01-09 00:15:22,476 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:15:22,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:15:22,828 INFO L134 CoverageAnalysis]: Checked inductivity of 1226 backedges. 893 proven. 0 refuted. 0 times theorem prover too weak. 333 trivial. 0 not checked. [2025-01-09 00:15:22,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:15:22,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330329221] [2025-01-09 00:15:22,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330329221] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:15:22,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:15:22,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:15:22,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071022094] [2025-01-09 00:15:22,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:15:22,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:15:22,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:15:22,830 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:15:22,831 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:15:22,831 INFO L87 Difference]: Start difference. First operand 77565 states and 83874 transitions. Second operand has 3 states, 3 states have (on average 138.0) internal successors, (414), 3 states have internal predecessors, (414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:15:24,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:15:24,615 INFO L93 Difference]: Finished difference Result 169177 states and 183313 transitions. [2025-01-09 00:15:24,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:15:24,615 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 138.0) internal successors, (414), 3 states have internal predecessors, (414), 0 states have call successors, (0), 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 696 [2025-01-09 00:15:24,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:15:24,701 INFO L225 Difference]: With dead ends: 169177 [2025-01-09 00:15:24,701 INFO L226 Difference]: Without dead ends: 91614 [2025-01-09 00:15:24,740 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-01-09 00:15:24,740 INFO L435 NwaCegarLoop]: 250 mSDtfsCounter, 387 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 1170 mSolverCounterSat, 188 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 387 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 1358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 188 IncrementalHoareTripleChecker+Valid, 1170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-01-09 00:15:24,741 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [387 Valid, 287 Invalid, 1358 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [188 Valid, 1170 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-01-09 00:15:24,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91614 states. [2025-01-09 00:15:25,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91614 to 89902. [2025-01-09 00:15:25,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89902 states, 89901 states have (on average 1.0802771938020712) internal successors, (97118), 89901 states have internal predecessors, (97118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:15:25,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89902 states to 89902 states and 97118 transitions. [2025-01-09 00:15:25,745 INFO L78 Accepts]: Start accepts. Automaton has 89902 states and 97118 transitions. Word has length 696 [2025-01-09 00:15:25,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:15:25,745 INFO L471 AbstractCegarLoop]: Abstraction has 89902 states and 97118 transitions. [2025-01-09 00:15:25,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 138.0) internal successors, (414), 3 states have internal predecessors, (414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:15:25,749 INFO L276 IsEmpty]: Start isEmpty. Operand 89902 states and 97118 transitions. [2025-01-09 00:15:25,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 746 [2025-01-09 00:15:25,798 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:15:25,799 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:15:25,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 00:15:25,799 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:15:25,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:15:25,799 INFO L85 PathProgramCache]: Analyzing trace with hash -1426667397, now seen corresponding path program 1 times [2025-01-09 00:15:25,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:15:25,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427761810] [2025-01-09 00:15:25,800 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:15:25,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:15:25,837 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 745 statements into 1 equivalence classes. [2025-01-09 00:15:26,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 745 of 745 statements. [2025-01-09 00:15:26,012 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:15:26,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:15:26,415 INFO L134 CoverageAnalysis]: Checked inductivity of 1290 backedges. 997 proven. 0 refuted. 0 times theorem prover too weak. 293 trivial. 0 not checked. [2025-01-09 00:15:26,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:15:26,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427761810] [2025-01-09 00:15:26,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427761810] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:15:26,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:15:26,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:15:26,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224555089] [2025-01-09 00:15:26,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:15:26,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:15:26,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:15:26,417 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:15:26,417 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:15:26,417 INFO L87 Difference]: Start difference. First operand 89902 states and 97118 transitions. Second operand has 3 states, 3 states have (on average 178.66666666666666) internal successors, (536), 3 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:15:28,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:15:28,084 INFO L93 Difference]: Finished difference Result 184052 states and 198865 transitions. [2025-01-09 00:15:28,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:15:28,084 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 178.66666666666666) internal successors, (536), 3 states have internal predecessors, (536), 0 states have call successors, (0), 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 745 [2025-01-09 00:15:28,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:15:28,183 INFO L225 Difference]: With dead ends: 184052 [2025-01-09 00:15:28,184 INFO L226 Difference]: Without dead ends: 92877 [2025-01-09 00:15:28,237 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-01-09 00:15:28,237 INFO L435 NwaCegarLoop]: 643 mSDtfsCounter, 262 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 1181 mSolverCounterSat, 162 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 685 SdHoareTripleChecker+Invalid, 1343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 162 IncrementalHoareTripleChecker+Valid, 1181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-01-09 00:15:28,237 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [262 Valid, 685 Invalid, 1343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [162 Valid, 1181 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-01-09 00:15:28,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92877 states. [2025-01-09 00:15:29,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92877 to 87327. [2025-01-09 00:15:29,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87327 states, 87326 states have (on average 1.0760483704738566) internal successors, (93967), 87326 states have internal predecessors, (93967), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:15:29,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87327 states to 87327 states and 93967 transitions. [2025-01-09 00:15:29,376 INFO L78 Accepts]: Start accepts. Automaton has 87327 states and 93967 transitions. Word has length 745 [2025-01-09 00:15:29,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:15:29,376 INFO L471 AbstractCegarLoop]: Abstraction has 87327 states and 93967 transitions. [2025-01-09 00:15:29,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 178.66666666666666) internal successors, (536), 3 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:15:29,376 INFO L276 IsEmpty]: Start isEmpty. Operand 87327 states and 93967 transitions. [2025-01-09 00:15:29,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 755 [2025-01-09 00:15:29,401 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:15:29,402 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 00:15:29,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 00:15:29,402 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:15:29,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:15:29,402 INFO L85 PathProgramCache]: Analyzing trace with hash -1012370015, now seen corresponding path program 1 times [2025-01-09 00:15:29,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:15:29,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877711361] [2025-01-09 00:15:29,403 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:15:29,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:15:29,466 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 754 statements into 1 equivalence classes. [2025-01-09 00:15:29,490 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 754 of 754 statements. [2025-01-09 00:15:29,490 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:15:29,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:15:29,755 INFO L134 CoverageAnalysis]: Checked inductivity of 858 backedges. 191 proven. 0 refuted. 0 times theorem prover too weak. 667 trivial. 0 not checked. [2025-01-09 00:15:29,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:15:29,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877711361] [2025-01-09 00:15:29,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877711361] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:15:29,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:15:29,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:15:29,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052123024] [2025-01-09 00:15:29,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:15:29,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:15:29,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:15:29,757 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:15:29,757 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:15:29,757 INFO L87 Difference]: Start difference. First operand 87327 states and 93967 transitions. Second operand has 3 states, 3 states have (on average 119.66666666666667) internal successors, (359), 3 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:15:31,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:15:31,463 INFO L93 Difference]: Finished difference Result 182750 states and 196629 transitions. [2025-01-09 00:15:31,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:15:31,464 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 119.66666666666667) internal successors, (359), 3 states have internal predecessors, (359), 0 states have call successors, (0), 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 754 [2025-01-09 00:15:31,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:15:31,558 INFO L225 Difference]: With dead ends: 182750 [2025-01-09 00:15:31,558 INFO L226 Difference]: Without dead ends: 95425 [2025-01-09 00:15:31,594 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-01-09 00:15:31,595 INFO L435 NwaCegarLoop]: 673 mSDtfsCounter, 399 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 1206 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 399 SdHoareTripleChecker+Valid, 717 SdHoareTripleChecker+Invalid, 1309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 1206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-01-09 00:15:31,595 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [399 Valid, 717 Invalid, 1309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 1206 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-01-09 00:15:31,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95425 states. [2025-01-09 00:15:32,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95425 to 87324. [2025-01-09 00:15:32,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87324 states, 87323 states have (on average 1.07503177856922) internal successors, (93875), 87323 states have internal predecessors, (93875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:15:32,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87324 states to 87324 states and 93875 transitions. [2025-01-09 00:15:32,587 INFO L78 Accepts]: Start accepts. Automaton has 87324 states and 93875 transitions. Word has length 754 [2025-01-09 00:15:32,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:15:32,588 INFO L471 AbstractCegarLoop]: Abstraction has 87324 states and 93875 transitions. [2025-01-09 00:15:32,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 119.66666666666667) internal successors, (359), 3 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:15:32,588 INFO L276 IsEmpty]: Start isEmpty. Operand 87324 states and 93875 transitions. [2025-01-09 00:15:32,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 926 [2025-01-09 00:15:32,626 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:15:32,627 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:15:32,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 00:15:32,627 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:15:32,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:15:32,628 INFO L85 PathProgramCache]: Analyzing trace with hash -70710093, now seen corresponding path program 1 times [2025-01-09 00:15:32,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:15:32,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770150441] [2025-01-09 00:15:32,628 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:15:32,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:15:32,676 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 925 statements into 1 equivalence classes. [2025-01-09 00:15:33,000 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 925 of 925 statements. [2025-01-09 00:15:33,000 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:15:33,000 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:15:33,282 INFO L134 CoverageAnalysis]: Checked inductivity of 1039 backedges. 192 proven. 0 refuted. 0 times theorem prover too weak. 847 trivial. 0 not checked. [2025-01-09 00:15:33,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:15:33,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770150441] [2025-01-09 00:15:33,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770150441] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:15:33,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:15:33,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:15:33,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657361780] [2025-01-09 00:15:33,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:15:33,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:15:33,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:15:33,284 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:15:33,284 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:15:33,284 INFO L87 Difference]: Start difference. First operand 87324 states and 93875 transitions. Second operand has 3 states, 3 states have (on average 129.33333333333334) internal successors, (388), 2 states have internal predecessors, (388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:15:34,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:15:34,231 INFO L93 Difference]: Finished difference Result 164839 states and 176911 transitions. [2025-01-09 00:15:34,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:15:34,234 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 129.33333333333334) internal successors, (388), 2 states have internal predecessors, (388), 0 states have call successors, (0), 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 925 [2025-01-09 00:15:34,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:15:34,304 INFO L225 Difference]: With dead ends: 164839 [2025-01-09 00:15:34,304 INFO L226 Difference]: Without dead ends: 77516 [2025-01-09 00:15:34,342 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-01-09 00:15:34,344 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 347 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 614 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 347 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 620 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 614 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 00:15:34,344 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [347 Valid, 69 Invalid, 620 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 614 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 00:15:34,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77516 states. [2025-01-09 00:15:35,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77516 to 77510. [2025-01-09 00:15:35,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77510 states, 77509 states have (on average 1.0709595014772477) internal successors, (83009), 77509 states have internal predecessors, (83009), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:15:35,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77510 states to 77510 states and 83009 transitions. [2025-01-09 00:15:35,261 INFO L78 Accepts]: Start accepts. Automaton has 77510 states and 83009 transitions. Word has length 925 [2025-01-09 00:15:35,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:15:35,262 INFO L471 AbstractCegarLoop]: Abstraction has 77510 states and 83009 transitions. [2025-01-09 00:15:35,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 129.33333333333334) internal successors, (388), 2 states have internal predecessors, (388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:15:35,262 INFO L276 IsEmpty]: Start isEmpty. Operand 77510 states and 83009 transitions. [2025-01-09 00:15:35,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1021 [2025-01-09 00:15:35,327 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:15:35,327 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 00:15:35,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 00:15:35,327 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:15:35,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:15:35,328 INFO L85 PathProgramCache]: Analyzing trace with hash 1990725428, now seen corresponding path program 1 times [2025-01-09 00:15:35,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:15:35,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385317367] [2025-01-09 00:15:35,328 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:15:35,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:15:35,416 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1020 statements into 1 equivalence classes. [2025-01-09 00:15:35,579 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1020 of 1020 statements. [2025-01-09 00:15:35,579 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:15:35,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:15:36,087 INFO L134 CoverageAnalysis]: Checked inductivity of 1463 backedges. 850 proven. 0 refuted. 0 times theorem prover too weak. 613 trivial. 0 not checked. [2025-01-09 00:15:36,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:15:36,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385317367] [2025-01-09 00:15:36,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385317367] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:15:36,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:15:36,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 00:15:36,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714752781] [2025-01-09 00:15:36,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:15:36,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:15:36,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:15:36,089 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:15:36,089 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:15:36,089 INFO L87 Difference]: Start difference. First operand 77510 states and 83009 transitions. Second operand has 4 states, 4 states have (on average 163.75) internal successors, (655), 4 states have internal predecessors, (655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:15:38,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:15:38,470 INFO L93 Difference]: Finished difference Result 178020 states and 190237 transitions. [2025-01-09 00:15:38,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:15:38,471 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 163.75) internal successors, (655), 4 states have internal predecessors, (655), 0 states have call successors, (0), 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 1020 [2025-01-09 00:15:38,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:15:38,573 INFO L225 Difference]: With dead ends: 178020 [2025-01-09 00:15:38,573 INFO L226 Difference]: Without dead ends: 100512 [2025-01-09 00:15:38,624 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-01-09 00:15:38,625 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 663 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 2248 mSolverCounterSat, 389 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 663 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 2637 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 389 IncrementalHoareTripleChecker+Valid, 2248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-01-09 00:15:38,625 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [663 Valid, 93 Invalid, 2637 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [389 Valid, 2248 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-01-09 00:15:38,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100512 states. [2025-01-09 00:15:39,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100512 to 87716. [2025-01-09 00:15:39,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87716 states, 87715 states have (on average 1.0689619791369778) internal successors, (93764), 87715 states have internal predecessors, (93764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:15:39,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87716 states to 87716 states and 93764 transitions. [2025-01-09 00:15:39,838 INFO L78 Accepts]: Start accepts. Automaton has 87716 states and 93764 transitions. Word has length 1020 [2025-01-09 00:15:39,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:15:39,838 INFO L471 AbstractCegarLoop]: Abstraction has 87716 states and 93764 transitions. [2025-01-09 00:15:39,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 163.75) internal successors, (655), 4 states have internal predecessors, (655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:15:39,838 INFO L276 IsEmpty]: Start isEmpty. Operand 87716 states and 93764 transitions. [2025-01-09 00:15:39,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1108 [2025-01-09 00:15:39,885 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:15:39,885 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 00:15:39,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-09 00:15:39,886 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:15:39,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:15:39,886 INFO L85 PathProgramCache]: Analyzing trace with hash -2133088679, now seen corresponding path program 1 times [2025-01-09 00:15:39,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:15:39,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022713626] [2025-01-09 00:15:39,886 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:15:39,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:15:39,942 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1107 statements into 1 equivalence classes. [2025-01-09 00:15:39,977 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1107 of 1107 statements. [2025-01-09 00:15:39,977 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:15:39,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:15:40,350 INFO L134 CoverageAnalysis]: Checked inductivity of 1513 backedges. 894 proven. 0 refuted. 0 times theorem prover too weak. 619 trivial. 0 not checked. [2025-01-09 00:15:40,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:15:40,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022713626] [2025-01-09 00:15:40,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022713626] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:15:40,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:15:40,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:15:40,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062938357] [2025-01-09 00:15:40,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:15:40,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:15:40,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:15:40,352 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:15:40,352 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:15:40,353 INFO L87 Difference]: Start difference. First operand 87716 states and 93764 transitions. Second operand has 3 states, 3 states have (on average 253.33333333333334) internal successors, (760), 3 states have internal predecessors, (760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:15:41,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:15:41,902 INFO L93 Difference]: Finished difference Result 176272 states and 188510 transitions. [2025-01-09 00:15:41,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:15:41,903 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 253.33333333333334) internal successors, (760), 3 states have internal predecessors, (760), 0 states have call successors, (0), 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 1107 [2025-01-09 00:15:41,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:15:42,003 INFO L225 Difference]: With dead ends: 176272 [2025-01-09 00:15:42,003 INFO L226 Difference]: Without dead ends: 87708 [2025-01-09 00:15:42,055 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-01-09 00:15:42,058 INFO L435 NwaCegarLoop]: 553 mSDtfsCounter, 73 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 1092 mSolverCounterSat, 199 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 575 SdHoareTripleChecker+Invalid, 1291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 199 IncrementalHoareTripleChecker+Valid, 1092 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-09 00:15:42,059 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 575 Invalid, 1291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [199 Valid, 1092 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-09 00:15:42,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87708 states. [2025-01-09 00:15:43,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87708 to 87708. [2025-01-09 00:15:43,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87708 states, 87707 states have (on average 1.0649663082764202) internal successors, (93405), 87707 states have internal predecessors, (93405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:15:43,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87708 states to 87708 states and 93405 transitions. [2025-01-09 00:15:43,120 INFO L78 Accepts]: Start accepts. Automaton has 87708 states and 93405 transitions. Word has length 1107 [2025-01-09 00:15:43,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:15:43,120 INFO L471 AbstractCegarLoop]: Abstraction has 87708 states and 93405 transitions. [2025-01-09 00:15:43,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 253.33333333333334) internal successors, (760), 3 states have internal predecessors, (760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:15:43,121 INFO L276 IsEmpty]: Start isEmpty. Operand 87708 states and 93405 transitions. [2025-01-09 00:15:43,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1201 [2025-01-09 00:15:43,173 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:15:43,174 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:15:43,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-01-09 00:15:43,174 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:15:43,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:15:43,175 INFO L85 PathProgramCache]: Analyzing trace with hash 136235356, now seen corresponding path program 1 times [2025-01-09 00:15:43,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:15:43,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529264972] [2025-01-09 00:15:43,175 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:15:43,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:15:43,236 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1200 statements into 1 equivalence classes. [2025-01-09 00:15:43,268 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1200 of 1200 statements. [2025-01-09 00:15:43,269 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:15:43,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:15:43,615 INFO L134 CoverageAnalysis]: Checked inductivity of 1576 backedges. 1282 proven. 0 refuted. 0 times theorem prover too weak. 294 trivial. 0 not checked. [2025-01-09 00:15:43,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:15:43,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529264972] [2025-01-09 00:15:43,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529264972] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:15:43,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:15:43,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:15:43,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504081091] [2025-01-09 00:15:43,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:15:43,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:15:43,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:15:43,617 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:15:43,617 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:15:43,617 INFO L87 Difference]: Start difference. First operand 87708 states and 93405 transitions. Second operand has 3 states, 3 states have (on average 330.0) internal successors, (990), 3 states have internal predecessors, (990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:15:44,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:15:44,878 INFO L93 Difference]: Finished difference Result 172435 states and 183594 transitions. [2025-01-09 00:15:44,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:15:44,886 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 330.0) internal successors, (990), 3 states have internal predecessors, (990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1200 [2025-01-09 00:15:44,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:15:44,970 INFO L225 Difference]: With dead ends: 172435 [2025-01-09 00:15:44,971 INFO L226 Difference]: Without dead ends: 85154 [2025-01-09 00:15:45,018 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-01-09 00:15:45,019 INFO L435 NwaCegarLoop]: 599 mSDtfsCounter, 103 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 1072 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 642 SdHoareTripleChecker+Invalid, 1165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 1072 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-09 00:15:45,020 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 642 Invalid, 1165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 1072 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-09 00:15:45,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85154 states. [2025-01-09 00:15:45,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85154 to 84300. [2025-01-09 00:15:46,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84300 states, 84299 states have (on average 1.057628204367786) internal successors, (89157), 84299 states have internal predecessors, (89157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:15:46,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84300 states to 84300 states and 89157 transitions. [2025-01-09 00:15:46,329 INFO L78 Accepts]: Start accepts. Automaton has 84300 states and 89157 transitions. Word has length 1200 [2025-01-09 00:15:46,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:15:46,330 INFO L471 AbstractCegarLoop]: Abstraction has 84300 states and 89157 transitions. [2025-01-09 00:15:46,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 330.0) internal successors, (990), 3 states have internal predecessors, (990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:15:46,332 INFO L276 IsEmpty]: Start isEmpty. Operand 84300 states and 89157 transitions. [2025-01-09 00:15:46,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1458 [2025-01-09 00:15:46,386 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:15:46,387 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:15:46,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-01-09 00:15:46,388 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:15:46,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:15:46,388 INFO L85 PathProgramCache]: Analyzing trace with hash 1215365157, now seen corresponding path program 1 times [2025-01-09 00:15:46,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:15:46,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367190843] [2025-01-09 00:15:46,389 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:15:46,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:15:46,467 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1457 statements into 1 equivalence classes. [2025-01-09 00:15:46,516 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1457 of 1457 statements. [2025-01-09 00:15:46,516 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:15:46,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:15:47,269 INFO L134 CoverageAnalysis]: Checked inductivity of 2408 backedges. 1268 proven. 0 refuted. 0 times theorem prover too weak. 1140 trivial. 0 not checked. [2025-01-09 00:15:47,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:15:47,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367190843] [2025-01-09 00:15:47,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367190843] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:15:47,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:15:47,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 00:15:47,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936316994] [2025-01-09 00:15:47,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:15:47,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:15:47,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:15:47,271 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:15:47,271 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:15:47,272 INFO L87 Difference]: Start difference. First operand 84300 states and 89157 transitions. Second operand has 4 states, 4 states have (on average 193.25) internal successors, (773), 4 states have internal predecessors, (773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:15:49,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:15:49,489 INFO L93 Difference]: Finished difference Result 180963 states and 191290 transitions. [2025-01-09 00:15:49,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:15:49,493 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 193.25) internal successors, (773), 4 states have internal predecessors, (773), 0 states have call successors, (0), 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 1457 [2025-01-09 00:15:49,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:15:49,496 INFO L225 Difference]: With dead ends: 180963 [2025-01-09 00:15:49,496 INFO L226 Difference]: Without dead ends: 0 [2025-01-09 00:15:49,553 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-01-09 00:15:49,553 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 552 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 2192 mSolverCounterSat, 409 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 552 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 2601 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 409 IncrementalHoareTripleChecker+Valid, 2192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-01-09 00:15:49,554 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [552 Valid, 80 Invalid, 2601 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [409 Valid, 2192 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-01-09 00:15:49,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-01-09 00:15:49,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-01-09 00:15:49,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:15:49,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-01-09 00:15:49,556 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1457 [2025-01-09 00:15:49,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:15:49,556 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-09 00:15:49,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 193.25) internal successors, (773), 4 states have internal predecessors, (773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:15:49,564 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-01-09 00:15:49,564 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-01-09 00:15:49,566 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 00:15:49,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-01-09 00:15:49,571 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:15:49,577 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.