./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.4.ufo.UNBOUNDED.pals+Problem12_label03.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/combinations/pals_lcr.4.ufo.UNBOUNDED.pals+Problem12_label03.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 2aece9bc24459d3bfdb5e96b44f652012670bcbf1cd47e085c4f986f518e00f1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 05:47:30,720 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 05:47:30,779 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 05:47:30,784 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 05:47:30,785 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 05:47:30,806 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 05:47:30,807 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 05:47:30,807 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 05:47:30,808 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 05:47:30,808 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 05:47:30,809 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 05:47:30,809 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 05:47:30,809 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 05:47:30,809 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 05:47:30,809 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 05:47:30,810 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 05:47:30,810 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 05:47:30,810 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 05:47:30,810 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 05:47:30,810 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 05:47:30,810 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 05:47:30,810 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 05:47:30,810 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 05:47:30,810 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 05:47:30,810 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 05:47:30,810 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 05:47:30,810 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 05:47:30,810 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 05:47:30,810 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 05:47:30,810 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 05:47:30,810 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 05:47:30,810 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 05:47:30,810 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:47:30,810 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 05:47:30,811 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 05:47:30,811 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 05:47:30,811 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 05:47:30,811 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:47:30,811 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 05:47:30,811 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 05:47:30,811 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 05:47:30,811 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 05:47:30,811 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 05:47:30,811 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 05:47:30,811 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 05:47:30,811 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 05:47:30,811 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 05:47:30,811 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 05:47:30,811 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 -> 2aece9bc24459d3bfdb5e96b44f652012670bcbf1cd47e085c4f986f518e00f1 [2025-01-09 05:47:31,047 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 05:47:31,060 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 05:47:31,062 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 05:47:31,065 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 05:47:31,065 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 05:47:31,067 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.4.ufo.UNBOUNDED.pals+Problem12_label03.c [2025-01-09 05:47:32,223 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d4f872cac/e5554d13c54744c984cfe9f9ffd3950e/FLAG8cdf51f20 [2025-01-09 05:47:32,676 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 05:47:32,676 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.4.ufo.UNBOUNDED.pals+Problem12_label03.c [2025-01-09 05:47:32,699 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d4f872cac/e5554d13c54744c984cfe9f9ffd3950e/FLAG8cdf51f20 [2025-01-09 05:47:32,814 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d4f872cac/e5554d13c54744c984cfe9f9ffd3950e [2025-01-09 05:47:32,815 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 05:47:32,816 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 05:47:32,818 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 05:47:32,818 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 05:47:32,821 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 05:47:32,822 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 05:47:32" (1/1) ... [2025-01-09 05:47:32,823 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ee2e45b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:47:32, skipping insertion in model container [2025-01-09 05:47:32,824 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 05:47:32" (1/1) ... [2025-01-09 05:47:32,899 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 05:47:33,183 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/combinations/pals_lcr.4.ufo.UNBOUNDED.pals+Problem12_label03.c[8712,8725] [2025-01-09 05:47:33,241 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/combinations/pals_lcr.4.ufo.UNBOUNDED.pals+Problem12_label03.c[11049,11062] [2025-01-09 05:47:33,705 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 05:47:33,715 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 05:47:33,747 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/combinations/pals_lcr.4.ufo.UNBOUNDED.pals+Problem12_label03.c[8712,8725] [2025-01-09 05:47:33,750 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/combinations/pals_lcr.4.ufo.UNBOUNDED.pals+Problem12_label03.c[11049,11062] [2025-01-09 05:47:34,036 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 05:47:34,056 INFO L204 MainTranslator]: Completed translation [2025-01-09 05:47:34,057 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:47:34 WrapperNode [2025-01-09 05:47:34,057 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 05:47:34,058 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 05:47:34,058 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 05:47:34,058 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 05:47:34,062 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:47:34" (1/1) ... [2025-01-09 05:47:34,110 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:47:34" (1/1) ... [2025-01-09 05:47:34,371 INFO L138 Inliner]: procedures = 36, calls = 21, calls flagged for inlining = 16, calls inlined = 16, statements flattened = 5033 [2025-01-09 05:47:34,372 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 05:47:34,372 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 05:47:34,372 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 05:47:34,372 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 05:47:34,378 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:47:34" (1/1) ... [2025-01-09 05:47:34,379 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:47:34" (1/1) ... [2025-01-09 05:47:34,415 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:47:34" (1/1) ... [2025-01-09 05:47:34,682 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 05:47:34,682 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:47:34" (1/1) ... [2025-01-09 05:47:34,682 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:47:34" (1/1) ... [2025-01-09 05:47:34,861 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:47:34" (1/1) ... [2025-01-09 05:47:34,883 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:47:34" (1/1) ... [2025-01-09 05:47:34,899 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:47:34" (1/1) ... [2025-01-09 05:47:34,921 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:47:34" (1/1) ... [2025-01-09 05:47:34,933 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:47:34" (1/1) ... [2025-01-09 05:47:34,975 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 05:47:34,976 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 05:47:34,976 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 05:47:34,976 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 05:47:34,977 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:47:34" (1/1) ... [2025-01-09 05:47:34,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:47:34,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:47:35,003 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 05:47:35,009 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 05:47:35,026 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 05:47:35,026 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 05:47:35,026 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 05:47:35,026 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 05:47:35,107 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 05:47:35,109 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 05:47:38,745 INFO L? ?]: Removed 739 outVars from TransFormulas that were not future-live. [2025-01-09 05:47:38,746 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 05:47:38,770 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 05:47:38,770 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2025-01-09 05:47:38,771 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 05:47:38 BoogieIcfgContainer [2025-01-09 05:47:38,774 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 05:47:38,776 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 05:47:38,776 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 05:47:38,780 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 05:47:38,783 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 05:47:32" (1/3) ... [2025-01-09 05:47:38,784 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@112bb9da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 05:47:38, skipping insertion in model container [2025-01-09 05:47:38,784 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:47:34" (2/3) ... [2025-01-09 05:47:38,784 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@112bb9da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 05:47:38, skipping insertion in model container [2025-01-09 05:47:38,784 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 05:47:38" (3/3) ... [2025-01-09 05:47:38,785 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.4.ufo.UNBOUNDED.pals+Problem12_label03.c [2025-01-09 05:47:38,797 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 05:47:38,800 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.4.ufo.UNBOUNDED.pals+Problem12_label03.c that has 1 procedures, 886 locations, 1 initial locations, 2 loop locations, and 2 error locations. [2025-01-09 05:47:38,893 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 05:47:38,911 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;@46a4d480, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 05:47:38,912 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-01-09 05:47:38,921 INFO L276 IsEmpty]: Start isEmpty. Operand has 886 states, 883 states have (on average 1.9037372593431483) internal successors, (1681), 885 states have internal predecessors, (1681), 0 states have call successors, (0), 0 states 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 05:47:38,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-01-09 05:47:38,932 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:47:38,933 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:47:38,933 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:47:38,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:47:38,938 INFO L85 PathProgramCache]: Analyzing trace with hash -1031177696, now seen corresponding path program 1 times [2025-01-09 05:47:38,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:47:38,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169337656] [2025-01-09 05:47:38,944 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:47:38,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:47:38,994 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-09 05:47:39,014 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-09 05:47:39,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:47:39,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:47:39,177 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 05:47:39,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:47:39,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169337656] [2025-01-09 05:47:39,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169337656] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:47:39,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:47:39,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 05:47:39,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531341115] [2025-01-09 05:47:39,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:47:39,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:47:39,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:47:39,219 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:47:39,219 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:47:39,226 INFO L87 Difference]: Start difference. First operand has 886 states, 883 states have (on average 1.9037372593431483) internal successors, (1681), 885 states have internal predecessors, (1681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 2 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 05:47:42,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:47:42,312 INFO L93 Difference]: Finished difference Result 2497 states and 4808 transitions. [2025-01-09 05:47:42,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:47:42,314 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 2 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 20 [2025-01-09 05:47:42,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:47:42,330 INFO L225 Difference]: With dead ends: 2497 [2025-01-09 05:47:42,330 INFO L226 Difference]: Without dead ends: 1572 [2025-01-09 05:47:42,336 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:47:42,338 INFO L435 NwaCegarLoop]: 259 mSDtfsCounter, 990 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 2437 mSolverCounterSat, 771 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 990 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 3208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 771 IncrementalHoareTripleChecker+Valid, 2437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:47:42,338 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [990 Valid, 270 Invalid, 3208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [771 Valid, 2437 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2025-01-09 05:47:42,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1572 states. [2025-01-09 05:47:42,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1572 to 1572. [2025-01-09 05:47:42,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1572 states, 1570 states have (on average 1.8407643312101911) internal successors, (2890), 1571 states have internal predecessors, (2890), 0 states have call successors, (0), 0 states 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 05:47:42,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2890 transitions. [2025-01-09 05:47:42,409 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2890 transitions. Word has length 20 [2025-01-09 05:47:42,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:47:42,410 INFO L471 AbstractCegarLoop]: Abstraction has 1572 states and 2890 transitions. [2025-01-09 05:47:42,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 2 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 05:47:42,410 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2890 transitions. [2025-01-09 05:47:42,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-01-09 05:47:42,411 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:47:42,411 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:47:42,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 05:47:42,411 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:47:42,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:47:42,412 INFO L85 PathProgramCache]: Analyzing trace with hash 37471187, now seen corresponding path program 1 times [2025-01-09 05:47:42,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:47:42,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971800068] [2025-01-09 05:47:42,412 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:47:42,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:47:42,422 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-09 05:47:42,439 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-09 05:47:42,439 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:47:42,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:47:42,572 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 05:47:42,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:47:42,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971800068] [2025-01-09 05:47:42,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971800068] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:47:42,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:47:42,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 05:47:42,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715849407] [2025-01-09 05:47:42,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:47:42,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 05:47:42,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:47:42,574 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 05:47:42,574 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 05:47:42,574 INFO L87 Difference]: Start difference. First operand 1572 states and 2890 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states 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 05:47:42,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:47:42,667 INFO L93 Difference]: Finished difference Result 1614 states and 2954 transitions. [2025-01-09 05:47:42,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 05:47:42,672 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 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 22 [2025-01-09 05:47:42,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:47:42,685 INFO L225 Difference]: With dead ends: 1614 [2025-01-09 05:47:42,685 INFO L226 Difference]: Without dead ends: 1572 [2025-01-09 05:47:42,686 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 05:47:42,691 INFO L435 NwaCegarLoop]: 1549 mSDtfsCounter, 0 mSDsluCounter, 4619 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6168 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:47:42,691 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6168 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:47:42,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1572 states. [2025-01-09 05:47:42,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1572 to 1572. [2025-01-09 05:47:42,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1572 states, 1570 states have (on average 1.8261146496815286) internal successors, (2867), 1571 states have internal predecessors, (2867), 0 states have call successors, (0), 0 states 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 05:47:42,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2867 transitions. [2025-01-09 05:47:42,765 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2867 transitions. Word has length 22 [2025-01-09 05:47:42,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:47:42,765 INFO L471 AbstractCegarLoop]: Abstraction has 1572 states and 2867 transitions. [2025-01-09 05:47:42,765 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states 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 05:47:42,765 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2867 transitions. [2025-01-09 05:47:42,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-01-09 05:47:42,769 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:47:42,769 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:47:42,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 05:47:42,769 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:47:42,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:47:42,769 INFO L85 PathProgramCache]: Analyzing trace with hash 467871054, now seen corresponding path program 1 times [2025-01-09 05:47:42,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:47:42,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033058833] [2025-01-09 05:47:42,770 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:47:42,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:47:42,787 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-01-09 05:47:42,811 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-01-09 05:47:42,811 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:47:42,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:47:42,965 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 05:47:42,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:47:42,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033058833] [2025-01-09 05:47:42,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033058833] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:47:42,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:47:42,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:47:42,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590858267] [2025-01-09 05:47:42,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:47:42,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:47:42,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:47:42,966 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:47:42,966 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:47:42,966 INFO L87 Difference]: Start difference. First operand 1572 states and 2867 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 0 states have call successors, (0), 0 states 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 05:47:43,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:47:43,206 INFO L93 Difference]: Finished difference Result 1876 states and 3347 transitions. [2025-01-09 05:47:43,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:47:43,206 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 0 states have call successors, (0), 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 44 [2025-01-09 05:47:43,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:47:43,216 INFO L225 Difference]: With dead ends: 1876 [2025-01-09 05:47:43,216 INFO L226 Difference]: Without dead ends: 1838 [2025-01-09 05:47:43,217 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-01-09 05:47:43,225 INFO L435 NwaCegarLoop]: 1522 mSDtfsCounter, 6285 mSDsluCounter, 613 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6285 SdHoareTripleChecker+Valid, 2135 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 05:47:43,225 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6285 Valid, 2135 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 05:47:43,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1838 states. [2025-01-09 05:47:43,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1838 to 1608. [2025-01-09 05:47:43,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1608 states, 1606 states have (on average 1.8206724782067247) internal successors, (2924), 1607 states have internal predecessors, (2924), 0 states have call successors, (0), 0 states 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 05:47:43,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1608 states to 1608 states and 2924 transitions. [2025-01-09 05:47:43,303 INFO L78 Accepts]: Start accepts. Automaton has 1608 states and 2924 transitions. Word has length 44 [2025-01-09 05:47:43,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:47:43,304 INFO L471 AbstractCegarLoop]: Abstraction has 1608 states and 2924 transitions. [2025-01-09 05:47:43,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 0 states have call successors, (0), 0 states 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 05:47:43,304 INFO L276 IsEmpty]: Start isEmpty. Operand 1608 states and 2924 transitions. [2025-01-09 05:47:43,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-01-09 05:47:43,309 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:47:43,310 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:47:43,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 05:47:43,310 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:47:43,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:47:43,310 INFO L85 PathProgramCache]: Analyzing trace with hash 1531785022, now seen corresponding path program 1 times [2025-01-09 05:47:43,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:47:43,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645380825] [2025-01-09 05:47:43,310 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:47:43,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:47:43,323 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-01-09 05:47:43,336 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-01-09 05:47:43,336 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:47:43,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:47:43,418 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 05:47:43,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:47:43,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645380825] [2025-01-09 05:47:43,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645380825] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:47:43,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:47:43,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:47:43,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290503129] [2025-01-09 05:47:43,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:47:43,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:47:43,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:47:43,420 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:47:43,420 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:47:43,420 INFO L87 Difference]: Start difference. First operand 1608 states and 2924 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states 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 05:47:43,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:47:43,482 INFO L93 Difference]: Finished difference Result 1745 states and 3139 transitions. [2025-01-09 05:47:43,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:47:43,482 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 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 05:47:43,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:47:43,491 INFO L225 Difference]: With dead ends: 1745 [2025-01-09 05:47:43,491 INFO L226 Difference]: Without dead ends: 1671 [2025-01-09 05:47:43,495 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 05:47:43,495 INFO L435 NwaCegarLoop]: 1524 mSDtfsCounter, 1476 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1476 SdHoareTripleChecker+Valid, 1577 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:47:43,496 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1476 Valid, 1577 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:47:43,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1671 states. [2025-01-09 05:47:43,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1671 to 1667. [2025-01-09 05:47:43,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1667 states, 1665 states have (on average 1.8102102102102102) internal successors, (3014), 1666 states have internal predecessors, (3014), 0 states have call successors, (0), 0 states 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 05:47:43,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1667 states to 1667 states and 3014 transitions. [2025-01-09 05:47:43,570 INFO L78 Accepts]: Start accepts. Automaton has 1667 states and 3014 transitions. Word has length 46 [2025-01-09 05:47:43,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:47:43,570 INFO L471 AbstractCegarLoop]: Abstraction has 1667 states and 3014 transitions. [2025-01-09 05:47:43,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states 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 05:47:43,570 INFO L276 IsEmpty]: Start isEmpty. Operand 1667 states and 3014 transitions. [2025-01-09 05:47:43,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-01-09 05:47:43,571 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:47:43,571 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:47:43,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 05:47:43,572 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:47:43,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:47:43,572 INFO L85 PathProgramCache]: Analyzing trace with hash 1598278534, now seen corresponding path program 1 times [2025-01-09 05:47:43,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:47:43,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266981040] [2025-01-09 05:47:43,572 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:47:43,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:47:43,580 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-01-09 05:47:43,594 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-01-09 05:47:43,595 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:47:43,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:47:43,771 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 05:47:43,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:47:43,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266981040] [2025-01-09 05:47:43,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266981040] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:47:43,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:47:43,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:47:43,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523587926] [2025-01-09 05:47:43,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:47:43,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:47:43,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:47:43,773 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:47:43,773 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:47:43,773 INFO L87 Difference]: Start difference. First operand 1667 states and 3014 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 0 states have call successors, (0), 0 states 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 05:47:43,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:47:43,858 INFO L93 Difference]: Finished difference Result 1802 states and 3222 transitions. [2025-01-09 05:47:43,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 05:47:43,858 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 0 states have call successors, (0), 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 05:47:43,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:47:43,863 INFO L225 Difference]: With dead ends: 1802 [2025-01-09 05:47:43,863 INFO L226 Difference]: Without dead ends: 1669 [2025-01-09 05:47:43,864 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2025-01-09 05:47:43,865 INFO L435 NwaCegarLoop]: 1522 mSDtfsCounter, 4455 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4455 SdHoareTripleChecker+Valid, 1690 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:47:43,865 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4455 Valid, 1690 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:47:43,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1669 states. [2025-01-09 05:47:43,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1669 to 1667. [2025-01-09 05:47:43,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1667 states, 1665 states have (on average 1.809009009009009) internal successors, (3012), 1666 states have internal predecessors, (3012), 0 states have call successors, (0), 0 states 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 05:47:43,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1667 states to 1667 states and 3012 transitions. [2025-01-09 05:47:43,901 INFO L78 Accepts]: Start accepts. Automaton has 1667 states and 3012 transitions. Word has length 46 [2025-01-09 05:47:43,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:47:43,901 INFO L471 AbstractCegarLoop]: Abstraction has 1667 states and 3012 transitions. [2025-01-09 05:47:43,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 0 states have call successors, (0), 0 states 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 05:47:43,901 INFO L276 IsEmpty]: Start isEmpty. Operand 1667 states and 3012 transitions. [2025-01-09 05:47:43,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-01-09 05:47:43,902 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:47:43,902 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:47:43,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 05:47:43,903 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:47:43,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:47:43,903 INFO L85 PathProgramCache]: Analyzing trace with hash 1887271147, now seen corresponding path program 1 times [2025-01-09 05:47:43,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:47:43,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21109883] [2025-01-09 05:47:43,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:47:43,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:47:43,909 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-01-09 05:47:43,918 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-01-09 05:47:43,918 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:47:43,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:47:44,053 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 05:47:44,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:47:44,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21109883] [2025-01-09 05:47:44,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21109883] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:47:44,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:47:44,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 05:47:44,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627625670] [2025-01-09 05:47:44,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:47:44,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 05:47:44,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:47:44,055 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 05:47:44,055 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 05:47:44,055 INFO L87 Difference]: Start difference. First operand 1667 states and 3012 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 0 states have call successors, (0), 0 states 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 05:47:44,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:47:44,088 INFO L93 Difference]: Finished difference Result 1675 states and 3021 transitions. [2025-01-09 05:47:44,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 05:47:44,089 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 0 states have call successors, (0), 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 05:47:44,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:47:44,094 INFO L225 Difference]: With dead ends: 1675 [2025-01-09 05:47:44,094 INFO L226 Difference]: Without dead ends: 1673 [2025-01-09 05:47:44,095 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 05:47:44,095 INFO L435 NwaCegarLoop]: 1525 mSDtfsCounter, 0 mSDsluCounter, 4566 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6091 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:47:44,095 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6091 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:47:44,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1673 states. [2025-01-09 05:47:44,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1673 to 1673. [2025-01-09 05:47:44,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1673 states, 1671 states have (on average 1.8055056852184321) internal successors, (3017), 1672 states have internal predecessors, (3017), 0 states have call successors, (0), 0 states 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 05:47:44,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1673 states to 1673 states and 3017 transitions. [2025-01-09 05:47:44,201 INFO L78 Accepts]: Start accepts. Automaton has 1673 states and 3017 transitions. Word has length 47 [2025-01-09 05:47:44,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:47:44,201 INFO L471 AbstractCegarLoop]: Abstraction has 1673 states and 3017 transitions. [2025-01-09 05:47:44,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 0 states have call successors, (0), 0 states 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 05:47:44,201 INFO L276 IsEmpty]: Start isEmpty. Operand 1673 states and 3017 transitions. [2025-01-09 05:47:44,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-01-09 05:47:44,202 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:47:44,202 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:47:44,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 05:47:44,202 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:47:44,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:47:44,204 INFO L85 PathProgramCache]: Analyzing trace with hash 251428358, now seen corresponding path program 1 times [2025-01-09 05:47:44,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:47:44,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039771098] [2025-01-09 05:47:44,207 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:47:44,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:47:44,218 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-01-09 05:47:44,237 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-01-09 05:47:44,240 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:47:44,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:47:44,350 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 05:47:44,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:47:44,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039771098] [2025-01-09 05:47:44,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039771098] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:47:44,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:47:44,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:47:44,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939719812] [2025-01-09 05:47:44,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:47:44,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:47:44,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:47:44,351 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:47:44,351 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:47:44,351 INFO L87 Difference]: Start difference. First operand 1673 states and 3017 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:47:44,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:47:44,423 INFO L93 Difference]: Finished difference Result 1935 states and 3409 transitions. [2025-01-09 05:47:44,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:47:44,427 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2025-01-09 05:47:44,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:47:44,440 INFO L225 Difference]: With dead ends: 1935 [2025-01-09 05:47:44,447 INFO L226 Difference]: Without dead ends: 1796 [2025-01-09 05:47:44,449 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 05:47:44,449 INFO L435 NwaCegarLoop]: 1565 mSDtfsCounter, 1487 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1487 SdHoareTripleChecker+Valid, 1630 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:47:44,450 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1487 Valid, 1630 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:47:44,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1796 states. [2025-01-09 05:47:44,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1796 to 1794. [2025-01-09 05:47:44,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1794 states, 1792 states have (on average 1.7823660714285714) internal successors, (3194), 1793 states have internal predecessors, (3194), 0 states have call successors, (0), 0 states 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 05:47:44,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1794 states to 1794 states and 3194 transitions. [2025-01-09 05:47:44,509 INFO L78 Accepts]: Start accepts. Automaton has 1794 states and 3194 transitions. Word has length 48 [2025-01-09 05:47:44,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:47:44,509 INFO L471 AbstractCegarLoop]: Abstraction has 1794 states and 3194 transitions. [2025-01-09 05:47:44,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:47:44,510 INFO L276 IsEmpty]: Start isEmpty. Operand 1794 states and 3194 transitions. [2025-01-09 05:47:44,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-01-09 05:47:44,511 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:47:44,511 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:47:44,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 05:47:44,511 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:47:44,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:47:44,512 INFO L85 PathProgramCache]: Analyzing trace with hash -1964040442, now seen corresponding path program 1 times [2025-01-09 05:47:44,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:47:44,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293716046] [2025-01-09 05:47:44,512 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:47:44,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:47:44,540 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-01-09 05:47:44,547 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-01-09 05:47:44,548 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:47:44,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:47:44,599 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 05:47:44,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:47:44,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293716046] [2025-01-09 05:47:44,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293716046] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:47:44,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:47:44,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:47:44,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616953950] [2025-01-09 05:47:44,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:47:44,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:47:44,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:47:44,600 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:47:44,600 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:47:44,600 INFO L87 Difference]: Start difference. First operand 1794 states and 3194 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:47:44,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:47:44,632 INFO L93 Difference]: Finished difference Result 2282 states and 3912 transitions. [2025-01-09 05:47:44,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:47:44,633 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2025-01-09 05:47:44,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:47:44,639 INFO L225 Difference]: With dead ends: 2282 [2025-01-09 05:47:44,640 INFO L226 Difference]: Without dead ends: 2022 [2025-01-09 05:47:44,640 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 05:47:44,641 INFO L435 NwaCegarLoop]: 1563 mSDtfsCounter, 1485 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1485 SdHoareTripleChecker+Valid, 1632 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:47:44,641 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1485 Valid, 1632 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:47:44,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2022 states. [2025-01-09 05:47:44,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2022 to 2020. [2025-01-09 05:47:44,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2020 states, 2018 states have (on average 1.7423191278493557) internal successors, (3516), 2019 states have internal predecessors, (3516), 0 states have call successors, (0), 0 states 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 05:47:44,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2020 states to 2020 states and 3516 transitions. [2025-01-09 05:47:44,679 INFO L78 Accepts]: Start accepts. Automaton has 2020 states and 3516 transitions. Word has length 48 [2025-01-09 05:47:44,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:47:44,680 INFO L471 AbstractCegarLoop]: Abstraction has 2020 states and 3516 transitions. [2025-01-09 05:47:44,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:47:44,681 INFO L276 IsEmpty]: Start isEmpty. Operand 2020 states and 3516 transitions. [2025-01-09 05:47:44,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-01-09 05:47:44,681 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:47:44,681 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:47:44,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 05:47:44,681 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:47:44,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:47:44,684 INFO L85 PathProgramCache]: Analyzing trace with hash -183107578, now seen corresponding path program 1 times [2025-01-09 05:47:44,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:47:44,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720545177] [2025-01-09 05:47:44,685 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:47:44,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:47:44,690 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-01-09 05:47:44,698 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-01-09 05:47:44,698 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:47:44,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:47:44,731 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 05:47:44,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:47:44,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720545177] [2025-01-09 05:47:44,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720545177] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:47:44,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:47:44,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:47:44,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140016150] [2025-01-09 05:47:44,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:47:44,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:47:44,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:47:44,733 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:47:44,733 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:47:44,734 INFO L87 Difference]: Start difference. First operand 2020 states and 3516 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:47:44,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:47:44,767 INFO L93 Difference]: Finished difference Result 2928 states and 4822 transitions. [2025-01-09 05:47:44,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:47:44,767 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2025-01-09 05:47:44,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:47:44,774 INFO L225 Difference]: With dead ends: 2928 [2025-01-09 05:47:44,775 INFO L226 Difference]: Without dead ends: 2442 [2025-01-09 05:47:44,776 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 05:47:44,779 INFO L435 NwaCegarLoop]: 1561 mSDtfsCounter, 1483 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1483 SdHoareTripleChecker+Valid, 1634 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:47:44,779 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1483 Valid, 1634 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:47:44,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2442 states. [2025-01-09 05:47:44,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2442 to 2440. [2025-01-09 05:47:44,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2440 states, 2438 states have (on average 1.6800656275635768) internal successors, (4096), 2439 states have internal predecessors, (4096), 0 states have call successors, (0), 0 states 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 05:47:44,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2440 states to 2440 states and 4096 transitions. [2025-01-09 05:47:44,825 INFO L78 Accepts]: Start accepts. Automaton has 2440 states and 4096 transitions. Word has length 48 [2025-01-09 05:47:44,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:47:44,826 INFO L471 AbstractCegarLoop]: Abstraction has 2440 states and 4096 transitions. [2025-01-09 05:47:44,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:47:44,826 INFO L276 IsEmpty]: Start isEmpty. Operand 2440 states and 4096 transitions. [2025-01-09 05:47:44,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-01-09 05:47:44,826 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:47:44,827 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:47:44,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 05:47:44,827 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:47:44,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:47:44,827 INFO L85 PathProgramCache]: Analyzing trace with hash 211109921, now seen corresponding path program 1 times [2025-01-09 05:47:44,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:47:44,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545194858] [2025-01-09 05:47:44,827 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:47:44,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:47:44,835 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-01-09 05:47:44,843 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-01-09 05:47:44,845 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:47:44,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:47:44,880 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 05:47:44,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:47:44,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545194858] [2025-01-09 05:47:44,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545194858] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:47:44,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:47:44,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:47:44,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787429272] [2025-01-09 05:47:44,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:47:44,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:47:44,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:47:44,882 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:47:44,882 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:47:44,882 INFO L87 Difference]: Start difference. First operand 2440 states and 4096 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:47:44,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:47:44,923 INFO L93 Difference]: Finished difference Result 3407 states and 5494 transitions. [2025-01-09 05:47:44,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:47:44,924 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2025-01-09 05:47:44,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:47:44,932 INFO L225 Difference]: With dead ends: 3407 [2025-01-09 05:47:44,932 INFO L226 Difference]: Without dead ends: 2876 [2025-01-09 05:47:44,934 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 05:47:44,934 INFO L435 NwaCegarLoop]: 1570 mSDtfsCounter, 1486 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1486 SdHoareTripleChecker+Valid, 1631 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:47:44,935 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1486 Valid, 1631 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:47:44,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2876 states. [2025-01-09 05:47:44,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2876 to 2874. [2025-01-09 05:47:44,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2874 states, 2872 states have (on average 1.6357938718662952) internal successors, (4698), 2873 states have internal predecessors, (4698), 0 states have call successors, (0), 0 states 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 05:47:44,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2874 states to 2874 states and 4698 transitions. [2025-01-09 05:47:44,989 INFO L78 Accepts]: Start accepts. Automaton has 2874 states and 4698 transitions. Word has length 50 [2025-01-09 05:47:44,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:47:44,990 INFO L471 AbstractCegarLoop]: Abstraction has 2874 states and 4698 transitions. [2025-01-09 05:47:44,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:47:44,990 INFO L276 IsEmpty]: Start isEmpty. Operand 2874 states and 4698 transitions. [2025-01-09 05:47:44,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-01-09 05:47:44,991 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:47:44,991 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:47:44,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 05:47:44,992 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:47:44,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:47:44,995 INFO L85 PathProgramCache]: Analyzing trace with hash 1730235462, now seen corresponding path program 1 times [2025-01-09 05:47:44,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:47:44,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715433569] [2025-01-09 05:47:44,995 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:47:44,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:47:45,005 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-01-09 05:47:45,016 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-01-09 05:47:45,017 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:47:45,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:47:45,104 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 05:47:45,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:47:45,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715433569] [2025-01-09 05:47:45,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715433569] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:47:45,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:47:45,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:47:45,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479704614] [2025-01-09 05:47:45,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:47:45,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:47:45,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:47:45,105 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:47:45,105 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:47:45,106 INFO L87 Difference]: Start difference. First operand 2874 states and 4698 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:47:45,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:47:45,264 INFO L93 Difference]: Finished difference Result 8524 states and 12655 transitions. [2025-01-09 05:47:45,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 05:47:45,265 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2025-01-09 05:47:45,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:47:45,284 INFO L225 Difference]: With dead ends: 8524 [2025-01-09 05:47:45,284 INFO L226 Difference]: Without dead ends: 7186 [2025-01-09 05:47:45,288 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-01-09 05:47:45,289 INFO L435 NwaCegarLoop]: 1582 mSDtfsCounter, 4667 mSDsluCounter, 1768 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4667 SdHoareTripleChecker+Valid, 3350 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:47:45,289 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4667 Valid, 3350 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:47:45,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7186 states. [2025-01-09 05:47:45,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7186 to 4210. [2025-01-09 05:47:45,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4210 states, 4208 states have (on average 1.5594106463878328) internal successors, (6562), 4209 states have internal predecessors, (6562), 0 states have call successors, (0), 0 states 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 05:47:45,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4210 states to 4210 states and 6562 transitions. [2025-01-09 05:47:45,388 INFO L78 Accepts]: Start accepts. Automaton has 4210 states and 6562 transitions. Word has length 65 [2025-01-09 05:47:45,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:47:45,388 INFO L471 AbstractCegarLoop]: Abstraction has 4210 states and 6562 transitions. [2025-01-09 05:47:45,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:47:45,389 INFO L276 IsEmpty]: Start isEmpty. Operand 4210 states and 6562 transitions. [2025-01-09 05:47:45,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-01-09 05:47:45,389 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:47:45,390 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:47:45,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 05:47:45,390 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:47:45,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:47:45,390 INFO L85 PathProgramCache]: Analyzing trace with hash -485233338, now seen corresponding path program 1 times [2025-01-09 05:47:45,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:47:45,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032918193] [2025-01-09 05:47:45,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:47:45,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:47:45,398 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-01-09 05:47:45,405 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-01-09 05:47:45,405 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:47:45,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:47:45,484 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-09 05:47:45,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:47:45,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032918193] [2025-01-09 05:47:45,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032918193] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:47:45,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:47:45,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:47:45,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516911152] [2025-01-09 05:47:45,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:47:45,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:47:45,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:47:45,485 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:47:45,485 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:47:45,485 INFO L87 Difference]: Start difference. First operand 4210 states and 6562 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 0 states have call successors, (0), 0 states 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 05:47:45,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:47:45,638 INFO L93 Difference]: Finished difference Result 9860 states and 14519 transitions. [2025-01-09 05:47:45,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 05:47:45,638 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 0 states have call successors, (0), 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 65 [2025-01-09 05:47:45,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:47:45,652 INFO L225 Difference]: With dead ends: 9860 [2025-01-09 05:47:45,652 INFO L226 Difference]: Without dead ends: 8522 [2025-01-09 05:47:45,656 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-01-09 05:47:45,656 INFO L435 NwaCegarLoop]: 1579 mSDtfsCounter, 4688 mSDsluCounter, 1747 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4688 SdHoareTripleChecker+Valid, 3326 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:47:45,656 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4688 Valid, 3326 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:47:45,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8522 states. [2025-01-09 05:47:45,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8522 to 6218. [2025-01-09 05:47:45,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6218 states, 6216 states have (on average 1.5022522522522523) internal successors, (9338), 6217 states have internal predecessors, (9338), 0 states have call successors, (0), 0 states 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 05:47:45,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6218 states to 6218 states and 9338 transitions. [2025-01-09 05:47:45,929 INFO L78 Accepts]: Start accepts. Automaton has 6218 states and 9338 transitions. Word has length 65 [2025-01-09 05:47:45,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:47:45,933 INFO L471 AbstractCegarLoop]: Abstraction has 6218 states and 9338 transitions. [2025-01-09 05:47:45,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 0 states have call successors, (0), 0 states 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 05:47:45,933 INFO L276 IsEmpty]: Start isEmpty. Operand 6218 states and 9338 transitions. [2025-01-09 05:47:45,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-01-09 05:47:45,934 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:47:45,934 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:47:45,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 05:47:45,935 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:47:45,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:47:45,935 INFO L85 PathProgramCache]: Analyzing trace with hash 1295699526, now seen corresponding path program 1 times [2025-01-09 05:47:45,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:47:45,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281633598] [2025-01-09 05:47:45,935 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:47:45,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:47:45,946 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-01-09 05:47:45,952 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-01-09 05:47:45,953 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:47:45,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:47:46,033 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-09 05:47:46,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:47:46,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281633598] [2025-01-09 05:47:46,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281633598] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:47:46,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:47:46,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:47:46,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242122965] [2025-01-09 05:47:46,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:47:46,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:47:46,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:47:46,035 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:47:46,035 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:47:46,035 INFO L87 Difference]: Start difference. First operand 6218 states and 9338 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states 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 05:47:46,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:47:46,199 INFO L93 Difference]: Finished difference Result 11196 states and 16383 transitions. [2025-01-09 05:47:46,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 05:47:46,199 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 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 65 [2025-01-09 05:47:46,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:47:46,215 INFO L225 Difference]: With dead ends: 11196 [2025-01-09 05:47:46,216 INFO L226 Difference]: Without dead ends: 9858 [2025-01-09 05:47:46,220 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-01-09 05:47:46,221 INFO L435 NwaCegarLoop]: 1583 mSDtfsCounter, 4673 mSDsluCounter, 1774 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4673 SdHoareTripleChecker+Valid, 3357 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:47:46,221 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4673 Valid, 3357 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:47:46,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9858 states. [2025-01-09 05:47:46,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9858 to 7554. [2025-01-09 05:47:46,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7554 states, 7552 states have (on average 1.4833156779661016) internal successors, (11202), 7553 states have internal predecessors, (11202), 0 states have call successors, (0), 0 states 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 05:47:46,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7554 states to 7554 states and 11202 transitions. [2025-01-09 05:47:46,442 INFO L78 Accepts]: Start accepts. Automaton has 7554 states and 11202 transitions. Word has length 65 [2025-01-09 05:47:46,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:47:46,442 INFO L471 AbstractCegarLoop]: Abstraction has 7554 states and 11202 transitions. [2025-01-09 05:47:46,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states 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 05:47:46,442 INFO L276 IsEmpty]: Start isEmpty. Operand 7554 states and 11202 transitions. [2025-01-09 05:47:46,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-01-09 05:47:46,446 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:47:46,447 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:47:46,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 05:47:46,447 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:47:46,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:47:46,447 INFO L85 PathProgramCache]: Analyzing trace with hash -289438111, now seen corresponding path program 1 times [2025-01-09 05:47:46,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:47:46,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124730686] [2025-01-09 05:47:46,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:47:46,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:47:46,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-01-09 05:47:46,464 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-01-09 05:47:46,464 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:47:46,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:47:46,624 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 05:47:46,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:47:46,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124730686] [2025-01-09 05:47:46,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124730686] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:47:46,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:47:46,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:47:46,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976945036] [2025-01-09 05:47:46,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:47:46,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:47:46,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:47:46,626 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:47:46,626 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:47:46,626 INFO L87 Difference]: Start difference. First operand 7554 states and 11202 transitions. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 0 states have call successors, (0), 0 states 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 05:47:46,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:47:46,778 INFO L93 Difference]: Finished difference Result 11780 states and 17223 transitions. [2025-01-09 05:47:46,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 05:47:46,779 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 0 states have call successors, (0), 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 67 [2025-01-09 05:47:46,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:47:46,796 INFO L225 Difference]: With dead ends: 11780 [2025-01-09 05:47:46,797 INFO L226 Difference]: Without dead ends: 10818 [2025-01-09 05:47:46,801 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-01-09 05:47:46,802 INFO L435 NwaCegarLoop]: 1584 mSDtfsCounter, 4661 mSDsluCounter, 1816 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4661 SdHoareTripleChecker+Valid, 3400 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:47:46,802 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4661 Valid, 3400 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:47:46,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10818 states. [2025-01-09 05:47:46,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10818 to 8514. [2025-01-09 05:47:46,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8514 states, 8512 states have (on average 1.4757988721804511) internal successors, (12562), 8513 states have internal predecessors, (12562), 0 states have call successors, (0), 0 states 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 05:47:47,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8514 states to 8514 states and 12562 transitions. [2025-01-09 05:47:47,005 INFO L78 Accepts]: Start accepts. Automaton has 8514 states and 12562 transitions. Word has length 67 [2025-01-09 05:47:47,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:47:47,005 INFO L471 AbstractCegarLoop]: Abstraction has 8514 states and 12562 transitions. [2025-01-09 05:47:47,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 0 states have call successors, (0), 0 states 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 05:47:47,005 INFO L276 IsEmpty]: Start isEmpty. Operand 8514 states and 12562 transitions. [2025-01-09 05:47:47,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-01-09 05:47:47,007 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:47:47,007 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:47:47,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 05:47:47,007 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:47:47,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:47:47,008 INFO L85 PathProgramCache]: Analyzing trace with hash -745270146, now seen corresponding path program 1 times [2025-01-09 05:47:47,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:47:47,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509048906] [2025-01-09 05:47:47,008 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:47:47,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:47:47,014 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-01-09 05:47:47,024 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-01-09 05:47:47,025 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:47:47,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:47:47,074 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:47:47,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:47:47,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509048906] [2025-01-09 05:47:47,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509048906] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:47:47,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:47:47,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:47:47,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111549110] [2025-01-09 05:47:47,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:47:47,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:47:47,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:47:47,076 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:47:47,076 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:47:47,076 INFO L87 Difference]: Start difference. First operand 8514 states and 12562 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states 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 05:47:47,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:47:47,148 INFO L93 Difference]: Finished difference Result 13816 states and 20063 transitions. [2025-01-09 05:47:47,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:47:47,148 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 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 67 [2025-01-09 05:47:47,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:47:47,159 INFO L225 Difference]: With dead ends: 13816 [2025-01-09 05:47:47,159 INFO L226 Difference]: Without dead ends: 6838 [2025-01-09 05:47:47,167 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 05:47:47,167 INFO L435 NwaCegarLoop]: 1560 mSDtfsCounter, 42 mSDsluCounter, 1513 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 3073 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:47:47,167 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 3073 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:47:47,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6838 states. [2025-01-09 05:47:47,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6838 to 6836. [2025-01-09 05:47:47,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6836 states, 6834 states have (on average 1.495463857184665) internal successors, (10220), 6835 states have internal predecessors, (10220), 0 states have call successors, (0), 0 states 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 05:47:47,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6836 states to 6836 states and 10220 transitions. [2025-01-09 05:47:47,387 INFO L78 Accepts]: Start accepts. Automaton has 6836 states and 10220 transitions. Word has length 67 [2025-01-09 05:47:47,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:47:47,387 INFO L471 AbstractCegarLoop]: Abstraction has 6836 states and 10220 transitions. [2025-01-09 05:47:47,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states 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 05:47:47,388 INFO L276 IsEmpty]: Start isEmpty. Operand 6836 states and 10220 transitions. [2025-01-09 05:47:47,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-01-09 05:47:47,389 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:47:47,389 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:47:47,389 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 05:47:47,389 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:47:47,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:47:47,390 INFO L85 PathProgramCache]: Analyzing trace with hash 1417744737, now seen corresponding path program 1 times [2025-01-09 05:47:47,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:47:47,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522312511] [2025-01-09 05:47:47,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:47:47,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:47:47,398 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-01-09 05:47:47,409 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-01-09 05:47:47,410 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:47:47,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:47:47,473 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:47:47,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:47:47,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522312511] [2025-01-09 05:47:47,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522312511] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:47:47,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:47:47,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:47:47,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616122951] [2025-01-09 05:47:47,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:47:47,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:47:47,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:47:47,474 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:47:47,474 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:47:47,474 INFO L87 Difference]: Start difference. First operand 6836 states and 10220 transitions. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states 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 05:47:47,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:47:47,542 INFO L93 Difference]: Finished difference Result 9480 states and 13918 transitions. [2025-01-09 05:47:47,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:47:47,543 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 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 68 [2025-01-09 05:47:47,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:47:47,551 INFO L225 Difference]: With dead ends: 9480 [2025-01-09 05:47:47,551 INFO L226 Difference]: Without dead ends: 4198 [2025-01-09 05:47:47,557 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 05:47:47,557 INFO L435 NwaCegarLoop]: 1553 mSDtfsCounter, 37 mSDsluCounter, 1505 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 3058 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:47:47,558 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 3058 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:47:47,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4198 states. [2025-01-09 05:47:47,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4198 to 4196. [2025-01-09 05:47:47,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4196 states, 4194 states have (on average 1.5450643776824033) internal successors, (6480), 4195 states have internal predecessors, (6480), 0 states have call successors, (0), 0 states 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 05:47:47,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4196 states to 4196 states and 6480 transitions. [2025-01-09 05:47:47,654 INFO L78 Accepts]: Start accepts. Automaton has 4196 states and 6480 transitions. Word has length 68 [2025-01-09 05:47:47,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:47:47,654 INFO L471 AbstractCegarLoop]: Abstraction has 4196 states and 6480 transitions. [2025-01-09 05:47:47,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states 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 05:47:47,654 INFO L276 IsEmpty]: Start isEmpty. Operand 4196 states and 6480 transitions. [2025-01-09 05:47:47,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-01-09 05:47:47,655 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:47:47,656 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:47:47,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 05:47:47,656 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:47:47,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:47:47,656 INFO L85 PathProgramCache]: Analyzing trace with hash 142724947, now seen corresponding path program 1 times [2025-01-09 05:47:47,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:47:47,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807359376] [2025-01-09 05:47:47,657 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:47:47,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:47:47,665 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-01-09 05:47:47,675 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-01-09 05:47:47,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:47:47,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:47:47,748 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:47:47,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:47:47,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807359376] [2025-01-09 05:47:47,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807359376] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:47:47,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:47:47,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:47:47,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526177082] [2025-01-09 05:47:47,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:47:47,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:47:47,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:47:47,749 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:47:47,749 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:47:47,750 INFO L87 Difference]: Start difference. First operand 4196 states and 6480 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states 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 05:47:47,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:47:47,794 INFO L93 Difference]: Finished difference Result 5520 states and 8308 transitions. [2025-01-09 05:47:47,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:47:47,794 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 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 70 [2025-01-09 05:47:47,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:47:47,799 INFO L225 Difference]: With dead ends: 5520 [2025-01-09 05:47:47,800 INFO L226 Difference]: Without dead ends: 2878 [2025-01-09 05:47:47,802 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 05:47:47,803 INFO L435 NwaCegarLoop]: 1546 mSDtfsCounter, 34 mSDsluCounter, 1497 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 3043 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:47:47,804 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 3043 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:47:47,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2878 states. [2025-01-09 05:47:47,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2878 to 2876. [2025-01-09 05:47:47,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2876 states, 2874 states have (on average 1.6116910229645094) internal successors, (4632), 2875 states have internal predecessors, (4632), 0 states have call successors, (0), 0 states 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 05:47:47,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2876 states to 2876 states and 4632 transitions. [2025-01-09 05:47:47,845 INFO L78 Accepts]: Start accepts. Automaton has 2876 states and 4632 transitions. Word has length 70 [2025-01-09 05:47:47,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:47:47,845 INFO L471 AbstractCegarLoop]: Abstraction has 2876 states and 4632 transitions. [2025-01-09 05:47:47,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states 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 05:47:47,845 INFO L276 IsEmpty]: Start isEmpty. Operand 2876 states and 4632 transitions. [2025-01-09 05:47:47,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-01-09 05:47:47,846 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:47:47,847 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:47:47,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 05:47:47,847 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:47:47,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:47:47,847 INFO L85 PathProgramCache]: Analyzing trace with hash -2030791739, now seen corresponding path program 1 times [2025-01-09 05:47:47,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:47:47,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691279106] [2025-01-09 05:47:47,848 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:47:47,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:47:47,856 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-01-09 05:47:47,869 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-01-09 05:47:47,869 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:47:47,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:47:47,936 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:47:47,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:47:47,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691279106] [2025-01-09 05:47:47,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691279106] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:47:47,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:47:47,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:47:47,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961872645] [2025-01-09 05:47:47,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:47:47,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:47:47,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:47:47,937 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:47:47,937 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:47:47,937 INFO L87 Difference]: Start difference. First operand 2876 states and 4632 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states 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 05:47:47,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:47:47,967 INFO L93 Difference]: Finished difference Result 3540 states and 5536 transitions. [2025-01-09 05:47:47,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:47:47,968 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 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 72 [2025-01-09 05:47:47,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:47:47,972 INFO L225 Difference]: With dead ends: 3540 [2025-01-09 05:47:47,972 INFO L226 Difference]: Without dead ends: 2218 [2025-01-09 05:47:47,973 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 05:47:47,974 INFO L435 NwaCegarLoop]: 1539 mSDtfsCounter, 31 mSDsluCounter, 1489 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 3028 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:47:47,975 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 3028 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:47:47,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2218 states. [2025-01-09 05:47:48,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2218 to 2216. [2025-01-09 05:47:48,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2216 states, 2214 states have (on average 1.679765130984643) internal successors, (3719), 2215 states have internal predecessors, (3719), 0 states have call successors, (0), 0 states 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 05:47:48,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2216 states to 2216 states and 3719 transitions. [2025-01-09 05:47:48,019 INFO L78 Accepts]: Start accepts. Automaton has 2216 states and 3719 transitions. Word has length 72 [2025-01-09 05:47:48,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:47:48,019 INFO L471 AbstractCegarLoop]: Abstraction has 2216 states and 3719 transitions. [2025-01-09 05:47:48,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states 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 05:47:48,019 INFO L276 IsEmpty]: Start isEmpty. Operand 2216 states and 3719 transitions. [2025-01-09 05:47:48,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-01-09 05:47:48,020 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:47:48,020 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:47:48,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 05:47:48,020 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:47:48,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:47:48,021 INFO L85 PathProgramCache]: Analyzing trace with hash -1062961481, now seen corresponding path program 1 times [2025-01-09 05:47:48,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:47:48,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658202449] [2025-01-09 05:47:48,021 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:47:48,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:47:48,031 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-01-09 05:47:48,049 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-01-09 05:47:48,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:47:48,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:47:49,157 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:47:49,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:47:49,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658202449] [2025-01-09 05:47:49,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658202449] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 05:47:49,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1250613747] [2025-01-09 05:47:49,158 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:47:49,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:47:49,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:47:49,161 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 05:47:49,162 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 05:47:49,226 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-01-09 05:47:49,258 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-01-09 05:47:49,259 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:47:49,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:47:49,261 INFO L256 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-01-09 05:47:49,265 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:47:49,509 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:47:49,509 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 05:47:49,754 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:47:49,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1250613747] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 05:47:49,755 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 05:47:49,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7, 6] total 22 [2025-01-09 05:47:49,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786569935] [2025-01-09 05:47:49,755 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 05:47:49,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-01-09 05:47:49,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:47:49,756 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-01-09 05:47:49,756 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=392, Unknown=0, NotChecked=0, Total=462 [2025-01-09 05:47:49,756 INFO L87 Difference]: Start difference. First operand 2216 states and 3719 transitions. Second operand has 22 states, 22 states have (on average 9.5) internal successors, (209), 22 states have internal predecessors, (209), 0 states have call successors, (0), 0 states 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 05:47:52,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:47:52,939 INFO L93 Difference]: Finished difference Result 8272 states and 11767 transitions. [2025-01-09 05:47:52,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2025-01-09 05:47:52,940 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 9.5) internal successors, (209), 22 states have internal predecessors, (209), 0 states have call successors, (0), 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 74 [2025-01-09 05:47:52,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:47:52,961 INFO L225 Difference]: With dead ends: 8272 [2025-01-09 05:47:52,961 INFO L226 Difference]: Without dead ends: 7536 [2025-01-09 05:47:52,968 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2857 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1313, Invalid=7243, Unknown=0, NotChecked=0, Total=8556 [2025-01-09 05:47:52,968 INFO L435 NwaCegarLoop]: 1511 mSDtfsCounter, 13427 mSDsluCounter, 9342 mSDsCounter, 0 mSdLazyCounter, 1714 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13427 SdHoareTripleChecker+Valid, 10853 SdHoareTripleChecker+Invalid, 1821 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 1714 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-09 05:47:52,968 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13427 Valid, 10853 Invalid, 1821 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 1714 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-09 05:47:52,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7536 states. [2025-01-09 05:47:53,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7536 to 7038. [2025-01-09 05:47:53,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7038 states, 7036 states have (on average 1.419556566230813) internal successors, (9988), 7037 states have internal predecessors, (9988), 0 states have call successors, (0), 0 states 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 05:47:53,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7038 states to 7038 states and 9988 transitions. [2025-01-09 05:47:53,107 INFO L78 Accepts]: Start accepts. Automaton has 7038 states and 9988 transitions. Word has length 74 [2025-01-09 05:47:53,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:47:53,107 INFO L471 AbstractCegarLoop]: Abstraction has 7038 states and 9988 transitions. [2025-01-09 05:47:53,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 9.5) internal successors, (209), 22 states have internal predecessors, (209), 0 states have call successors, (0), 0 states 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 05:47:53,107 INFO L276 IsEmpty]: Start isEmpty. Operand 7038 states and 9988 transitions. [2025-01-09 05:47:53,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-01-09 05:47:53,108 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:47:53,108 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:47:53,119 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 05:47:53,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:47:53,310 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:47:53,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:47:53,310 INFO L85 PathProgramCache]: Analyzing trace with hash -1655134909, now seen corresponding path program 1 times [2025-01-09 05:47:53,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:47:53,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258008355] [2025-01-09 05:47:53,311 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:47:53,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:47:53,322 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-01-09 05:47:53,334 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-01-09 05:47:53,335 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:47:53,335 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:47:54,144 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:47:54,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:47:54,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258008355] [2025-01-09 05:47:54,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258008355] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 05:47:54,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [342232481] [2025-01-09 05:47:54,144 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:47:54,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:47:54,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:47:54,146 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 05:47:54,151 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 05:47:54,197 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-01-09 05:47:54,226 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-01-09 05:47:54,226 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:47:54,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:47:54,228 INFO L256 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-09 05:47:54,231 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:47:54,565 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:47:54,566 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 05:47:55,093 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:47:55,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [342232481] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 05:47:55,093 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 05:47:55,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 28 [2025-01-09 05:47:55,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9621216] [2025-01-09 05:47:55,093 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 05:47:55,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-01-09 05:47:55,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:47:55,094 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-01-09 05:47:55,095 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=711, Unknown=0, NotChecked=0, Total=812 [2025-01-09 05:47:55,095 INFO L87 Difference]: Start difference. First operand 7038 states and 9988 transitions. Second operand has 29 states, 29 states have (on average 6.586206896551724) internal successors, (191), 28 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 05:47:56,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:47:56,922 INFO L93 Difference]: Finished difference Result 24208 states and 32520 transitions. [2025-01-09 05:47:56,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-01-09 05:47:56,923 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 6.586206896551724) internal successors, (191), 28 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) Word has length 75 [2025-01-09 05:47:56,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:47:56,950 INFO L225 Difference]: With dead ends: 24208 [2025-01-09 05:47:56,950 INFO L226 Difference]: Without dead ends: 18776 [2025-01-09 05:47:56,959 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 677 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=755, Invalid=2785, Unknown=0, NotChecked=0, Total=3540 [2025-01-09 05:47:56,959 INFO L435 NwaCegarLoop]: 1498 mSDtfsCounter, 17205 mSDsluCounter, 6486 mSDsCounter, 0 mSdLazyCounter, 784 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17205 SdHoareTripleChecker+Valid, 7984 SdHoareTripleChecker+Invalid, 818 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 784 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 05:47:56,960 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17205 Valid, 7984 Invalid, 818 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 784 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 05:47:56,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18776 states. [2025-01-09 05:47:57,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18776 to 18700. [2025-01-09 05:47:57,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18700 states, 18698 states have (on average 1.3303027061717831) internal successors, (24874), 18699 states have internal predecessors, (24874), 0 states have call successors, (0), 0 states 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 05:47:57,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18700 states to 18700 states and 24874 transitions. [2025-01-09 05:47:57,494 INFO L78 Accepts]: Start accepts. Automaton has 18700 states and 24874 transitions. Word has length 75 [2025-01-09 05:47:57,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:47:57,494 INFO L471 AbstractCegarLoop]: Abstraction has 18700 states and 24874 transitions. [2025-01-09 05:47:57,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 6.586206896551724) internal successors, (191), 28 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 05:47:57,495 INFO L276 IsEmpty]: Start isEmpty. Operand 18700 states and 24874 transitions. [2025-01-09 05:47:57,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-01-09 05:47:57,496 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:47:57,496 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:47:57,504 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 05:47:57,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:47:57,699 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:47:57,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:47:57,701 INFO L85 PathProgramCache]: Analyzing trace with hash -399507787, now seen corresponding path program 1 times [2025-01-09 05:47:57,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:47:57,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574709167] [2025-01-09 05:47:57,701 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:47:57,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:47:57,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-01-09 05:47:57,719 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-01-09 05:47:57,719 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:47:57,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:47:57,981 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:47:57,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:47:57,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574709167] [2025-01-09 05:47:57,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574709167] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 05:47:57,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1640361164] [2025-01-09 05:47:57,981 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:47:57,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:47:57,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:47:57,983 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 05:47:57,985 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 05:47:58,049 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-01-09 05:47:58,078 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-01-09 05:47:58,078 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:47:58,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:47:58,083 INFO L256 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-09 05:47:58,084 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:47:58,392 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:47:58,392 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 05:47:58,925 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:47:58,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1640361164] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 05:47:58,925 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 05:47:58,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2025-01-09 05:47:58,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451021343] [2025-01-09 05:47:58,926 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 05:47:58,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-01-09 05:47:58,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:47:58,926 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-01-09 05:47:58,926 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=343, Unknown=0, NotChecked=0, Total=420 [2025-01-09 05:47:58,927 INFO L87 Difference]: Start difference. First operand 18700 states and 24874 transitions. Second operand has 21 states, 21 states have (on average 8.142857142857142) internal successors, (171), 20 states have internal predecessors, (171), 0 states have call successors, (0), 0 states 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 05:47:59,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:47:59,572 INFO L93 Difference]: Finished difference Result 36326 states and 47656 transitions. [2025-01-09 05:47:59,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 05:47:59,572 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 8.142857142857142) internal successors, (171), 20 states have internal predecessors, (171), 0 states have call successors, (0), 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 75 [2025-01-09 05:47:59,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:47:59,609 INFO L225 Difference]: With dead ends: 36326 [2025-01-09 05:47:59,609 INFO L226 Difference]: Without dead ends: 19358 [2025-01-09 05:47:59,617 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=228, Invalid=702, Unknown=0, NotChecked=0, Total=930 [2025-01-09 05:47:59,618 INFO L435 NwaCegarLoop]: 1507 mSDtfsCounter, 10666 mSDsluCounter, 4830 mSDsCounter, 0 mSdLazyCounter, 441 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10666 SdHoareTripleChecker+Valid, 6337 SdHoareTripleChecker+Invalid, 454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 05:47:59,618 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10666 Valid, 6337 Invalid, 454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 441 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 05:47:59,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19358 states. [2025-01-09 05:47:59,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19358 to 17742. [2025-01-09 05:47:59,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17742 states, 17740 states have (on average 1.322153325817362) internal successors, (23455), 17741 states have internal predecessors, (23455), 0 states have call successors, (0), 0 states 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 05:47:59,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17742 states to 17742 states and 23455 transitions. [2025-01-09 05:47:59,952 INFO L78 Accepts]: Start accepts. Automaton has 17742 states and 23455 transitions. Word has length 75 [2025-01-09 05:47:59,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:47:59,952 INFO L471 AbstractCegarLoop]: Abstraction has 17742 states and 23455 transitions. [2025-01-09 05:47:59,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 8.142857142857142) internal successors, (171), 20 states have internal predecessors, (171), 0 states have call successors, (0), 0 states 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 05:47:59,952 INFO L276 IsEmpty]: Start isEmpty. Operand 17742 states and 23455 transitions. [2025-01-09 05:47:59,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-01-09 05:47:59,953 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:47:59,953 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:47:59,962 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 05:48:00,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:48:00,155 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:48:00,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:48:00,155 INFO L85 PathProgramCache]: Analyzing trace with hash -1891375623, now seen corresponding path program 1 times [2025-01-09 05:48:00,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:48:00,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520980453] [2025-01-09 05:48:00,156 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:48:00,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:48:00,162 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-01-09 05:48:00,171 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-01-09 05:48:00,171 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:48:00,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:48:00,826 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:48:00,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:48:00,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520980453] [2025-01-09 05:48:00,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520980453] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 05:48:00,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [758415799] [2025-01-09 05:48:00,826 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:48:00,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:48:00,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:48:00,828 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 05:48:00,830 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 05:48:00,878 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-01-09 05:48:00,908 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-01-09 05:48:00,908 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:48:00,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:48:00,910 INFO L256 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-01-09 05:48:00,911 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:48:01,377 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:48:01,377 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 05:48:02,076 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:48:02,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [758415799] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 05:48:02,077 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 05:48:02,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 27 [2025-01-09 05:48:02,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351629470] [2025-01-09 05:48:02,077 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 05:48:02,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-01-09 05:48:02,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:48:02,078 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-01-09 05:48:02,078 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=652, Unknown=0, NotChecked=0, Total=756 [2025-01-09 05:48:02,078 INFO L87 Difference]: Start difference. First operand 17742 states and 23455 transitions. Second operand has 28 states, 28 states have (on average 6.75) internal successors, (189), 27 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 05:48:04,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:48:04,678 INFO L93 Difference]: Finished difference Result 78418 states and 100078 transitions. [2025-01-09 05:48:04,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2025-01-09 05:48:04,681 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 6.75) internal successors, (189), 27 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2025-01-09 05:48:04,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:48:04,754 INFO L225 Difference]: With dead ends: 78418 [2025-01-09 05:48:04,754 INFO L226 Difference]: Without dead ends: 62900 [2025-01-09 05:48:04,769 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 891 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=737, Invalid=3045, Unknown=0, NotChecked=0, Total=3782 [2025-01-09 05:48:04,771 INFO L435 NwaCegarLoop]: 1501 mSDtfsCounter, 17702 mSDsluCounter, 15155 mSDsCounter, 0 mSdLazyCounter, 923 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17702 SdHoareTripleChecker+Valid, 16656 SdHoareTripleChecker+Invalid, 950 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 923 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 05:48:04,771 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17702 Valid, 16656 Invalid, 950 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 923 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 05:48:04,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62900 states. [2025-01-09 05:48:05,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62900 to 52122. [2025-01-09 05:48:05,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52122 states, 52120 states have (on average 1.282233307751343) internal successors, (66830), 52121 states have internal predecessors, (66830), 0 states have call successors, (0), 0 states 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 05:48:06,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52122 states to 52122 states and 66830 transitions. [2025-01-09 05:48:06,059 INFO L78 Accepts]: Start accepts. Automaton has 52122 states and 66830 transitions. Word has length 76 [2025-01-09 05:48:06,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:48:06,060 INFO L471 AbstractCegarLoop]: Abstraction has 52122 states and 66830 transitions. [2025-01-09 05:48:06,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 6.75) internal successors, (189), 27 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 05:48:06,060 INFO L276 IsEmpty]: Start isEmpty. Operand 52122 states and 66830 transitions. [2025-01-09 05:48:06,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-01-09 05:48:06,066 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:48:06,066 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:48:06,073 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 05:48:06,267 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,SelfDestructingSolverStorable21 [2025-01-09 05:48:06,267 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:48:06,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:48:06,268 INFO L85 PathProgramCache]: Analyzing trace with hash -1312503671, now seen corresponding path program 1 times [2025-01-09 05:48:06,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:48:06,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743108427] [2025-01-09 05:48:06,268 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:48:06,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:48:06,275 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-01-09 05:48:06,296 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-01-09 05:48:06,300 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:48:06,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:48:06,625 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:48:06,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:48:06,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743108427] [2025-01-09 05:48:06,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743108427] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 05:48:06,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1998891007] [2025-01-09 05:48:06,625 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:48:06,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:48:06,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:48:06,627 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 05:48:06,629 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 05:48:06,683 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-01-09 05:48:06,712 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-01-09 05:48:06,712 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:48:06,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:48:06,714 INFO L256 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-01-09 05:48:06,715 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:48:07,361 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:48:07,361 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 05:48:08,048 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:48:08,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1998891007] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 05:48:08,049 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 05:48:08,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13, 13] total 32 [2025-01-09 05:48:08,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670443659] [2025-01-09 05:48:08,049 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 05:48:08,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-01-09 05:48:08,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:48:08,049 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-01-09 05:48:08,050 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=886, Unknown=0, NotChecked=0, Total=992 [2025-01-09 05:48:08,050 INFO L87 Difference]: Start difference. First operand 52122 states and 66830 transitions. Second operand has 32 states, 32 states have (on average 6.125) internal successors, (196), 32 states have internal predecessors, (196), 0 states have call successors, (0), 0 states 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 05:48:10,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:48:10,891 INFO L93 Difference]: Finished difference Result 107898 states and 137531 transitions. [2025-01-09 05:48:10,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-01-09 05:48:10,892 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 6.125) internal successors, (196), 32 states have internal predecessors, (196), 0 states have call successors, (0), 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 76 [2025-01-09 05:48:10,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:48:10,956 INFO L225 Difference]: With dead ends: 107898 [2025-01-09 05:48:10,956 INFO L226 Difference]: Without dead ends: 58926 [2025-01-09 05:48:10,976 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 749 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=723, Invalid=3059, Unknown=0, NotChecked=0, Total=3782 [2025-01-09 05:48:10,976 INFO L435 NwaCegarLoop]: 1506 mSDtfsCounter, 14701 mSDsluCounter, 15384 mSDsCounter, 0 mSdLazyCounter, 1015 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14701 SdHoareTripleChecker+Valid, 16890 SdHoareTripleChecker+Invalid, 1052 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 1015 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 05:48:10,976 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14701 Valid, 16890 Invalid, 1052 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 1015 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 05:48:11,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58926 states. [2025-01-09 05:48:12,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58926 to 45438. [2025-01-09 05:48:12,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45438 states, 45436 states have (on average 1.2637336033101505) internal successors, (57419), 45437 states have internal predecessors, (57419), 0 states have call successors, (0), 0 states 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 05:48:12,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45438 states to 45438 states and 57419 transitions. [2025-01-09 05:48:12,679 INFO L78 Accepts]: Start accepts. Automaton has 45438 states and 57419 transitions. Word has length 76 [2025-01-09 05:48:12,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:48:12,679 INFO L471 AbstractCegarLoop]: Abstraction has 45438 states and 57419 transitions. [2025-01-09 05:48:12,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 6.125) internal successors, (196), 32 states have internal predecessors, (196), 0 states have call successors, (0), 0 states 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 05:48:12,680 INFO L276 IsEmpty]: Start isEmpty. Operand 45438 states and 57419 transitions. [2025-01-09 05:48:12,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-01-09 05:48:12,681 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:48:12,681 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:48:12,687 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-09 05:48:12,881 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,SelfDestructingSolverStorable22 [2025-01-09 05:48:12,882 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:48:12,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:48:12,883 INFO L85 PathProgramCache]: Analyzing trace with hash -1112270555, now seen corresponding path program 1 times [2025-01-09 05:48:12,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:48:12,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379395078] [2025-01-09 05:48:12,883 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:48:12,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:48:12,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-01-09 05:48:12,925 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-01-09 05:48:12,926 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:48:12,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:48:13,488 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:48:13,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:48:13,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379395078] [2025-01-09 05:48:13,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379395078] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 05:48:13,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [314805315] [2025-01-09 05:48:13,489 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:48:13,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:48:13,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:48:13,492 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 05:48:13,493 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-09 05:48:13,551 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-01-09 05:48:13,582 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-01-09 05:48:13,582 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:48:13,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:48:13,584 INFO L256 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-01-09 05:48:13,586 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:48:14,196 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:48:14,196 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 05:48:15,093 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:48:15,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [314805315] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 05:48:15,093 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 05:48:15,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 13] total 35 [2025-01-09 05:48:15,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659757491] [2025-01-09 05:48:15,093 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 05:48:15,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-01-09 05:48:15,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:48:15,094 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-01-09 05:48:15,095 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=1076, Unknown=0, NotChecked=0, Total=1190 [2025-01-09 05:48:15,095 INFO L87 Difference]: Start difference. First operand 45438 states and 57419 transitions. Second operand has 35 states, 35 states have (on average 6.142857142857143) internal successors, (215), 35 states have internal predecessors, (215), 0 states have call successors, (0), 0 states 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 05:48:22,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:48:22,191 INFO L93 Difference]: Finished difference Result 101795 states and 128801 transitions. [2025-01-09 05:48:22,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2025-01-09 05:48:22,191 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 6.142857142857143) internal successors, (215), 35 states have internal predecessors, (215), 0 states have call successors, (0), 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 77 [2025-01-09 05:48:22,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:48:22,267 INFO L225 Difference]: With dead ends: 101795 [2025-01-09 05:48:22,267 INFO L226 Difference]: Without dead ends: 73807 [2025-01-09 05:48:22,286 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2846 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=2174, Invalid=7726, Unknown=0, NotChecked=0, Total=9900 [2025-01-09 05:48:22,287 INFO L435 NwaCegarLoop]: 1534 mSDtfsCounter, 15194 mSDsluCounter, 18601 mSDsCounter, 0 mSdLazyCounter, 1376 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15194 SdHoareTripleChecker+Valid, 20135 SdHoareTripleChecker+Invalid, 1453 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 1376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 05:48:22,287 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15194 Valid, 20135 Invalid, 1453 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 1376 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 05:48:22,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73807 states. [2025-01-09 05:48:23,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73807 to 33474. [2025-01-09 05:48:23,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33474 states, 33472 states have (on average 1.2667304015296368) internal successors, (42400), 33473 states have internal predecessors, (42400), 0 states have call successors, (0), 0 states 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 05:48:23,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33474 states to 33474 states and 42400 transitions. [2025-01-09 05:48:23,655 INFO L78 Accepts]: Start accepts. Automaton has 33474 states and 42400 transitions. Word has length 77 [2025-01-09 05:48:23,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:48:23,656 INFO L471 AbstractCegarLoop]: Abstraction has 33474 states and 42400 transitions. [2025-01-09 05:48:23,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 6.142857142857143) internal successors, (215), 35 states have internal predecessors, (215), 0 states have call successors, (0), 0 states 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 05:48:23,656 INFO L276 IsEmpty]: Start isEmpty. Operand 33474 states and 42400 transitions. [2025-01-09 05:48:23,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-01-09 05:48:23,661 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:48:23,661 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:48:23,675 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-01-09 05:48:23,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-01-09 05:48:23,862 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:48:23,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:48:23,862 INFO L85 PathProgramCache]: Analyzing trace with hash -656090524, now seen corresponding path program 1 times [2025-01-09 05:48:23,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:48:23,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750189024] [2025-01-09 05:48:23,862 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:48:23,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:48:23,875 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-01-09 05:48:23,882 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-01-09 05:48:23,885 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:48:23,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:48:23,919 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:48:23,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:48:23,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750189024] [2025-01-09 05:48:23,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750189024] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:48:23,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:48:23,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 05:48:23,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976261329] [2025-01-09 05:48:23,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:48:23,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:48:23,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:48:23,921 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:48:23,921 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:48:23,921 INFO L87 Difference]: Start difference. First operand 33474 states and 42400 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 2 states have internal predecessors, (89), 0 states have call successors, (0), 0 states 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 05:48:27,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:48:27,446 INFO L93 Difference]: Finished difference Result 35729 states and 46515 transitions. [2025-01-09 05:48:27,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:48:27,446 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 2 states have internal predecessors, (89), 0 states have call successors, (0), 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 89 [2025-01-09 05:48:27,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:48:27,484 INFO L225 Difference]: With dead ends: 35729 [2025-01-09 05:48:27,484 INFO L226 Difference]: Without dead ends: 34225 [2025-01-09 05:48:27,490 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:48:27,491 INFO L435 NwaCegarLoop]: 531 mSDtfsCounter, 868 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1995 mSolverCounterSat, 864 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 868 SdHoareTripleChecker+Valid, 537 SdHoareTripleChecker+Invalid, 2859 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 864 IncrementalHoareTripleChecker+Valid, 1995 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-01-09 05:48:27,492 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [868 Valid, 537 Invalid, 2859 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [864 Valid, 1995 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-01-09 05:48:27,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34225 states. [2025-01-09 05:48:29,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34225 to 34225. [2025-01-09 05:48:29,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34225 states, 34223 states have (on average 1.2528124360809982) internal successors, (42875), 34224 states have internal predecessors, (42875), 0 states have call successors, (0), 0 states 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 05:48:29,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34225 states to 34225 states and 42875 transitions. [2025-01-09 05:48:29,163 INFO L78 Accepts]: Start accepts. Automaton has 34225 states and 42875 transitions. Word has length 89 [2025-01-09 05:48:29,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:48:29,163 INFO L471 AbstractCegarLoop]: Abstraction has 34225 states and 42875 transitions. [2025-01-09 05:48:29,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 2 states have internal predecessors, (89), 0 states have call successors, (0), 0 states 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 05:48:29,163 INFO L276 IsEmpty]: Start isEmpty. Operand 34225 states and 42875 transitions. [2025-01-09 05:48:29,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-01-09 05:48:29,165 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:48:29,165 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:48:29,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-01-09 05:48:29,165 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:48:29,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:48:29,165 INFO L85 PathProgramCache]: Analyzing trace with hash -305008407, now seen corresponding path program 1 times [2025-01-09 05:48:29,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:48:29,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071000936] [2025-01-09 05:48:29,166 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:48:29,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:48:29,175 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-01-09 05:48:29,179 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-01-09 05:48:29,180 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:48:29,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:48:29,247 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:48:29,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:48:29,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071000936] [2025-01-09 05:48:29,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071000936] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 05:48:29,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1505264093] [2025-01-09 05:48:29,248 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:48:29,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:48:29,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:48:29,250 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 05:48:29,254 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-09 05:48:29,312 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-01-09 05:48:29,330 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-01-09 05:48:29,331 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:48:29,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:48:29,331 INFO L256 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 05:48:29,333 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:48:29,351 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:48:29,351 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 05:48:29,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1505264093] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:48:29,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 05:48:29,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-01-09 05:48:29,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002583005] [2025-01-09 05:48:29,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:48:29,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:48:29,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:48:29,353 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:48:29,353 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:48:29,353 INFO L87 Difference]: Start difference. First operand 34225 states and 42875 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states 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 05:48:32,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:48:32,485 INFO L93 Difference]: Finished difference Result 38733 states and 49376 transitions. [2025-01-09 05:48:32,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:48:32,486 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 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 91 [2025-01-09 05:48:32,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:48:32,521 INFO L225 Difference]: With dead ends: 38733 [2025-01-09 05:48:32,522 INFO L226 Difference]: Without dead ends: 36478 [2025-01-09 05:48:32,528 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:48:32,529 INFO L435 NwaCegarLoop]: 700 mSDtfsCounter, 840 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2273 mSolverCounterSat, 684 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 840 SdHoareTripleChecker+Valid, 707 SdHoareTripleChecker+Invalid, 2957 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 684 IncrementalHoareTripleChecker+Valid, 2273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-01-09 05:48:32,529 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [840 Valid, 707 Invalid, 2957 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [684 Valid, 2273 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-01-09 05:48:32,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36478 states. [2025-01-09 05:48:33,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36478 to 36478. [2025-01-09 05:48:33,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36478 states, 36476 states have (on average 1.2460796139927623) internal successors, (45452), 36477 states have internal predecessors, (45452), 0 states have call successors, (0), 0 states 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 05:48:33,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36478 states to 36478 states and 45452 transitions. [2025-01-09 05:48:33,539 INFO L78 Accepts]: Start accepts. Automaton has 36478 states and 45452 transitions. Word has length 91 [2025-01-09 05:48:33,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:48:33,539 INFO L471 AbstractCegarLoop]: Abstraction has 36478 states and 45452 transitions. [2025-01-09 05:48:33,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states 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 05:48:33,539 INFO L276 IsEmpty]: Start isEmpty. Operand 36478 states and 45452 transitions. [2025-01-09 05:48:33,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-01-09 05:48:33,540 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:48:33,540 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:48:33,546 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-01-09 05:48:33,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:48:33,741 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:48:33,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:48:33,741 INFO L85 PathProgramCache]: Analyzing trace with hash 1053625464, now seen corresponding path program 1 times [2025-01-09 05:48:33,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:48:33,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073206201] [2025-01-09 05:48:33,741 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:48:33,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:48:33,752 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-01-09 05:48:33,755 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-01-09 05:48:33,755 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:48:33,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:48:33,824 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:48:33,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:48:33,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073206201] [2025-01-09 05:48:33,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073206201] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:48:33,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:48:33,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:48:33,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140671932] [2025-01-09 05:48:33,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:48:33,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 05:48:33,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:48:33,826 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 05:48:33,827 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 05:48:33,827 INFO L87 Difference]: Start difference. First operand 36478 states and 45452 transitions. Second operand has 4 states, 4 states have (on average 24.25) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states 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 05:48:38,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:48:38,345 INFO L93 Difference]: Finished difference Result 46243 states and 57906 transitions. [2025-01-09 05:48:38,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 05:48:38,345 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 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 97 [2025-01-09 05:48:38,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:48:38,389 INFO L225 Difference]: With dead ends: 46243 [2025-01-09 05:48:38,390 INFO L226 Difference]: Without dead ends: 41735 [2025-01-09 05:48:38,399 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 05:48:38,400 INFO L435 NwaCegarLoop]: 235 mSDtfsCounter, 2359 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 4712 mSolverCounterSat, 711 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2359 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 5423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 711 IncrementalHoareTripleChecker+Valid, 4712 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2025-01-09 05:48:38,401 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2359 Valid, 253 Invalid, 5423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [711 Valid, 4712 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2025-01-09 05:48:38,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41735 states. [2025-01-09 05:48:39,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41735 to 41735. [2025-01-09 05:48:39,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41735 states, 41733 states have (on average 1.2432846907722905) internal successors, (51886), 41734 states have internal predecessors, (51886), 0 states have call successors, (0), 0 states 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 05:48:39,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41735 states to 41735 states and 51886 transitions. [2025-01-09 05:48:39,487 INFO L78 Accepts]: Start accepts. Automaton has 41735 states and 51886 transitions. Word has length 97 [2025-01-09 05:48:39,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:48:39,488 INFO L471 AbstractCegarLoop]: Abstraction has 41735 states and 51886 transitions. [2025-01-09 05:48:39,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states 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 05:48:39,488 INFO L276 IsEmpty]: Start isEmpty. Operand 41735 states and 51886 transitions. [2025-01-09 05:48:39,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-01-09 05:48:39,491 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:48:39,491 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:48:39,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-01-09 05:48:39,491 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:48:39,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:48:39,491 INFO L85 PathProgramCache]: Analyzing trace with hash -1728802058, now seen corresponding path program 1 times [2025-01-09 05:48:39,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:48:39,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116441100] [2025-01-09 05:48:39,492 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:48:39,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:48:39,506 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-01-09 05:48:39,525 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-01-09 05:48:39,525 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:48:39,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:48:40,180 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 22 proven. 85 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:48:40,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:48:40,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116441100] [2025-01-09 05:48:40,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116441100] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 05:48:40,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [395293684] [2025-01-09 05:48:40,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:48:40,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:48:40,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:48:40,183 INFO L229 MonitoredProcess]: Starting monitored process 9 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 05:48:40,185 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-01-09 05:48:40,245 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-01-09 05:48:40,290 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-01-09 05:48:40,290 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:48:40,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:48:40,293 INFO L256 TraceCheckSpWp]: Trace formula consists of 520 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-01-09 05:48:40,296 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:48:40,955 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 53 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:48:40,956 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 05:48:42,448 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 47 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:48:42,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [395293684] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 05:48:42,449 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 05:48:42,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 31 [2025-01-09 05:48:42,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015405651] [2025-01-09 05:48:42,449 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 05:48:42,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-01-09 05:48:42,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:48:42,450 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-01-09 05:48:42,450 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=885, Unknown=0, NotChecked=0, Total=992 [2025-01-09 05:48:42,450 INFO L87 Difference]: Start difference. First operand 41735 states and 51886 transitions. Second operand has 32 states, 32 states have (on average 10.15625) internal successors, (325), 31 states have internal predecessors, (325), 0 states have call successors, (0), 0 states 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 05:48:46,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:48:46,480 INFO L93 Difference]: Finished difference Result 66128 states and 82232 transitions. [2025-01-09 05:48:46,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-01-09 05:48:46,481 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 10.15625) internal successors, (325), 31 states have internal predecessors, (325), 0 states have call successors, (0), 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 123 [2025-01-09 05:48:46,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:48:46,523 INFO L225 Difference]: With dead ends: 66128 [2025-01-09 05:48:46,523 INFO L226 Difference]: Without dead ends: 42127 [2025-01-09 05:48:46,536 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 227 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 703 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=882, Invalid=3408, Unknown=0, NotChecked=0, Total=4290 [2025-01-09 05:48:46,537 INFO L435 NwaCegarLoop]: 1519 mSDtfsCounter, 28908 mSDsluCounter, 12564 mSDsCounter, 0 mSdLazyCounter, 1035 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28908 SdHoareTripleChecker+Valid, 14083 SdHoareTripleChecker+Invalid, 1082 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 1035 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 05:48:46,537 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28908 Valid, 14083 Invalid, 1082 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 1035 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 05:48:46,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42127 states. [2025-01-09 05:48:48,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42127 to 41735. [2025-01-09 05:48:48,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41735 states, 41733 states have (on average 1.2306807562360722) internal successors, (51360), 41734 states have internal predecessors, (51360), 0 states have call successors, (0), 0 states 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 05:48:48,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41735 states to 41735 states and 51360 transitions. [2025-01-09 05:48:48,231 INFO L78 Accepts]: Start accepts. Automaton has 41735 states and 51360 transitions. Word has length 123 [2025-01-09 05:48:48,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:48:48,232 INFO L471 AbstractCegarLoop]: Abstraction has 41735 states and 51360 transitions. [2025-01-09 05:48:48,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 10.15625) internal successors, (325), 31 states have internal predecessors, (325), 0 states have call successors, (0), 0 states 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 05:48:48,232 INFO L276 IsEmpty]: Start isEmpty. Operand 41735 states and 51360 transitions. [2025-01-09 05:48:48,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-01-09 05:48:48,235 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:48:48,235 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:48:48,242 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-01-09 05:48:48,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-01-09 05:48:48,436 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:48:48,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:48:48,436 INFO L85 PathProgramCache]: Analyzing trace with hash 2052026678, now seen corresponding path program 1 times [2025-01-09 05:48:48,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:48:48,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188059681] [2025-01-09 05:48:48,436 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:48:48,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:48:48,444 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-01-09 05:48:48,453 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-01-09 05:48:48,454 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:48:48,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:48:48,934 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 34 proven. 69 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:48:48,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:48:48,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188059681] [2025-01-09 05:48:48,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188059681] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 05:48:48,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [257106781] [2025-01-09 05:48:48,935 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:48:48,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:48:48,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:48:48,939 INFO L229 MonitoredProcess]: Starting monitored process 10 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 05:48:48,940 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-01-09 05:48:49,004 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-01-09 05:48:49,053 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-01-09 05:48:49,053 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:48:49,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:48:49,055 INFO L256 TraceCheckSpWp]: Trace formula consists of 524 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-01-09 05:48:49,057 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:48:49,646 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 36 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:48:49,646 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 05:48:50,914 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 34 proven. 69 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:48:50,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [257106781] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 05:48:50,914 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 05:48:50,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 26 [2025-01-09 05:48:50,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649181718] [2025-01-09 05:48:50,915 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 05:48:50,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-01-09 05:48:50,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:48:50,915 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-01-09 05:48:50,916 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=595, Unknown=0, NotChecked=0, Total=702 [2025-01-09 05:48:50,916 INFO L87 Difference]: Start difference. First operand 41735 states and 51360 transitions. Second operand has 27 states, 27 states have (on average 10.0) internal successors, (270), 26 states have internal predecessors, (270), 0 states have call successors, (0), 0 states 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 05:48:52,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:48:52,780 INFO L93 Difference]: Finished difference Result 62131 states and 76515 transitions. [2025-01-09 05:48:52,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 05:48:52,780 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 10.0) internal successors, (270), 26 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 124 [2025-01-09 05:48:52,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:48:52,820 INFO L225 Difference]: With dead ends: 62131 [2025-01-09 05:48:52,820 INFO L226 Difference]: Without dead ends: 43851 [2025-01-09 05:48:52,833 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 233 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 280 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=345, Invalid=1215, Unknown=0, NotChecked=0, Total=1560 [2025-01-09 05:48:52,838 INFO L435 NwaCegarLoop]: 1530 mSDtfsCounter, 18025 mSDsluCounter, 7715 mSDsCounter, 0 mSdLazyCounter, 405 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18025 SdHoareTripleChecker+Valid, 9245 SdHoareTripleChecker+Invalid, 431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 405 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 05:48:52,838 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18025 Valid, 9245 Invalid, 431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 405 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 05:48:52,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43851 states. [2025-01-09 05:48:54,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43851 to 41735. [2025-01-09 05:48:54,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41735 states, 41733 states have (on average 1.223588047827858) internal successors, (51064), 41734 states have internal predecessors, (51064), 0 states have call successors, (0), 0 states 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 05:48:54,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41735 states to 41735 states and 51064 transitions. [2025-01-09 05:48:54,517 INFO L78 Accepts]: Start accepts. Automaton has 41735 states and 51064 transitions. Word has length 124 [2025-01-09 05:48:54,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:48:54,517 INFO L471 AbstractCegarLoop]: Abstraction has 41735 states and 51064 transitions. [2025-01-09 05:48:54,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 10.0) internal successors, (270), 26 states have internal predecessors, (270), 0 states have call successors, (0), 0 states 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 05:48:54,517 INFO L276 IsEmpty]: Start isEmpty. Operand 41735 states and 51064 transitions. [2025-01-09 05:48:54,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-01-09 05:48:54,520 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:48:54,520 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:48:54,527 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-01-09 05:48:54,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-01-09 05:48:54,721 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:48:54,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:48:54,722 INFO L85 PathProgramCache]: Analyzing trace with hash 1504055192, now seen corresponding path program 1 times [2025-01-09 05:48:54,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:48:54,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195295922] [2025-01-09 05:48:54,722 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:48:54,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:48:54,731 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-01-09 05:48:54,748 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-01-09 05:48:54,748 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:48:54,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:48:55,440 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 16 proven. 88 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:48:55,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:48:55,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195295922] [2025-01-09 05:48:55,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195295922] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 05:48:55,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [114722834] [2025-01-09 05:48:55,441 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:48:55,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:48:55,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:48:55,445 INFO L229 MonitoredProcess]: Starting monitored process 11 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 05:48:55,447 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-01-09 05:48:55,511 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-01-09 05:48:55,555 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-01-09 05:48:55,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:48:55,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:48:55,557 INFO L256 TraceCheckSpWp]: Trace formula consists of 526 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-01-09 05:48:55,559 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:48:56,831 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 25 proven. 79 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:48:56,831 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 05:48:59,209 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 25 proven. 79 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:48:59,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [114722834] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 05:48:59,209 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 05:48:59,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 52 [2025-01-09 05:48:59,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581762019] [2025-01-09 05:48:59,210 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 05:48:59,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2025-01-09 05:48:59,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:48:59,211 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2025-01-09 05:48:59,211 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=2462, Unknown=0, NotChecked=0, Total=2652 [2025-01-09 05:48:59,214 INFO L87 Difference]: Start difference. First operand 41735 states and 51064 transitions. Second operand has 52 states, 52 states have (on average 6.788461538461538) internal successors, (353), 52 states have internal predecessors, (353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)