./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem13_label02.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/Problem13_label02.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 48aec8d1d241a0a7736380f3571da3a89472d426f8d78df6e318e9a8d52f121e --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-08 23:50:05,857 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-08 23:50:05,892 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-08 23:50:05,896 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-08 23:50:05,896 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-08 23:50:05,911 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-08 23:50:05,911 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-08 23:50:05,911 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-08 23:50:05,912 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-08 23:50:05,912 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-08 23:50:05,912 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-08 23:50:05,912 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-08 23:50:05,912 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-08 23:50:05,912 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-08 23:50:05,912 INFO L153 SettingsManager]: * Use SBE=true [2025-01-08 23:50:05,912 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-08 23:50:05,912 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-08 23:50:05,912 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-08 23:50:05,912 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-08 23:50:05,912 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-08 23:50:05,912 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-08 23:50:05,912 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-08 23:50:05,913 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-08 23:50:05,913 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-08 23:50:05,913 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-08 23:50:05,913 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-08 23:50:05,913 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-08 23:50:05,913 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-08 23:50:05,913 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-08 23:50:05,913 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 23:50:05,913 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 23:50:05,913 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 23:50:05,913 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 23:50:05,913 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-08 23:50:05,913 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 23:50:05,913 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 23:50:05,913 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 23:50:05,913 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 23:50:05,913 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-08 23:50:05,913 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-08 23:50:05,914 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-08 23:50:05,914 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-08 23:50:05,914 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-08 23:50:05,914 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-08 23:50:05,914 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-08 23:50:05,914 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-08 23:50:05,914 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-08 23:50:05,914 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-08 23:50:05,914 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 -> 48aec8d1d241a0a7736380f3571da3a89472d426f8d78df6e318e9a8d52f121e [2025-01-08 23:50:06,137 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-08 23:50:06,142 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-08 23:50:06,143 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-08 23:50:06,144 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-08 23:50:06,144 INFO L274 PluginConnector]: CDTParser initialized [2025-01-08 23:50:06,145 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem13_label02.c [2025-01-08 23:50:07,217 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/05adb0564/1022bb83faed4ca882ee9dd4ede47521/FLAGb6df08f4a [2025-01-08 23:50:07,653 INFO L384 CDTParser]: Found 1 translation units. [2025-01-08 23:50:07,654 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label02.c [2025-01-08 23:50:07,684 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/05adb0564/1022bb83faed4ca882ee9dd4ede47521/FLAGb6df08f4a [2025-01-08 23:50:07,780 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/05adb0564/1022bb83faed4ca882ee9dd4ede47521 [2025-01-08 23:50:07,782 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-08 23:50:07,783 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-08 23:50:07,784 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-08 23:50:07,784 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-08 23:50:07,787 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-08 23:50:07,787 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 11:50:07" (1/1) ... [2025-01-08 23:50:07,788 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6da76ceb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:50:07, skipping insertion in model container [2025-01-08 23:50:07,788 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 11:50:07" (1/1) ... [2025-01-08 23:50:07,871 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-08 23:50:08,077 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/Problem13_label02.c[5671,5684] [2025-01-08 23:50:08,637 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 23:50:08,644 INFO L200 MainTranslator]: Completed pre-run [2025-01-08 23:50:08,660 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/Problem13_label02.c[5671,5684] [2025-01-08 23:50:08,975 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 23:50:08,992 INFO L204 MainTranslator]: Completed translation [2025-01-08 23:50:08,994 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:50:08 WrapperNode [2025-01-08 23:50:08,994 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-08 23:50:08,995 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-08 23:50:08,995 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-08 23:50:08,995 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-08 23:50:08,999 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:50:08" (1/1) ... [2025-01-08 23:50:09,049 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:50:08" (1/1) ... [2025-01-08 23:50:09,381 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 5584 [2025-01-08 23:50:09,382 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-08 23:50:09,383 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-08 23:50:09,383 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-08 23:50:09,383 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-08 23:50:09,390 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:50:08" (1/1) ... [2025-01-08 23:50:09,391 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:50:08" (1/1) ... [2025-01-08 23:50:09,455 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:50:08" (1/1) ... [2025-01-08 23:50:09,668 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-08 23:50:09,668 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:50:08" (1/1) ... [2025-01-08 23:50:09,668 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:50:08" (1/1) ... [2025-01-08 23:50:09,796 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:50:08" (1/1) ... [2025-01-08 23:50:09,822 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:50:08" (1/1) ... [2025-01-08 23:50:09,851 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:50:08" (1/1) ... [2025-01-08 23:50:09,891 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:50:08" (1/1) ... [2025-01-08 23:50:09,914 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:50:08" (1/1) ... [2025-01-08 23:50:09,960 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-08 23:50:09,961 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-08 23:50:09,962 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-08 23:50:09,962 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-08 23:50:09,963 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:50:08" (1/1) ... [2025-01-08 23:50:09,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 23:50:09,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:50:09,992 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-08 23:50:10,001 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-08 23:50:10,020 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-08 23:50:10,021 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-08 23:50:10,021 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-08 23:50:10,022 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-08 23:50:10,079 INFO L234 CfgBuilder]: Building ICFG [2025-01-08 23:50:10,080 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-08 23:50:14,903 INFO L? ?]: Removed 738 outVars from TransFormulas that were not future-live. [2025-01-08 23:50:14,904 INFO L283 CfgBuilder]: Performing block encoding [2025-01-08 23:50:14,927 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-08 23:50:14,927 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-08 23:50:14,932 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 11:50:14 BoogieIcfgContainer [2025-01-08 23:50:14,932 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-08 23:50:14,934 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-08 23:50:14,934 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-08 23:50:14,937 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-08 23:50:14,940 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.01 11:50:07" (1/3) ... [2025-01-08 23:50:14,941 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a831dca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 11:50:14, skipping insertion in model container [2025-01-08 23:50:14,941 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:50:08" (2/3) ... [2025-01-08 23:50:14,941 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a831dca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 11:50:14, skipping insertion in model container [2025-01-08 23:50:14,941 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 11:50:14" (3/3) ... [2025-01-08 23:50:14,942 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem13_label02.c [2025-01-08 23:50:14,961 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-08 23:50:14,965 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem13_label02.c that has 1 procedures, 1098 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-08 23:50:15,083 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-08 23:50:15,091 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;@469b5f1a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-08 23:50:15,091 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-08 23:50:15,096 INFO L276 IsEmpty]: Start isEmpty. Operand has 1098 states, 1096 states have (on average 1.8266423357664234) internal successors, (2002), 1097 states have internal predecessors, (2002), 0 states have call successors, (0), 0 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-08 23:50:15,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-01-08 23:50:15,102 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:50:15,102 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] [2025-01-08 23:50:15,103 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:50:15,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:50:15,106 INFO L85 PathProgramCache]: Analyzing trace with hash 1896988172, now seen corresponding path program 1 times [2025-01-08 23:50:15,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:50:15,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867567637] [2025-01-08 23:50:15,114 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:50:15,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:50:15,177 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-01-08 23:50:15,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-01-08 23:50:15,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:50:15,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:50:15,410 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-08 23:50:15,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:50:15,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867567637] [2025-01-08 23:50:15,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867567637] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:50:15,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:50:15,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 23:50:15,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824310708] [2025-01-08 23:50:15,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:50:15,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:50:15,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:50:15,429 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:50:15,430 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:50:15,434 INFO L87 Difference]: Start difference. First operand has 1098 states, 1096 states have (on average 1.8266423357664234) internal successors, (2002), 1097 states have internal predecessors, (2002), 0 states have call successors, (0), 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 13.0) internal successors, (39), 2 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:50:19,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:50:19,116 INFO L93 Difference]: Finished difference Result 3121 states and 5801 transitions. [2025-01-08 23:50:19,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:50:19,118 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 2 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2025-01-08 23:50:19,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:50:19,132 INFO L225 Difference]: With dead ends: 3121 [2025-01-08 23:50:19,132 INFO L226 Difference]: Without dead ends: 1944 [2025-01-08 23:50:19,139 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-08 23:50:19,144 INFO L435 NwaCegarLoop]: 437 mSDtfsCounter, 950 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 3124 mSolverCounterSat, 577 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 950 SdHoareTripleChecker+Valid, 574 SdHoareTripleChecker+Invalid, 3701 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 577 IncrementalHoareTripleChecker+Valid, 3124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2025-01-08 23:50:19,146 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [950 Valid, 574 Invalid, 3701 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [577 Valid, 3124 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2025-01-08 23:50:19,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1944 states. [2025-01-08 23:50:19,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1944 to 1873. [2025-01-08 23:50:19,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1873 states, 1872 states have (on average 1.7393162393162394) internal successors, (3256), 1872 states have internal predecessors, (3256), 0 states have call successors, (0), 0 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-08 23:50:19,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1873 states to 1873 states and 3256 transitions. [2025-01-08 23:50:19,231 INFO L78 Accepts]: Start accepts. Automaton has 1873 states and 3256 transitions. Word has length 39 [2025-01-08 23:50:19,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:50:19,231 INFO L471 AbstractCegarLoop]: Abstraction has 1873 states and 3256 transitions. [2025-01-08 23:50:19,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 2 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:50:19,232 INFO L276 IsEmpty]: Start isEmpty. Operand 1873 states and 3256 transitions. [2025-01-08 23:50:19,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-01-08 23:50:19,233 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:50:19,233 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 23:50:19,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-08 23:50:19,234 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:50:19,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:50:19,234 INFO L85 PathProgramCache]: Analyzing trace with hash -1625688374, now seen corresponding path program 1 times [2025-01-08 23:50:19,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:50:19,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340647028] [2025-01-08 23:50:19,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:50:19,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:50:19,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-01-08 23:50:19,262 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-01-08 23:50:19,263 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:50:19,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:50:19,403 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:50:19,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:50:19,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340647028] [2025-01-08 23:50:19,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340647028] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:50:19,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:50:19,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 23:50:19,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121439846] [2025-01-08 23:50:19,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:50:19,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:50:19,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:50:19,405 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:50:19,405 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:50:19,405 INFO L87 Difference]: Start difference. First operand 1873 states and 3256 transitions. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 2 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:50:22,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:50:22,369 INFO L93 Difference]: Finished difference Result 5351 states and 9369 transitions. [2025-01-08 23:50:22,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:50:22,369 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 2 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 104 [2025-01-08 23:50:22,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:50:22,379 INFO L225 Difference]: With dead ends: 5351 [2025-01-08 23:50:22,379 INFO L226 Difference]: Without dead ends: 3480 [2025-01-08 23:50:22,381 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-08 23:50:22,382 INFO L435 NwaCegarLoop]: 927 mSDtfsCounter, 884 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 2338 mSolverCounterSat, 878 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 884 SdHoareTripleChecker+Valid, 1080 SdHoareTripleChecker+Invalid, 3216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 878 IncrementalHoareTripleChecker+Valid, 2338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2025-01-08 23:50:22,382 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [884 Valid, 1080 Invalid, 3216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [878 Valid, 2338 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2025-01-08 23:50:22,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3480 states. [2025-01-08 23:50:22,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3480 to 3479. [2025-01-08 23:50:22,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3479 states, 3478 states have (on average 1.518688901667625) internal successors, (5282), 3478 states have internal predecessors, (5282), 0 states have call successors, (0), 0 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-08 23:50:22,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3479 states to 3479 states and 5282 transitions. [2025-01-08 23:50:22,431 INFO L78 Accepts]: Start accepts. Automaton has 3479 states and 5282 transitions. Word has length 104 [2025-01-08 23:50:22,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:50:22,431 INFO L471 AbstractCegarLoop]: Abstraction has 3479 states and 5282 transitions. [2025-01-08 23:50:22,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 2 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:50:22,432 INFO L276 IsEmpty]: Start isEmpty. Operand 3479 states and 5282 transitions. [2025-01-08 23:50:22,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-01-08 23:50:22,436 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:50:22,436 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 23:50:22,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-08 23:50:22,436 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:50:22,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:50:22,437 INFO L85 PathProgramCache]: Analyzing trace with hash 478893839, now seen corresponding path program 1 times [2025-01-08 23:50:22,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:50:22,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383343922] [2025-01-08 23:50:22,437 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:50:22,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:50:22,452 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-01-08 23:50:22,473 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-01-08 23:50:22,473 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:50:22,477 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:50:22,751 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:50:22,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:50:22,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383343922] [2025-01-08 23:50:22,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383343922] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:50:22,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:50:22,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 23:50:22,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468004887] [2025-01-08 23:50:22,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:50:22,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:50:22,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:50:22,753 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:50:22,753 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:50:22,753 INFO L87 Difference]: Start difference. First operand 3479 states and 5282 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 2 states have internal predecessors, (106), 0 states have call successors, (0), 0 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-08 23:50:25,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:50:25,973 INFO L93 Difference]: Finished difference Result 8603 states and 12979 transitions. [2025-01-08 23:50:25,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:50:25,974 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 2 states have internal predecessors, (106), 0 states have call successors, (0), 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 106 [2025-01-08 23:50:25,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:50:25,990 INFO L225 Difference]: With dead ends: 8603 [2025-01-08 23:50:25,991 INFO L226 Difference]: Without dead ends: 5126 [2025-01-08 23:50:25,994 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-08 23:50:25,997 INFO L435 NwaCegarLoop]: 943 mSDtfsCounter, 813 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 3283 mSolverCounterSat, 164 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 813 SdHoareTripleChecker+Valid, 1079 SdHoareTripleChecker+Invalid, 3447 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 164 IncrementalHoareTripleChecker+Valid, 3283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2025-01-08 23:50:25,997 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [813 Valid, 1079 Invalid, 3447 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [164 Valid, 3283 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2025-01-08 23:50:26,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5126 states. [2025-01-08 23:50:26,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5126 to 5063. [2025-01-08 23:50:26,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5063 states, 5062 states have (on average 1.454563413670486) internal successors, (7363), 5062 states have internal predecessors, (7363), 0 states have call successors, (0), 0 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-08 23:50:26,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5063 states to 5063 states and 7363 transitions. [2025-01-08 23:50:26,056 INFO L78 Accepts]: Start accepts. Automaton has 5063 states and 7363 transitions. Word has length 106 [2025-01-08 23:50:26,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:50:26,057 INFO L471 AbstractCegarLoop]: Abstraction has 5063 states and 7363 transitions. [2025-01-08 23:50:26,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 2 states have internal predecessors, (106), 0 states have call successors, (0), 0 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-08 23:50:26,057 INFO L276 IsEmpty]: Start isEmpty. Operand 5063 states and 7363 transitions. [2025-01-08 23:50:26,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-01-08 23:50:26,059 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:50:26,060 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 23:50:26,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-08 23:50:26,060 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:50:26,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:50:26,061 INFO L85 PathProgramCache]: Analyzing trace with hash 1146800980, now seen corresponding path program 1 times [2025-01-08 23:50:26,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:50:26,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171866918] [2025-01-08 23:50:26,061 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:50:26,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:50:26,074 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-01-08 23:50:26,084 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-01-08 23:50:26,086 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:50:26,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:50:26,167 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:50:26,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:50:26,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171866918] [2025-01-08 23:50:26,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171866918] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:50:26,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:50:26,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 23:50:26,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350745449] [2025-01-08 23:50:26,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:50:26,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:50:26,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:50:26,171 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:50:26,171 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:50:26,171 INFO L87 Difference]: Start difference. First operand 5063 states and 7363 transitions. Second operand has 3 states, 3 states have (on average 36.0) internal successors, (108), 2 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:50:29,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:50:29,034 INFO L93 Difference]: Finished difference Result 12510 states and 18431 transitions. [2025-01-08 23:50:29,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:50:29,035 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 2 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 108 [2025-01-08 23:50:29,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:50:29,054 INFO L225 Difference]: With dead ends: 12510 [2025-01-08 23:50:29,055 INFO L226 Difference]: Without dead ends: 7449 [2025-01-08 23:50:29,061 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-08 23:50:29,063 INFO L435 NwaCegarLoop]: 1087 mSDtfsCounter, 787 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 2530 mSolverCounterSat, 777 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 787 SdHoareTripleChecker+Valid, 1237 SdHoareTripleChecker+Invalid, 3307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 777 IncrementalHoareTripleChecker+Valid, 2530 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-01-08 23:50:29,064 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [787 Valid, 1237 Invalid, 3307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [777 Valid, 2530 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-01-08 23:50:29,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7449 states. [2025-01-08 23:50:29,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7449 to 7432. [2025-01-08 23:50:29,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7432 states, 7431 states have (on average 1.3080339119903108) internal successors, (9720), 7431 states have internal predecessors, (9720), 0 states have call successors, (0), 0 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-08 23:50:29,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7432 states to 7432 states and 9720 transitions. [2025-01-08 23:50:29,159 INFO L78 Accepts]: Start accepts. Automaton has 7432 states and 9720 transitions. Word has length 108 [2025-01-08 23:50:29,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:50:29,159 INFO L471 AbstractCegarLoop]: Abstraction has 7432 states and 9720 transitions. [2025-01-08 23:50:29,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 2 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:50:29,160 INFO L276 IsEmpty]: Start isEmpty. Operand 7432 states and 9720 transitions. [2025-01-08 23:50:29,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-01-08 23:50:29,162 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:50:29,162 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 23:50:29,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-08 23:50:29,162 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:50:29,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:50:29,162 INFO L85 PathProgramCache]: Analyzing trace with hash 732905225, now seen corresponding path program 1 times [2025-01-08 23:50:29,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:50:29,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871787523] [2025-01-08 23:50:29,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:50:29,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:50:29,179 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-01-08 23:50:29,189 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-01-08 23:50:29,189 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:50:29,190 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:50:29,278 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:50:29,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:50:29,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871787523] [2025-01-08 23:50:29,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871787523] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:50:29,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:50:29,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 23:50:29,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619444674] [2025-01-08 23:50:29,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:50:29,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:50:29,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:50:29,280 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:50:29,280 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:50:29,280 INFO L87 Difference]: Start difference. First operand 7432 states and 9720 transitions. Second operand has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 2 states have internal predecessors, (125), 0 states have call successors, (0), 0 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-08 23:50:32,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:50:32,145 INFO L93 Difference]: Finished difference Result 20402 states and 27075 transitions. [2025-01-08 23:50:32,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:50:32,146 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 2 states have internal predecessors, (125), 0 states have call successors, (0), 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 125 [2025-01-08 23:50:32,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:50:32,172 INFO L225 Difference]: With dead ends: 20402 [2025-01-08 23:50:32,172 INFO L226 Difference]: Without dead ends: 13759 [2025-01-08 23:50:32,176 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-08 23:50:32,176 INFO L435 NwaCegarLoop]: 755 mSDtfsCounter, 932 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 2544 mSolverCounterSat, 769 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 932 SdHoareTripleChecker+Valid, 887 SdHoareTripleChecker+Invalid, 3313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 769 IncrementalHoareTripleChecker+Valid, 2544 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-01-08 23:50:32,177 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [932 Valid, 887 Invalid, 3313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [769 Valid, 2544 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-01-08 23:50:32,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13759 states. [2025-01-08 23:50:32,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13759 to 13751. [2025-01-08 23:50:32,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13751 states, 13750 states have (on average 1.2261090909090908) internal successors, (16859), 13750 states have internal predecessors, (16859), 0 states have call successors, (0), 0 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-08 23:50:32,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13751 states to 13751 states and 16859 transitions. [2025-01-08 23:50:32,316 INFO L78 Accepts]: Start accepts. Automaton has 13751 states and 16859 transitions. Word has length 125 [2025-01-08 23:50:32,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:50:32,317 INFO L471 AbstractCegarLoop]: Abstraction has 13751 states and 16859 transitions. [2025-01-08 23:50:32,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 2 states have internal predecessors, (125), 0 states have call successors, (0), 0 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-08 23:50:32,317 INFO L276 IsEmpty]: Start isEmpty. Operand 13751 states and 16859 transitions. [2025-01-08 23:50:32,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-01-08 23:50:32,318 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:50:32,318 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 23:50:32,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-08 23:50:32,318 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:50:32,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:50:32,318 INFO L85 PathProgramCache]: Analyzing trace with hash -761070714, now seen corresponding path program 1 times [2025-01-08 23:50:32,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:50:32,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007804001] [2025-01-08 23:50:32,320 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:50:32,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:50:32,331 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-01-08 23:50:32,339 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-01-08 23:50:32,339 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:50:32,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:50:32,401 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:50:32,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:50:32,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007804001] [2025-01-08 23:50:32,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007804001] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:50:32,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:50:32,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:50:32,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247030570] [2025-01-08 23:50:32,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:50:32,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:50:32,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:50:32,402 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:50:32,402 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:50:32,402 INFO L87 Difference]: Start difference. First operand 13751 states and 16859 transitions. Second operand has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 0 states have call successors, (0), 0 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-08 23:50:35,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:50:35,951 INFO L93 Difference]: Finished difference Result 33022 states and 41589 transitions. [2025-01-08 23:50:35,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:50:35,953 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 0 states have call successors, (0), 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 128 [2025-01-08 23:50:35,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:50:35,996 INFO L225 Difference]: With dead ends: 33022 [2025-01-08 23:50:35,997 INFO L226 Difference]: Without dead ends: 20060 [2025-01-08 23:50:36,005 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-08 23:50:36,005 INFO L435 NwaCegarLoop]: 1572 mSDtfsCounter, 958 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 2549 mSolverCounterSat, 822 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 958 SdHoareTripleChecker+Valid, 1670 SdHoareTripleChecker+Invalid, 3371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 822 IncrementalHoareTripleChecker+Valid, 2549 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2025-01-08 23:50:36,006 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [958 Valid, 1670 Invalid, 3371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [822 Valid, 2549 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2025-01-08 23:50:36,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20060 states. [2025-01-08 23:50:36,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20060 to 20050. [2025-01-08 23:50:36,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20050 states, 20049 states have (on average 1.2318320115716495) internal successors, (24697), 20049 states have internal predecessors, (24697), 0 states have call successors, (0), 0 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-08 23:50:36,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20050 states to 20050 states and 24697 transitions. [2025-01-08 23:50:36,246 INFO L78 Accepts]: Start accepts. Automaton has 20050 states and 24697 transitions. Word has length 128 [2025-01-08 23:50:36,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:50:36,247 INFO L471 AbstractCegarLoop]: Abstraction has 20050 states and 24697 transitions. [2025-01-08 23:50:36,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 0 states have call successors, (0), 0 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-08 23:50:36,247 INFO L276 IsEmpty]: Start isEmpty. Operand 20050 states and 24697 transitions. [2025-01-08 23:50:36,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-01-08 23:50:36,248 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:50:36,249 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 23:50:36,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-08 23:50:36,249 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:50:36,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:50:36,249 INFO L85 PathProgramCache]: Analyzing trace with hash 1926952842, now seen corresponding path program 1 times [2025-01-08 23:50:36,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:50:36,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525816017] [2025-01-08 23:50:36,250 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:50:36,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:50:36,264 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-01-08 23:50:36,276 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-01-08 23:50:36,276 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:50:36,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:50:36,366 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:50:36,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:50:36,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525816017] [2025-01-08 23:50:36,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525816017] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:50:36,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:50:36,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:50:36,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713702532] [2025-01-08 23:50:36,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:50:36,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:50:36,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:50:36,368 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:50:36,368 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:50:36,368 INFO L87 Difference]: Start difference. First operand 20050 states and 24697 transitions. Second operand has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:50:38,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:50:38,939 INFO L93 Difference]: Finished difference Result 39329 states and 48628 transitions. [2025-01-08 23:50:38,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:50:38,940 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 135 [2025-01-08 23:50:38,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:50:38,972 INFO L225 Difference]: With dead ends: 39329 [2025-01-08 23:50:38,972 INFO L226 Difference]: Without dead ends: 20068 [2025-01-08 23:50:38,989 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-08 23:50:38,991 INFO L435 NwaCegarLoop]: 1319 mSDtfsCounter, 1085 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 2469 mSolverCounterSat, 608 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1085 SdHoareTripleChecker+Valid, 1372 SdHoareTripleChecker+Invalid, 3077 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 608 IncrementalHoareTripleChecker+Valid, 2469 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-01-08 23:50:38,992 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1085 Valid, 1372 Invalid, 3077 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [608 Valid, 2469 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-01-08 23:50:39,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20068 states. [2025-01-08 23:50:39,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20068 to 20050. [2025-01-08 23:50:39,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20050 states, 20049 states have (on average 1.2169185495535937) internal successors, (24398), 20049 states have internal predecessors, (24398), 0 states have call successors, (0), 0 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-08 23:50:39,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20050 states to 20050 states and 24398 transitions. [2025-01-08 23:50:39,156 INFO L78 Accepts]: Start accepts. Automaton has 20050 states and 24398 transitions. Word has length 135 [2025-01-08 23:50:39,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:50:39,156 INFO L471 AbstractCegarLoop]: Abstraction has 20050 states and 24398 transitions. [2025-01-08 23:50:39,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:50:39,156 INFO L276 IsEmpty]: Start isEmpty. Operand 20050 states and 24398 transitions. [2025-01-08 23:50:39,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2025-01-08 23:50:39,159 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:50:39,159 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-08 23:50:39,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-08 23:50:39,160 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:50:39,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:50:39,160 INFO L85 PathProgramCache]: Analyzing trace with hash 884000506, now seen corresponding path program 1 times [2025-01-08 23:50:39,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:50:39,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966082088] [2025-01-08 23:50:39,161 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:50:39,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:50:39,177 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 210 statements into 1 equivalence classes. [2025-01-08 23:50:39,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 210 of 210 statements. [2025-01-08 23:50:39,186 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:50:39,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:50:39,395 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-01-08 23:50:39,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:50:39,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966082088] [2025-01-08 23:50:39,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966082088] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:50:39,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:50:39,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 23:50:39,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854658480] [2025-01-08 23:50:39,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:50:39,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:50:39,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:50:39,397 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:50:39,397 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:50:39,397 INFO L87 Difference]: Start difference. First operand 20050 states and 24398 transitions. Second operand has 3 states, 3 states have (on average 58.0) internal successors, (174), 2 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:50:41,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:50:41,772 INFO L93 Difference]: Finished difference Result 39311 states and 47997 transitions. [2025-01-08 23:50:41,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:50:41,772 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.0) internal successors, (174), 2 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 210 [2025-01-08 23:50:41,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:50:41,814 INFO L225 Difference]: With dead ends: 39311 [2025-01-08 23:50:41,815 INFO L226 Difference]: Without dead ends: 20050 [2025-01-08 23:50:41,840 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-08 23:50:41,844 INFO L435 NwaCegarLoop]: 1077 mSDtfsCounter, 700 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 2514 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 700 SdHoareTripleChecker+Valid, 1206 SdHoareTripleChecker+Invalid, 2518 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 2514 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-01-08 23:50:41,844 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [700 Valid, 1206 Invalid, 2518 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 2514 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-01-08 23:50:41,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20050 states. [2025-01-08 23:50:41,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20050 to 20050. [2025-01-08 23:50:42,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20050 states, 20049 states have (on average 1.2166691605566362) internal successors, (24393), 20049 states have internal predecessors, (24393), 0 states have call successors, (0), 0 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-08 23:50:42,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20050 states to 20050 states and 24393 transitions. [2025-01-08 23:50:42,022 INFO L78 Accepts]: Start accepts. Automaton has 20050 states and 24393 transitions. Word has length 210 [2025-01-08 23:50:42,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:50:42,023 INFO L471 AbstractCegarLoop]: Abstraction has 20050 states and 24393 transitions. [2025-01-08 23:50:42,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.0) internal successors, (174), 2 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:50:42,023 INFO L276 IsEmpty]: Start isEmpty. Operand 20050 states and 24393 transitions. [2025-01-08 23:50:42,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2025-01-08 23:50:42,025 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:50:42,025 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-08 23:50:42,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-08 23:50:42,025 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:50:42,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:50:42,026 INFO L85 PathProgramCache]: Analyzing trace with hash 628173310, now seen corresponding path program 1 times [2025-01-08 23:50:42,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:50:42,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058818057] [2025-01-08 23:50:42,026 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:50:42,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:50:42,039 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 217 statements into 1 equivalence classes. [2025-01-08 23:50:42,049 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 217 of 217 statements. [2025-01-08 23:50:42,049 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:50:42,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:50:42,128 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:50:42,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:50:42,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058818057] [2025-01-08 23:50:42,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058818057] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:50:42,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:50:42,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:50:42,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392817298] [2025-01-08 23:50:42,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:50:42,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:50:42,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:50:42,129 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:50:42,129 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:50:42,129 INFO L87 Difference]: Start difference. First operand 20050 states and 24393 transitions. Second operand has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 3 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:50:44,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:50:44,644 INFO L93 Difference]: Finished difference Result 39321 states and 48009 transitions. [2025-01-08 23:50:44,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:50:44,644 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 3 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 217 [2025-01-08 23:50:44,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:50:44,665 INFO L225 Difference]: With dead ends: 39321 [2025-01-08 23:50:44,665 INFO L226 Difference]: Without dead ends: 20060 [2025-01-08 23:50:44,678 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-08 23:50:44,680 INFO L435 NwaCegarLoop]: 812 mSDtfsCounter, 887 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 2381 mSolverCounterSat, 764 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 887 SdHoareTripleChecker+Valid, 930 SdHoareTripleChecker+Invalid, 3145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 764 IncrementalHoareTripleChecker+Valid, 2381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-01-08 23:50:44,680 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [887 Valid, 930 Invalid, 3145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [764 Valid, 2381 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-01-08 23:50:44,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20060 states. [2025-01-08 23:50:44,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20060 to 20050. [2025-01-08 23:50:44,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20050 states, 20049 states have (on average 1.1535737443264003) internal successors, (23128), 20049 states have internal predecessors, (23128), 0 states have call successors, (0), 0 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-08 23:50:44,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20050 states to 20050 states and 23128 transitions. [2025-01-08 23:50:44,908 INFO L78 Accepts]: Start accepts. Automaton has 20050 states and 23128 transitions. Word has length 217 [2025-01-08 23:50:44,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:50:44,909 INFO L471 AbstractCegarLoop]: Abstraction has 20050 states and 23128 transitions. [2025-01-08 23:50:44,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 3 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:50:44,909 INFO L276 IsEmpty]: Start isEmpty. Operand 20050 states and 23128 transitions. [2025-01-08 23:50:44,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2025-01-08 23:50:44,912 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:50:44,912 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:50:44,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-08 23:50:44,913 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:50:44,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:50:44,914 INFO L85 PathProgramCache]: Analyzing trace with hash 647735996, now seen corresponding path program 1 times [2025-01-08 23:50:44,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:50:44,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951789059] [2025-01-08 23:50:44,914 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:50:44,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:50:44,935 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 306 statements into 1 equivalence classes. [2025-01-08 23:50:44,947 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 306 of 306 statements. [2025-01-08 23:50:44,947 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:50:44,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:50:45,063 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 273 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2025-01-08 23:50:45,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:50:45,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951789059] [2025-01-08 23:50:45,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951789059] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:50:45,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:50:45,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:50:45,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300889356] [2025-01-08 23:50:45,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:50:45,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:50:45,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:50:45,063 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:50:45,064 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:50:45,064 INFO L87 Difference]: Start difference. First operand 20050 states and 23128 transitions. Second operand has 3 states, 3 states have (on average 73.0) internal successors, (219), 3 states have internal predecessors, (219), 0 states have call successors, (0), 0 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-08 23:50:48,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:50:48,033 INFO L93 Difference]: Finished difference Result 45630 states and 53337 transitions. [2025-01-08 23:50:48,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:50:48,033 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 73.0) internal successors, (219), 3 states have internal predecessors, (219), 0 states have call successors, (0), 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 306 [2025-01-08 23:50:48,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:50:48,056 INFO L225 Difference]: With dead ends: 45630 [2025-01-08 23:50:48,056 INFO L226 Difference]: Without dead ends: 26369 [2025-01-08 23:50:48,069 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-08 23:50:48,070 INFO L435 NwaCegarLoop]: 701 mSDtfsCounter, 968 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 2383 mSolverCounterSat, 844 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 968 SdHoareTripleChecker+Valid, 789 SdHoareTripleChecker+Invalid, 3227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 844 IncrementalHoareTripleChecker+Valid, 2383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-01-08 23:50:48,070 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [968 Valid, 789 Invalid, 3227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [844 Valid, 2383 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-01-08 23:50:48,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26369 states. [2025-01-08 23:50:48,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26369 to 26357. [2025-01-08 23:50:48,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26357 states, 26356 states have (on average 1.145204128092275) internal successors, (30183), 26356 states have internal predecessors, (30183), 0 states have call successors, (0), 0 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-08 23:50:48,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26357 states to 26357 states and 30183 transitions. [2025-01-08 23:50:48,246 INFO L78 Accepts]: Start accepts. Automaton has 26357 states and 30183 transitions. Word has length 306 [2025-01-08 23:50:48,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:50:48,246 INFO L471 AbstractCegarLoop]: Abstraction has 26357 states and 30183 transitions. [2025-01-08 23:50:48,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 73.0) internal successors, (219), 3 states have internal predecessors, (219), 0 states have call successors, (0), 0 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-08 23:50:48,246 INFO L276 IsEmpty]: Start isEmpty. Operand 26357 states and 30183 transitions. [2025-01-08 23:50:48,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 359 [2025-01-08 23:50:48,251 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:50:48,251 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:50:48,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-08 23:50:48,251 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:50:48,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:50:48,252 INFO L85 PathProgramCache]: Analyzing trace with hash 1253125304, now seen corresponding path program 1 times [2025-01-08 23:50:48,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:50:48,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797265918] [2025-01-08 23:50:48,252 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:50:48,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:50:48,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 358 statements into 1 equivalence classes. [2025-01-08 23:50:48,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 358 of 358 statements. [2025-01-08 23:50:48,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:50:48,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:50:48,783 INFO L134 CoverageAnalysis]: Checked inductivity of 407 backedges. 345 proven. 25 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-01-08 23:50:48,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:50:48,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797265918] [2025-01-08 23:50:48,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797265918] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 23:50:48,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [17374308] [2025-01-08 23:50:48,783 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:50:48,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:50:48,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:50:48,786 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-08 23:50:48,790 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-08 23:50:48,866 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 358 statements into 1 equivalence classes. [2025-01-08 23:50:48,929 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 358 of 358 statements. [2025-01-08 23:50:48,929 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:50:48,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:50:48,932 INFO L256 TraceCheckSpWp]: Trace formula consists of 488 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-08 23:50:48,940 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 23:50:49,089 INFO L134 CoverageAnalysis]: Checked inductivity of 407 backedges. 312 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2025-01-08 23:50:49,090 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 23:50:49,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [17374308] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:50:49,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 23:50:49,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-01-08 23:50:49,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972837485] [2025-01-08 23:50:49,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:50:49,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:50:49,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:50:49,091 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:50:49,091 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-08 23:50:49,091 INFO L87 Difference]: Start difference. First operand 26357 states and 30183 transitions. Second operand has 3 states, 3 states have (on average 88.0) internal successors, (264), 3 states have internal predecessors, (264), 0 states have call successors, (0), 0 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-08 23:50:51,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:50:51,844 INFO L93 Difference]: Finished difference Result 60575 states and 70087 transitions. [2025-01-08 23:50:51,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:50:51,845 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 88.0) internal successors, (264), 3 states have internal predecessors, (264), 0 states have call successors, (0), 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 358 [2025-01-08 23:50:51,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:50:51,877 INFO L225 Difference]: With dead ends: 60575 [2025-01-08 23:50:51,877 INFO L226 Difference]: Without dead ends: 35007 [2025-01-08 23:50:51,896 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 361 GetRequests, 357 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-08 23:50:51,896 INFO L435 NwaCegarLoop]: 417 mSDtfsCounter, 1228 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 2268 mSolverCounterSat, 1179 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1228 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 3447 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1179 IncrementalHoareTripleChecker+Valid, 2268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-01-08 23:50:51,896 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1228 Valid, 438 Invalid, 3447 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1179 Valid, 2268 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-01-08 23:50:51,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35007 states. [2025-01-08 23:50:52,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35007 to 35007. [2025-01-08 23:50:52,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35007 states, 35006 states have (on average 1.148745929269268) internal successors, (40213), 35006 states have internal predecessors, (40213), 0 states have call successors, (0), 0 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-08 23:50:52,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35007 states to 35007 states and 40213 transitions. [2025-01-08 23:50:52,181 INFO L78 Accepts]: Start accepts. Automaton has 35007 states and 40213 transitions. Word has length 358 [2025-01-08 23:50:52,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:50:52,182 INFO L471 AbstractCegarLoop]: Abstraction has 35007 states and 40213 transitions. [2025-01-08 23:50:52,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 88.0) internal successors, (264), 3 states have internal predecessors, (264), 0 states have call successors, (0), 0 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-08 23:50:52,182 INFO L276 IsEmpty]: Start isEmpty. Operand 35007 states and 40213 transitions. [2025-01-08 23:50:52,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 366 [2025-01-08 23:50:52,185 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:50:52,186 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:50:52,196 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-08 23:50:52,386 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,SelfDestructingSolverStorable10 [2025-01-08 23:50:52,387 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:50:52,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:50:52,388 INFO L85 PathProgramCache]: Analyzing trace with hash -1813290472, now seen corresponding path program 1 times [2025-01-08 23:50:52,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:50:52,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353471414] [2025-01-08 23:50:52,388 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:50:52,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:50:52,414 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 365 statements into 1 equivalence classes. [2025-01-08 23:50:52,428 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 365 of 365 statements. [2025-01-08 23:50:52,429 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:50:52,429 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:50:52,844 INFO L134 CoverageAnalysis]: Checked inductivity of 412 backedges. 350 proven. 25 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-01-08 23:50:52,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:50:52,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353471414] [2025-01-08 23:50:52,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353471414] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 23:50:52,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [604160479] [2025-01-08 23:50:52,845 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:50:52,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:50:52,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:50:52,847 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-08 23:50:52,848 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-08 23:50:52,890 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 365 statements into 1 equivalence classes. [2025-01-08 23:50:52,942 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 365 of 365 statements. [2025-01-08 23:50:52,943 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:50:52,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:50:52,944 INFO L256 TraceCheckSpWp]: Trace formula consists of 495 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-08 23:50:52,950 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 23:50:53,097 INFO L134 CoverageAnalysis]: Checked inductivity of 412 backedges. 280 proven. 0 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2025-01-08 23:50:53,097 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 23:50:53,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [604160479] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:50:53,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 23:50:53,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-01-08 23:50:53,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991710465] [2025-01-08 23:50:53,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:50:53,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:50:53,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:50:53,099 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:50:53,100 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-08 23:50:53,100 INFO L87 Difference]: Start difference. First operand 35007 states and 40213 transitions. Second operand has 3 states, 3 states have (on average 78.33333333333333) internal successors, (235), 3 states have internal predecessors, (235), 0 states have call successors, (0), 0 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-08 23:50:56,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:50:56,202 INFO L93 Difference]: Finished difference Result 69223 states and 79631 transitions. [2025-01-08 23:50:56,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:50:56,203 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 78.33333333333333) internal successors, (235), 3 states have internal predecessors, (235), 0 states have call successors, (0), 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 365 [2025-01-08 23:50:56,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:50:56,236 INFO L225 Difference]: With dead ends: 69223 [2025-01-08 23:50:56,236 INFO L226 Difference]: Without dead ends: 35005 [2025-01-08 23:50:56,252 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 368 GetRequests, 364 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-08 23:50:56,253 INFO L435 NwaCegarLoop]: 1370 mSDtfsCounter, 1095 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 2462 mSolverCounterSat, 449 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1095 SdHoareTripleChecker+Valid, 1452 SdHoareTripleChecker+Invalid, 2911 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 449 IncrementalHoareTripleChecker+Valid, 2462 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2025-01-08 23:50:56,253 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1095 Valid, 1452 Invalid, 2911 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [449 Valid, 2462 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2025-01-08 23:50:56,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35005 states. [2025-01-08 23:50:56,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35005 to 35004. [2025-01-08 23:50:56,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35004 states, 35003 states have (on average 1.1105905208125018) internal successors, (38874), 35003 states have internal predecessors, (38874), 0 states have call successors, (0), 0 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-08 23:50:56,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35004 states to 35004 states and 38874 transitions. [2025-01-08 23:50:56,608 INFO L78 Accepts]: Start accepts. Automaton has 35004 states and 38874 transitions. Word has length 365 [2025-01-08 23:50:56,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:50:56,609 INFO L471 AbstractCegarLoop]: Abstraction has 35004 states and 38874 transitions. [2025-01-08 23:50:56,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 78.33333333333333) internal successors, (235), 3 states have internal predecessors, (235), 0 states have call successors, (0), 0 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-08 23:50:56,609 INFO L276 IsEmpty]: Start isEmpty. Operand 35004 states and 38874 transitions. [2025-01-08 23:50:56,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 367 [2025-01-08 23:50:56,612 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:50:56,613 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 23:50:56,619 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-08 23:50:56,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:50:56,814 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:50:56,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:50:56,814 INFO L85 PathProgramCache]: Analyzing trace with hash 474780796, now seen corresponding path program 1 times [2025-01-08 23:50:56,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:50:56,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291907997] [2025-01-08 23:50:56,814 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:50:56,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:50:56,833 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 366 statements into 1 equivalence classes. [2025-01-08 23:50:56,846 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 366 of 366 statements. [2025-01-08 23:50:56,846 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:50:56,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:50:56,994 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2025-01-08 23:50:56,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:50:56,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291907997] [2025-01-08 23:50:56,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291907997] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:50:56,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:50:56,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:50:56,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118922988] [2025-01-08 23:50:56,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:50:56,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:50:56,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:50:56,995 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:50:56,995 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:50:56,995 INFO L87 Difference]: Start difference. First operand 35004 states and 38874 transitions. Second operand has 3 states, 3 states have (on average 61.333333333333336) internal successors, (184), 3 states have internal predecessors, (184), 0 states have call successors, (0), 0 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-08 23:51:00,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:51:00,879 INFO L93 Difference]: Finished difference Result 83498 states and 92927 transitions. [2025-01-08 23:51:00,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:51:00,880 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 61.333333333333336) internal successors, (184), 3 states have internal predecessors, (184), 0 states have call successors, (0), 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 366 [2025-01-08 23:51:00,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:51:00,935 INFO L225 Difference]: With dead ends: 83498 [2025-01-08 23:51:00,936 INFO L226 Difference]: Without dead ends: 49283 [2025-01-08 23:51:00,962 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-08 23:51:00,963 INFO L435 NwaCegarLoop]: 537 mSDtfsCounter, 970 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 2988 mSolverCounterSat, 764 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 970 SdHoareTripleChecker+Valid, 638 SdHoareTripleChecker+Invalid, 3752 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 764 IncrementalHoareTripleChecker+Valid, 2988 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2025-01-08 23:51:00,963 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [970 Valid, 638 Invalid, 3752 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [764 Valid, 2988 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2025-01-08 23:51:00,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49283 states. [2025-01-08 23:51:01,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49283 to 48417. [2025-01-08 23:51:01,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48417 states, 48416 states have (on average 1.1117605750165234) internal successors, (53827), 48416 states have internal predecessors, (53827), 0 states have call successors, (0), 0 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-08 23:51:01,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48417 states to 48417 states and 53827 transitions. [2025-01-08 23:51:01,438 INFO L78 Accepts]: Start accepts. Automaton has 48417 states and 53827 transitions. Word has length 366 [2025-01-08 23:51:01,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:51:01,438 INFO L471 AbstractCegarLoop]: Abstraction has 48417 states and 53827 transitions. [2025-01-08 23:51:01,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 61.333333333333336) internal successors, (184), 3 states have internal predecessors, (184), 0 states have call successors, (0), 0 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-08 23:51:01,438 INFO L276 IsEmpty]: Start isEmpty. Operand 48417 states and 53827 transitions. [2025-01-08 23:51:01,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 384 [2025-01-08 23:51:01,449 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:51:01,450 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 23:51:01,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-08 23:51:01,450 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:51:01,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:51:01,450 INFO L85 PathProgramCache]: Analyzing trace with hash -1648440900, now seen corresponding path program 1 times [2025-01-08 23:51:01,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:51:01,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213752247] [2025-01-08 23:51:01,450 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:51:01,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:51:01,492 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 383 statements into 1 equivalence classes. [2025-01-08 23:51:01,515 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 383 of 383 statements. [2025-01-08 23:51:01,515 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:51:01,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:51:01,841 INFO L134 CoverageAnalysis]: Checked inductivity of 368 backedges. 331 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-01-08 23:51:01,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:51:01,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213752247] [2025-01-08 23:51:01,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213752247] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:51:01,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:51:01,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:51:01,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860123248] [2025-01-08 23:51:01,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:51:01,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:51:01,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:51:01,842 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:51:01,842 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:51:01,842 INFO L87 Difference]: Start difference. First operand 48417 states and 53827 transitions. Second operand has 3 states, 3 states have (on average 115.66666666666667) internal successors, (347), 3 states have internal predecessors, (347), 0 states have call successors, (0), 0 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-08 23:51:04,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:51:04,491 INFO L93 Difference]: Finished difference Result 96072 states and 106908 transitions. [2025-01-08 23:51:04,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:51:04,492 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 115.66666666666667) internal successors, (347), 3 states have internal predecessors, (347), 0 states have call successors, (0), 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 383 [2025-01-08 23:51:04,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:51:04,545 INFO L225 Difference]: With dead ends: 96072 [2025-01-08 23:51:04,545 INFO L226 Difference]: Without dead ends: 48444 [2025-01-08 23:51:04,574 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-08 23:51:04,575 INFO L435 NwaCegarLoop]: 1746 mSDtfsCounter, 727 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 2524 mSolverCounterSat, 190 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 727 SdHoareTripleChecker+Valid, 1885 SdHoareTripleChecker+Invalid, 2714 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 190 IncrementalHoareTripleChecker+Valid, 2524 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-01-08 23:51:04,575 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [727 Valid, 1885 Invalid, 2714 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [190 Valid, 2524 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-01-08 23:51:04,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48444 states. [2025-01-08 23:51:04,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48444 to 47628. [2025-01-08 23:51:05,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47628 states, 47627 states have (on average 1.1085518718374032) internal successors, (52797), 47627 states have internal predecessors, (52797), 0 states have call successors, (0), 0 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-08 23:51:05,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47628 states to 47628 states and 52797 transitions. [2025-01-08 23:51:05,054 INFO L78 Accepts]: Start accepts. Automaton has 47628 states and 52797 transitions. Word has length 383 [2025-01-08 23:51:05,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:51:05,054 INFO L471 AbstractCegarLoop]: Abstraction has 47628 states and 52797 transitions. [2025-01-08 23:51:05,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 115.66666666666667) internal successors, (347), 3 states have internal predecessors, (347), 0 states have call successors, (0), 0 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-08 23:51:05,054 INFO L276 IsEmpty]: Start isEmpty. Operand 47628 states and 52797 transitions. [2025-01-08 23:51:05,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 413 [2025-01-08 23:51:05,059 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:51:05,059 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 23:51:05,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-08 23:51:05,059 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:51:05,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:51:05,060 INFO L85 PathProgramCache]: Analyzing trace with hash 639358297, now seen corresponding path program 1 times [2025-01-08 23:51:05,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:51:05,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861269738] [2025-01-08 23:51:05,060 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:51:05,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:51:05,080 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 412 statements into 1 equivalence classes. [2025-01-08 23:51:05,093 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 412 of 412 statements. [2025-01-08 23:51:05,093 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:51:05,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:51:05,200 INFO L134 CoverageAnalysis]: Checked inductivity of 397 backedges. 273 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2025-01-08 23:51:05,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:51:05,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861269738] [2025-01-08 23:51:05,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861269738] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:51:05,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:51:05,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:51:05,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036927308] [2025-01-08 23:51:05,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:51:05,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:51:05,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:51:05,201 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:51:05,201 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:51:05,201 INFO L87 Difference]: Start difference. First operand 47628 states and 52797 transitions. Second operand has 3 states, 3 states have (on average 96.33333333333333) internal successors, (289), 3 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:51:08,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:51:08,201 INFO L93 Difference]: Finished difference Result 103915 states and 115866 transitions. [2025-01-08 23:51:08,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:51:08,201 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 96.33333333333333) internal successors, (289), 3 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 412 [2025-01-08 23:51:08,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:51:08,264 INFO L225 Difference]: With dead ends: 103915 [2025-01-08 23:51:08,264 INFO L226 Difference]: Without dead ends: 57076 [2025-01-08 23:51:08,296 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-08 23:51:08,297 INFO L435 NwaCegarLoop]: 1768 mSDtfsCounter, 779 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 2502 mSolverCounterSat, 444 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 779 SdHoareTripleChecker+Valid, 1918 SdHoareTripleChecker+Invalid, 2946 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 444 IncrementalHoareTripleChecker+Valid, 2502 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-01-08 23:51:08,297 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [779 Valid, 1918 Invalid, 2946 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [444 Valid, 2502 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-01-08 23:51:08,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57076 states. [2025-01-08 23:51:08,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57076 to 57070. [2025-01-08 23:51:08,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57070 states, 57069 states have (on average 1.102086947379488) internal successors, (62895), 57069 states have internal predecessors, (62895), 0 states have call successors, (0), 0 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-08 23:51:08,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57070 states to 57070 states and 62895 transitions. [2025-01-08 23:51:08,952 INFO L78 Accepts]: Start accepts. Automaton has 57070 states and 62895 transitions. Word has length 412 [2025-01-08 23:51:08,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:51:08,953 INFO L471 AbstractCegarLoop]: Abstraction has 57070 states and 62895 transitions. [2025-01-08 23:51:08,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 96.33333333333333) internal successors, (289), 3 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:51:08,953 INFO L276 IsEmpty]: Start isEmpty. Operand 57070 states and 62895 transitions. [2025-01-08 23:51:08,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 434 [2025-01-08 23:51:08,959 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:51:08,960 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, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 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] [2025-01-08 23:51:08,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-08 23:51:08,960 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:51:08,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:51:08,961 INFO L85 PathProgramCache]: Analyzing trace with hash 300582121, now seen corresponding path program 1 times [2025-01-08 23:51:08,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:51:08,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123981197] [2025-01-08 23:51:08,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:51:08,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:51:08,985 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 433 statements into 1 equivalence classes. [2025-01-08 23:51:09,000 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 433 of 433 statements. [2025-01-08 23:51:09,001 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:51:09,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:51:10,040 INFO L134 CoverageAnalysis]: Checked inductivity of 632 backedges. 377 proven. 113 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2025-01-08 23:51:10,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:51:10,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123981197] [2025-01-08 23:51:10,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123981197] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 23:51:10,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [762316784] [2025-01-08 23:51:10,040 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:51:10,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:51:10,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:51:10,042 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-08 23:51:10,044 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-08 23:51:10,108 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 433 statements into 1 equivalence classes. [2025-01-08 23:51:10,179 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 433 of 433 statements. [2025-01-08 23:51:10,180 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:51:10,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:51:10,181 INFO L256 TraceCheckSpWp]: Trace formula consists of 596 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-08 23:51:10,186 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 23:51:11,026 INFO L134 CoverageAnalysis]: Checked inductivity of 632 backedges. 377 proven. 0 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2025-01-08 23:51:11,026 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 23:51:11,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [762316784] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:51:11,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 23:51:11,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [7] total 8 [2025-01-08 23:51:11,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123687928] [2025-01-08 23:51:11,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:51:11,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:51:11,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:51:11,027 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:51:11,027 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-08 23:51:11,027 INFO L87 Difference]: Start difference. First operand 57070 states and 62895 transitions. Second operand has 3 states, 3 states have (on average 72.66666666666667) internal successors, (218), 2 states have internal predecessors, (218), 0 states have call successors, (0), 0 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-08 23:51:13,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:51:13,390 INFO L93 Difference]: Finished difference Result 116507 states and 128312 transitions. [2025-01-08 23:51:13,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:51:13,390 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 72.66666666666667) internal successors, (218), 2 states have internal predecessors, (218), 0 states have call successors, (0), 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 433 [2025-01-08 23:51:13,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:51:13,457 INFO L225 Difference]: With dead ends: 116507 [2025-01-08 23:51:13,457 INFO L226 Difference]: Without dead ends: 60226 [2025-01-08 23:51:13,489 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 439 GetRequests, 432 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-08 23:51:13,489 INFO L435 NwaCegarLoop]: 1017 mSDtfsCounter, 684 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 2450 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 684 SdHoareTripleChecker+Valid, 1152 SdHoareTripleChecker+Invalid, 2564 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 2450 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-01-08 23:51:13,490 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [684 Valid, 1152 Invalid, 2564 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 2450 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-01-08 23:51:13,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60226 states. [2025-01-08 23:51:14,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60226 to 60220. [2025-01-08 23:51:14,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60220 states, 60219 states have (on average 1.098938873113137) internal successors, (66177), 60219 states have internal predecessors, (66177), 0 states have call successors, (0), 0 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-08 23:51:14,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60220 states to 60220 states and 66177 transitions. [2025-01-08 23:51:14,255 INFO L78 Accepts]: Start accepts. Automaton has 60220 states and 66177 transitions. Word has length 433 [2025-01-08 23:51:14,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:51:14,259 INFO L471 AbstractCegarLoop]: Abstraction has 60220 states and 66177 transitions. [2025-01-08 23:51:14,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.66666666666667) internal successors, (218), 2 states have internal predecessors, (218), 0 states have call successors, (0), 0 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-08 23:51:14,259 INFO L276 IsEmpty]: Start isEmpty. Operand 60220 states and 66177 transitions. [2025-01-08 23:51:14,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 456 [2025-01-08 23:51:14,264 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:51:14,264 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2025-01-08 23:51:14,270 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-08 23:51:14,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:51:14,469 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:51:14,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:51:14,470 INFO L85 PathProgramCache]: Analyzing trace with hash -818980650, now seen corresponding path program 1 times [2025-01-08 23:51:14,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:51:14,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454813448] [2025-01-08 23:51:14,471 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:51:14,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:51:14,497 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 455 statements into 1 equivalence classes. [2025-01-08 23:51:14,526 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 455 of 455 statements. [2025-01-08 23:51:14,526 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:51:14,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:51:14,851 INFO L134 CoverageAnalysis]: Checked inductivity of 733 backedges. 559 proven. 0 refuted. 0 times theorem prover too weak. 174 trivial. 0 not checked. [2025-01-08 23:51:14,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:51:14,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454813448] [2025-01-08 23:51:14,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454813448] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:51:14,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:51:14,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:51:14,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316057143] [2025-01-08 23:51:14,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:51:14,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 23:51:14,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:51:14,853 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 23:51:14,853 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:51:14,853 INFO L87 Difference]: Start difference. First operand 60220 states and 66177 transitions. Second operand has 4 states, 4 states have (on average 80.0) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 0 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-08 23:51:20,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:51:20,217 INFO L93 Difference]: Finished difference Result 167854 states and 184931 transitions. [2025-01-08 23:51:20,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 23:51:20,218 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 80.0) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 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 455 [2025-01-08 23:51:20,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:51:20,346 INFO L225 Difference]: With dead ends: 167854 [2025-01-08 23:51:20,346 INFO L226 Difference]: Without dead ends: 108423 [2025-01-08 23:51:20,381 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-08 23:51:20,382 INFO L435 NwaCegarLoop]: 567 mSDtfsCounter, 1715 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 5907 mSolverCounterSat, 1094 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1715 SdHoareTripleChecker+Valid, 765 SdHoareTripleChecker+Invalid, 7001 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1094 IncrementalHoareTripleChecker+Valid, 5907 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2025-01-08 23:51:20,382 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1715 Valid, 765 Invalid, 7001 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1094 Valid, 5907 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2025-01-08 23:51:20,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108423 states. [2025-01-08 23:51:21,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108423 to 107525. [2025-01-08 23:51:21,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107525 states, 107524 states have (on average 1.0946486365834605) internal successors, (117701), 107524 states have internal predecessors, (117701), 0 states have call successors, (0), 0 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-08 23:51:21,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107525 states to 107525 states and 117701 transitions. [2025-01-08 23:51:21,683 INFO L78 Accepts]: Start accepts. Automaton has 107525 states and 117701 transitions. Word has length 455 [2025-01-08 23:51:21,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:51:21,684 INFO L471 AbstractCegarLoop]: Abstraction has 107525 states and 117701 transitions. [2025-01-08 23:51:21,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 80.0) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 0 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-08 23:51:21,684 INFO L276 IsEmpty]: Start isEmpty. Operand 107525 states and 117701 transitions. [2025-01-08 23:51:21,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 484 [2025-01-08 23:51:21,694 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:51:21,694 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, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-01-08 23:51:21,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-08 23:51:21,694 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:51:21,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:51:21,695 INFO L85 PathProgramCache]: Analyzing trace with hash -1286271573, now seen corresponding path program 1 times [2025-01-08 23:51:21,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:51:21,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345638218] [2025-01-08 23:51:21,695 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:51:21,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:51:21,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 483 statements into 1 equivalence classes. [2025-01-08 23:51:21,780 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 483 of 483 statements. [2025-01-08 23:51:21,780 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:51:21,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:51:22,161 INFO L134 CoverageAnalysis]: Checked inductivity of 941 backedges. 184 proven. 0 refuted. 0 times theorem prover too weak. 757 trivial. 0 not checked. [2025-01-08 23:51:22,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:51:22,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345638218] [2025-01-08 23:51:22,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345638218] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:51:22,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:51:22,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:51:22,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486490922] [2025-01-08 23:51:22,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:51:22,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:51:22,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:51:22,162 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:51:22,164 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:51:22,164 INFO L87 Difference]: Start difference. First operand 107525 states and 117701 transitions. Second operand has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:51:25,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:51:25,461 INFO L93 Difference]: Finished difference Result 254400 states and 279480 transitions. [2025-01-08 23:51:25,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:51:25,462 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 483 [2025-01-08 23:51:25,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:51:25,618 INFO L225 Difference]: With dead ends: 254400 [2025-01-08 23:51:25,619 INFO L226 Difference]: Without dead ends: 147664 [2025-01-08 23:51:25,681 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-08 23:51:25,681 INFO L435 NwaCegarLoop]: 1588 mSDtfsCounter, 844 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 2831 mSolverCounterSat, 490 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 844 SdHoareTripleChecker+Valid, 1753 SdHoareTripleChecker+Invalid, 3321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 490 IncrementalHoareTripleChecker+Valid, 2831 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-01-08 23:51:25,681 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [844 Valid, 1753 Invalid, 3321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [490 Valid, 2831 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-01-08 23:51:25,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147664 states. [2025-01-08 23:51:27,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147664 to 147664. [2025-01-08 23:51:27,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147664 states, 147663 states have (on average 1.0892166622647514) internal successors, (160837), 147663 states have internal predecessors, (160837), 0 states have call successors, (0), 0 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-08 23:51:27,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147664 states to 147664 states and 160837 transitions. [2025-01-08 23:51:27,325 INFO L78 Accepts]: Start accepts. Automaton has 147664 states and 160837 transitions. Word has length 483 [2025-01-08 23:51:27,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:51:27,325 INFO L471 AbstractCegarLoop]: Abstraction has 147664 states and 160837 transitions. [2025-01-08 23:51:27,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:51:27,326 INFO L276 IsEmpty]: Start isEmpty. Operand 147664 states and 160837 transitions. [2025-01-08 23:51:27,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 501 [2025-01-08 23:51:27,333 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:51:27,334 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 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] [2025-01-08 23:51:27,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-08 23:51:27,334 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:51:27,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:51:27,335 INFO L85 PathProgramCache]: Analyzing trace with hash 1302571978, now seen corresponding path program 1 times [2025-01-08 23:51:27,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:51:27,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122956140] [2025-01-08 23:51:27,335 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:51:27,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:51:27,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 500 statements into 1 equivalence classes. [2025-01-08 23:51:27,387 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 500 of 500 statements. [2025-01-08 23:51:27,387 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:51:27,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:51:28,198 INFO L134 CoverageAnalysis]: Checked inductivity of 1009 backedges. 747 proven. 50 refuted. 0 times theorem prover too weak. 212 trivial. 0 not checked. [2025-01-08 23:51:28,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:51:28,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122956140] [2025-01-08 23:51:28,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122956140] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 23:51:28,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2042555578] [2025-01-08 23:51:28,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:51:28,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:51:28,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:51:28,202 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 23:51:28,205 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-08 23:51:28,255 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 500 statements into 1 equivalence classes. [2025-01-08 23:51:28,329 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 500 of 500 statements. [2025-01-08 23:51:28,329 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:51:28,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:51:28,332 INFO L256 TraceCheckSpWp]: Trace formula consists of 686 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-08 23:51:28,341 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 23:51:28,766 INFO L134 CoverageAnalysis]: Checked inductivity of 1009 backedges. 771 proven. 0 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2025-01-08 23:51:28,766 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 23:51:28,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2042555578] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:51:28,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 23:51:28,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-01-08 23:51:28,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032978205] [2025-01-08 23:51:28,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:51:28,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:51:28,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:51:28,768 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:51:28,768 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-08 23:51:28,768 INFO L87 Difference]: Start difference. First operand 147664 states and 160837 transitions. Second operand has 3 states, 3 states have (on average 100.66666666666667) internal successors, (302), 3 states have internal predecessors, (302), 0 states have call successors, (0), 0 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-08 23:51:32,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:51:32,763 INFO L93 Difference]: Finished difference Result 359860 states and 392634 transitions. [2025-01-08 23:51:32,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:51:32,763 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 100.66666666666667) internal successors, (302), 3 states have internal predecessors, (302), 0 states have call successors, (0), 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 500 [2025-01-08 23:51:32,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:51:33,013 INFO L225 Difference]: With dead ends: 359860 [2025-01-08 23:51:33,014 INFO L226 Difference]: Without dead ends: 212985 [2025-01-08 23:51:33,082 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 503 GetRequests, 499 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-08 23:51:33,083 INFO L435 NwaCegarLoop]: 990 mSDtfsCounter, 726 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 2489 mSolverCounterSat, 676 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 726 SdHoareTripleChecker+Valid, 1161 SdHoareTripleChecker+Invalid, 3165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 676 IncrementalHoareTripleChecker+Valid, 2489 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2025-01-08 23:51:33,083 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [726 Valid, 1161 Invalid, 3165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [676 Valid, 2489 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2025-01-08 23:51:33,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212985 states. [2025-01-08 23:51:34,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212985 to 198813. [2025-01-08 23:51:34,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198813 states, 198812 states have (on average 1.072656580085709) internal successors, (213257), 198812 states have internal predecessors, (213257), 0 states have call successors, (0), 0 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-08 23:51:35,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198813 states to 198813 states and 213257 transitions. [2025-01-08 23:51:35,380 INFO L78 Accepts]: Start accepts. Automaton has 198813 states and 213257 transitions. Word has length 500 [2025-01-08 23:51:35,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:51:35,380 INFO L471 AbstractCegarLoop]: Abstraction has 198813 states and 213257 transitions. [2025-01-08 23:51:35,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 100.66666666666667) internal successors, (302), 3 states have internal predecessors, (302), 0 states have call successors, (0), 0 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-08 23:51:35,381 INFO L276 IsEmpty]: Start isEmpty. Operand 198813 states and 213257 transitions. [2025-01-08 23:51:35,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 521 [2025-01-08 23:51:35,394 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:51:35,394 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2025-01-08 23:51:35,667 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forcibly destroying the process [2025-01-08 23:51:35,668 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-08 23:51:35,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:51:35,668 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:51:35,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:51:35,669 INFO L85 PathProgramCache]: Analyzing trace with hash -2010612802, now seen corresponding path program 1 times [2025-01-08 23:51:35,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:51:35,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775839650] [2025-01-08 23:51:35,669 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:51:35,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:51:35,701 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 520 statements into 1 equivalence classes. [2025-01-08 23:51:35,718 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 520 of 520 statements. [2025-01-08 23:51:35,719 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:51:35,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:51:36,136 INFO L134 CoverageAnalysis]: Checked inductivity of 637 backedges. 147 proven. 75 refuted. 0 times theorem prover too weak. 415 trivial. 0 not checked. [2025-01-08 23:51:36,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:51:36,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775839650] [2025-01-08 23:51:36,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775839650] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 23:51:36,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1888231359] [2025-01-08 23:51:36,136 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:51:36,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:51:36,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:51:36,139 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 23:51:36,140 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-08 23:51:36,190 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 520 statements into 1 equivalence classes. [2025-01-08 23:51:36,263 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 520 of 520 statements. [2025-01-08 23:51:36,263 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:51:36,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:51:36,265 INFO L256 TraceCheckSpWp]: Trace formula consists of 679 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-08 23:51:36,271 INFO L279 TraceCheckSpWp]: Computing forward predicates...