./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem15_label13.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/Problem15_label13.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 5a19424d0456c6718774c0e7f98c7314f15d1f859d3e4c4b58b43cec62bc198b --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 00:01:11,607 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 00:01:11,662 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 00:01:11,666 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 00:01:11,667 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 00:01:11,690 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 00:01:11,691 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 00:01:11,691 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 00:01:11,691 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 00:01:11,691 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 00:01:11,692 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 00:01:11,692 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 00:01:11,692 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 00:01:11,692 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 00:01:11,692 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 00:01:11,692 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 00:01:11,692 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 00:01:11,693 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 00:01:11,693 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 00:01:11,693 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 00:01:11,693 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 00:01:11,693 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 00:01:11,693 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 00:01:11,693 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 00:01:11,693 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 00:01:11,693 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 00:01:11,693 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 00:01:11,693 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 00:01:11,694 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 00:01:11,694 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 00:01:11,694 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 00:01:11,694 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 00:01:11,694 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:01:11,694 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 00:01:11,694 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 00:01:11,694 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 00:01:11,694 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 00:01:11,695 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:01:11,695 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 00:01:11,695 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 00:01:11,695 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 00:01:11,695 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 00:01:11,695 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 00:01:11,695 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 00:01:11,695 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 00:01:11,695 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 00:01:11,695 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 00:01:11,695 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 00:01:11,695 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 -> 5a19424d0456c6718774c0e7f98c7314f15d1f859d3e4c4b58b43cec62bc198b [2025-01-09 00:01:11,934 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 00:01:11,942 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 00:01:11,944 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 00:01:11,945 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 00:01:11,946 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 00:01:11,947 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem15_label13.c [2025-01-09 00:01:13,253 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bb9115cae/d4d8f4dec34d42dc81ac201d8d17b8be/FLAG4270392aa [2025-01-09 00:01:13,611 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 00:01:13,612 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem15_label13.c [2025-01-09 00:01:13,634 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bb9115cae/d4d8f4dec34d42dc81ac201d8d17b8be/FLAG4270392aa [2025-01-09 00:01:13,649 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bb9115cae/d4d8f4dec34d42dc81ac201d8d17b8be [2025-01-09 00:01:13,651 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 00:01:13,652 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 00:01:13,653 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 00:01:13,653 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 00:01:13,657 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 00:01:13,658 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:01:13" (1/1) ... [2025-01-09 00:01:13,659 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d55e57a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:01:13, skipping insertion in model container [2025-01-09 00:01:13,659 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:01:13" (1/1) ... [2025-01-09 00:01:13,709 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 00:01:13,876 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/Problem15_label13.c[5940,5953] [2025-01-09 00:01:14,161 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 00:01:14,168 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 00:01:14,187 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/Problem15_label13.c[5940,5953] [2025-01-09 00:01:14,334 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 00:01:14,349 INFO L204 MainTranslator]: Completed translation [2025-01-09 00:01:14,351 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:01:14 WrapperNode [2025-01-09 00:01:14,351 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 00:01:14,352 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 00:01:14,352 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 00:01:14,353 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 00:01:14,359 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:01:14" (1/1) ... [2025-01-09 00:01:14,385 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:01:14" (1/1) ... [2025-01-09 00:01:14,530 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1757 [2025-01-09 00:01:14,530 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 00:01:14,531 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 00:01:14,531 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 00:01:14,532 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 00:01:14,538 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:01:14" (1/1) ... [2025-01-09 00:01:14,538 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:01:14" (1/1) ... [2025-01-09 00:01:14,561 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:01:14" (1/1) ... [2025-01-09 00:01:14,665 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 00:01:14,665 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:01:14" (1/1) ... [2025-01-09 00:01:14,665 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:01:14" (1/1) ... [2025-01-09 00:01:14,729 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:01:14" (1/1) ... [2025-01-09 00:01:14,748 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:01:14" (1/1) ... [2025-01-09 00:01:14,759 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:01:14" (1/1) ... [2025-01-09 00:01:14,783 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:01:14" (1/1) ... [2025-01-09 00:01:14,796 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:01:14" (1/1) ... [2025-01-09 00:01:14,830 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 00:01:14,833 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 00:01:14,833 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 00:01:14,833 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 00:01:14,834 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:01:14" (1/1) ... [2025-01-09 00:01:14,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:01:14,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:01:14,870 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 00:01:14,877 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 00:01:14,898 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 00:01:14,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 00:01:14,899 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 00:01:14,899 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 00:01:14,948 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 00:01:14,950 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 00:01:17,154 INFO L? ?]: Removed 246 outVars from TransFormulas that were not future-live. [2025-01-09 00:01:17,155 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 00:01:17,178 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 00:01:17,178 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 00:01:17,178 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:01:17 BoogieIcfgContainer [2025-01-09 00:01:17,178 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 00:01:17,180 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 00:01:17,180 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 00:01:17,183 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 00:01:17,183 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 12:01:13" (1/3) ... [2025-01-09 00:01:17,184 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1480963b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:01:17, skipping insertion in model container [2025-01-09 00:01:17,184 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:01:14" (2/3) ... [2025-01-09 00:01:17,184 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1480963b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:01:17, skipping insertion in model container [2025-01-09 00:01:17,184 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:01:17" (3/3) ... [2025-01-09 00:01:17,185 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem15_label13.c [2025-01-09 00:01:17,196 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 00:01:17,197 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem15_label13.c that has 1 procedures, 424 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 00:01:17,265 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 00:01:17,276 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;@4ff92ecc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 00:01:17,277 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 00:01:17,282 INFO L276 IsEmpty]: Start isEmpty. Operand has 424 states, 422 states have (on average 1.7748815165876777) internal successors, (749), 423 states have internal predecessors, (749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:01:17,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-01-09 00:01:17,287 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:01:17,288 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:01:17,289 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:01:17,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:01:17,294 INFO L85 PathProgramCache]: Analyzing trace with hash -480397966, now seen corresponding path program 1 times [2025-01-09 00:01:17,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:01:17,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009286403] [2025-01-09 00:01:17,300 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:01:17,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:01:17,364 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-01-09 00:01:17,418 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-01-09 00:01:17,418 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:01:17,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:01:17,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:01:17,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:01:17,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009286403] [2025-01-09 00:01:17,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009286403] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:01:17,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:01:17,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:01:17,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657878951] [2025-01-09 00:01:17,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:01:17,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:01:17,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:01:17,639 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:01:17,639 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:01:17,642 INFO L87 Difference]: Start difference. First operand has 424 states, 422 states have (on average 1.7748815165876777) internal successors, (749), 423 states have internal predecessors, (749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 2 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:01:19,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:01:19,665 INFO L93 Difference]: Finished difference Result 1191 states and 2154 transitions. [2025-01-09 00:01:19,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:01:19,667 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 2 states have internal predecessors, (48), 0 states have call successors, (0), 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 48 [2025-01-09 00:01:19,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:01:19,677 INFO L225 Difference]: With dead ends: 1191 [2025-01-09 00:01:19,677 INFO L226 Difference]: Without dead ends: 688 [2025-01-09 00:01:19,680 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:01:19,682 INFO L435 NwaCegarLoop]: 189 mSDtfsCounter, 323 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 1047 mSolverCounterSat, 286 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 323 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 1333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 286 IncrementalHoareTripleChecker+Valid, 1047 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-01-09 00:01:19,682 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [323 Valid, 230 Invalid, 1333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [286 Valid, 1047 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-01-09 00:01:19,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 688 states. [2025-01-09 00:01:19,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 688 to 680. [2025-01-09 00:01:19,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 680 states, 679 states have (on average 1.609720176730486) internal successors, (1093), 679 states have internal predecessors, (1093), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:01:19,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 680 states to 680 states and 1093 transitions. [2025-01-09 00:01:19,744 INFO L78 Accepts]: Start accepts. Automaton has 680 states and 1093 transitions. Word has length 48 [2025-01-09 00:01:19,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:01:19,745 INFO L471 AbstractCegarLoop]: Abstraction has 680 states and 1093 transitions. [2025-01-09 00:01:19,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 2 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:01:19,745 INFO L276 IsEmpty]: Start isEmpty. Operand 680 states and 1093 transitions. [2025-01-09 00:01:19,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-01-09 00:01:19,748 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:01:19,748 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:01:19,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 00:01:19,749 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:01:19,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:01:19,749 INFO L85 PathProgramCache]: Analyzing trace with hash 93531617, now seen corresponding path program 1 times [2025-01-09 00:01:19,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:01:19,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266191766] [2025-01-09 00:01:19,750 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:01:19,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:01:19,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-01-09 00:01:19,809 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-01-09 00:01:19,809 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:01:19,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:01:20,023 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:01:20,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:01:20,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266191766] [2025-01-09 00:01:20,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266191766] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:01:20,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:01:20,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:01:20,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672025038] [2025-01-09 00:01:20,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:01:20,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:01:20,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:01:20,026 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:01:20,026 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:01:20,026 INFO L87 Difference]: Start difference. First operand 680 states and 1093 transitions. Second operand has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 2 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:01:21,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:01:21,463 INFO L93 Difference]: Finished difference Result 1962 states and 3170 transitions. [2025-01-09 00:01:21,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:01:21,464 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 2 states have internal predecessors, (116), 0 states have call successors, (0), 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 116 [2025-01-09 00:01:21,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:01:21,468 INFO L225 Difference]: With dead ends: 1962 [2025-01-09 00:01:21,468 INFO L226 Difference]: Without dead ends: 1284 [2025-01-09 00:01:21,470 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:01:21,471 INFO L435 NwaCegarLoop]: 293 mSDtfsCounter, 247 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 933 mSolverCounterSat, 195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 1128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 195 IncrementalHoareTripleChecker+Valid, 933 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-01-09 00:01:21,471 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 339 Invalid, 1128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [195 Valid, 933 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-01-09 00:01:21,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1284 states. [2025-01-09 00:01:21,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1284 to 1281. [2025-01-09 00:01:21,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1281 states, 1280 states have (on average 1.39453125) internal successors, (1785), 1280 states have internal predecessors, (1785), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:01:21,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1281 states to 1281 states and 1785 transitions. [2025-01-09 00:01:21,502 INFO L78 Accepts]: Start accepts. Automaton has 1281 states and 1785 transitions. Word has length 116 [2025-01-09 00:01:21,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:01:21,503 INFO L471 AbstractCegarLoop]: Abstraction has 1281 states and 1785 transitions. [2025-01-09 00:01:21,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 2 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:01:21,503 INFO L276 IsEmpty]: Start isEmpty. Operand 1281 states and 1785 transitions. [2025-01-09 00:01:21,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-01-09 00:01:21,504 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:01:21,507 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:01:21,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 00:01:21,507 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:01:21,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:01:21,511 INFO L85 PathProgramCache]: Analyzing trace with hash -652376499, now seen corresponding path program 1 times [2025-01-09 00:01:21,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:01:21,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221482504] [2025-01-09 00:01:21,512 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:01:21,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:01:21,529 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-01-09 00:01:21,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-01-09 00:01:21,553 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:01:21,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:01:21,854 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:01:21,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:01:21,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221482504] [2025-01-09 00:01:21,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221482504] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:01:21,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:01:21,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:01:21,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979361884] [2025-01-09 00:01:21,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:01:21,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:01:21,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:01:21,855 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:01:21,855 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:01:21,855 INFO L87 Difference]: Start difference. First operand 1281 states and 1785 transitions. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 2 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:01:23,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:01:23,108 INFO L93 Difference]: Finished difference Result 2859 states and 3903 transitions. [2025-01-09 00:01:23,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:01:23,109 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 2 states have internal predecessors, (124), 0 states have call successors, (0), 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 124 [2025-01-09 00:01:23,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:01:23,115 INFO L225 Difference]: With dead ends: 2859 [2025-01-09 00:01:23,115 INFO L226 Difference]: Without dead ends: 1580 [2025-01-09 00:01:23,116 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:01:23,119 INFO L435 NwaCegarLoop]: 324 mSDtfsCounter, 225 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 888 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 917 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 888 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 00:01:23,120 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 359 Invalid, 917 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 888 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-09 00:01:23,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1580 states. [2025-01-09 00:01:23,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1580 to 1580. [2025-01-09 00:01:23,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1580 states, 1579 states have (on average 1.323622545915136) internal successors, (2090), 1579 states have internal predecessors, (2090), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:01:23,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1580 states to 1580 states and 2090 transitions. [2025-01-09 00:01:23,145 INFO L78 Accepts]: Start accepts. Automaton has 1580 states and 2090 transitions. Word has length 124 [2025-01-09 00:01:23,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:01:23,147 INFO L471 AbstractCegarLoop]: Abstraction has 1580 states and 2090 transitions. [2025-01-09 00:01:23,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 2 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:01:23,147 INFO L276 IsEmpty]: Start isEmpty. Operand 1580 states and 2090 transitions. [2025-01-09 00:01:23,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2025-01-09 00:01:23,152 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:01:23,152 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-01-09 00:01:23,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 00:01:23,153 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:01:23,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:01:23,153 INFO L85 PathProgramCache]: Analyzing trace with hash -550394456, now seen corresponding path program 1 times [2025-01-09 00:01:23,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:01:23,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363882314] [2025-01-09 00:01:23,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:01:23,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:01:23,178 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 207 statements into 1 equivalence classes. [2025-01-09 00:01:23,195 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 207 of 207 statements. [2025-01-09 00:01:23,196 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:01:23,196 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:01:23,319 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2025-01-09 00:01:23,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:01:23,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363882314] [2025-01-09 00:01:23,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363882314] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:01:23,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:01:23,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:01:23,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64972480] [2025-01-09 00:01:23,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:01:23,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:01:23,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:01:23,321 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:01:23,321 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:01:23,321 INFO L87 Difference]: Start difference. First operand 1580 states and 2090 transitions. Second operand has 3 states, 3 states have (on average 47.0) internal successors, (141), 2 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:01:24,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:01:24,476 INFO L93 Difference]: Finished difference Result 4065 states and 5551 transitions. [2025-01-09 00:01:24,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:01:24,477 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 2 states have internal predecessors, (141), 0 states have call successors, (0), 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 207 [2025-01-09 00:01:24,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:01:24,486 INFO L225 Difference]: With dead ends: 4065 [2025-01-09 00:01:24,487 INFO L226 Difference]: Without dead ends: 2786 [2025-01-09 00:01:24,489 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:01:24,490 INFO L435 NwaCegarLoop]: 293 mSDtfsCounter, 257 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 799 mSolverCounterSat, 298 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 1097 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 298 IncrementalHoareTripleChecker+Valid, 799 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-09 00:01:24,490 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 360 Invalid, 1097 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [298 Valid, 799 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-09 00:01:24,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2786 states. [2025-01-09 00:01:24,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2786 to 2781. [2025-01-09 00:01:24,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2781 states, 2780 states have (on average 1.249640287769784) internal successors, (3474), 2780 states have internal predecessors, (3474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:01:24,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2781 states to 2781 states and 3474 transitions. [2025-01-09 00:01:24,533 INFO L78 Accepts]: Start accepts. Automaton has 2781 states and 3474 transitions. Word has length 207 [2025-01-09 00:01:24,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:01:24,534 INFO L471 AbstractCegarLoop]: Abstraction has 2781 states and 3474 transitions. [2025-01-09 00:01:24,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 2 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:01:24,535 INFO L276 IsEmpty]: Start isEmpty. Operand 2781 states and 3474 transitions. [2025-01-09 00:01:24,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2025-01-09 00:01:24,537 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:01:24,537 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 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-09 00:01:24,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 00:01:24,537 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:01:24,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:01:24,538 INFO L85 PathProgramCache]: Analyzing trace with hash 1166493460, now seen corresponding path program 1 times [2025-01-09 00:01:24,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:01:24,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100531872] [2025-01-09 00:01:24,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:01:24,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:01:24,558 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 215 statements into 1 equivalence classes. [2025-01-09 00:01:24,573 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 215 of 215 statements. [2025-01-09 00:01:24,573 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:01:24,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:01:25,047 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 91 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:01:25,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:01:25,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100531872] [2025-01-09 00:01:25,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100531872] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:01:25,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1098681947] [2025-01-09 00:01:25,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:01:25,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:01:25,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:01:25,051 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 00:01:25,053 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 00:01:25,097 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 215 statements into 1 equivalence classes. [2025-01-09 00:01:25,134 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 215 of 215 statements. [2025-01-09 00:01:25,134 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:01:25,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:01:25,141 INFO L256 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 00:01:25,150 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:01:25,331 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2025-01-09 00:01:25,332 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 00:01:25,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1098681947] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:01:25,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 00:01:25,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-01-09 00:01:25,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693914592] [2025-01-09 00:01:25,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:01:25,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:01:25,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:01:25,337 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:01:25,338 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 00:01:25,338 INFO L87 Difference]: Start difference. First operand 2781 states and 3474 transitions. Second operand has 3 states, 3 states have (on average 47.0) internal successors, (141), 2 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:01:26,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:01:26,724 INFO L93 Difference]: Finished difference Result 6762 states and 8668 transitions. [2025-01-09 00:01:26,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:01:26,725 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 2 states have internal predecessors, (141), 0 states have call successors, (0), 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 215 [2025-01-09 00:01:26,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:01:26,735 INFO L225 Difference]: With dead ends: 6762 [2025-01-09 00:01:26,735 INFO L226 Difference]: Without dead ends: 4282 [2025-01-09 00:01:26,737 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 214 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-09 00:01:26,738 INFO L435 NwaCegarLoop]: 325 mSDtfsCounter, 220 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 861 mSolverCounterSat, 276 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 1137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 276 IncrementalHoareTripleChecker+Valid, 861 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-01-09 00:01:26,738 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 364 Invalid, 1137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [276 Valid, 861 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-01-09 00:01:26,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4282 states. [2025-01-09 00:01:26,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4282 to 3981. [2025-01-09 00:01:26,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3981 states, 3980 states have (on average 1.2045226130653266) internal successors, (4794), 3980 states have internal predecessors, (4794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:01:26,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3981 states to 3981 states and 4794 transitions. [2025-01-09 00:01:26,799 INFO L78 Accepts]: Start accepts. Automaton has 3981 states and 4794 transitions. Word has length 215 [2025-01-09 00:01:26,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:01:26,799 INFO L471 AbstractCegarLoop]: Abstraction has 3981 states and 4794 transitions. [2025-01-09 00:01:26,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 2 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:01:26,800 INFO L276 IsEmpty]: Start isEmpty. Operand 3981 states and 4794 transitions. [2025-01-09 00:01:26,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 336 [2025-01-09 00:01:26,803 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:01:26,803 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:01:26,812 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 00:01:27,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:01:27,008 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:01:27,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:01:27,009 INFO L85 PathProgramCache]: Analyzing trace with hash -1540559415, now seen corresponding path program 1 times [2025-01-09 00:01:27,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:01:27,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765447577] [2025-01-09 00:01:27,009 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:01:27,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:01:27,037 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 335 statements into 1 equivalence classes. [2025-01-09 00:01:27,055 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 335 of 335 statements. [2025-01-09 00:01:27,055 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:01:27,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:01:27,199 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2025-01-09 00:01:27,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:01:27,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765447577] [2025-01-09 00:01:27,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765447577] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:01:27,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:01:27,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:01:27,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7711625] [2025-01-09 00:01:27,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:01:27,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:01:27,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:01:27,201 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:01:27,201 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:01:27,202 INFO L87 Difference]: Start difference. First operand 3981 states and 4794 transitions. Second operand has 3 states, 3 states have (on average 82.0) internal successors, (246), 3 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:01:28,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:01:28,915 INFO L93 Difference]: Finished difference Result 8857 states and 10947 transitions. [2025-01-09 00:01:28,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:01:28,916 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 82.0) internal successors, (246), 3 states have internal predecessors, (246), 0 states have call successors, (0), 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 335 [2025-01-09 00:01:28,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:01:28,928 INFO L225 Difference]: With dead ends: 8857 [2025-01-09 00:01:28,928 INFO L226 Difference]: Without dead ends: 5177 [2025-01-09 00:01:28,933 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:01:28,933 INFO L435 NwaCegarLoop]: 278 mSDtfsCounter, 267 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 908 mSolverCounterSat, 206 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 1114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 206 IncrementalHoareTripleChecker+Valid, 908 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-01-09 00:01:28,933 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [267 Valid, 323 Invalid, 1114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [206 Valid, 908 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-01-09 00:01:28,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5177 states. [2025-01-09 00:01:28,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5177 to 3379. [2025-01-09 00:01:28,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3379 states, 3378 states have (on average 1.226169330965068) internal successors, (4142), 3378 states have internal predecessors, (4142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:01:28,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3379 states to 3379 states and 4142 transitions. [2025-01-09 00:01:28,983 INFO L78 Accepts]: Start accepts. Automaton has 3379 states and 4142 transitions. Word has length 335 [2025-01-09 00:01:28,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:01:28,984 INFO L471 AbstractCegarLoop]: Abstraction has 3379 states and 4142 transitions. [2025-01-09 00:01:28,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 82.0) internal successors, (246), 3 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:01:28,984 INFO L276 IsEmpty]: Start isEmpty. Operand 3379 states and 4142 transitions. [2025-01-09 00:01:28,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 395 [2025-01-09 00:01:28,988 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:01:28,988 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:01:28,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 00:01:28,988 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:01:28,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:01:28,989 INFO L85 PathProgramCache]: Analyzing trace with hash 337931535, now seen corresponding path program 1 times [2025-01-09 00:01:28,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:01:28,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427235252] [2025-01-09 00:01:28,989 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:01:28,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:01:29,018 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 394 statements into 1 equivalence classes. [2025-01-09 00:01:29,035 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 394 of 394 statements. [2025-01-09 00:01:29,036 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:01:29,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:01:29,883 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 91 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:01:29,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:01:29,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427235252] [2025-01-09 00:01:29,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427235252] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:01:29,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1984136365] [2025-01-09 00:01:29,883 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:01:29,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:01:29,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:01:29,885 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 00:01:29,887 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 00:01:29,939 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 394 statements into 1 equivalence classes. [2025-01-09 00:01:30,000 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 394 of 394 statements. [2025-01-09 00:01:30,000 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:01:30,000 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:01:30,003 INFO L256 TraceCheckSpWp]: Trace formula consists of 487 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 00:01:30,009 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:01:30,098 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 166 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:01:30,098 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 00:01:30,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1984136365] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:01:30,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 00:01:30,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2025-01-09 00:01:30,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364175976] [2025-01-09 00:01:30,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:01:30,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:01:30,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:01:30,100 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:01:30,100 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 00:01:30,101 INFO L87 Difference]: Start difference. First operand 3379 states and 4142 transitions. Second operand has 3 states, 3 states have (on average 131.33333333333334) internal successors, (394), 3 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:01:31,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:01:31,385 INFO L93 Difference]: Finished difference Result 8263 states and 10364 transitions. [2025-01-09 00:01:31,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:01:31,386 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 131.33333333333334) internal successors, (394), 3 states have internal predecessors, (394), 0 states have call successors, (0), 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 394 [2025-01-09 00:01:31,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:01:31,398 INFO L225 Difference]: With dead ends: 8263 [2025-01-09 00:01:31,399 INFO L226 Difference]: Without dead ends: 5185 [2025-01-09 00:01:31,402 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 398 GetRequests, 393 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 00:01:31,403 INFO L435 NwaCegarLoop]: 309 mSDtfsCounter, 249 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 877 mSolverCounterSat, 282 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 1159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 282 IncrementalHoareTripleChecker+Valid, 877 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 00:01:31,403 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 344 Invalid, 1159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [282 Valid, 877 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-09 00:01:31,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5185 states. [2025-01-09 00:01:31,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5185 to 4584. [2025-01-09 00:01:31,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4584 states, 4583 states have (on average 1.2081605934977089) internal successors, (5537), 4583 states have internal predecessors, (5537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:01:31,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4584 states to 4584 states and 5537 transitions. [2025-01-09 00:01:31,460 INFO L78 Accepts]: Start accepts. Automaton has 4584 states and 5537 transitions. Word has length 394 [2025-01-09 00:01:31,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:01:31,461 INFO L471 AbstractCegarLoop]: Abstraction has 4584 states and 5537 transitions. [2025-01-09 00:01:31,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 131.33333333333334) internal successors, (394), 3 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:01:31,461 INFO L276 IsEmpty]: Start isEmpty. Operand 4584 states and 5537 transitions. [2025-01-09 00:01:31,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 412 [2025-01-09 00:01:31,466 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:01:31,467 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:01:31,473 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 00:01:31,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:01:31,668 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:01:31,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:01:31,668 INFO L85 PathProgramCache]: Analyzing trace with hash 1430633508, now seen corresponding path program 1 times [2025-01-09 00:01:31,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:01:31,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232636429] [2025-01-09 00:01:31,668 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:01:31,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:01:31,707 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 411 statements into 1 equivalence classes. [2025-01-09 00:01:31,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 411 of 411 statements. [2025-01-09 00:01:31,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:01:31,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:01:32,126 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 293 proven. 39 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-01-09 00:01:32,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:01:32,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232636429] [2025-01-09 00:01:32,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232636429] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:01:32,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [700383938] [2025-01-09 00:01:32,128 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:01:32,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:01:32,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:01:32,130 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 00:01:32,132 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 00:01:32,180 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 411 statements into 1 equivalence classes. [2025-01-09 00:01:32,240 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 411 of 411 statements. [2025-01-09 00:01:32,241 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:01:32,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:01:32,243 INFO L256 TraceCheckSpWp]: Trace formula consists of 522 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-09 00:01:32,248 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:01:32,892 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 293 proven. 39 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-01-09 00:01:32,892 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 00:01:33,494 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 293 proven. 39 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-01-09 00:01:33,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [700383938] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 00:01:33,494 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 00:01:33,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2025-01-09 00:01:33,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259586800] [2025-01-09 00:01:33,495 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 00:01:33,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 00:01:33,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:01:33,497 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 00:01:33,498 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-01-09 00:01:33,498 INFO L87 Difference]: Start difference. First operand 4584 states and 5537 transitions. Second operand has 9 states, 9 states have (on average 72.66666666666667) internal successors, (654), 8 states have internal predecessors, (654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:01:38,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:01:38,506 INFO L93 Difference]: Finished difference Result 14213 states and 16892 transitions. [2025-01-09 00:01:38,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 00:01:38,506 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 72.66666666666667) internal successors, (654), 8 states have internal predecessors, (654), 0 states have call successors, (0), 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 411 [2025-01-09 00:01:38,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:01:38,522 INFO L225 Difference]: With dead ends: 14213 [2025-01-09 00:01:38,523 INFO L226 Difference]: Without dead ends: 6680 [2025-01-09 00:01:38,529 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 831 GetRequests, 817 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2025-01-09 00:01:38,530 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 2852 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 5883 mSolverCounterSat, 736 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2852 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 6619 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 736 IncrementalHoareTripleChecker+Valid, 5883 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2025-01-09 00:01:38,530 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2852 Valid, 245 Invalid, 6619 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [736 Valid, 5883 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2025-01-09 00:01:38,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6680 states. [2025-01-09 00:01:38,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6680 to 6378. [2025-01-09 00:01:38,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6378 states, 6377 states have (on average 1.110083111180806) internal successors, (7079), 6377 states have internal predecessors, (7079), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:01:38,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6378 states to 6378 states and 7079 transitions. [2025-01-09 00:01:38,603 INFO L78 Accepts]: Start accepts. Automaton has 6378 states and 7079 transitions. Word has length 411 [2025-01-09 00:01:38,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:01:38,603 INFO L471 AbstractCegarLoop]: Abstraction has 6378 states and 7079 transitions. [2025-01-09 00:01:38,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 72.66666666666667) internal successors, (654), 8 states have internal predecessors, (654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:01:38,604 INFO L276 IsEmpty]: Start isEmpty. Operand 6378 states and 7079 transitions. [2025-01-09 00:01:38,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 426 [2025-01-09 00:01:38,607 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:01:38,607 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:01:38,613 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-09 00:01:38,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:01:38,808 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:01:38,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:01:38,809 INFO L85 PathProgramCache]: Analyzing trace with hash -31966008, now seen corresponding path program 1 times [2025-01-09 00:01:38,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:01:38,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940917083] [2025-01-09 00:01:38,809 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:01:38,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:01:38,840 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 425 statements into 1 equivalence classes. [2025-01-09 00:01:38,888 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 425 of 425 statements. [2025-01-09 00:01:38,888 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:01:38,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:01:39,049 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2025-01-09 00:01:39,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:01:39,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940917083] [2025-01-09 00:01:39,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940917083] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:01:39,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:01:39,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:01:39,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114550954] [2025-01-09 00:01:39,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:01:39,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:01:39,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:01:39,051 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:01:39,052 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:01:39,052 INFO L87 Difference]: Start difference. First operand 6378 states and 7079 transitions. Second operand has 3 states, 3 states have (on average 106.66666666666667) 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-09 00:01:39,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:01:39,943 INFO L93 Difference]: Finished difference Result 14549 states and 16224 transitions. [2025-01-09 00:01:39,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:01:39,944 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 106.66666666666667) 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 425 [2025-01-09 00:01:39,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:01:39,956 INFO L225 Difference]: With dead ends: 14549 [2025-01-09 00:01:39,956 INFO L226 Difference]: Without dead ends: 8173 [2025-01-09 00:01:39,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-09 00:01:39,963 INFO L435 NwaCegarLoop]: 509 mSDtfsCounter, 277 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 774 mSolverCounterSat, 165 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 548 SdHoareTripleChecker+Invalid, 939 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 165 IncrementalHoareTripleChecker+Valid, 774 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 00:01:39,963 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 548 Invalid, 939 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [165 Valid, 774 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 00:01:39,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8173 states. [2025-01-09 00:01:40,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8173 to 7872. [2025-01-09 00:01:40,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7872 states, 7871 states have (on average 1.0881717697878288) internal successors, (8565), 7871 states have internal predecessors, (8565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:01:40,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7872 states to 7872 states and 8565 transitions. [2025-01-09 00:01:40,049 INFO L78 Accepts]: Start accepts. Automaton has 7872 states and 8565 transitions. Word has length 425 [2025-01-09 00:01:40,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:01:40,050 INFO L471 AbstractCegarLoop]: Abstraction has 7872 states and 8565 transitions. [2025-01-09 00:01:40,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.66666666666667) 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-09 00:01:40,051 INFO L276 IsEmpty]: Start isEmpty. Operand 7872 states and 8565 transitions. [2025-01-09 00:01:40,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 550 [2025-01-09 00:01:40,058 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:01:40,061 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:01:40,061 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 00:01:40,061 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:01:40,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:01:40,062 INFO L85 PathProgramCache]: Analyzing trace with hash 191542864, now seen corresponding path program 1 times [2025-01-09 00:01:40,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:01:40,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304595315] [2025-01-09 00:01:40,062 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:01:40,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:01:40,139 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 549 statements into 1 equivalence classes. [2025-01-09 00:01:40,166 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 549 of 549 statements. [2025-01-09 00:01:40,166 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:01:40,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:01:40,352 INFO L134 CoverageAnalysis]: Checked inductivity of 471 backedges. 137 proven. 0 refuted. 0 times theorem prover too weak. 334 trivial. 0 not checked. [2025-01-09 00:01:40,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:01:40,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304595315] [2025-01-09 00:01:40,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304595315] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:01:40,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:01:40,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:01:40,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945776047] [2025-01-09 00:01:40,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:01:40,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:01:40,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:01:40,354 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:01:40,354 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:01:40,355 INFO L87 Difference]: Start difference. First operand 7872 states and 8565 transitions. Second operand has 3 states, 3 states have (on average 107.66666666666667) internal successors, (323), 3 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:01:41,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:01:41,123 INFO L93 Difference]: Finished difference Result 15740 states and 17170 transitions. [2025-01-09 00:01:41,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:01:41,129 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 107.66666666666667) internal successors, (323), 3 states have internal predecessors, (323), 0 states have call successors, (0), 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 549 [2025-01-09 00:01:41,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:01:41,147 INFO L225 Difference]: With dead ends: 15740 [2025-01-09 00:01:41,147 INFO L226 Difference]: Without dead ends: 8169 [2025-01-09 00:01:41,155 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:01:41,156 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 438 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 741 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 438 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 857 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 741 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 00:01:41,156 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [438 Valid, 70 Invalid, 857 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 741 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 00:01:41,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8169 states. [2025-01-09 00:01:41,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8169 to 7870. [2025-01-09 00:01:41,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7870 states, 7869 states have (on average 1.087940017791333) internal successors, (8561), 7869 states have internal predecessors, (8561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:01:41,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7870 states to 7870 states and 8561 transitions. [2025-01-09 00:01:41,298 INFO L78 Accepts]: Start accepts. Automaton has 7870 states and 8561 transitions. Word has length 549 [2025-01-09 00:01:41,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:01:41,299 INFO L471 AbstractCegarLoop]: Abstraction has 7870 states and 8561 transitions. [2025-01-09 00:01:41,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 107.66666666666667) internal successors, (323), 3 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:01:41,299 INFO L276 IsEmpty]: Start isEmpty. Operand 7870 states and 8561 transitions. [2025-01-09 00:01:41,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 576 [2025-01-09 00:01:41,303 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:01:41,303 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:01:41,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 00:01:41,304 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:01:41,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:01:41,305 INFO L85 PathProgramCache]: Analyzing trace with hash 2117990745, now seen corresponding path program 1 times [2025-01-09 00:01:41,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:01:41,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993774940] [2025-01-09 00:01:41,305 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:01:41,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:01:41,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 575 statements into 1 equivalence classes. [2025-01-09 00:01:41,391 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 575 of 575 statements. [2025-01-09 00:01:41,391 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:01:41,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:01:41,692 INFO L134 CoverageAnalysis]: Checked inductivity of 499 backedges. 137 proven. 0 refuted. 0 times theorem prover too weak. 362 trivial. 0 not checked. [2025-01-09 00:01:41,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:01:41,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993774940] [2025-01-09 00:01:41,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993774940] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:01:41,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:01:41,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:01:41,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363772401] [2025-01-09 00:01:41,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:01:41,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:01:41,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:01:41,694 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:01:41,694 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:01:41,694 INFO L87 Difference]: Start difference. First operand 7870 states and 8561 transitions. Second operand has 3 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:01:42,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:01:42,646 INFO L93 Difference]: Finished difference Result 18456 states and 20118 transitions. [2025-01-09 00:01:42,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:01:42,646 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 0 states have call successors, (0), 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 575 [2025-01-09 00:01:42,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:01:42,673 INFO L225 Difference]: With dead ends: 18456 [2025-01-09 00:01:42,673 INFO L226 Difference]: Without dead ends: 10588 [2025-01-09 00:01:42,682 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:01:42,683 INFO L435 NwaCegarLoop]: 213 mSDtfsCounter, 289 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 875 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 975 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 875 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 00:01:42,683 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [289 Valid, 248 Invalid, 975 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 875 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 00:01:42,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10588 states. [2025-01-09 00:01:42,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10588 to 8172. [2025-01-09 00:01:42,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8172 states, 8171 states have (on average 1.0862807489903317) internal successors, (8876), 8171 states have internal predecessors, (8876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:01:42,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8172 states to 8172 states and 8876 transitions. [2025-01-09 00:01:42,807 INFO L78 Accepts]: Start accepts. Automaton has 8172 states and 8876 transitions. Word has length 575 [2025-01-09 00:01:42,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:01:42,808 INFO L471 AbstractCegarLoop]: Abstraction has 8172 states and 8876 transitions. [2025-01-09 00:01:42,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:01:42,808 INFO L276 IsEmpty]: Start isEmpty. Operand 8172 states and 8876 transitions. [2025-01-09 00:01:42,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 584 [2025-01-09 00:01:42,813 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:01:42,813 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:01:42,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 00:01:42,813 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:01:42,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:01:42,814 INFO L85 PathProgramCache]: Analyzing trace with hash 2047568986, now seen corresponding path program 1 times [2025-01-09 00:01:42,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:01:42,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948231797] [2025-01-09 00:01:42,815 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:01:42,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:01:42,866 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 583 statements into 1 equivalence classes. [2025-01-09 00:01:42,896 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 583 of 583 statements. [2025-01-09 00:01:42,897 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:01:42,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:01:43,714 INFO L134 CoverageAnalysis]: Checked inductivity of 476 backedges. 242 proven. 188 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-01-09 00:01:43,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:01:43,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948231797] [2025-01-09 00:01:43,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948231797] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:01:43,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [49437092] [2025-01-09 00:01:43,715 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:01:43,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:01:43,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:01:43,718 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-09 00:01:43,719 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-09 00:01:43,780 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 583 statements into 1 equivalence classes. [2025-01-09 00:01:43,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 583 of 583 statements. [2025-01-09 00:01:43,859 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:01:43,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:01:43,862 INFO L256 TraceCheckSpWp]: Trace formula consists of 694 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 00:01:43,866 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:01:44,547 INFO L134 CoverageAnalysis]: Checked inductivity of 476 backedges. 137 proven. 0 refuted. 0 times theorem prover too weak. 339 trivial. 0 not checked. [2025-01-09 00:01:44,548 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 00:01:44,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [49437092] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:01:44,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 00:01:44,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-01-09 00:01:44,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055858471] [2025-01-09 00:01:44,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:01:44,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:01:44,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:01:44,549 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:01:44,549 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 00:01:44,549 INFO L87 Difference]: Start difference. First operand 8172 states and 8876 transitions. Second operand has 4 states, 4 states have (on average 80.25) internal successors, (321), 3 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:01:45,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:01:45,805 INFO L93 Difference]: Finished difference Result 24491 states and 26721 transitions. [2025-01-09 00:01:45,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:01:45,806 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 80.25) internal successors, (321), 3 states have internal predecessors, (321), 0 states have call successors, (0), 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 583 [2025-01-09 00:01:45,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:01:45,841 INFO L225 Difference]: With dead ends: 24491 [2025-01-09 00:01:45,841 INFO L226 Difference]: Without dead ends: 16620 [2025-01-09 00:01:45,852 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 586 GetRequests, 581 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 00:01:45,852 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 527 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 1558 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 527 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 1654 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 1558 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 00:01:45,853 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [527 Valid, 171 Invalid, 1654 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 1558 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-09 00:01:45,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16620 states. [2025-01-09 00:01:46,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16620 to 13919. [2025-01-09 00:01:46,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13919 states, 13918 states have (on average 1.0854289409397901) internal successors, (15107), 13918 states have internal predecessors, (15107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:01:46,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13919 states to 13919 states and 15107 transitions. [2025-01-09 00:01:46,089 INFO L78 Accepts]: Start accepts. Automaton has 13919 states and 15107 transitions. Word has length 583 [2025-01-09 00:01:46,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:01:46,089 INFO L471 AbstractCegarLoop]: Abstraction has 13919 states and 15107 transitions. [2025-01-09 00:01:46,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 80.25) internal successors, (321), 3 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:01:46,090 INFO L276 IsEmpty]: Start isEmpty. Operand 13919 states and 15107 transitions. [2025-01-09 00:01:46,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 587 [2025-01-09 00:01:46,093 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:01:46,094 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:01:46,101 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-09 00:01:46,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-01-09 00:01:46,295 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:01:46,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:01:46,295 INFO L85 PathProgramCache]: Analyzing trace with hash 807520856, now seen corresponding path program 1 times [2025-01-09 00:01:46,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:01:46,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636085015] [2025-01-09 00:01:46,296 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:01:46,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:01:46,350 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 586 statements into 1 equivalence classes. [2025-01-09 00:01:46,379 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 586 of 586 statements. [2025-01-09 00:01:46,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:01:46,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:01:46,538 INFO L134 CoverageAnalysis]: Checked inductivity of 510 backedges. 137 proven. 0 refuted. 0 times theorem prover too weak. 373 trivial. 0 not checked. [2025-01-09 00:01:46,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:01:46,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636085015] [2025-01-09 00:01:46,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636085015] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:01:46,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:01:46,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:01:46,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916124936] [2025-01-09 00:01:46,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:01:46,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:01:46,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:01:46,540 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:01:46,540 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:01:46,540 INFO L87 Difference]: Start difference. First operand 13919 states and 15107 transitions. Second operand has 3 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:01:47,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:01:47,446 INFO L93 Difference]: Finished difference Result 33516 states and 36659 transitions. [2025-01-09 00:01:47,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:01:47,446 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 0 states have call successors, (0), 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 586 [2025-01-09 00:01:47,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:01:47,472 INFO L225 Difference]: With dead ends: 33516 [2025-01-09 00:01:47,472 INFO L226 Difference]: Without dead ends: 20499 [2025-01-09 00:01:47,486 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:01:47,488 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 302 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 816 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 302 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 939 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 816 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 00:01:47,488 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [302 Valid, 173 Invalid, 939 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 816 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 00:01:47,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20499 states. [2025-01-09 00:01:47,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20499 to 19602. [2025-01-09 00:01:47,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19602 states, 19601 states have (on average 1.0815264527320034) internal successors, (21199), 19601 states have internal predecessors, (21199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:01:47,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19602 states to 19602 states and 21199 transitions. [2025-01-09 00:01:47,805 INFO L78 Accepts]: Start accepts. Automaton has 19602 states and 21199 transitions. Word has length 586 [2025-01-09 00:01:47,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:01:47,805 INFO L471 AbstractCegarLoop]: Abstraction has 19602 states and 21199 transitions. [2025-01-09 00:01:47,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:01:47,806 INFO L276 IsEmpty]: Start isEmpty. Operand 19602 states and 21199 transitions. [2025-01-09 00:01:47,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 628 [2025-01-09 00:01:47,814 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:01:47,814 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:01:47,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 00:01:47,815 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:01:47,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:01:47,815 INFO L85 PathProgramCache]: Analyzing trace with hash -419061944, now seen corresponding path program 1 times [2025-01-09 00:01:47,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:01:47,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824793714] [2025-01-09 00:01:47,816 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:01:47,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:01:47,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 627 statements into 1 equivalence classes. [2025-01-09 00:01:47,939 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 627 of 627 statements. [2025-01-09 00:01:47,939 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:01:47,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:01:48,215 INFO L134 CoverageAnalysis]: Checked inductivity of 750 backedges. 183 proven. 0 refuted. 0 times theorem prover too weak. 567 trivial. 0 not checked. [2025-01-09 00:01:48,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:01:48,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824793714] [2025-01-09 00:01:48,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824793714] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:01:48,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:01:48,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:01:48,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277002299] [2025-01-09 00:01:48,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:01:48,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:01:48,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:01:48,217 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:01:48,217 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:01:48,217 INFO L87 Difference]: Start difference. First operand 19602 states and 21199 transitions. Second operand has 3 states, 3 states have (on average 108.0) internal successors, (324), 3 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:01:49,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:01:49,169 INFO L93 Difference]: Finished difference Result 42790 states and 46584 transitions. [2025-01-09 00:01:49,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:01:49,169 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 108.0) internal successors, (324), 3 states have internal predecessors, (324), 0 states have call successors, (0), 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 627 [2025-01-09 00:01:49,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:01:49,196 INFO L225 Difference]: With dead ends: 42790 [2025-01-09 00:01:49,197 INFO L226 Difference]: Without dead ends: 23190 [2025-01-09 00:01:49,207 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:01:49,207 INFO L435 NwaCegarLoop]: 505 mSDtfsCounter, 263 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 758 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 263 SdHoareTripleChecker+Valid, 544 SdHoareTripleChecker+Invalid, 884 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 758 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 00:01:49,207 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [263 Valid, 544 Invalid, 884 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 758 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 00:01:49,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23190 states. [2025-01-09 00:01:49,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23190 to 22890. [2025-01-09 00:01:49,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22890 states, 22889 states have (on average 1.06710647035694) internal successors, (24425), 22889 states have internal predecessors, (24425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:01:49,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22890 states to 22890 states and 24425 transitions. [2025-01-09 00:01:49,417 INFO L78 Accepts]: Start accepts. Automaton has 22890 states and 24425 transitions. Word has length 627 [2025-01-09 00:01:49,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:01:49,417 INFO L471 AbstractCegarLoop]: Abstraction has 22890 states and 24425 transitions. [2025-01-09 00:01:49,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.0) internal successors, (324), 3 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:01:49,418 INFO L276 IsEmpty]: Start isEmpty. Operand 22890 states and 24425 transitions. [2025-01-09 00:01:49,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 738 [2025-01-09 00:01:49,429 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:01:49,429 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:01:49,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 00:01:49,430 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:01:49,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:01:49,430 INFO L85 PathProgramCache]: Analyzing trace with hash 1546973447, now seen corresponding path program 1 times [2025-01-09 00:01:49,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:01:49,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580404035] [2025-01-09 00:01:49,430 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:01:49,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:01:49,480 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 737 statements into 1 equivalence classes. [2025-01-09 00:01:49,504 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 737 of 737 statements. [2025-01-09 00:01:49,504 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:01:49,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:01:50,246 INFO L134 CoverageAnalysis]: Checked inductivity of 1196 backedges. 705 proven. 338 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2025-01-09 00:01:50,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:01:50,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580404035] [2025-01-09 00:01:50,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580404035] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:01:50,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1901549534] [2025-01-09 00:01:50,247 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:01:50,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:01:50,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:01:50,249 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-09 00:01:50,256 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-09 00:01:50,343 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 737 statements into 1 equivalence classes. [2025-01-09 00:01:50,477 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 737 of 737 statements. [2025-01-09 00:01:50,477 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:01:50,477 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:01:50,481 INFO L256 TraceCheckSpWp]: Trace formula consists of 901 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 00:01:50,491 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:01:50,624 INFO L134 CoverageAnalysis]: Checked inductivity of 1196 backedges. 816 proven. 0 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-01-09 00:01:50,626 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 00:01:50,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1901549534] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:01:50,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 00:01:50,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-01-09 00:01:50,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733744969] [2025-01-09 00:01:50,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:01:50,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:01:50,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:01:50,628 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:01:50,628 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 00:01:50,629 INFO L87 Difference]: Start difference. First operand 22890 states and 24425 transitions. Second operand has 3 states, 3 states have (on average 155.33333333333334) internal successors, (466), 3 states have internal predecessors, (466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:01:51,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:01:51,375 INFO L93 Difference]: Finished difference Result 45482 states and 48552 transitions. [2025-01-09 00:01:51,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:01:51,376 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 155.33333333333334) internal successors, (466), 3 states have internal predecessors, (466), 0 states have call successors, (0), 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 737 [2025-01-09 00:01:51,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:01:51,402 INFO L225 Difference]: With dead ends: 45482 [2025-01-09 00:01:51,402 INFO L226 Difference]: Without dead ends: 22893 [2025-01-09 00:01:51,421 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 741 GetRequests, 738 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 00:01:51,422 INFO L435 NwaCegarLoop]: 387 mSDtfsCounter, 266 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 723 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 266 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 825 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 723 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 00:01:51,422 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [266 Valid, 398 Invalid, 825 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 723 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 00:01:51,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22893 states. [2025-01-09 00:01:51,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22893 to 22885. [2025-01-09 00:01:51,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22885 states, 22884 states have (on average 1.0597797587834294) internal successors, (24252), 22884 states have internal predecessors, (24252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:01:51,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22885 states to 22885 states and 24252 transitions. [2025-01-09 00:01:51,649 INFO L78 Accepts]: Start accepts. Automaton has 22885 states and 24252 transitions. Word has length 737 [2025-01-09 00:01:51,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:01:51,650 INFO L471 AbstractCegarLoop]: Abstraction has 22885 states and 24252 transitions. [2025-01-09 00:01:51,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 155.33333333333334) internal successors, (466), 3 states have internal predecessors, (466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:01:51,650 INFO L276 IsEmpty]: Start isEmpty. Operand 22885 states and 24252 transitions. [2025-01-09 00:01:51,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 758 [2025-01-09 00:01:51,659 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:01:51,659 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:01:51,666 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-01-09 00:01:51,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-01-09 00:01:51,859 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:01:51,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:01:51,860 INFO L85 PathProgramCache]: Analyzing trace with hash 557537778, now seen corresponding path program 1 times [2025-01-09 00:01:51,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:01:51,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094279175] [2025-01-09 00:01:51,860 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:01:51,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:01:51,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 757 statements into 1 equivalence classes. [2025-01-09 00:01:51,977 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 757 of 757 statements. [2025-01-09 00:01:51,977 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:01:51,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:01:52,347 INFO L134 CoverageAnalysis]: Checked inductivity of 1142 backedges. 757 proven. 0 refuted. 0 times theorem prover too weak. 385 trivial. 0 not checked. [2025-01-09 00:01:52,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:01:52,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094279175] [2025-01-09 00:01:52,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094279175] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:01:52,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:01:52,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:01:52,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467672236] [2025-01-09 00:01:52,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:01:52,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:01:52,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:01:52,349 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:01:52,349 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:01:52,349 INFO L87 Difference]: Start difference. First operand 22885 states and 24252 transitions. Second operand has 3 states, 3 states have (on average 150.0) internal successors, (450), 3 states have internal predecessors, (450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:01:53,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:01:53,131 INFO L93 Difference]: Finished difference Result 45469 states and 48201 transitions. [2025-01-09 00:01:53,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:01:53,132 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 150.0) internal successors, (450), 3 states have internal predecessors, (450), 0 states have call successors, (0), 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 757 [2025-01-09 00:01:53,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:01:53,157 INFO L225 Difference]: With dead ends: 45469 [2025-01-09 00:01:53,157 INFO L226 Difference]: Without dead ends: 22885 [2025-01-09 00:01:53,174 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:01:53,175 INFO L435 NwaCegarLoop]: 475 mSDtfsCounter, 225 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 740 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 509 SdHoareTripleChecker+Invalid, 833 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 740 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 00:01:53,175 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 509 Invalid, 833 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 740 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 00:01:53,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22885 states. [2025-01-09 00:01:53,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22885 to 22885. [2025-01-09 00:01:53,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22885 states, 22884 states have (on average 1.0396346792518791) internal successors, (23791), 22884 states have internal predecessors, (23791), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:01:53,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22885 states to 22885 states and 23791 transitions. [2025-01-09 00:01:53,424 INFO L78 Accepts]: Start accepts. Automaton has 22885 states and 23791 transitions. Word has length 757 [2025-01-09 00:01:53,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:01:53,424 INFO L471 AbstractCegarLoop]: Abstraction has 22885 states and 23791 transitions. [2025-01-09 00:01:53,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 150.0) internal successors, (450), 3 states have internal predecessors, (450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:01:53,425 INFO L276 IsEmpty]: Start isEmpty. Operand 22885 states and 23791 transitions. [2025-01-09 00:01:53,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 760 [2025-01-09 00:01:53,432 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:01:53,432 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:01:53,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 00:01:53,433 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:01:53,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:01:53,433 INFO L85 PathProgramCache]: Analyzing trace with hash -1151966650, now seen corresponding path program 1 times [2025-01-09 00:01:53,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:01:53,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801991317] [2025-01-09 00:01:53,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:01:53,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:01:53,475 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 759 statements into 1 equivalence classes. [2025-01-09 00:01:53,499 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 759 of 759 statements. [2025-01-09 00:01:53,500 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:01:53,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:01:53,682 INFO L134 CoverageAnalysis]: Checked inductivity of 949 backedges. 183 proven. 0 refuted. 0 times theorem prover too weak. 766 trivial. 0 not checked. [2025-01-09 00:01:53,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:01:53,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801991317] [2025-01-09 00:01:53,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801991317] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:01:53,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:01:53,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:01:53,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827673387] [2025-01-09 00:01:53,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:01:53,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:01:53,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:01:53,684 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:01:53,684 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:01:53,684 INFO L87 Difference]: Start difference. First operand 22885 states and 23791 transitions. Second operand has 3 states, 3 states have (on average 108.0) internal successors, (324), 3 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:01:54,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:01:54,422 INFO L93 Difference]: Finished difference Result 46361 states and 48276 transitions. [2025-01-09 00:01:54,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:01:54,423 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 108.0) internal successors, (324), 3 states have internal predecessors, (324), 0 states have call successors, (0), 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 759 [2025-01-09 00:01:54,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:01:54,445 INFO L225 Difference]: With dead ends: 46361 [2025-01-09 00:01:54,445 INFO L226 Difference]: Without dead ends: 24975 [2025-01-09 00:01:54,457 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:01:54,458 INFO L435 NwaCegarLoop]: 403 mSDtfsCounter, 363 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 746 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 363 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 824 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 746 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 00:01:54,458 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [363 Valid, 422 Invalid, 824 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 746 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 00:01:54,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24975 states. [2025-01-09 00:01:54,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24975 to 12652. [2025-01-09 00:01:54,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12652 states, 12651 states have (on average 1.0380207098253103) internal successors, (13132), 12651 states have internal predecessors, (13132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:01:54,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12652 states to 12652 states and 13132 transitions. [2025-01-09 00:01:54,588 INFO L78 Accepts]: Start accepts. Automaton has 12652 states and 13132 transitions. Word has length 759 [2025-01-09 00:01:54,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:01:54,589 INFO L471 AbstractCegarLoop]: Abstraction has 12652 states and 13132 transitions. [2025-01-09 00:01:54,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.0) internal successors, (324), 3 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:01:54,589 INFO L276 IsEmpty]: Start isEmpty. Operand 12652 states and 13132 transitions. [2025-01-09 00:01:54,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 775 [2025-01-09 00:01:54,595 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:01:54,595 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:01:54,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 00:01:54,595 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:01:54,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:01:54,596 INFO L85 PathProgramCache]: Analyzing trace with hash 438709716, now seen corresponding path program 1 times [2025-01-09 00:01:54,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:01:54,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379223305] [2025-01-09 00:01:54,596 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:01:54,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:01:54,639 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 774 statements into 1 equivalence classes. [2025-01-09 00:01:54,686 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 774 of 774 statements. [2025-01-09 00:01:54,686 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:01:54,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:01:55,426 INFO L134 CoverageAnalysis]: Checked inductivity of 977 backedges. 621 proven. 188 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2025-01-09 00:01:55,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:01:55,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379223305] [2025-01-09 00:01:55,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379223305] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:01:55,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1998925579] [2025-01-09 00:01:55,426 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:01:55,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:01:55,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:01:55,429 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 00:01:55,431 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-09 00:01:55,509 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 774 statements into 1 equivalence classes. [2025-01-09 00:01:55,611 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 774 of 774 statements. [2025-01-09 00:01:55,611 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:01:55,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:01:55,614 INFO L256 TraceCheckSpWp]: Trace formula consists of 906 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 00:01:55,620 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:01:55,932 INFO L134 CoverageAnalysis]: Checked inductivity of 977 backedges. 667 proven. 122 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2025-01-09 00:01:55,932 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 00:01:57,157 INFO L134 CoverageAnalysis]: Checked inductivity of 977 backedges. 638 proven. 0 refuted. 0 times theorem prover too weak. 339 trivial. 0 not checked. [2025-01-09 00:01:57,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1998925579] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 00:01:57,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-09 00:01:57,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 5] total 10 [2025-01-09 00:01:57,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630831419] [2025-01-09 00:01:57,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:01:57,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:01:57,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:01:57,160 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:01:57,160 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-01-09 00:01:57,160 INFO L87 Difference]: Start difference. First operand 12652 states and 13132 transitions. Second operand has 4 states, 4 states have (on average 128.0) internal successors, (512), 4 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:01:58,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:01:58,523 INFO L93 Difference]: Finished difference Result 32212 states and 33511 transitions. [2025-01-09 00:01:58,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:01:58,523 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 128.0) internal successors, (512), 4 states have internal predecessors, (512), 0 states have call successors, (0), 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 774 [2025-01-09 00:01:58,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:01:58,540 INFO L225 Difference]: With dead ends: 32212 [2025-01-09 00:01:58,540 INFO L226 Difference]: Without dead ends: 19562 [2025-01-09 00:01:58,548 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1550 GetRequests, 1542 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-01-09 00:01:58,549 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 459 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 1559 mSolverCounterSat, 323 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 459 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 1882 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 323 IncrementalHoareTripleChecker+Valid, 1559 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-01-09 00:01:58,549 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [459 Valid, 89 Invalid, 1882 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [323 Valid, 1559 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-01-09 00:01:58,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19562 states. [2025-01-09 00:01:58,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19562 to 19538. [2025-01-09 00:01:58,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19538 states, 19537 states have (on average 1.036136561396325) internal successors, (20243), 19537 states have internal predecessors, (20243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:01:58,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19538 states to 19538 states and 20243 transitions. [2025-01-09 00:01:58,693 INFO L78 Accepts]: Start accepts. Automaton has 19538 states and 20243 transitions. Word has length 774 [2025-01-09 00:01:58,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:01:58,693 INFO L471 AbstractCegarLoop]: Abstraction has 19538 states and 20243 transitions. [2025-01-09 00:01:58,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 128.0) internal successors, (512), 4 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:01:58,693 INFO L276 IsEmpty]: Start isEmpty. Operand 19538 states and 20243 transitions. [2025-01-09 00:01:58,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1033 [2025-01-09 00:01:58,710 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:01:58,710 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:01:58,716 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-01-09 00:01:58,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-01-09 00:01:58,911 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:01:58,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:01:58,912 INFO L85 PathProgramCache]: Analyzing trace with hash 1910983174, now seen corresponding path program 1 times [2025-01-09 00:01:58,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:01:58,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155898781] [2025-01-09 00:01:58,912 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:01:58,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:01:58,976 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1032 statements into 1 equivalence classes. [2025-01-09 00:01:59,015 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1032 of 1032 statements. [2025-01-09 00:01:59,015 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:01:59,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:02:00,193 INFO L134 CoverageAnalysis]: Checked inductivity of 1671 backedges. 1296 proven. 41 refuted. 0 times theorem prover too weak. 334 trivial. 0 not checked. [2025-01-09 00:02:00,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:02:00,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155898781] [2025-01-09 00:02:00,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155898781] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:02:00,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1069656305] [2025-01-09 00:02:00,194 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:02:00,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:02:00,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:02:00,199 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 00:02:00,200 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-09 00:02:00,331 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1032 statements into 1 equivalence classes. [2025-01-09 00:02:00,483 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1032 of 1032 statements. [2025-01-09 00:02:00,486 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:02:00,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:02:00,491 INFO L256 TraceCheckSpWp]: Trace formula consists of 1200 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 00:02:00,498 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:02:00,717 INFO L134 CoverageAnalysis]: Checked inductivity of 1671 backedges. 793 proven. 46 refuted. 0 times theorem prover too weak. 832 trivial. 0 not checked. [2025-01-09 00:02:00,717 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 00:02:00,971 INFO L134 CoverageAnalysis]: Checked inductivity of 1671 backedges. 793 proven. 46 refuted. 0 times theorem prover too weak. 832 trivial. 0 not checked. [2025-01-09 00:02:00,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1069656305] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 00:02:00,972 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 00:02:00,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 10 [2025-01-09 00:02:00,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552877521] [2025-01-09 00:02:00,972 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 00:02:00,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 00:02:00,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:02:00,974 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 00:02:00,974 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-01-09 00:02:00,975 INFO L87 Difference]: Start difference. First operand 19538 states and 20243 transitions. Second operand has 10 states, 10 states have (on average 130.9) internal successors, (1309), 10 states have internal predecessors, (1309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:02:08,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:02:08,387 INFO L93 Difference]: Finished difference Result 47835 states and 49608 transitions. [2025-01-09 00:02:08,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2025-01-09 00:02:08,387 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 130.9) internal successors, (1309), 10 states have internal predecessors, (1309), 0 states have call successors, (0), 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 1032 [2025-01-09 00:02:08,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:02:08,389 INFO L225 Difference]: With dead ends: 47835 [2025-01-09 00:02:08,389 INFO L226 Difference]: Without dead ends: 0 [2025-01-09 00:02:08,396 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2119 GetRequests, 2079 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 501 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=368, Invalid=1354, Unknown=0, NotChecked=0, Total=1722 [2025-01-09 00:02:08,397 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 3369 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 15797 mSolverCounterSat, 582 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3369 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 16379 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 582 IncrementalHoareTripleChecker+Valid, 15797 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.8s IncrementalHoareTripleChecker+Time [2025-01-09 00:02:08,397 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3369 Valid, 368 Invalid, 16379 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [582 Valid, 15797 Invalid, 0 Unknown, 0 Unchecked, 6.8s Time] [2025-01-09 00:02:08,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-01-09 00:02:08,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-01-09 00:02:08,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:02:08,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-01-09 00:02:08,398 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1032 [2025-01-09 00:02:08,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:02:08,398 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-09 00:02:08,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 130.9) internal successors, (1309), 10 states have internal predecessors, (1309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:02:08,399 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-01-09 00:02:08,399 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-01-09 00:02:08,402 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 00:02:08,410 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-01-09 00:02:08,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:02:08,608 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:02:08,610 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-01-09 00:02:11,798 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 00:02:11,819 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 12:02:11 BoogieIcfgContainer [2025-01-09 00:02:11,819 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 00:02:11,820 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 00:02:11,820 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 00:02:11,820 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 00:02:11,821 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:01:17" (3/4) ... [2025-01-09 00:02:11,826 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-09 00:02:11,850 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2025-01-09 00:02:11,852 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-01-09 00:02:11,853 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-09 00:02:11,855 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-09 00:02:12,000 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 00:02:12,000 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 00:02:12,001 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 00:02:12,002 INFO L158 Benchmark]: Toolchain (without parser) took 58349.43ms. Allocated memory was 167.8MB in the beginning and 520.1MB in the end (delta: 352.3MB). Free memory was 118.2MB in the beginning and 418.6MB in the end (delta: -300.4MB). Peak memory consumption was 337.1MB. Max. memory is 16.1GB. [2025-01-09 00:02:12,002 INFO L158 Benchmark]: CDTParser took 0.46ms. Allocated memory is still 201.3MB. Free memory is still 115.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 00:02:12,002 INFO L158 Benchmark]: CACSL2BoogieTranslator took 699.11ms. Allocated memory is still 167.8MB. Free memory was 118.2MB in the beginning and 46.0MB in the end (delta: 72.2MB). Peak memory consumption was 75.5MB. Max. memory is 16.1GB. [2025-01-09 00:02:12,003 INFO L158 Benchmark]: Boogie Procedure Inliner took 177.73ms. Allocated memory is still 167.8MB. Free memory was 46.0MB in the beginning and 86.8MB in the end (delta: -40.8MB). Peak memory consumption was 31.4MB. Max. memory is 16.1GB. [2025-01-09 00:02:12,003 INFO L158 Benchmark]: Boogie Preprocessor took 300.21ms. Allocated memory is still 167.8MB. Free memory was 86.8MB in the beginning and 94.9MB in the end (delta: -8.1MB). Peak memory consumption was 51.2MB. Max. memory is 16.1GB. [2025-01-09 00:02:12,005 INFO L158 Benchmark]: RCFGBuilder took 2345.82ms. Allocated memory was 167.8MB in the beginning and 411.0MB in the end (delta: 243.3MB). Free memory was 94.9MB in the beginning and 338.0MB in the end (delta: -243.1MB). Peak memory consumption was 223.0MB. Max. memory is 16.1GB. [2025-01-09 00:02:12,005 INFO L158 Benchmark]: TraceAbstraction took 54639.16ms. Allocated memory was 411.0MB in the beginning and 520.1MB in the end (delta: 109.1MB). Free memory was 338.0MB in the beginning and 146.1MB in the end (delta: 191.9MB). Peak memory consumption was 374.7MB. Max. memory is 16.1GB. [2025-01-09 00:02:12,006 INFO L158 Benchmark]: Witness Printer took 181.07ms. Allocated memory is still 520.1MB. Free memory was 142.0MB in the beginning and 418.6MB in the end (delta: -276.6MB). Peak memory consumption was 8.6MB. Max. memory is 16.1GB. [2025-01-09 00:02:12,007 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.46ms. Allocated memory is still 201.3MB. Free memory is still 115.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 699.11ms. Allocated memory is still 167.8MB. Free memory was 118.2MB in the beginning and 46.0MB in the end (delta: 72.2MB). Peak memory consumption was 75.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 177.73ms. Allocated memory is still 167.8MB. Free memory was 46.0MB in the beginning and 86.8MB in the end (delta: -40.8MB). Peak memory consumption was 31.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 300.21ms. Allocated memory is still 167.8MB. Free memory was 86.8MB in the beginning and 94.9MB in the end (delta: -8.1MB). Peak memory consumption was 51.2MB. Max. memory is 16.1GB. * RCFGBuilder took 2345.82ms. Allocated memory was 167.8MB in the beginning and 411.0MB in the end (delta: 243.3MB). Free memory was 94.9MB in the beginning and 338.0MB in the end (delta: -243.1MB). Peak memory consumption was 223.0MB. Max. memory is 16.1GB. * TraceAbstraction took 54639.16ms. Allocated memory was 411.0MB in the beginning and 520.1MB in the end (delta: 109.1MB). Free memory was 338.0MB in the beginning and 146.1MB in the end (delta: 191.9MB). Peak memory consumption was 374.7MB. Max. memory is 16.1GB. * Witness Printer took 181.07ms. Allocated memory is still 520.1MB. Free memory was 142.0MB in the beginning and 418.6MB in the end (delta: -276.6MB). Peak memory consumption was 8.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 161]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 424 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 51.4s, OverallIterations: 19, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 32.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 11418 SdHoareTripleChecker+Valid, 29.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 11418 mSDsluCounter, 6104 SdHoareTripleChecker+Invalid, 25.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1066 mSDsCounter, 4212 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 37283 IncrementalHoareTripleChecker+Invalid, 41495 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4212 mSolverCounterUnsat, 5038 mSDtfsCounter, 37283 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 6475 GetRequests, 6384 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 552 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=22890occurred in iteration=14, InterpolantAutomatonStates: 108, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.2s AutomataMinimizationTime, 19 MinimizatonAttempts, 22287 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 12.2s InterpolantComputationTime, 13400 NumberOfCodeBlocks, 13400 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 15588 ConstructedInterpolants, 0 QuantifiedInterpolants, 67046 SizeOfPredicates, 7 NumberOfNonLiveVariables, 5018 ConjunctsInSsa, 25 ConjunctsInUnsatCore, 29 InterpolantComputations, 17 PerfectInterpolantSequences, 16797/18033 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 1776]: Loop Invariant Derived loop invariant: ((((((((((((((((((((a2 <= 1) && (((long long) 42 + a4) <= 0)) && (((long long) a0 + 61) <= 0)) || (((((long long) 42 + a4) <= 0) && (3 == a2)) && (((long long) a0 + 61) <= 0))) || (((((long long) 42 + a4) <= 0) && (0 <= ((long long) 146 + a0))) && (a2 == 4))) || (((((((a29 >= 0) ? (a29 % 5) : ((a29 % 5) + 5)) != 0) || (0 < (340319 + ((a29 >= 0) ? (a29 / 5) : ((a29 / 5) - 1))))) && (2 == a2)) && (0 <= (340319 + ((a29 >= 0) ? (a29 / 5) : ((a29 / 5) - 1))))) && (((long long) 89 + a4) <= 0))) || (((((((((a29 >= 0) ? (a29 % 5) : ((a29 % 5) + 5)) != 0) || (0 < (340319 + ((a29 >= 0) ? (a29 / 5) : ((a29 / 5) - 1))))) && (((long long) 42 + a4) <= 0)) && (2 == a2)) && (0 <= (340319 + ((a29 >= 0) ? (a29 / 5) : ((a29 / 5) - 1))))) && (0 <= ((long long) a0 + 60))) && (((long long) a29 + 127) <= 0))) || (((((long long) 89 + a4) <= 0) && (((long long) a29 + 18) <= 0)) && (((long long) a0 + 61) <= 0))) || (((((((((a29 >= 0) ? (a29 % 5) : ((a29 % 5) + 5)) != 0) || (0 < (340319 + ((a29 >= 0) ? (a29 / 5) : ((a29 / 5) - 1))))) && (((long long) 42 + a4) <= 0)) && (0 <= ((long long) a4 + 85))) && (0 <= (340319 + ((a29 >= 0) ? (a29 / 5) : ((a29 / 5) - 1))))) && (a2 == 1)) && (a29 <= 401234))) || ((((5 == a2) && ((((a29 >= 0) ? (a29 % 5) : ((a29 % 5) + 5)) != 0) || (0 < (340319 + ((a29 >= 0) ? (a29 / 5) : ((a29 / 5) - 1)))))) && (((long long) 42 + a4) <= 0)) && (0 <= (340319 + ((a29 >= 0) ? (a29 / 5) : ((a29 / 5) - 1)))))) || ((((((long long) 42 + a4) <= 0) && (2 == a2)) && (0 <= ((long long) a4 + 85))) && (((long long) a0 + 61) <= 0))) || (((44 <= a29) && (((long long) 89 + a4) <= 0)) && (a2 == 4))) || (((2 == a2) && (44 <= a29)) && (((long long) a0 + 61) <= 0))) || ((((5 == a2) && (((long long) 42 + a4) <= 0)) && (0 <= ((long long) a4 + 85))) && (((long long) a0 + 61) <= 0))) || (((((((((a29 >= 0) ? (a29 % 5) : ((a29 % 5) + 5)) != 0) || (0 < (340319 + ((a29 >= 0) ? (a29 / 5) : ((a29 / 5) - 1))))) && (2 == a2)) && (0 <= ((long long) a4 + 85))) && (0 <= (340319 + ((a29 >= 0) ? (a29 / 5) : ((a29 / 5) - 1))))) && (0 <= ((long long) 146 + a0))) && (((long long) a0 + 61) <= 0))) || ((((((((a29 >= 0) ? (a29 % 5) : ((a29 % 5) + 5)) != 0) || (0 < (340319 + ((a29 >= 0) ? (a29 / 5) : ((a29 / 5) - 1))))) && (((long long) 42 + a4) <= 0)) && (0 <= ((long long) a4 + 85))) && (0 <= (340319 + ((a29 >= 0) ? (a29 / 5) : ((a29 / 5) - 1))))) && (a2 == 4))) || (((a2 == 1) && (((long long) a4 + 86) <= 0)) && (((long long) a29 + 144) <= 0))) || (((((long long) 89 + a4) <= 0) && (0 <= ((long long) 146 + a0))) && (((long long) a0 + 61) <= 0))) || (((((long long) 89 + a4) <= 0) && (((long long) a29 + 18) <= 0)) && (a2 == 1))) || (((((((a29 >= 0) ? (a29 % 5) : ((a29 % 5) + 5)) != 0) || (0 < (340319 + ((a29 >= 0) ? (a29 / 5) : ((a29 / 5) - 1))))) && (((long long) 42 + a4) <= 0)) && (0 <= (340319 + ((a29 >= 0) ? (a29 / 5) : ((a29 / 5) - 1))))) && (3 == a2))) RESULT: Ultimate proved your program to be correct! [2025-01-09 00:02:12,025 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE