./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/psyco/psyco_abp_1-3.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/psyco/psyco_abp_1-3.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 041b6fdf6940cdc60d0f8513696cf56c45d5af72c3bd8ce1d60d3ac14fc6f3dc --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 00:30:19,707 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 00:30:19,760 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:30:19,766 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 00:30:19,768 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 00:30:19,788 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 00:30:19,789 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 00:30:19,789 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 00:30:19,789 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 00:30:19,790 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 00:30:19,790 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 00:30:19,790 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 00:30:19,791 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 00:30:19,791 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 00:30:19,791 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 00:30:19,791 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 00:30:19,791 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 00:30:19,792 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 00:30:19,792 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 00:30:19,792 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 00:30:19,792 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 00:30:19,792 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 00:30:19,792 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 00:30:19,792 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 00:30:19,792 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 00:30:19,792 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 00:30:19,792 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 00:30:19,792 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 00:30:19,792 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 00:30:19,792 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 00:30:19,793 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 00:30:19,793 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 00:30:19,793 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:30:19,793 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 00:30:19,793 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 00:30:19,793 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 00:30:19,793 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 00:30:19,793 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:30:19,794 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 00:30:19,794 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 00:30:19,794 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 00:30:19,794 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 00:30:19,794 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 00:30:19,794 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 00:30:19,794 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 00:30:19,794 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 00:30:19,794 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 00:30:19,794 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 00:30:19,795 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 -> 041b6fdf6940cdc60d0f8513696cf56c45d5af72c3bd8ce1d60d3ac14fc6f3dc [2025-01-09 00:30:20,032 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 00:30:20,040 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 00:30:20,043 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 00:30:20,044 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 00:30:20,045 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 00:30:20,047 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/psyco/psyco_abp_1-3.c [2025-01-09 00:30:21,201 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e4c184af7/68325e08197342ba8f21b053510f64c8/FLAGa27d8fc8e [2025-01-09 00:30:21,443 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 00:30:21,443 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/psyco/psyco_abp_1-3.c [2025-01-09 00:30:21,451 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e4c184af7/68325e08197342ba8f21b053510f64c8/FLAGa27d8fc8e [2025-01-09 00:30:21,767 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e4c184af7/68325e08197342ba8f21b053510f64c8 [2025-01-09 00:30:21,769 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 00:30:21,770 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 00:30:21,771 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 00:30:21,771 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 00:30:21,774 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 00:30:21,774 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:30:21" (1/1) ... [2025-01-09 00:30:21,775 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74f677aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:30:21, skipping insertion in model container [2025-01-09 00:30:21,775 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:30:21" (1/1) ... [2025-01-09 00:30:21,800 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 00:30:22,000 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/psyco/psyco_abp_1-3.c[24720,24733] [2025-01-09 00:30:22,005 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 00:30:22,015 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 00:30:22,084 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/psyco/psyco_abp_1-3.c[24720,24733] [2025-01-09 00:30:22,085 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 00:30:22,107 INFO L204 MainTranslator]: Completed translation [2025-01-09 00:30:22,107 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:30:22 WrapperNode [2025-01-09 00:30:22,108 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 00:30:22,108 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 00:30:22,108 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 00:30:22,109 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 00:30:22,113 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:30:22" (1/1) ... [2025-01-09 00:30:22,120 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:30:22" (1/1) ... [2025-01-09 00:30:22,155 INFO L138 Inliner]: procedures = 12, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 453 [2025-01-09 00:30:22,156 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 00:30:22,156 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 00:30:22,156 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 00:30:22,156 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 00:30:22,166 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:30:22" (1/1) ... [2025-01-09 00:30:22,166 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:30:22" (1/1) ... [2025-01-09 00:30:22,174 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:30:22" (1/1) ... [2025-01-09 00:30:22,193 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:30:22,193 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:30:22" (1/1) ... [2025-01-09 00:30:22,194 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:30:22" (1/1) ... [2025-01-09 00:30:22,201 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:30:22" (1/1) ... [2025-01-09 00:30:22,202 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:30:22" (1/1) ... [2025-01-09 00:30:22,206 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:30:22" (1/1) ... [2025-01-09 00:30:22,208 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:30:22" (1/1) ... [2025-01-09 00:30:22,210 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:30:22" (1/1) ... [2025-01-09 00:30:22,212 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 00:30:22,213 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 00:30:22,213 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 00:30:22,213 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 00:30:22,215 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:30:22" (1/1) ... [2025-01-09 00:30:22,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:30:22,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:30:22,244 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:30:22,250 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:30:22,265 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 00:30:22,265 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 00:30:22,265 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 00:30:22,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 00:30:22,313 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 00:30:22,314 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 00:30:22,871 INFO L? ?]: Removed 274 outVars from TransFormulas that were not future-live. [2025-01-09 00:30:22,871 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 00:30:22,883 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 00:30:22,883 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2025-01-09 00:30:22,883 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:30:22 BoogieIcfgContainer [2025-01-09 00:30:22,883 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 00:30:22,886 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 00:30:22,886 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 00:30:22,889 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 00:30:22,889 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 12:30:21" (1/3) ... [2025-01-09 00:30:22,890 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2aab2945 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:30:22, skipping insertion in model container [2025-01-09 00:30:22,890 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:30:22" (2/3) ... [2025-01-09 00:30:22,890 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2aab2945 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:30:22, skipping insertion in model container [2025-01-09 00:30:22,890 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:30:22" (3/3) ... [2025-01-09 00:30:22,891 INFO L128 eAbstractionObserver]: Analyzing ICFG psyco_abp_1-3.c [2025-01-09 00:30:22,901 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 00:30:22,902 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG psyco_abp_1-3.c that has 1 procedures, 109 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 00:30:22,945 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 00:30:22,955 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;@84265aa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 00:30:22,955 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 00:30:22,958 INFO L276 IsEmpty]: Start isEmpty. Operand has 109 states, 107 states have (on average 1.9439252336448598) internal successors, (208), 108 states have internal predecessors, (208), 0 states have call successors, (0), 0 states 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:30:22,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-01-09 00:30:22,962 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:30:22,962 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:30:22,962 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:30:22,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:30:22,967 INFO L85 PathProgramCache]: Analyzing trace with hash 234237687, now seen corresponding path program 1 times [2025-01-09 00:30:22,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:30:22,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937735912] [2025-01-09 00:30:22,973 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:30:22,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:30:23,024 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-09 00:30:23,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-09 00:30:23,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:30:23,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:30:23,084 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:30:23,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:30:23,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937735912] [2025-01-09 00:30:23,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937735912] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:30:23,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:30:23,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:30:23,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118689049] [2025-01-09 00:30:23,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:30:23,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 00:30:23,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:30:23,100 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 00:30:23,101 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 00:30:23,102 INFO L87 Difference]: Start difference. First operand has 109 states, 107 states have (on average 1.9439252336448598) internal successors, (208), 108 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:30:23,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:30:23,122 INFO L93 Difference]: Finished difference Result 216 states and 414 transitions. [2025-01-09 00:30:23,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 00:30:23,124 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-01-09 00:30:23,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:30:23,130 INFO L225 Difference]: With dead ends: 216 [2025-01-09 00:30:23,131 INFO L226 Difference]: Without dead ends: 100 [2025-01-09 00:30:23,133 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 00:30:23,134 INFO L435 NwaCegarLoop]: 199 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 00:30:23,135 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 00:30:23,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-01-09 00:30:23,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2025-01-09 00:30:23,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 99 states have (on average 1.6666666666666667) internal successors, (165), 99 states have internal predecessors, (165), 0 states have call successors, (0), 0 states 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:30:23,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 165 transitions. [2025-01-09 00:30:23,159 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 165 transitions. Word has length 9 [2025-01-09 00:30:23,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:30:23,159 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 165 transitions. [2025-01-09 00:30:23,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:30:23,159 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 165 transitions. [2025-01-09 00:30:23,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-01-09 00:30:23,160 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:30:23,160 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:30:23,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 00:30:23,160 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:30:23,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:30:23,161 INFO L85 PathProgramCache]: Analyzing trace with hash -796078813, now seen corresponding path program 1 times [2025-01-09 00:30:23,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:30:23,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348147279] [2025-01-09 00:30:23,161 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:30:23,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:30:23,166 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-09 00:30:23,172 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-09 00:30:23,173 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:30:23,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:30:23,230 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:30:23,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:30:23,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348147279] [2025-01-09 00:30:23,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348147279] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:30:23,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:30:23,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:30:23,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791433991] [2025-01-09 00:30:23,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:30:23,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:30:23,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:30:23,232 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:30:23,232 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:30:23,232 INFO L87 Difference]: Start difference. First operand 100 states and 165 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:30:23,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:30:23,292 INFO L93 Difference]: Finished difference Result 201 states and 332 transitions. [2025-01-09 00:30:23,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:30:23,293 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-01-09 00:30:23,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:30:23,293 INFO L225 Difference]: With dead ends: 201 [2025-01-09 00:30:23,293 INFO L226 Difference]: Without dead ends: 103 [2025-01-09 00:30:23,294 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:30:23,294 INFO L435 NwaCegarLoop]: 164 mSDtfsCounter, 4 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 00:30:23,294 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 308 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 00:30:23,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2025-01-09 00:30:23,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2025-01-09 00:30:23,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 102 states have (on average 1.6470588235294117) internal successors, (168), 102 states have internal predecessors, (168), 0 states have call successors, (0), 0 states 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:30:23,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 168 transitions. [2025-01-09 00:30:23,306 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 168 transitions. Word has length 10 [2025-01-09 00:30:23,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:30:23,307 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 168 transitions. [2025-01-09 00:30:23,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:30:23,307 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 168 transitions. [2025-01-09 00:30:23,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-01-09 00:30:23,308 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:30:23,308 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:30:23,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 00:30:23,308 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:30:23,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:30:23,309 INFO L85 PathProgramCache]: Analyzing trace with hash 410821978, now seen corresponding path program 1 times [2025-01-09 00:30:23,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:30:23,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424468468] [2025-01-09 00:30:23,309 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:30:23,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:30:23,319 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-09 00:30:23,351 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-09 00:30:23,351 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:30:23,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:30:23,654 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:30:23,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:30:23,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424468468] [2025-01-09 00:30:23,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424468468] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:30:23,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:30:23,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 00:30:23,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901262503] [2025-01-09 00:30:23,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:30:23,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:30:23,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:30:23,658 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:30:23,658 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:30:23,658 INFO L87 Difference]: Start difference. First operand 103 states and 168 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:30:23,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:30:23,817 INFO L93 Difference]: Finished difference Result 203 states and 333 transitions. [2025-01-09 00:30:23,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:30:23,817 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-01-09 00:30:23,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:30:23,822 INFO L225 Difference]: With dead ends: 203 [2025-01-09 00:30:23,824 INFO L226 Difference]: Without dead ends: 184 [2025-01-09 00:30:23,824 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:30:23,824 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 127 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 00:30:23,825 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 370 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 00:30:23,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2025-01-09 00:30:23,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 172. [2025-01-09 00:30:23,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 171 states have (on average 1.6432748538011697) internal successors, (281), 171 states have internal predecessors, (281), 0 states have call successors, (0), 0 states 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:30:23,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 281 transitions. [2025-01-09 00:30:23,838 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 281 transitions. Word has length 15 [2025-01-09 00:30:23,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:30:23,839 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 281 transitions. [2025-01-09 00:30:23,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:30:23,839 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 281 transitions. [2025-01-09 00:30:23,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-01-09 00:30:23,839 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:30:23,839 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:30:23,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 00:30:23,839 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:30:23,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:30:23,840 INFO L85 PathProgramCache]: Analyzing trace with hash -1693140608, now seen corresponding path program 1 times [2025-01-09 00:30:23,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:30:23,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880485164] [2025-01-09 00:30:23,840 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:30:23,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:30:23,849 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-09 00:30:23,856 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-09 00:30:23,856 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:30:23,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:30:23,878 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:30:23,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:30:23,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880485164] [2025-01-09 00:30:23,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880485164] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:30:23,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:30:23,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:30:23,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091567372] [2025-01-09 00:30:23,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:30:23,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:30:23,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:30:23,879 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:30:23,880 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:30:23,880 INFO L87 Difference]: Start difference. First operand 172 states and 281 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states 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:30:23,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:30:23,903 INFO L93 Difference]: Finished difference Result 293 states and 477 transitions. [2025-01-09 00:30:23,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:30:23,904 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 [2025-01-09 00:30:23,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:30:23,904 INFO L225 Difference]: With dead ends: 293 [2025-01-09 00:30:23,904 INFO L226 Difference]: Without dead ends: 124 [2025-01-09 00:30:23,905 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:30:23,905 INFO L435 NwaCegarLoop]: 164 mSDtfsCounter, 30 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 00:30:23,906 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 283 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 00:30:23,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2025-01-09 00:30:23,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 122. [2025-01-09 00:30:23,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 121 states have (on average 1.603305785123967) internal successors, (194), 121 states have internal predecessors, (194), 0 states have call successors, (0), 0 states 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:30:23,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 194 transitions. [2025-01-09 00:30:23,910 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 194 transitions. Word has length 16 [2025-01-09 00:30:23,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:30:23,910 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 194 transitions. [2025-01-09 00:30:23,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states 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:30:23,910 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 194 transitions. [2025-01-09 00:30:23,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-01-09 00:30:23,911 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:30:23,911 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:30:23,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 00:30:23,911 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:30:23,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:30:23,911 INFO L85 PathProgramCache]: Analyzing trace with hash 987465085, now seen corresponding path program 1 times [2025-01-09 00:30:23,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:30:23,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816017000] [2025-01-09 00:30:23,912 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:30:23,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:30:23,917 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-09 00:30:23,926 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-09 00:30:23,926 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:30:23,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:30:23,973 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 00:30:23,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:30:23,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816017000] [2025-01-09 00:30:23,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816017000] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:30:23,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:30:23,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:30:23,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972729478] [2025-01-09 00:30:23,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:30:23,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:30:23,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:30:23,974 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:30:23,974 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:30:23,974 INFO L87 Difference]: Start difference. First operand 122 states and 194 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states 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:30:24,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:30:24,000 INFO L93 Difference]: Finished difference Result 248 states and 395 transitions. [2025-01-09 00:30:24,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:30:24,001 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 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 21 [2025-01-09 00:30:24,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:30:24,001 INFO L225 Difference]: With dead ends: 248 [2025-01-09 00:30:24,001 INFO L226 Difference]: Without dead ends: 129 [2025-01-09 00:30:24,002 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:30:24,002 INFO L435 NwaCegarLoop]: 163 mSDtfsCounter, 32 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 00:30:24,002 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 282 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 00:30:24,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2025-01-09 00:30:24,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 127. [2025-01-09 00:30:24,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 126 states have (on average 1.5793650793650793) internal successors, (199), 126 states have internal predecessors, (199), 0 states have call successors, (0), 0 states 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:30:24,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 199 transitions. [2025-01-09 00:30:24,011 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 199 transitions. Word has length 21 [2025-01-09 00:30:24,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:30:24,011 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 199 transitions. [2025-01-09 00:30:24,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states 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:30:24,012 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 199 transitions. [2025-01-09 00:30:24,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-01-09 00:30:24,012 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:30:24,012 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:30:24,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 00:30:24,012 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:30:24,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:30:24,013 INFO L85 PathProgramCache]: Analyzing trace with hash 1877160126, now seen corresponding path program 1 times [2025-01-09 00:30:24,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:30:24,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651104293] [2025-01-09 00:30:24,013 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:30:24,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:30:24,021 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-09 00:30:24,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-09 00:30:24,030 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:30:24,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:30:24,164 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:30:24,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:30:24,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651104293] [2025-01-09 00:30:24,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651104293] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:30:24,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1312424969] [2025-01-09 00:30:24,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:30:24,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:30:24,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:30:24,174 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:30:24,175 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:30:24,215 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-09 00:30:24,237 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-09 00:30:24,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:30:24,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:30:24,242 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 00:30:24,244 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:30:24,283 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:30:24,284 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 00:30:24,347 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:30:24,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1312424969] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 00:30:24,347 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 00:30:24,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 9 [2025-01-09 00:30:24,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167686067] [2025-01-09 00:30:24,347 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 00:30:24,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 00:30:24,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:30:24,348 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 00:30:24,348 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-01-09 00:30:24,348 INFO L87 Difference]: Start difference. First operand 127 states and 199 transitions. Second operand has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 9 states have internal predecessors, (53), 0 states have call successors, (0), 0 states 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:30:24,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:30:24,768 INFO L93 Difference]: Finished difference Result 452 states and 722 transitions. [2025-01-09 00:30:24,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 00:30:24,769 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 9 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2025-01-09 00:30:24,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:30:24,771 INFO L225 Difference]: With dead ends: 452 [2025-01-09 00:30:24,771 INFO L226 Difference]: Without dead ends: 400 [2025-01-09 00:30:24,772 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2025-01-09 00:30:24,772 INFO L435 NwaCegarLoop]: 298 mSDtfsCounter, 1338 mSDsluCounter, 980 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1338 SdHoareTripleChecker+Valid, 1278 SdHoareTripleChecker+Invalid, 427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 00:30:24,772 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1338 Valid, 1278 Invalid, 427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 343 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 00:30:24,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2025-01-09 00:30:24,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 348. [2025-01-09 00:30:24,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 348 states, 347 states have (on average 1.5878962536023056) internal successors, (551), 347 states have internal predecessors, (551), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:30:24,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 551 transitions. [2025-01-09 00:30:24,785 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 551 transitions. Word has length 23 [2025-01-09 00:30:24,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:30:24,785 INFO L471 AbstractCegarLoop]: Abstraction has 348 states and 551 transitions. [2025-01-09 00:30:24,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 9 states have internal predecessors, (53), 0 states have call successors, (0), 0 states 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:30:24,786 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 551 transitions. [2025-01-09 00:30:24,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-01-09 00:30:24,786 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:30:24,786 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:30:24,793 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:30:24,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:30:24,993 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:30:24,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:30:24,993 INFO L85 PathProgramCache]: Analyzing trace with hash -1320477952, now seen corresponding path program 1 times [2025-01-09 00:30:24,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:30:24,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611211145] [2025-01-09 00:30:24,993 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:30:24,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:30:25,001 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-09 00:30:25,016 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-09 00:30:25,016 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:30:25,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:30:25,219 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:30:25,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:30:25,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611211145] [2025-01-09 00:30:25,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611211145] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:30:25,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [507297701] [2025-01-09 00:30:25,220 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:30:25,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:30:25,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:30:25,222 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:30:25,224 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:30:25,263 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-09 00:30:25,279 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-09 00:30:25,279 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:30:25,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:30:25,281 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 00:30:25,282 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:30:25,349 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 00:30:25,349 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 00:30:25,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [507297701] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:30:25,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 00:30:25,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-01-09 00:30:25,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144518243] [2025-01-09 00:30:25,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:30:25,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:30:25,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:30:25,351 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:30:25,351 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 00:30:25,351 INFO L87 Difference]: Start difference. First operand 348 states and 551 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states 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:30:25,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:30:25,366 INFO L93 Difference]: Finished difference Result 355 states and 557 transitions. [2025-01-09 00:30:25,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:30:25,366 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 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 27 [2025-01-09 00:30:25,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:30:25,368 INFO L225 Difference]: With dead ends: 355 [2025-01-09 00:30:25,368 INFO L226 Difference]: Without dead ends: 348 [2025-01-09 00:30:25,368 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 00:30:25,368 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 145 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 00:30:25,369 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 163 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 00:30:25,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2025-01-09 00:30:25,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 343. [2025-01-09 00:30:25,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 342 states have (on average 1.567251461988304) internal successors, (536), 342 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:30:25,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 536 transitions. [2025-01-09 00:30:25,394 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 536 transitions. Word has length 27 [2025-01-09 00:30:25,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:30:25,394 INFO L471 AbstractCegarLoop]: Abstraction has 343 states and 536 transitions. [2025-01-09 00:30:25,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states 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:30:25,394 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 536 transitions. [2025-01-09 00:30:25,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-01-09 00:30:25,394 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:30:25,394 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:30:25,401 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:30:25,599 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:30:25,599 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:30:25,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:30:25,600 INFO L85 PathProgramCache]: Analyzing trace with hash 1231404125, now seen corresponding path program 1 times [2025-01-09 00:30:25,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:30:25,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252576240] [2025-01-09 00:30:25,600 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:30:25,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:30:25,611 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-09 00:30:25,616 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-09 00:30:25,616 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:30:25,616 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:30:25,640 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-01-09 00:30:25,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:30:25,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252576240] [2025-01-09 00:30:25,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252576240] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:30:25,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:30:25,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:30:25,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717665659] [2025-01-09 00:30:25,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:30:25,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:30:25,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:30:25,641 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:30:25,641 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:30:25,641 INFO L87 Difference]: Start difference. First operand 343 states and 536 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states 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:30:25,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:30:25,664 INFO L93 Difference]: Finished difference Result 583 states and 907 transitions. [2025-01-09 00:30:25,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:30:25,664 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-01-09 00:30:25,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:30:25,665 INFO L225 Difference]: With dead ends: 583 [2025-01-09 00:30:25,665 INFO L226 Difference]: Without dead ends: 243 [2025-01-09 00:30:25,666 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:30:25,666 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 61 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 00:30:25,666 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 184 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 00:30:25,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2025-01-09 00:30:25,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 241. [2025-01-09 00:30:25,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 240 states have (on average 1.5041666666666667) internal successors, (361), 240 states have internal predecessors, (361), 0 states have call successors, (0), 0 states 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:30:25,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 361 transitions. [2025-01-09 00:30:25,671 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 361 transitions. Word has length 30 [2025-01-09 00:30:25,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:30:25,671 INFO L471 AbstractCegarLoop]: Abstraction has 241 states and 361 transitions. [2025-01-09 00:30:25,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states 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:30:25,671 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 361 transitions. [2025-01-09 00:30:25,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-01-09 00:30:25,672 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:30:25,672 INFO L218 NwaCegarLoop]: trace histogram [4, 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] [2025-01-09 00:30:25,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 00:30:25,672 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:30:25,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:30:25,673 INFO L85 PathProgramCache]: Analyzing trace with hash 2046419339, now seen corresponding path program 1 times [2025-01-09 00:30:25,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:30:25,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829277584] [2025-01-09 00:30:25,673 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:30:25,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:30:25,679 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-01-09 00:30:25,683 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-01-09 00:30:25,683 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:30:25,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:30:25,702 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-01-09 00:30:25,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:30:25,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829277584] [2025-01-09 00:30:25,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829277584] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:30:25,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:30:25,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:30:25,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607522402] [2025-01-09 00:30:25,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:30:25,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:30:25,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:30:25,703 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:30:25,703 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:30:25,703 INFO L87 Difference]: Start difference. First operand 241 states and 361 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states 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:30:25,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:30:25,724 INFO L93 Difference]: Finished difference Result 424 states and 632 transitions. [2025-01-09 00:30:25,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:30:25,724 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 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 37 [2025-01-09 00:30:25,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:30:25,725 INFO L225 Difference]: With dead ends: 424 [2025-01-09 00:30:25,725 INFO L226 Difference]: Without dead ends: 225 [2025-01-09 00:30:25,726 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:30:25,726 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 28 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 00:30:25,726 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 212 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 00:30:25,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2025-01-09 00:30:25,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 223. [2025-01-09 00:30:25,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 222 states have (on average 1.4594594594594594) internal successors, (324), 222 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:30:25,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 324 transitions. [2025-01-09 00:30:25,731 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 324 transitions. Word has length 37 [2025-01-09 00:30:25,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:30:25,731 INFO L471 AbstractCegarLoop]: Abstraction has 223 states and 324 transitions. [2025-01-09 00:30:25,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states 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:30:25,731 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 324 transitions. [2025-01-09 00:30:25,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-01-09 00:30:25,732 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:30:25,732 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:30:25,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 00:30:25,732 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:30:25,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:30:25,733 INFO L85 PathProgramCache]: Analyzing trace with hash -1149209427, now seen corresponding path program 1 times [2025-01-09 00:30:25,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:30:25,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336406141] [2025-01-09 00:30:25,733 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:30:25,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:30:25,741 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-01-09 00:30:25,746 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-01-09 00:30:25,747 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:30:25,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:30:25,777 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-01-09 00:30:25,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:30:25,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336406141] [2025-01-09 00:30:25,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336406141] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:30:25,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:30:25,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:30:25,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144716432] [2025-01-09 00:30:25,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:30:25,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:30:25,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:30:25,779 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:30:25,779 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:30:25,779 INFO L87 Difference]: Start difference. First operand 223 states and 324 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:30:25,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:30:25,797 INFO L93 Difference]: Finished difference Result 305 states and 442 transitions. [2025-01-09 00:30:25,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:30:25,798 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2025-01-09 00:30:25,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:30:25,799 INFO L225 Difference]: With dead ends: 305 [2025-01-09 00:30:25,799 INFO L226 Difference]: Without dead ends: 143 [2025-01-09 00:30:25,799 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:30:25,799 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 27 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 00:30:25,800 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 184 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 00:30:25,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2025-01-09 00:30:25,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 141. [2025-01-09 00:30:25,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 140 states have (on average 1.4214285714285715) internal successors, (199), 140 states have internal predecessors, (199), 0 states have call successors, (0), 0 states 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:30:25,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 199 transitions. [2025-01-09 00:30:25,802 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 199 transitions. Word has length 46 [2025-01-09 00:30:25,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:30:25,803 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 199 transitions. [2025-01-09 00:30:25,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:30:25,803 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 199 transitions. [2025-01-09 00:30:25,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-01-09 00:30:25,803 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:30:25,804 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:30:25,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 00:30:25,804 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:30:25,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:30:25,804 INFO L85 PathProgramCache]: Analyzing trace with hash 2075416648, now seen corresponding path program 1 times [2025-01-09 00:30:25,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:30:25,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275249822] [2025-01-09 00:30:25,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:30:25,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:30:25,811 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-01-09 00:30:25,821 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-01-09 00:30:25,821 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:30:25,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:30:25,968 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 20 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-09 00:30:25,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:30:25,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275249822] [2025-01-09 00:30:25,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [275249822] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:30:25,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [175083410] [2025-01-09 00:30:25,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:30:25,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:30:25,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:30:25,970 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:30:25,972 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:30:26,015 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-01-09 00:30:26,041 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-01-09 00:30:26,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:30:26,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:30:26,045 INFO L256 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-01-09 00:30:26,047 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:30:26,140 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 20 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-09 00:30:26,141 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 00:30:26,236 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 15 proven. 11 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-01-09 00:30:26,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [175083410] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 00:30:26,237 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 00:30:26,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 5] total 11 [2025-01-09 00:30:26,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084220349] [2025-01-09 00:30:26,237 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 00:30:26,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 00:30:26,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:30:26,238 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 00:30:26,238 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2025-01-09 00:30:26,238 INFO L87 Difference]: Start difference. First operand 141 states and 199 transitions. Second operand has 11 states, 11 states have (on average 8.636363636363637) internal successors, (95), 11 states have internal predecessors, (95), 0 states have call successors, (0), 0 states 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:30:26,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:30:26,355 INFO L93 Difference]: Finished difference Result 182 states and 258 transitions. [2025-01-09 00:30:26,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 00:30:26,355 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.636363636363637) internal successors, (95), 11 states have internal predecessors, (95), 0 states have call successors, (0), 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 47 [2025-01-09 00:30:26,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:30:26,357 INFO L225 Difference]: With dead ends: 182 [2025-01-09 00:30:26,357 INFO L226 Difference]: Without dead ends: 174 [2025-01-09 00:30:26,357 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 87 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-01-09 00:30:26,358 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 352 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 352 SdHoareTripleChecker+Valid, 530 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 00:30:26,359 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [352 Valid, 530 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 00:30:26,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2025-01-09 00:30:26,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 137. [2025-01-09 00:30:26,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 136 states have (on average 1.4044117647058822) internal successors, (191), 136 states have internal predecessors, (191), 0 states have call successors, (0), 0 states 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:30:26,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 191 transitions. [2025-01-09 00:30:26,368 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 191 transitions. Word has length 47 [2025-01-09 00:30:26,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:30:26,369 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 191 transitions. [2025-01-09 00:30:26,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.636363636363637) internal successors, (95), 11 states have internal predecessors, (95), 0 states have call successors, (0), 0 states 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:30:26,370 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 191 transitions. [2025-01-09 00:30:26,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-01-09 00:30:26,370 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:30:26,371 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:30:26,378 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:30:26,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:30:26,575 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:30:26,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:30:26,576 INFO L85 PathProgramCache]: Analyzing trace with hash 1860568618, now seen corresponding path program 1 times [2025-01-09 00:30:26,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:30:26,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709754852] [2025-01-09 00:30:26,576 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:30:26,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:30:26,586 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-01-09 00:30:26,606 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-01-09 00:30:26,606 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:30:26,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:30:27,017 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:30:27,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:30:27,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709754852] [2025-01-09 00:30:27,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709754852] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:30:27,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [297861371] [2025-01-09 00:30:27,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:30:27,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:30:27,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:30:27,021 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:30:27,028 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:30:27,071 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-01-09 00:30:27,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-01-09 00:30:27,096 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:30:27,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:30:27,098 INFO L256 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-01-09 00:30:27,100 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:30:27,250 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:30:27,250 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 00:30:27,492 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 15 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 00:30:27,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [297861371] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 00:30:27,492 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 00:30:27,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 15 [2025-01-09 00:30:27,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086601675] [2025-01-09 00:30:27,493 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 00:30:27,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-09 00:30:27,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:30:27,493 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-09 00:30:27,493 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2025-01-09 00:30:27,494 INFO L87 Difference]: Start difference. First operand 137 states and 191 transitions. Second operand has 15 states, 15 states have (on average 8.733333333333333) internal successors, (131), 15 states have internal predecessors, (131), 0 states have call successors, (0), 0 states 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:30:27,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:30:27,615 INFO L93 Difference]: Finished difference Result 161 states and 223 transitions. [2025-01-09 00:30:27,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 00:30:27,616 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 8.733333333333333) internal successors, (131), 15 states have internal predecessors, (131), 0 states have call successors, (0), 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 51 [2025-01-09 00:30:27,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:30:27,617 INFO L225 Difference]: With dead ends: 161 [2025-01-09 00:30:27,617 INFO L226 Difference]: Without dead ends: 159 [2025-01-09 00:30:27,617 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2025-01-09 00:30:27,618 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 144 mSDsluCounter, 957 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 1066 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 00:30:27,618 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 1066 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 00:30:27,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2025-01-09 00:30:27,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 137. [2025-01-09 00:30:27,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 136 states have (on average 1.3897058823529411) internal successors, (189), 136 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:30:27,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 189 transitions. [2025-01-09 00:30:27,626 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 189 transitions. Word has length 51 [2025-01-09 00:30:27,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:30:27,626 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 189 transitions. [2025-01-09 00:30:27,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 8.733333333333333) internal successors, (131), 15 states have internal predecessors, (131), 0 states have call successors, (0), 0 states 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:30:27,626 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 189 transitions. [2025-01-09 00:30:27,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-01-09 00:30:27,627 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:30:27,627 INFO L218 NwaCegarLoop]: trace histogram [6, 5, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:30:27,633 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:30:27,827 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:30:27,828 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:30:27,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:30:27,828 INFO L85 PathProgramCache]: Analyzing trace with hash -1345516979, now seen corresponding path program 1 times [2025-01-09 00:30:27,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:30:27,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506026338] [2025-01-09 00:30:27,828 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:30:27,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:30:27,841 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-01-09 00:30:27,866 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-01-09 00:30:27,866 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:30:27,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:30:28,319 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 10 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:30:28,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:30:28,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506026338] [2025-01-09 00:30:28,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506026338] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:30:28,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [100487842] [2025-01-09 00:30:28,320 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:30:28,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:30:28,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:30:28,322 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:30:28,328 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:30:28,375 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-01-09 00:30:28,407 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-01-09 00:30:28,407 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:30:28,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:30:28,413 INFO L256 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-01-09 00:30:28,415 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:30:28,645 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 10 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:30:28,646 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 00:30:28,932 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 23 proven. 25 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 00:30:28,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [100487842] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 00:30:28,932 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 00:30:28,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 7] total 19 [2025-01-09 00:30:28,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505932560] [2025-01-09 00:30:28,932 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 00:30:28,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-01-09 00:30:28,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:30:28,933 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-01-09 00:30:28,933 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2025-01-09 00:30:28,934 INFO L87 Difference]: Start difference. First operand 137 states and 189 transitions. Second operand has 19 states, 19 states have (on average 7.842105263157895) internal successors, (149), 19 states have internal predecessors, (149), 0 states have call successors, (0), 0 states 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:30:29,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:30:29,087 INFO L93 Difference]: Finished difference Result 248 states and 347 transitions. [2025-01-09 00:30:29,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-01-09 00:30:29,088 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 7.842105263157895) internal successors, (149), 19 states have internal predecessors, (149), 0 states have call successors, (0), 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 57 [2025-01-09 00:30:29,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:30:29,088 INFO L225 Difference]: With dead ends: 248 [2025-01-09 00:30:29,088 INFO L226 Difference]: Without dead ends: 0 [2025-01-09 00:30:29,089 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=306, Unknown=0, NotChecked=0, Total=380 [2025-01-09 00:30:29,089 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 352 mSDsluCounter, 1000 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 352 SdHoareTripleChecker+Valid, 1130 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 00:30:29,089 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [352 Valid, 1130 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 00:30:29,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-01-09 00:30:29,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-01-09 00:30:29,091 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:30:29,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-01-09 00:30:29,091 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 57 [2025-01-09 00:30:29,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:30:29,091 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-09 00:30:29,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 7.842105263157895) internal successors, (149), 19 states have internal predecessors, (149), 0 states have call successors, (0), 0 states 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:30:29,092 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-01-09 00:30:29,092 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-01-09 00:30:29,094 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 00:30:29,101 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:30:29,295 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,SelfDestructingSolverStorable12 [2025-01-09 00:30:29,298 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:30:29,300 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-01-09 00:30:29,347 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 00:30:29,356 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 12:30:29 BoogieIcfgContainer [2025-01-09 00:30:29,356 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 00:30:29,356 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 00:30:29,356 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 00:30:29,357 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 00:30:29,357 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:30:22" (3/4) ... [2025-01-09 00:30:29,358 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-09 00:30:29,367 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2025-01-09 00:30:29,369 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-01-09 00:30:29,369 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-09 00:30:29,369 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-09 00:30:29,427 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 00:30:29,427 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 00:30:29,427 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 00:30:29,428 INFO L158 Benchmark]: Toolchain (without parser) took 7658.13ms. Allocated memory was 142.6MB in the beginning and 327.2MB in the end (delta: 184.5MB). Free memory was 104.8MB in the beginning and 198.7MB in the end (delta: -93.9MB). Peak memory consumption was 88.8MB. Max. memory is 16.1GB. [2025-01-09 00:30:29,429 INFO L158 Benchmark]: CDTParser took 0.40ms. Allocated memory is still 201.3MB. Free memory is still 126.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 00:30:29,429 INFO L158 Benchmark]: CACSL2BoogieTranslator took 337.10ms. Allocated memory is still 142.6MB. Free memory was 104.8MB in the beginning and 85.1MB in the end (delta: 19.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 00:30:29,429 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.43ms. Allocated memory is still 142.6MB. Free memory was 85.1MB in the beginning and 81.5MB in the end (delta: 3.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 00:30:29,429 INFO L158 Benchmark]: Boogie Preprocessor took 56.28ms. Allocated memory is still 142.6MB. Free memory was 81.5MB in the beginning and 77.9MB in the end (delta: 3.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 00:30:29,429 INFO L158 Benchmark]: RCFGBuilder took 670.18ms. Allocated memory is still 142.6MB. Free memory was 77.9MB in the beginning and 100.1MB in the end (delta: -22.1MB). Peak memory consumption was 56.6MB. Max. memory is 16.1GB. [2025-01-09 00:30:29,430 INFO L158 Benchmark]: TraceAbstraction took 6470.17ms. Allocated memory was 142.6MB in the beginning and 327.2MB in the end (delta: 184.5MB). Free memory was 100.1MB in the beginning and 202.4MB in the end (delta: -102.3MB). Peak memory consumption was 82.5MB. Max. memory is 16.1GB. [2025-01-09 00:30:29,430 INFO L158 Benchmark]: Witness Printer took 71.10ms. Allocated memory is still 327.2MB. Free memory was 202.4MB in the beginning and 198.7MB in the end (delta: 3.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 00:30:29,431 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.40ms. Allocated memory is still 201.3MB. Free memory is still 126.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 337.10ms. Allocated memory is still 142.6MB. Free memory was 104.8MB in the beginning and 85.1MB in the end (delta: 19.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.43ms. Allocated memory is still 142.6MB. Free memory was 85.1MB in the beginning and 81.5MB in the end (delta: 3.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 56.28ms. Allocated memory is still 142.6MB. Free memory was 81.5MB in the beginning and 77.9MB in the end (delta: 3.5MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 670.18ms. Allocated memory is still 142.6MB. Free memory was 77.9MB in the beginning and 100.1MB in the end (delta: -22.1MB). Peak memory consumption was 56.6MB. Max. memory is 16.1GB. * TraceAbstraction took 6470.17ms. Allocated memory was 142.6MB in the beginning and 327.2MB in the end (delta: 184.5MB). Free memory was 100.1MB in the beginning and 202.4MB in the end (delta: -102.3MB). Peak memory consumption was 82.5MB. Max. memory is 16.1GB. * Witness Printer took 71.10ms. Allocated memory is still 327.2MB. Free memory was 202.4MB in the beginning and 198.7MB in the end (delta: 3.7MB). There was no memory consumed. 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: 567]: 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, 109 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.4s, OverallIterations: 13, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2640 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2640 mSDsluCounter, 6189 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4148 mSDsCounter, 143 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 982 IncrementalHoareTripleChecker+Invalid, 1125 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 143 mSolverCounterUnsat, 2041 mSDtfsCounter, 982 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 441 GetRequests, 374 SyntacticMatches, 3 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=348occurred in iteration=6, InterpolantAutomatonStates: 75, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 138 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 594 NumberOfCodeBlocks, 594 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 750 ConstructedInterpolants, 0 QuantifiedInterpolants, 4823 SizeOfPredicates, 4 NumberOfNonLiveVariables, 1099 ConjunctsInSsa, 78 ConjunctsInUnsatCore, 22 InterpolantComputations, 9 PerfectInterpolantSequences, 233/467 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: 26]: Loop Invariant Derived loop invariant: ((((this_buffer_empty == 0) && (1 == (((long long) this_expect + 1) % 2))) && (5 <= q)) || (((this_expect == 0) && (this_buffer_empty == 0)) && (q == 0))) RESULT: Ultimate proved your program to be correct! [2025-01-09 00:30:29,447 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