./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem17_label43.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_label43.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 b76d5bd3a937dd443771d4fd333665d0cd3fbe44dd72d1f97738d181d0765bea --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 00:14:24,871 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 00:14:24,932 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:24,941 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 00:14:24,941 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 00:14:24,963 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 00:14:24,964 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 00:14:24,964 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 00:14:24,965 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 00:14:24,965 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 00:14:24,965 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 00:14:24,965 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 00:14:24,965 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 00:14:24,965 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 00:14:24,966 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 00:14:24,966 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 00:14:24,966 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 00:14:24,966 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 00:14:24,967 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 00:14:24,967 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 00:14:24,967 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 00:14:24,967 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 00:14:24,967 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 00:14:24,968 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 00:14:24,968 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 00:14:24,968 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 00:14:24,968 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 00:14:24,968 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 00:14:24,968 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 00:14:24,968 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 00:14:24,969 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 00:14:24,969 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 00:14:24,969 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:14:24,969 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 00:14:24,969 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 00:14:24,969 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 00:14:24,969 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 00:14:24,970 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:14:24,970 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 00:14:24,970 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 00:14:24,970 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 00:14:24,970 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 00:14:24,970 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 00:14:24,970 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 00:14:24,970 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 00:14:24,970 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 00:14:24,970 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 00:14:24,970 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 00:14:24,970 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 -> b76d5bd3a937dd443771d4fd333665d0cd3fbe44dd72d1f97738d181d0765bea [2025-01-09 00:14:25,238 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 00:14:25,247 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 00:14:25,249 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 00:14:25,250 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 00:14:25,251 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 00:14:25,252 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem17_label43.c [2025-01-09 00:14:26,517 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e2c478578/5c2187df83fa40e09db07b7d961e685c/FLAGd85fa0484 [2025-01-09 00:14:26,927 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 00:14:26,927 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label43.c [2025-01-09 00:14:26,957 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e2c478578/5c2187df83fa40e09db07b7d961e685c/FLAGd85fa0484 [2025-01-09 00:14:27,073 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e2c478578/5c2187df83fa40e09db07b7d961e685c [2025-01-09 00:14:27,075 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 00:14:27,076 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 00:14:27,077 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 00:14:27,077 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 00:14:27,081 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 00:14:27,082 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:14:27" (1/1) ... [2025-01-09 00:14:27,082 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75854446 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:14:27, skipping insertion in model container [2025-01-09 00:14:27,082 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:14:27" (1/1) ... [2025-01-09 00:14:27,147 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 00:14:27,339 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_label43.c[9211,9224] [2025-01-09 00:14:27,737 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 00:14:27,747 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 00:14:27,779 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_label43.c[9211,9224] [2025-01-09 00:14:28,017 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 00:14:28,036 INFO L204 MainTranslator]: Completed translation [2025-01-09 00:14:28,037 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:14:28 WrapperNode [2025-01-09 00:14:28,038 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 00:14:28,040 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 00:14:28,040 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 00:14:28,040 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 00:14:28,048 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:28" (1/1) ... [2025-01-09 00:14:28,096 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:28" (1/1) ... [2025-01-09 00:14:28,354 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 2610 [2025-01-09 00:14:28,355 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 00:14:28,355 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 00:14:28,356 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 00:14:28,356 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 00:14:28,365 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:28" (1/1) ... [2025-01-09 00:14:28,366 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:28" (1/1) ... [2025-01-09 00:14:28,461 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:28" (1/1) ... [2025-01-09 00:14:28,594 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:28,595 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:28" (1/1) ... [2025-01-09 00:14:28,595 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:28" (1/1) ... [2025-01-09 00:14:28,737 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:28" (1/1) ... [2025-01-09 00:14:28,780 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:28" (1/1) ... [2025-01-09 00:14:28,820 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:28" (1/1) ... [2025-01-09 00:14:28,845 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:28" (1/1) ... [2025-01-09 00:14:28,863 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:28" (1/1) ... [2025-01-09 00:14:28,906 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 00:14:28,907 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 00:14:28,907 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 00:14:28,907 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 00:14:28,912 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:14:28" (1/1) ... [2025-01-09 00:14:28,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:14:28,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:14:28,952 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:28,957 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:28,982 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 00:14:28,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 00:14:28,982 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 00:14:28,982 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 00:14:29,044 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 00:14:29,046 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 00:14:32,489 INFO L? ?]: Removed 372 outVars from TransFormulas that were not future-live. [2025-01-09 00:14:32,490 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 00:14:32,518 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 00:14:32,521 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 00:14:32,522 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:14:32 BoogieIcfgContainer [2025-01-09 00:14:32,522 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 00:14:32,524 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 00:14:32,524 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 00:14:32,529 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 00:14:32,529 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 12:14:27" (1/3) ... [2025-01-09 00:14:32,530 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6acba362 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:14:32, skipping insertion in model container [2025-01-09 00:14:32,531 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:14:28" (2/3) ... [2025-01-09 00:14:32,531 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6acba362 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:14:32, skipping insertion in model container [2025-01-09 00:14:32,531 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:14:32" (3/3) ... [2025-01-09 00:14:32,532 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem17_label43.c [2025-01-09 00:14:32,546 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 00:14:32,548 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem17_label43.c that has 1 procedures, 590 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 00:14:32,623 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 00:14:32,637 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;@106a495e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 00:14:32,637 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 00:14:32,645 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:32,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-01-09 00:14:32,653 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:14:32,654 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:14:32,654 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:14:32,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:14:32,660 INFO L85 PathProgramCache]: Analyzing trace with hash -2137131158, now seen corresponding path program 1 times [2025-01-09 00:14:32,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:14:32,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835407640] [2025-01-09 00:14:32,668 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:14:32,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:14:32,755 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-01-09 00:14:32,803 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-01-09 00:14:32,803 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:14:32,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:14:33,040 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:33,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:14:33,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835407640] [2025-01-09 00:14:33,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835407640] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:14:33,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:14:33,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:14:33,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124970237] [2025-01-09 00:14:33,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:14:33,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:14:33,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:14:33,066 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:14:33,066 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:14:33,070 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 20.666666666666668) internal successors, (62), 2 states have internal predecessors, (62), 0 states have call successors, (0), 0 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:35,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:14:35,665 INFO L93 Difference]: Finished difference Result 1680 states and 3071 transitions. [2025-01-09 00:14:35,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:14:35,667 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 2 states have internal predecessors, (62), 0 states have call successors, (0), 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 62 [2025-01-09 00:14:35,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:14:35,685 INFO L225 Difference]: With dead ends: 1680 [2025-01-09 00:14:35,685 INFO L226 Difference]: Without dead ends: 1011 [2025-01-09 00:14:35,694 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:35,697 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 519 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 1600 mSolverCounterSat, 358 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 519 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 1958 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 358 IncrementalHoareTripleChecker+Valid, 1600 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-01-09 00:14:35,698 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [519 Valid, 220 Invalid, 1958 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [358 Valid, 1600 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-01-09 00:14:35,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1011 states. [2025-01-09 00:14:35,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1011 to 996. [2025-01-09 00:14:35,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 996 states, 995 states have (on average 1.735678391959799) internal successors, (1727), 995 states have internal predecessors, (1727), 0 states have call successors, (0), 0 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:35,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 996 states to 996 states and 1727 transitions. [2025-01-09 00:14:35,788 INFO L78 Accepts]: Start accepts. Automaton has 996 states and 1727 transitions. Word has length 62 [2025-01-09 00:14:35,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:14:35,789 INFO L471 AbstractCegarLoop]: Abstraction has 996 states and 1727 transitions. [2025-01-09 00:14:35,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 2 states have internal predecessors, (62), 0 states have call successors, (0), 0 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:35,790 INFO L276 IsEmpty]: Start isEmpty. Operand 996 states and 1727 transitions. [2025-01-09 00:14:35,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-01-09 00:14:35,794 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:14:35,795 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:14:35,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 00:14:35,795 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:14:35,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:14:35,796 INFO L85 PathProgramCache]: Analyzing trace with hash -738638686, now seen corresponding path program 1 times [2025-01-09 00:14:35,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:14:35,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175200904] [2025-01-09 00:14:35,797 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:14:35,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:14:35,826 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-01-09 00:14:35,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-01-09 00:14:35,896 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:14:35,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:14:36,133 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:14:36,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:14:36,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175200904] [2025-01-09 00:14:36,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175200904] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:14:36,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:14:36,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:14:36,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741821418] [2025-01-09 00:14:36,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:14:36,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:14:36,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:14:36,138 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:14:36,139 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:14:36,139 INFO L87 Difference]: Start difference. First operand 996 states and 1727 transitions. Second operand has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 2 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:14:38,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:14:38,238 INFO L93 Difference]: Finished difference Result 2868 states and 5021 transitions. [2025-01-09 00:14:38,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:14:38,239 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 2 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 127 [2025-01-09 00:14:38,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:14:38,248 INFO L225 Difference]: With dead ends: 2868 [2025-01-09 00:14:38,248 INFO L226 Difference]: Without dead ends: 1874 [2025-01-09 00:14:38,251 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:38,253 INFO L435 NwaCegarLoop]: 389 mSDtfsCounter, 407 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 1407 mSolverCounterSat, 284 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 407 SdHoareTripleChecker+Valid, 464 SdHoareTripleChecker+Invalid, 1691 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 284 IncrementalHoareTripleChecker+Valid, 1407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-01-09 00:14:38,253 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [407 Valid, 464 Invalid, 1691 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [284 Valid, 1407 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-01-09 00:14:38,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1874 states. [2025-01-09 00:14:38,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1874 to 1865. [2025-01-09 00:14:38,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1865 states, 1864 states have (on average 1.51931330472103) internal successors, (2832), 1864 states have internal predecessors, (2832), 0 states have call successors, (0), 0 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:38,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1865 states to 1865 states and 2832 transitions. [2025-01-09 00:14:38,297 INFO L78 Accepts]: Start accepts. Automaton has 1865 states and 2832 transitions. Word has length 127 [2025-01-09 00:14:38,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:14:38,297 INFO L471 AbstractCegarLoop]: Abstraction has 1865 states and 2832 transitions. [2025-01-09 00:14:38,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 2 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:14:38,298 INFO L276 IsEmpty]: Start isEmpty. Operand 1865 states and 2832 transitions. [2025-01-09 00:14:38,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-01-09 00:14:38,304 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:14:38,304 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, 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:14:38,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 00:14:38,305 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:14:38,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:14:38,306 INFO L85 PathProgramCache]: Analyzing trace with hash 299227773, now seen corresponding path program 1 times [2025-01-09 00:14:38,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:14:38,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36649623] [2025-01-09 00:14:38,306 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:14:38,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:14:38,329 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-01-09 00:14:38,348 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-01-09 00:14:38,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:14:38,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:14:38,535 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:14:38,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:14:38,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36649623] [2025-01-09 00:14:38,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36649623] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:14:38,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:14:38,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:14:38,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769177392] [2025-01-09 00:14:38,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:14:38,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:14:38,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:14:38,539 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:14:38,540 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:14:38,540 INFO L87 Difference]: Start difference. First operand 1865 states and 2832 transitions. Second operand has 3 states, 3 states have (on average 43.0) internal successors, (129), 2 states have internal predecessors, (129), 0 states have call successors, (0), 0 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,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:14:40,642 INFO L93 Difference]: Finished difference Result 5051 states and 7607 transitions. [2025-01-09 00:14:40,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:14:40,643 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 2 states have internal predecessors, (129), 0 states have call successors, (0), 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 129 [2025-01-09 00:14:40,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:14:40,656 INFO L225 Difference]: With dead ends: 5051 [2025-01-09 00:14:40,656 INFO L226 Difference]: Without dead ends: 3188 [2025-01-09 00:14:40,660 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:40,660 INFO L435 NwaCegarLoop]: 182 mSDtfsCounter, 444 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 1491 mSolverCounterSat, 351 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 444 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 1842 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 351 IncrementalHoareTripleChecker+Valid, 1491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-01-09 00:14:40,661 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [444 Valid, 240 Invalid, 1842 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [351 Valid, 1491 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-01-09 00:14:40,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3188 states. [2025-01-09 00:14:40,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3188 to 3166. [2025-01-09 00:14:40,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3166 states, 3165 states have (on average 1.4458135860979462) internal successors, (4576), 3165 states have internal predecessors, (4576), 0 states have call successors, (0), 0 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,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3166 states to 3166 states and 4576 transitions. [2025-01-09 00:14:40,727 INFO L78 Accepts]: Start accepts. Automaton has 3166 states and 4576 transitions. Word has length 129 [2025-01-09 00:14:40,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:14:40,728 INFO L471 AbstractCegarLoop]: Abstraction has 3166 states and 4576 transitions. [2025-01-09 00:14:40,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 2 states have internal predecessors, (129), 0 states have call successors, (0), 0 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,729 INFO L276 IsEmpty]: Start isEmpty. Operand 3166 states and 4576 transitions. [2025-01-09 00:14:40,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-01-09 00:14:40,730 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:14:40,730 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, 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] [2025-01-09 00:14:40,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 00:14:40,731 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:14:40,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:14:40,731 INFO L85 PathProgramCache]: Analyzing trace with hash 2105372502, now seen corresponding path program 1 times [2025-01-09 00:14:40,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:14:40,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828775292] [2025-01-09 00:14:40,732 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:14:40,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:14:40,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-01-09 00:14:40,785 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-01-09 00:14:40,785 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:14:40,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:14:41,005 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:14:41,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:14:41,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828775292] [2025-01-09 00:14:41,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828775292] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:14:41,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:14:41,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:14:41,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896055137] [2025-01-09 00:14:41,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:14:41,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:14:41,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:14:41,006 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:14:41,006 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:14:41,007 INFO L87 Difference]: Start difference. First operand 3166 states and 4576 transitions. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:14:42,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:14:42,677 INFO L93 Difference]: Finished difference Result 7194 states and 10897 transitions. [2025-01-09 00:14:42,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:14:42,677 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 132 [2025-01-09 00:14:42,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:14:42,719 INFO L225 Difference]: With dead ends: 7194 [2025-01-09 00:14:42,720 INFO L226 Difference]: Without dead ends: 4455 [2025-01-09 00:14:42,724 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:42,725 INFO L435 NwaCegarLoop]: 851 mSDtfsCounter, 430 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 1279 mSolverCounterSat, 414 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 430 SdHoareTripleChecker+Valid, 919 SdHoareTripleChecker+Invalid, 1693 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 414 IncrementalHoareTripleChecker+Valid, 1279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-01-09 00:14:42,725 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [430 Valid, 919 Invalid, 1693 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [414 Valid, 1279 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-01-09 00:14:42,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4455 states. [2025-01-09 00:14:42,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4455 to 4452. [2025-01-09 00:14:42,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4452 states, 4451 states have (on average 1.3900247135475174) internal successors, (6187), 4451 states have internal predecessors, (6187), 0 states have call successors, (0), 0 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:42,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4452 states to 4452 states and 6187 transitions. [2025-01-09 00:14:42,840 INFO L78 Accepts]: Start accepts. Automaton has 4452 states and 6187 transitions. Word has length 132 [2025-01-09 00:14:42,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:14:42,840 INFO L471 AbstractCegarLoop]: Abstraction has 4452 states and 6187 transitions. [2025-01-09 00:14:42,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:14:42,841 INFO L276 IsEmpty]: Start isEmpty. Operand 4452 states and 6187 transitions. [2025-01-09 00:14:42,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-01-09 00:14:42,842 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:14:42,842 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, 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:42,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 00:14:42,842 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:14:42,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:14:42,848 INFO L85 PathProgramCache]: Analyzing trace with hash -1374226159, now seen corresponding path program 1 times [2025-01-09 00:14:42,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:14:42,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332585287] [2025-01-09 00:14:42,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:14:42,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:14:42,887 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-01-09 00:14:42,934 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-01-09 00:14:42,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:14:42,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:14:43,058 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:14:43,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:14:43,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332585287] [2025-01-09 00:14:43,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332585287] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:14:43,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:14:43,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:14:43,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111218101] [2025-01-09 00:14:43,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:14:43,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:14:43,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:14:43,060 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:14:43,060 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:14:43,060 INFO L87 Difference]: Start difference. First operand 4452 states and 6187 transitions. Second operand has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 2 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:14:44,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:14:44,905 INFO L93 Difference]: Finished difference Result 12768 states and 17848 transitions. [2025-01-09 00:14:44,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:14:44,906 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 2 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 134 [2025-01-09 00:14:44,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:14:44,925 INFO L225 Difference]: With dead ends: 12768 [2025-01-09 00:14:44,926 INFO L226 Difference]: Without dead ends: 8318 [2025-01-09 00:14:44,932 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:44,933 INFO L435 NwaCegarLoop]: 506 mSDtfsCounter, 400 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 1381 mSolverCounterSat, 325 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 400 SdHoareTripleChecker+Valid, 579 SdHoareTripleChecker+Invalid, 1706 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 325 IncrementalHoareTripleChecker+Valid, 1381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-01-09 00:14:44,933 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [400 Valid, 579 Invalid, 1706 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [325 Valid, 1381 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-01-09 00:14:44,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8318 states. [2025-01-09 00:14:45,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8318 to 7460. [2025-01-09 00:14:45,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7460 states, 7459 states have (on average 1.2756401662421235) internal successors, (9515), 7459 states have internal predecessors, (9515), 0 states have call successors, (0), 0 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,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7460 states to 7460 states and 9515 transitions. [2025-01-09 00:14:45,069 INFO L78 Accepts]: Start accepts. Automaton has 7460 states and 9515 transitions. Word has length 134 [2025-01-09 00:14:45,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:14:45,070 INFO L471 AbstractCegarLoop]: Abstraction has 7460 states and 9515 transitions. [2025-01-09 00:14:45,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 2 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:14:45,071 INFO L276 IsEmpty]: Start isEmpty. Operand 7460 states and 9515 transitions. [2025-01-09 00:14:45,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-01-09 00:14:45,074 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:14:45,075 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, 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] [2025-01-09 00:14:45,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 00:14:45,075 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:14:45,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:14:45,076 INFO L85 PathProgramCache]: Analyzing trace with hash 1320148552, now seen corresponding path program 1 times [2025-01-09 00:14:45,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:14:45,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293090830] [2025-01-09 00:14:45,076 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:14:45,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:14:45,104 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-01-09 00:14:45,121 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-01-09 00:14:45,121 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:14:45,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:14:45,285 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:14:45,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:14:45,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293090830] [2025-01-09 00:14:45,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293090830] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:14:45,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:14:45,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:14:45,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551452017] [2025-01-09 00:14:45,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:14:45,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:14:45,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:14:45,290 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:14:45,290 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:14:45,291 INFO L87 Difference]: Start difference. First operand 7460 states and 9515 transitions. Second operand has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 2 states have internal predecessors, (173), 0 states have call successors, (0), 0 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:46,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:14:46,948 INFO L93 Difference]: Finished difference Result 21724 states and 27770 transitions. [2025-01-09 00:14:46,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:14:46,949 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 2 states have internal predecessors, (173), 0 states have call successors, (0), 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 173 [2025-01-09 00:14:46,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:14:47,002 INFO L225 Difference]: With dead ends: 21724 [2025-01-09 00:14:47,003 INFO L226 Difference]: Without dead ends: 12137 [2025-01-09 00:14:47,027 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,028 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.6s IncrementalHoareTripleChecker+Time [2025-01-09 00:14:47,028 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.6s Time] [2025-01-09 00:14:47,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12137 states. [2025-01-09 00:14:47,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12137 to 9153. [2025-01-09 00:14:47,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9153 states, 9152 states have (on average 1.1726398601398602) internal successors, (10732), 9152 states have internal predecessors, (10732), 0 states have call successors, (0), 0 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,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9153 states to 9153 states and 10732 transitions. [2025-01-09 00:14:47,256 INFO L78 Accepts]: Start accepts. Automaton has 9153 states and 10732 transitions. Word has length 173 [2025-01-09 00:14:47,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:14:47,257 INFO L471 AbstractCegarLoop]: Abstraction has 9153 states and 10732 transitions. [2025-01-09 00:14:47,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 2 states have internal predecessors, (173), 0 states have call successors, (0), 0 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,264 INFO L276 IsEmpty]: Start isEmpty. Operand 9153 states and 10732 transitions. [2025-01-09 00:14:47,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2025-01-09 00:14:47,270 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:14:47,270 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:14:47,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 00:14:47,271 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:14:47,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:14:47,271 INFO L85 PathProgramCache]: Analyzing trace with hash -1859645235, now seen corresponding path program 1 times [2025-01-09 00:14:47,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:14:47,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497950266] [2025-01-09 00:14:47,272 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:14:47,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:14:47,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes. [2025-01-09 00:14:47,317 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements. [2025-01-09 00:14:47,317 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:14:47,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:14:47,490 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 187 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:14:47,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:14:47,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497950266] [2025-01-09 00:14:47,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497950266] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:14:47,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:14:47,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:14:47,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357562005] [2025-01-09 00:14:47,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:14:47,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:14:47,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:14:47,492 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:14:47,493 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:14:47,494 INFO L87 Difference]: Start difference. First operand 9153 states and 10732 transitions. Second operand has 3 states, 3 states have (on average 71.33333333333333) internal successors, (214), 3 states have internal predecessors, (214), 0 states have call successors, (0), 0 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:49,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:14:49,105 INFO L93 Difference]: Finished difference Result 22974 states and 27391 transitions. [2025-01-09 00:14:49,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:14:49,106 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 71.33333333333333) internal successors, (214), 3 states have internal predecessors, (214), 0 states have call successors, (0), 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 214 [2025-01-09 00:14:49,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:14:49,129 INFO L225 Difference]: With dead ends: 22974 [2025-01-09 00:14:49,129 INFO L226 Difference]: Without dead ends: 13823 [2025-01-09 00:14:49,139 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:49,140 INFO L435 NwaCegarLoop]: 721 mSDtfsCounter, 496 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 1136 mSolverCounterSat, 306 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 496 SdHoareTripleChecker+Valid, 779 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.5s IncrementalHoareTripleChecker+Time [2025-01-09 00:14:49,140 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [496 Valid, 779 Invalid, 1442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [306 Valid, 1136 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-01-09 00:14:49,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13823 states. [2025-01-09 00:14:49,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13823 to 13398. [2025-01-09 00:14:49,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13398 states, 13397 states have (on average 1.15943868030156) internal successors, (15533), 13397 states have internal predecessors, (15533), 0 states have call successors, (0), 0 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:49,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13398 states to 13398 states and 15533 transitions. [2025-01-09 00:14:49,309 INFO L78 Accepts]: Start accepts. Automaton has 13398 states and 15533 transitions. Word has length 214 [2025-01-09 00:14:49,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:14:49,310 INFO L471 AbstractCegarLoop]: Abstraction has 13398 states and 15533 transitions. [2025-01-09 00:14:49,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 71.33333333333333) internal successors, (214), 3 states have internal predecessors, (214), 0 states have call successors, (0), 0 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:49,310 INFO L276 IsEmpty]: Start isEmpty. Operand 13398 states and 15533 transitions. [2025-01-09 00:14:49,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2025-01-09 00:14:49,315 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:14:49,316 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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:49,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 00:14:49,316 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:14:49,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:14:49,317 INFO L85 PathProgramCache]: Analyzing trace with hash -1232106165, now seen corresponding path program 1 times [2025-01-09 00:14:49,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:14:49,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693878341] [2025-01-09 00:14:49,317 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:14:49,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:14:49,344 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 294 statements into 1 equivalence classes. [2025-01-09 00:14:49,398 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 294 of 294 statements. [2025-01-09 00:14:49,398 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:14:49,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:14:49,571 INFO L134 CoverageAnalysis]: Checked inductivity of 393 backedges. 252 proven. 0 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked. [2025-01-09 00:14:49,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:14:49,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693878341] [2025-01-09 00:14:49,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693878341] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:14:49,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:14:49,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:14:49,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071490468] [2025-01-09 00:14:49,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:14:49,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:14:49,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:14:49,573 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:14:49,573 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:14:49,574 INFO L87 Difference]: Start difference. First operand 13398 states and 15533 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:51,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:14:51,312 INFO L93 Difference]: Finished difference Result 32736 states and 38265 transitions. [2025-01-09 00:14:51,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:14:51,312 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 294 [2025-01-09 00:14:51,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:14:51,346 INFO L225 Difference]: With dead ends: 32736 [2025-01-09 00:14:51,346 INFO L226 Difference]: Without dead ends: 18065 [2025-01-09 00:14:51,359 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:51,360 INFO L435 NwaCegarLoop]: 780 mSDtfsCounter, 387 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 1202 mSolverCounterSat, 260 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 387 SdHoareTripleChecker+Valid, 850 SdHoareTripleChecker+Invalid, 1462 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 260 IncrementalHoareTripleChecker+Valid, 1202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-01-09 00:14:51,360 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [387 Valid, 850 Invalid, 1462 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [260 Valid, 1202 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-01-09 00:14:51,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18065 states. [2025-01-09 00:14:51,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18065 to 18065. [2025-01-09 00:14:51,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18065 states, 18064 states have (on average 1.1204052258635961) internal successors, (20239), 18064 states have internal predecessors, (20239), 0 states have call successors, (0), 0 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:51,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18065 states to 18065 states and 20239 transitions. [2025-01-09 00:14:51,549 INFO L78 Accepts]: Start accepts. Automaton has 18065 states and 20239 transitions. Word has length 294 [2025-01-09 00:14:51,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:14:51,549 INFO L471 AbstractCegarLoop]: Abstraction has 18065 states and 20239 transitions. [2025-01-09 00:14:51,550 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:51,550 INFO L276 IsEmpty]: Start isEmpty. Operand 18065 states and 20239 transitions. [2025-01-09 00:14:51,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2025-01-09 00:14:51,558 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:14:51,559 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, 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, 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:51,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 00:14:51,560 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:14:51,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:14:51,561 INFO L85 PathProgramCache]: Analyzing trace with hash 449027374, now seen corresponding path program 1 times [2025-01-09 00:14:51,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:14:51,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592935681] [2025-01-09 00:14:51,561 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:14:51,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:14:51,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 334 statements into 1 equivalence classes. [2025-01-09 00:14:51,618 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 334 of 334 statements. [2025-01-09 00:14:51,619 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:14:51,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:14:51,847 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 179 proven. 0 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2025-01-09 00:14:51,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:14:51,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592935681] [2025-01-09 00:14:51,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592935681] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:14:51,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:14:51,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:14:51,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535017676] [2025-01-09 00:14:51,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:14:51,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:14:51,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:14:51,850 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:14:51,850 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:14:51,850 INFO L87 Difference]: Start difference. First operand 18065 states and 20239 transitions. Second operand has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 0 states have call successors, (0), 0 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,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:14:53,572 INFO L93 Difference]: Finished difference Result 42936 states and 48393 transitions. [2025-01-09 00:14:53,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:14:53,572 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 0 states have call successors, (0), 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 334 [2025-01-09 00:14:53,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:14:53,615 INFO L225 Difference]: With dead ends: 42936 [2025-01-09 00:14:53,615 INFO L226 Difference]: Without dead ends: 23136 [2025-01-09 00:14:53,632 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,634 INFO L435 NwaCegarLoop]: 615 mSDtfsCounter, 486 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 1190 mSolverCounterSat, 353 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 486 SdHoareTripleChecker+Valid, 646 SdHoareTripleChecker+Invalid, 1543 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 353 IncrementalHoareTripleChecker+Valid, 1190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-01-09 00:14:53,634 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [486 Valid, 646 Invalid, 1543 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [353 Valid, 1190 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-01-09 00:14:53,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23136 states. [2025-01-09 00:14:53,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23136 to 21852. [2025-01-09 00:14:53,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21852 states, 21851 states have (on average 1.1148231202233307) internal successors, (24360), 21851 states have internal predecessors, (24360), 0 states have call successors, (0), 0 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:54,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21852 states to 21852 states and 24360 transitions. [2025-01-09 00:14:54,057 INFO L78 Accepts]: Start accepts. Automaton has 21852 states and 24360 transitions. Word has length 334 [2025-01-09 00:14:54,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:14:54,061 INFO L471 AbstractCegarLoop]: Abstraction has 21852 states and 24360 transitions. [2025-01-09 00:14:54,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 0 states have call successors, (0), 0 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:54,062 INFO L276 IsEmpty]: Start isEmpty. Operand 21852 states and 24360 transitions. [2025-01-09 00:14:54,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 402 [2025-01-09 00:14:54,091 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:14:54,091 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, 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] [2025-01-09 00:14:54,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 00:14:54,092 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:14:54,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:14:54,098 INFO L85 PathProgramCache]: Analyzing trace with hash 477532571, now seen corresponding path program 1 times [2025-01-09 00:14:54,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:14:54,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428292312] [2025-01-09 00:14:54,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:14:54,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:14:54,232 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 401 statements into 1 equivalence classes. [2025-01-09 00:14:54,279 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 401 of 401 statements. [2025-01-09 00:14:54,279 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:14:54,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:14:54,900 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:14:54,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:14:54,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428292312] [2025-01-09 00:14:54,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428292312] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:14:54,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:14:54,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:14:54,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039595295] [2025-01-09 00:14:54,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:14:54,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:14:54,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:14:54,902 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:14:54,902 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:14:54,903 INFO L87 Difference]: Start difference. First operand 21852 states and 24360 transitions. Second operand has 4 states, 4 states have (on average 100.25) internal successors, (401), 3 states have internal predecessors, (401), 0 states have call successors, (0), 0 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,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:14:57,040 INFO L93 Difference]: Finished difference Result 52670 states and 58808 transitions. [2025-01-09 00:14:57,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:14:57,041 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 100.25) internal successors, (401), 3 states have internal predecessors, (401), 0 states have call successors, (0), 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 401 [2025-01-09 00:14:57,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:14:57,081 INFO L225 Difference]: With dead ends: 52670 [2025-01-09 00:14:57,081 INFO L226 Difference]: Without dead ends: 29970 [2025-01-09 00:14:57,100 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:14:57,101 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 588 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 2275 mSolverCounterSat, 254 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 588 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 2529 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 254 IncrementalHoareTripleChecker+Valid, 2275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-01-09 00:14:57,101 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [588 Valid, 206 Invalid, 2529 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [254 Valid, 2275 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-01-09 00:14:57,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29970 states. [2025-01-09 00:14:57,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29970 to 29965. [2025-01-09 00:14:57,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29965 states, 29964 states have (on average 1.1206447737284742) internal successors, (33579), 29964 states have internal predecessors, (33579), 0 states have call successors, (0), 0 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,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29965 states to 29965 states and 33579 transitions. [2025-01-09 00:14:57,511 INFO L78 Accepts]: Start accepts. Automaton has 29965 states and 33579 transitions. Word has length 401 [2025-01-09 00:14:57,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:14:57,511 INFO L471 AbstractCegarLoop]: Abstraction has 29965 states and 33579 transitions. [2025-01-09 00:14:57,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 100.25) internal successors, (401), 3 states have internal predecessors, (401), 0 states have call successors, (0), 0 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,512 INFO L276 IsEmpty]: Start isEmpty. Operand 29965 states and 33579 transitions. [2025-01-09 00:14:57,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 559 [2025-01-09 00:14:57,531 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:14:57,532 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, 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, 3, 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] [2025-01-09 00:14:57,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 00:14:57,532 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:14:57,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:14:57,534 INFO L85 PathProgramCache]: Analyzing trace with hash 1440437001, now seen corresponding path program 1 times [2025-01-09 00:14:57,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:14:57,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239413574] [2025-01-09 00:14:57,534 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:14:57,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:14:57,588 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 558 statements into 1 equivalence classes. [2025-01-09 00:14:57,630 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 558 of 558 statements. [2025-01-09 00:14:57,630 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:14:57,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:14:57,960 INFO L134 CoverageAnalysis]: Checked inductivity of 738 backedges. 433 proven. 0 refuted. 0 times theorem prover too weak. 305 trivial. 0 not checked. [2025-01-09 00:14:57,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:14:57,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239413574] [2025-01-09 00:14:57,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239413574] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:14:57,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:14:57,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:14:57,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389037669] [2025-01-09 00:14:57,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:14:57,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:14:57,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:14:57,962 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:14:57,962 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:14:57,968 INFO L87 Difference]: Start difference. First operand 29965 states and 33579 transitions. Second operand has 3 states, 3 states have (on average 112.33333333333333) internal successors, (337), 3 states have internal predecessors, (337), 0 states have call successors, (0), 0 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,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:14:59,525 INFO L93 Difference]: Finished difference Result 65884 states and 74209 transitions. [2025-01-09 00:14:59,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:14:59,526 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 112.33333333333333) internal successors, (337), 3 states have internal predecessors, (337), 0 states have call successors, (0), 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 558 [2025-01-09 00:14:59,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:14:59,646 INFO L225 Difference]: With dead ends: 65884 [2025-01-09 00:14:59,647 INFO L226 Difference]: Without dead ends: 36346 [2025-01-09 00:14:59,667 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,669 INFO L435 NwaCegarLoop]: 664 mSDtfsCounter, 482 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 1159 mSolverCounterSat, 176 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 482 SdHoareTripleChecker+Valid, 711 SdHoareTripleChecker+Invalid, 1335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 176 IncrementalHoareTripleChecker+Valid, 1159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-01-09 00:14:59,670 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [482 Valid, 711 Invalid, 1335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [176 Valid, 1159 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-01-09 00:14:59,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36346 states. [2025-01-09 00:14:59,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36346 to 36342. [2025-01-09 00:15:00,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36342 states, 36341 states have (on average 1.117608211111417) internal successors, (40615), 36341 states have internal predecessors, (40615), 0 states have call successors, (0), 0 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,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36342 states to 36342 states and 40615 transitions. [2025-01-09 00:15:00,125 INFO L78 Accepts]: Start accepts. Automaton has 36342 states and 40615 transitions. Word has length 558 [2025-01-09 00:15:00,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:15:00,126 INFO L471 AbstractCegarLoop]: Abstraction has 36342 states and 40615 transitions. [2025-01-09 00:15:00,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.33333333333333) internal successors, (337), 3 states have internal predecessors, (337), 0 states have call successors, (0), 0 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,126 INFO L276 IsEmpty]: Start isEmpty. Operand 36342 states and 40615 transitions. [2025-01-09 00:15:00,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 579 [2025-01-09 00:15:00,152 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:15:00,153 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:00,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 00:15:00,153 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:15:00,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:15:00,154 INFO L85 PathProgramCache]: Analyzing trace with hash 319877705, now seen corresponding path program 1 times [2025-01-09 00:15:00,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:15:00,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751405859] [2025-01-09 00:15:00,154 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:15:00,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:15:00,207 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 578 statements into 1 equivalence classes. [2025-01-09 00:15:00,240 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 578 of 578 statements. [2025-01-09 00:15:00,241 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:15:00,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:15:00,562 INFO L134 CoverageAnalysis]: Checked inductivity of 783 backedges. 494 proven. 0 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2025-01-09 00:15:00,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:15:00,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751405859] [2025-01-09 00:15:00,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751405859] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:15:00,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:15:00,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:15:00,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459977163] [2025-01-09 00:15:00,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:15:00,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:15:00,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:15:00,566 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:15:00,566 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:15:00,567 INFO L87 Difference]: Start difference. First operand 36342 states and 40615 transitions. Second operand has 3 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 0 states have call successors, (0), 0 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:02,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:15:02,267 INFO L93 Difference]: Finished difference Result 82910 states and 93083 transitions. [2025-01-09 00:15:02,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:15:02,268 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 0 states have call successors, (0), 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 578 [2025-01-09 00:15:02,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:15:02,315 INFO L225 Difference]: With dead ends: 82910 [2025-01-09 00:15:02,315 INFO L226 Difference]: Without dead ends: 46995 [2025-01-09 00:15:02,345 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:02,346 INFO L435 NwaCegarLoop]: 212 mSDtfsCounter, 490 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 1248 mSolverCounterSat, 200 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 490 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 1448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 200 IncrementalHoareTripleChecker+Valid, 1248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-01-09 00:15:02,346 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [490 Valid, 254 Invalid, 1448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [200 Valid, 1248 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-01-09 00:15:02,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46995 states. [2025-01-09 00:15:02,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46995 to 38025. [2025-01-09 00:15:02,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38025 states, 38024 states have (on average 1.1171891436987167) internal successors, (42480), 38024 states have internal predecessors, (42480), 0 states have call successors, (0), 0 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:02,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38025 states to 38025 states and 42480 transitions. [2025-01-09 00:15:02,851 INFO L78 Accepts]: Start accepts. Automaton has 38025 states and 42480 transitions. Word has length 578 [2025-01-09 00:15:02,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:15:02,851 INFO L471 AbstractCegarLoop]: Abstraction has 38025 states and 42480 transitions. [2025-01-09 00:15:02,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 0 states have call successors, (0), 0 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:02,851 INFO L276 IsEmpty]: Start isEmpty. Operand 38025 states and 42480 transitions. [2025-01-09 00:15:02,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 648 [2025-01-09 00:15:02,870 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:15:02,871 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 00:15:02,871 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:15:02,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:15:02,872 INFO L85 PathProgramCache]: Analyzing trace with hash 473897504, now seen corresponding path program 1 times [2025-01-09 00:15:02,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:15:02,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399699365] [2025-01-09 00:15:02,872 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:15:02,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:15:02,921 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 647 statements into 1 equivalence classes. [2025-01-09 00:15:02,959 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 647 of 647 statements. [2025-01-09 00:15:02,959 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:15:02,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:15:03,754 INFO L134 CoverageAnalysis]: Checked inductivity of 770 backedges. 239 proven. 0 refuted. 0 times theorem prover too weak. 531 trivial. 0 not checked. [2025-01-09 00:15:03,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:15:03,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399699365] [2025-01-09 00:15:03,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399699365] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:15:03,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:15:03,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 00:15:03,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900524100] [2025-01-09 00:15:03,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:15:03,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 00:15:03,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:15:03,758 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 00:15:03,758 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 00:15:03,758 INFO L87 Difference]: Start difference. First operand 38025 states and 42480 transitions. Second operand has 5 states, 5 states have (on average 74.6) internal successors, (373), 4 states have internal predecessors, (373), 0 states have call successors, (0), 0 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,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:15:05,656 INFO L93 Difference]: Finished difference Result 77375 states and 86338 transitions. [2025-01-09 00:15:05,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 00:15:05,657 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 74.6) internal successors, (373), 4 states have internal predecessors, (373), 0 states have call successors, (0), 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 647 [2025-01-09 00:15:05,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:15:05,691 INFO L225 Difference]: With dead ends: 77375 [2025-01-09 00:15:05,691 INFO L226 Difference]: Without dead ends: 39710 [2025-01-09 00:15:05,701 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 00:15:05,701 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 845 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 2228 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 845 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 2358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 2228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-01-09 00:15:05,701 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [845 Valid, 151 Invalid, 2358 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 2228 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-01-09 00:15:05,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39710 states. [2025-01-09 00:15:05,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39710 to 39278. [2025-01-09 00:15:05,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39278 states, 39277 states have (on average 1.1059398630241617) internal successors, (43438), 39277 states have internal predecessors, (43438), 0 states have call successors, (0), 0 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,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39278 states to 39278 states and 43438 transitions. [2025-01-09 00:15:06,026 INFO L78 Accepts]: Start accepts. Automaton has 39278 states and 43438 transitions. Word has length 647 [2025-01-09 00:15:06,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:15:06,027 INFO L471 AbstractCegarLoop]: Abstraction has 39278 states and 43438 transitions. [2025-01-09 00:15:06,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 74.6) internal successors, (373), 4 states have internal predecessors, (373), 0 states have call successors, (0), 0 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,027 INFO L276 IsEmpty]: Start isEmpty. Operand 39278 states and 43438 transitions. [2025-01-09 00:15:06,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 660 [2025-01-09 00:15:06,051 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:15:06,052 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-09 00:15:06,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 00:15:06,052 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:15:06,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:15:06,053 INFO L85 PathProgramCache]: Analyzing trace with hash -1035572617, now seen corresponding path program 1 times [2025-01-09 00:15:06,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:15:06,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072261296] [2025-01-09 00:15:06,053 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:15:06,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:15:06,106 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 659 statements into 1 equivalence classes. [2025-01-09 00:15:06,138 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 659 of 659 statements. [2025-01-09 00:15:06,139 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:15:06,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:15:06,327 INFO L134 CoverageAnalysis]: Checked inductivity of 541 backedges. 179 proven. 0 refuted. 0 times theorem prover too weak. 362 trivial. 0 not checked. [2025-01-09 00:15:06,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:15:06,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072261296] [2025-01-09 00:15:06,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072261296] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:15:06,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:15:06,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:15:06,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878017042] [2025-01-09 00:15:06,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:15:06,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:15:06,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:15:06,330 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:15:06,330 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:15:06,330 INFO L87 Difference]: Start difference. First operand 39278 states and 43438 transitions. Second operand has 3 states, 3 states have (on average 127.0) internal successors, (381), 3 states have internal predecessors, (381), 0 states have call successors, (0), 0 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,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:15:07,746 INFO L93 Difference]: Finished difference Result 86198 states and 95320 transitions. [2025-01-09 00:15:07,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:15:07,747 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 127.0) internal successors, (381), 3 states have internal predecessors, (381), 0 states have call successors, (0), 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 659 [2025-01-09 00:15:07,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:15:07,816 INFO L225 Difference]: With dead ends: 86198 [2025-01-09 00:15:07,817 INFO L226 Difference]: Without dead ends: 47347 [2025-01-09 00:15:07,837 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,838 INFO L435 NwaCegarLoop]: 286 mSDtfsCounter, 383 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 1102 mSolverCounterSat, 138 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 383 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 1240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 1102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-09 00:15:07,838 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [383 Valid, 334 Invalid, 1240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 1102 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-09 00:15:07,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47347 states. [2025-01-09 00:15:08,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47347 to 41377. [2025-01-09 00:15:08,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41377 states, 41376 states have (on average 1.1013389404485692) internal successors, (45569), 41376 states have internal predecessors, (45569), 0 states have call successors, (0), 0 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,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41377 states to 41377 states and 45569 transitions. [2025-01-09 00:15:08,204 INFO L78 Accepts]: Start accepts. Automaton has 41377 states and 45569 transitions. Word has length 659 [2025-01-09 00:15:08,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:15:08,205 INFO L471 AbstractCegarLoop]: Abstraction has 41377 states and 45569 transitions. [2025-01-09 00:15:08,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 127.0) internal successors, (381), 3 states have internal predecessors, (381), 0 states have call successors, (0), 0 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,205 INFO L276 IsEmpty]: Start isEmpty. Operand 41377 states and 45569 transitions. [2025-01-09 00:15:08,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 870 [2025-01-09 00:15:08,232 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:15:08,233 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 00:15:08,233 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:15:08,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:15:08,234 INFO L85 PathProgramCache]: Analyzing trace with hash -832690043, now seen corresponding path program 1 times [2025-01-09 00:15:08,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:15:08,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32323648] [2025-01-09 00:15:08,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:15:08,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:15:08,311 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 869 statements into 1 equivalence classes. [2025-01-09 00:15:08,371 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 869 of 869 statements. [2025-01-09 00:15:08,372 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:15:08,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:15:08,982 INFO L134 CoverageAnalysis]: Checked inductivity of 888 backedges. 239 proven. 0 refuted. 0 times theorem prover too weak. 649 trivial. 0 not checked. [2025-01-09 00:15:08,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:15:08,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32323648] [2025-01-09 00:15:08,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32323648] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:15:08,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:15:08,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:15:08,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032812679] [2025-01-09 00:15:08,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:15:08,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:15:08,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:15:08,984 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:15:08,984 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:15:08,984 INFO L87 Difference]: Start difference. First operand 41377 states and 45569 transitions. Second operand has 3 states, 3 states have (on average 156.0) internal successors, (468), 3 states have internal predecessors, (468), 0 states have call successors, (0), 0 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,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:15:10,417 INFO L93 Difference]: Finished difference Result 89567 states and 99047 transitions. [2025-01-09 00:15:10,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:15:10,418 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 156.0) internal successors, (468), 3 states have internal predecessors, (468), 0 states have call successors, (0), 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 869 [2025-01-09 00:15:10,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:15:10,463 INFO L225 Difference]: With dead ends: 89567 [2025-01-09 00:15:10,464 INFO L226 Difference]: Without dead ends: 47767 [2025-01-09 00:15:10,486 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:15:10,486 INFO L435 NwaCegarLoop]: 682 mSDtfsCounter, 404 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 1204 mSolverCounterSat, 155 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 404 SdHoareTripleChecker+Valid, 737 SdHoareTripleChecker+Invalid, 1359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 155 IncrementalHoareTripleChecker+Valid, 1204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 00:15:10,486 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [404 Valid, 737 Invalid, 1359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [155 Valid, 1204 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-09 00:15:10,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47767 states. [2025-01-09 00:15:10,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47767 to 47760. [2025-01-09 00:15:10,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47760 states, 47759 states have (on average 1.0996670784564166) internal successors, (52519), 47759 states have internal predecessors, (52519), 0 states have call successors, (0), 0 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,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47760 states to 47760 states and 52519 transitions. [2025-01-09 00:15:10,850 INFO L78 Accepts]: Start accepts. Automaton has 47760 states and 52519 transitions. Word has length 869 [2025-01-09 00:15:10,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:15:10,850 INFO L471 AbstractCegarLoop]: Abstraction has 47760 states and 52519 transitions. [2025-01-09 00:15:10,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 156.0) internal successors, (468), 3 states have internal predecessors, (468), 0 states have call successors, (0), 0 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,850 INFO L276 IsEmpty]: Start isEmpty. Operand 47760 states and 52519 transitions. [2025-01-09 00:15:10,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 873 [2025-01-09 00:15:10,885 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:15:10,885 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 00:15:10,885 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:15:10,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:15:10,886 INFO L85 PathProgramCache]: Analyzing trace with hash 1606094458, now seen corresponding path program 1 times [2025-01-09 00:15:10,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:15:10,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009636396] [2025-01-09 00:15:10,886 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:15:10,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:15:10,957 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 872 statements into 1 equivalence classes. [2025-01-09 00:15:11,015 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 872 of 872 statements. [2025-01-09 00:15:11,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:15:11,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:15:11,963 INFO L134 CoverageAnalysis]: Checked inductivity of 891 backedges. 567 proven. 243 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2025-01-09 00:15:11,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:15:11,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009636396] [2025-01-09 00:15:11,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009636396] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:15:11,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [549198751] [2025-01-09 00:15:11,965 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:15:11,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:15:11,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:15:11,968 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:11,970 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:12,083 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 872 statements into 1 equivalence classes. [2025-01-09 00:15:12,247 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 872 of 872 statements. [2025-01-09 00:15:12,247 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:15:12,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:15:12,251 INFO L256 TraceCheckSpWp]: Trace formula consists of 1027 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 00:15:12,272 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:15:13,181 INFO L134 CoverageAnalysis]: Checked inductivity of 891 backedges. 567 proven. 243 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2025-01-09 00:15:13,182 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 00:15:15,090 INFO L134 CoverageAnalysis]: Checked inductivity of 891 backedges. 567 proven. 243 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2025-01-09 00:15:15,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [549198751] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 00:15:15,090 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 00:15:15,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2025-01-09 00:15:15,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958233330] [2025-01-09 00:15:15,090 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 00:15:15,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 00:15:15,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:15:15,093 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 00:15:15,093 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 00:15:15,094 INFO L87 Difference]: Start difference. First operand 47760 states and 52519 transitions. Second operand has 6 states, 6 states have (on average 239.66666666666666) internal successors, (1438), 6 states have internal predecessors, (1438), 0 states have call successors, (0), 0 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:17,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:15:17,976 INFO L93 Difference]: Finished difference Result 100184 states and 110403 transitions. [2025-01-09 00:15:17,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 00:15:17,976 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 239.66666666666666) internal successors, (1438), 6 states have internal predecessors, (1438), 0 states have call successors, (0), 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 872 [2025-01-09 00:15:17,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:15:18,035 INFO L225 Difference]: With dead ends: 100184 [2025-01-09 00:15:18,036 INFO L226 Difference]: Without dead ends: 52001 [2025-01-09 00:15:18,067 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1746 GetRequests, 1741 SyntacticMatches, 1 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,067 INFO L435 NwaCegarLoop]: 626 mSDtfsCounter, 536 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 3363 mSolverCounterSat, 296 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 536 SdHoareTripleChecker+Valid, 739 SdHoareTripleChecker+Invalid, 3659 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 296 IncrementalHoareTripleChecker+Valid, 3363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-01-09 00:15:18,067 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [536 Valid, 739 Invalid, 3659 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [296 Valid, 3363 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-01-09 00:15:18,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52001 states. [2025-01-09 00:15:18,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52001 to 44758. [2025-01-09 00:15:18,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44758 states, 44757 states have (on average 1.0834506334204705) internal successors, (48492), 44757 states have internal predecessors, (48492), 0 states have call successors, (0), 0 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,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44758 states to 44758 states and 48492 transitions. [2025-01-09 00:15:18,609 INFO L78 Accepts]: Start accepts. Automaton has 44758 states and 48492 transitions. Word has length 872 [2025-01-09 00:15:18,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:15:18,609 INFO L471 AbstractCegarLoop]: Abstraction has 44758 states and 48492 transitions. [2025-01-09 00:15:18,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 239.66666666666666) internal successors, (1438), 6 states have internal predecessors, (1438), 0 states have call successors, (0), 0 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,610 INFO L276 IsEmpty]: Start isEmpty. Operand 44758 states and 48492 transitions. [2025-01-09 00:15:18,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 928 [2025-01-09 00:15:18,655 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:15:18,655 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, 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, 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, 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] [2025-01-09 00:15:18,662 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:18,856 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,SelfDestructingSolverStorable15 [2025-01-09 00:15:18,856 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:15:18,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:15:18,857 INFO L85 PathProgramCache]: Analyzing trace with hash 1839610089, now seen corresponding path program 1 times [2025-01-09 00:15:18,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:15:18,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591589719] [2025-01-09 00:15:18,857 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:15:18,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:15:18,972 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 927 statements into 1 equivalence classes. [2025-01-09 00:15:19,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 927 of 927 statements. [2025-01-09 00:15:19,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:15:19,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:15:19,623 INFO L134 CoverageAnalysis]: Checked inductivity of 1439 backedges. 1110 proven. 0 refuted. 0 times theorem prover too weak. 329 trivial. 0 not checked. [2025-01-09 00:15:19,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:15:19,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591589719] [2025-01-09 00:15:19,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591589719] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:15:19,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:15:19,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:15:19,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167813451] [2025-01-09 00:15:19,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:15:19,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:15:19,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:15:19,626 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:15:19,626 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:15:19,626 INFO L87 Difference]: Start difference. First operand 44758 states and 48492 transitions. Second operand has 3 states, 3 states have (on average 220.33333333333334) internal successors, (661), 3 states have internal predecessors, (661), 0 states have call successors, (0), 0 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:20,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:15:20,960 INFO L93 Difference]: Finished difference Result 96328 states and 104717 transitions. [2025-01-09 00:15:20,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:15:20,961 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 220.33333333333334) internal successors, (661), 3 states have internal predecessors, (661), 0 states have call successors, (0), 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 927 [2025-01-09 00:15:20,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:15:21,021 INFO L225 Difference]: With dead ends: 96328 [2025-01-09 00:15:21,021 INFO L226 Difference]: Without dead ends: 51145 [2025-01-09 00:15:21,051 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,051 INFO L435 NwaCegarLoop]: 569 mSDtfsCounter, 185 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 1129 mSolverCounterSat, 168 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 597 SdHoareTripleChecker+Invalid, 1297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 168 IncrementalHoareTripleChecker+Valid, 1129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-09 00:15:21,051 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 597 Invalid, 1297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [168 Valid, 1129 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-09 00:15:21,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51145 states. [2025-01-09 00:15:21,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51145 to 51137. [2025-01-09 00:15:21,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51137 states, 51136 states have (on average 1.0861819461827285) internal successors, (55543), 51136 states have internal predecessors, (55543), 0 states have call successors, (0), 0 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,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51137 states to 51137 states and 55543 transitions. [2025-01-09 00:15:21,470 INFO L78 Accepts]: Start accepts. Automaton has 51137 states and 55543 transitions. Word has length 927 [2025-01-09 00:15:21,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:15:21,471 INFO L471 AbstractCegarLoop]: Abstraction has 51137 states and 55543 transitions. [2025-01-09 00:15:21,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 220.33333333333334) internal successors, (661), 3 states have internal predecessors, (661), 0 states have call successors, (0), 0 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,471 INFO L276 IsEmpty]: Start isEmpty. Operand 51137 states and 55543 transitions. [2025-01-09 00:15:21,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 984 [2025-01-09 00:15:21,505 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:15:21,506 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, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-09 00:15:21,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 00:15:21,506 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:15:21,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:15:21,507 INFO L85 PathProgramCache]: Analyzing trace with hash -1526672587, now seen corresponding path program 1 times [2025-01-09 00:15:21,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:15:21,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442158133] [2025-01-09 00:15:21,507 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:15:21,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:15:21,571 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 983 statements into 1 equivalence classes. [2025-01-09 00:15:21,612 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 983 of 983 statements. [2025-01-09 00:15:21,613 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:15:21,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:15:22,319 INFO L134 CoverageAnalysis]: Checked inductivity of 1569 backedges. 810 proven. 82 refuted. 0 times theorem prover too weak. 677 trivial. 0 not checked. [2025-01-09 00:15:22,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:15:22,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442158133] [2025-01-09 00:15:22,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442158133] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:15:22,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [336125666] [2025-01-09 00:15:22,320 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:15:22,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:15:22,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:15:22,323 INFO L229 MonitoredProcess]: Starting monitored process 3 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:22,326 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 00:15:22,420 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 983 statements into 1 equivalence classes. [2025-01-09 00:15:22,566 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 983 of 983 statements. [2025-01-09 00:15:22,566 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:15:22,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:15:22,570 INFO L256 TraceCheckSpWp]: Trace formula consists of 1161 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 00:15:22,580 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:15:23,300 INFO L134 CoverageAnalysis]: Checked inductivity of 1569 backedges. 1263 proven. 246 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-01-09 00:15:23,300 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 00:15:23,990 INFO L134 CoverageAnalysis]: Checked inductivity of 1569 backedges. 1509 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-01-09 00:15:23,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [336125666] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 00:15:23,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-09 00:15:23,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [3, 5] total 11 [2025-01-09 00:15:23,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390952340] [2025-01-09 00:15:23,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:15:23,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 00:15:23,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:15:23,993 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 00:15:23,993 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2025-01-09 00:15:23,994 INFO L87 Difference]: Start difference. First operand 51137 states and 55543 transitions. Second operand has 6 states, 6 states have (on average 154.0) internal successors, (924), 5 states have internal predecessors, (924), 0 states have call successors, (0), 0 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:26,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:15:26,329 INFO L93 Difference]: Finished difference Result 109919 states and 119662 transitions. [2025-01-09 00:15:26,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:15:26,330 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 154.0) internal successors, (924), 5 states have internal predecessors, (924), 0 states have call successors, (0), 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 983 [2025-01-09 00:15:26,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:15:26,388 INFO L225 Difference]: With dead ends: 109919 [2025-01-09 00:15:26,388 INFO L226 Difference]: Without dead ends: 58359 [2025-01-09 00:15:26,403 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1967 GetRequests, 1957 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2025-01-09 00:15:26,404 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 598 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 2454 mSolverCounterSat, 582 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 598 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 3036 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 582 IncrementalHoareTripleChecker+Valid, 2454 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-01-09 00:15:26,404 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [598 Valid, 114 Invalid, 3036 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [582 Valid, 2454 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-01-09 00:15:26,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58359 states. [2025-01-09 00:15:26,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58359 to 47727. [2025-01-09 00:15:26,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47727 states, 47726 states have (on average 1.0824498177094246) internal successors, (51661), 47726 states have internal predecessors, (51661), 0 states have call successors, (0), 0 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:26,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47727 states to 47727 states and 51661 transitions. [2025-01-09 00:15:26,790 INFO L78 Accepts]: Start accepts. Automaton has 47727 states and 51661 transitions. Word has length 983 [2025-01-09 00:15:26,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:15:26,790 INFO L471 AbstractCegarLoop]: Abstraction has 47727 states and 51661 transitions. [2025-01-09 00:15:26,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 154.0) internal successors, (924), 5 states have internal predecessors, (924), 0 states have call successors, (0), 0 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:26,790 INFO L276 IsEmpty]: Start isEmpty. Operand 47727 states and 51661 transitions. [2025-01-09 00:15:26,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1048 [2025-01-09 00:15:26,821 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:15:26,821 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-09 00:15:26,828 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 00:15:27,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-01-09 00:15:27,022 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:15:27,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:15:27,024 INFO L85 PathProgramCache]: Analyzing trace with hash 2117945676, now seen corresponding path program 1 times [2025-01-09 00:15:27,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:15:27,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652576761] [2025-01-09 00:15:27,024 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:15:27,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:15:27,104 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1047 statements into 1 equivalence classes. [2025-01-09 00:15:27,149 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1047 of 1047 statements. [2025-01-09 00:15:27,149 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:15:27,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:15:27,839 INFO L134 CoverageAnalysis]: Checked inductivity of 2040 backedges. 1363 proven. 0 refuted. 0 times theorem prover too weak. 677 trivial. 0 not checked. [2025-01-09 00:15:27,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:15:27,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652576761] [2025-01-09 00:15:27,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652576761] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:15:27,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:15:27,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 00:15:27,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147615963] [2025-01-09 00:15:27,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:15:27,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:15:27,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:15:27,841 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:15:27,842 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:15:27,842 INFO L87 Difference]: Start difference. First operand 47727 states and 51661 transitions. Second operand has 4 states, 4 states have (on average 155.0) internal successors, (620), 4 states have internal predecessors, (620), 0 states have call successors, (0), 0 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,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:15:29,941 INFO L93 Difference]: Finished difference Result 113781 states and 123410 transitions. [2025-01-09 00:15:29,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:15:29,941 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 155.0) internal successors, (620), 4 states have internal predecessors, (620), 0 states have call successors, (0), 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 1047 [2025-01-09 00:15:29,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:15:30,016 INFO L225 Difference]: With dead ends: 113781 [2025-01-09 00:15:30,016 INFO L226 Difference]: Without dead ends: 66481 [2025-01-09 00:15:30,050 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:30,050 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 748 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 2165 mSolverCounterSat, 335 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 748 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 2500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 335 IncrementalHoareTripleChecker+Valid, 2165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-01-09 00:15:30,050 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [748 Valid, 116 Invalid, 2500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [335 Valid, 2165 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-01-09 00:15:30,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66481 states. [2025-01-09 00:15:30,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66481 to 61792. [2025-01-09 00:15:30,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61792 states, 61791 states have (on average 1.0859348448803223) internal successors, (67101), 61791 states have internal predecessors, (67101), 0 states have call successors, (0), 0 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:30,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61792 states to 61792 states and 67101 transitions. [2025-01-09 00:15:30,584 INFO L78 Accepts]: Start accepts. Automaton has 61792 states and 67101 transitions. Word has length 1047 [2025-01-09 00:15:30,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:15:30,584 INFO L471 AbstractCegarLoop]: Abstraction has 61792 states and 67101 transitions. [2025-01-09 00:15:30,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 155.0) internal successors, (620), 4 states have internal predecessors, (620), 0 states have call successors, (0), 0 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:30,584 INFO L276 IsEmpty]: Start isEmpty. Operand 61792 states and 67101 transitions. [2025-01-09 00:15:30,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1073 [2025-01-09 00:15:30,632 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:15:30,632 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, 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 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:30,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 00:15:30,632 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:15:30,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:15:30,633 INFO L85 PathProgramCache]: Analyzing trace with hash -1877162740, now seen corresponding path program 1 times [2025-01-09 00:15:30,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:15:30,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881868305] [2025-01-09 00:15:30,633 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:15:30,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:15:30,698 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1072 statements into 1 equivalence classes. [2025-01-09 00:15:30,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1072 of 1072 statements. [2025-01-09 00:15:30,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:15:30,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:15:31,612 INFO L134 CoverageAnalysis]: Checked inductivity of 1552 backedges. 1160 proven. 0 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2025-01-09 00:15:31,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:15:31,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881868305] [2025-01-09 00:15:31,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881868305] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:15:31,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:15:31,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:15:31,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027671527] [2025-01-09 00:15:31,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:15:31,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:15:31,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:15:31,614 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:15:31,615 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:15:31,615 INFO L87 Difference]: Start difference. First operand 61792 states and 67101 transitions. Second operand has 3 states, 3 states have (on average 247.66666666666666) internal successors, (743), 3 states have internal predecessors, (743), 0 states have call successors, (0), 0 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,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:15:32,882 INFO L93 Difference]: Finished difference Result 125286 states and 135995 transitions. [2025-01-09 00:15:32,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:15:32,883 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 247.66666666666666) internal successors, (743), 3 states have internal predecessors, (743), 0 states have call successors, (0), 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 1072 [2025-01-09 00:15:32,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:15:32,944 INFO L225 Difference]: With dead ends: 125286 [2025-01-09 00:15:32,944 INFO L226 Difference]: Without dead ends: 63921 [2025-01-09 00:15:32,979 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:32,979 INFO L435 NwaCegarLoop]: 680 mSDtfsCounter, 113 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 1085 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 717 SdHoareTripleChecker+Invalid, 1117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1085 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-09 00:15:32,980 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 717 Invalid, 1117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1085 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-09 00:15:33,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63921 states. [2025-01-09 00:15:33,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63921 to 63493. [2025-01-09 00:15:33,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63493 states, 63492 states have (on average 1.0833333333333333) internal successors, (68783), 63492 states have internal predecessors, (68783), 0 states have call successors, (0), 0 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:33,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63493 states to 63493 states and 68783 transitions. [2025-01-09 00:15:33,781 INFO L78 Accepts]: Start accepts. Automaton has 63493 states and 68783 transitions. Word has length 1072 [2025-01-09 00:15:33,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:15:33,782 INFO L471 AbstractCegarLoop]: Abstraction has 63493 states and 68783 transitions. [2025-01-09 00:15:33,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 247.66666666666666) internal successors, (743), 3 states have internal predecessors, (743), 0 states have call successors, (0), 0 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:33,783 INFO L276 IsEmpty]: Start isEmpty. Operand 63493 states and 68783 transitions. [2025-01-09 00:15:33,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1078 [2025-01-09 00:15:33,849 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:15:33,850 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, 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 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:33,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 00:15:33,850 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:15:33,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:15:33,851 INFO L85 PathProgramCache]: Analyzing trace with hash -99993969, now seen corresponding path program 1 times [2025-01-09 00:15:33,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:15:33,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934127511] [2025-01-09 00:15:33,851 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:15:33,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:15:33,948 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1077 statements into 1 equivalence classes. [2025-01-09 00:15:34,009 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1077 of 1077 statements. [2025-01-09 00:15:34,010 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:15:34,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:15:35,406 INFO L134 CoverageAnalysis]: Checked inductivity of 1572 backedges. 419 proven. 555 refuted. 0 times theorem prover too weak. 598 trivial. 0 not checked. [2025-01-09 00:15:35,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:15:35,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934127511] [2025-01-09 00:15:35,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934127511] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:15:35,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1770174609] [2025-01-09 00:15:35,406 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:15:35,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:15:35,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:15:35,408 INFO L229 MonitoredProcess]: Starting monitored process 4 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:35,410 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 00:15:35,504 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1077 statements into 1 equivalence classes. [2025-01-09 00:15:35,657 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1077 of 1077 statements. [2025-01-09 00:15:35,658 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:15:35,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:15:35,662 INFO L256 TraceCheckSpWp]: Trace formula consists of 1264 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 00:15:35,669 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:15:35,828 INFO L134 CoverageAnalysis]: Checked inductivity of 1572 backedges. 602 proven. 78 refuted. 0 times theorem prover too weak. 892 trivial. 0 not checked. [2025-01-09 00:15:35,829 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 00:15:36,039 INFO L134 CoverageAnalysis]: Checked inductivity of 1572 backedges. 680 proven. 0 refuted. 0 times theorem prover too weak. 892 trivial. 0 not checked. [2025-01-09 00:15:36,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1770174609] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 00:15:36,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-09 00:15:36,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4, 3] total 8 [2025-01-09 00:15:36,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698911822] [2025-01-09 00:15:36,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:15:36,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:15:36,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:15:36,041 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:15:36,041 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-01-09 00:15:36,041 INFO L87 Difference]: Start difference. First operand 63493 states and 68783 transitions. Second operand has 4 states, 4 states have (on average 126.5) internal successors, (506), 3 states have internal predecessors, (506), 0 states have call successors, (0), 0 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,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:15:38,302 INFO L93 Difference]: Finished difference Result 145305 states and 157589 transitions. [2025-01-09 00:15:38,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:15:38,302 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 126.5) internal successors, (506), 3 states have internal predecessors, (506), 0 states have call successors, (0), 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 1077 [2025-01-09 00:15:38,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:15:38,392 INFO L225 Difference]: With dead ends: 145305 [2025-01-09 00:15:38,392 INFO L226 Difference]: Without dead ends: 82239 [2025-01-09 00:15:38,435 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2156 GetRequests, 2149 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-01-09 00:15:38,435 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 785 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 2127 mSolverCounterSat, 360 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 785 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 2487 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 360 IncrementalHoareTripleChecker+Valid, 2127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-01-09 00:15:38,435 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [785 Valid, 121 Invalid, 2487 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [360 Valid, 2127 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-01-09 00:15:38,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82239 states. [2025-01-09 00:15:39,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82239 to 78413. [2025-01-09 00:15:39,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78413 states, 78412 states have (on average 1.0851400295873082) internal successors, (85088), 78412 states have internal predecessors, (85088), 0 states have call successors, (0), 0 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,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78413 states to 78413 states and 85088 transitions. [2025-01-09 00:15:39,394 INFO L78 Accepts]: Start accepts. Automaton has 78413 states and 85088 transitions. Word has length 1077 [2025-01-09 00:15:39,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:15:39,395 INFO L471 AbstractCegarLoop]: Abstraction has 78413 states and 85088 transitions. [2025-01-09 00:15:39,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 126.5) internal successors, (506), 3 states have internal predecessors, (506), 0 states have call successors, (0), 0 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,395 INFO L276 IsEmpty]: Start isEmpty. Operand 78413 states and 85088 transitions. [2025-01-09 00:15:39,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1119 [2025-01-09 00:15:39,446 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:15:39,446 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-09 00:15:39,453 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0