./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.3.1.ufo.UNBOUNDED.pals+Problem12_label02.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/pals_lcr.3.1.ufo.UNBOUNDED.pals+Problem12_label02.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6325d9fccdba44ffb7ef0e133bfabfb6d285a7f8e20c4133b9b681e02437a24c --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 05:41:20,157 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 05:41:20,215 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:41:20,226 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 05:41:20,226 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 05:41:20,251 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 05:41:20,256 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 05:41:20,256 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 05:41:20,256 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 05:41:20,256 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 05:41:20,256 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 05:41:20,256 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 05:41:20,256 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 05:41:20,256 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 05:41:20,257 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 05:41:20,257 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 05:41:20,257 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 05:41:20,257 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 05:41:20,257 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 05:41:20,257 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 05:41:20,257 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 05:41:20,257 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 05:41:20,257 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 05:41:20,257 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 05:41:20,257 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 05:41:20,257 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 05:41:20,257 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 05:41:20,257 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 05:41:20,257 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 05:41:20,257 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 05:41:20,257 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 05:41:20,258 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 05:41:20,258 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:41:20,258 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 05:41:20,258 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 05:41:20,258 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 05:41:20,258 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 05:41:20,258 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:41:20,258 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 05:41:20,258 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 05:41:20,258 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 05:41:20,258 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 05:41:20,258 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 05:41:20,258 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 05:41:20,258 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 05:41:20,258 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 05:41:20,258 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 05:41:20,258 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 05:41:20,258 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 -> 6325d9fccdba44ffb7ef0e133bfabfb6d285a7f8e20c4133b9b681e02437a24c [2025-01-09 05:41:20,550 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 05:41:20,564 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 05:41:20,566 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 05:41:20,568 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 05:41:20,568 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 05:41:20,569 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.3.1.ufo.UNBOUNDED.pals+Problem12_label02.c [2025-01-09 05:41:21,872 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d451c975b/5a0a85f4178f46fb9579bc056a2bec68/FLAGc7b319c0c [2025-01-09 05:41:22,474 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 05:41:22,475 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.3.1.ufo.UNBOUNDED.pals+Problem12_label02.c [2025-01-09 05:41:22,515 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d451c975b/5a0a85f4178f46fb9579bc056a2bec68/FLAGc7b319c0c [2025-01-09 05:41:22,938 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d451c975b/5a0a85f4178f46fb9579bc056a2bec68 [2025-01-09 05:41:22,939 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 05:41:22,941 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 05:41:22,942 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 05:41:22,942 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 05:41:22,945 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 05:41:22,946 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 05:41:22" (1/1) ... [2025-01-09 05:41:22,947 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@190426d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:41:22, skipping insertion in model container [2025-01-09 05:41:22,948 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 05:41:22" (1/1) ... [2025-01-09 05:41:23,029 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 05:41:23,365 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.3.1.ufo.UNBOUNDED.pals+Problem12_label02.c[6487,6500] [2025-01-09 05:41:23,440 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.3.1.ufo.UNBOUNDED.pals+Problem12_label02.c[13777,13790] [2025-01-09 05:41:24,087 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 05:41:24,103 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 05:41:24,132 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.3.1.ufo.UNBOUNDED.pals+Problem12_label02.c[6487,6500] [2025-01-09 05:41:24,150 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.3.1.ufo.UNBOUNDED.pals+Problem12_label02.c[13777,13790] [2025-01-09 05:41:24,473 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 05:41:24,496 INFO L204 MainTranslator]: Completed translation [2025-01-09 05:41:24,497 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:41:24 WrapperNode [2025-01-09 05:41:24,497 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 05:41:24,498 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 05:41:24,499 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 05:41:24,499 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 05:41:24,503 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:41:24" (1/1) ... [2025-01-09 05:41:24,550 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:41:24" (1/1) ... [2025-01-09 05:41:24,873 INFO L138 Inliner]: procedures = 35, calls = 20, calls flagged for inlining = 15, calls inlined = 15, statements flattened = 4978 [2025-01-09 05:41:24,874 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 05:41:24,874 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 05:41:24,874 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 05:41:24,874 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 05:41:24,881 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:41:24" (1/1) ... [2025-01-09 05:41:24,881 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:41:24" (1/1) ... [2025-01-09 05:41:24,919 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:41:24" (1/1) ... [2025-01-09 05:41:25,070 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:41:25,071 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:41:24" (1/1) ... [2025-01-09 05:41:25,071 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:41:24" (1/1) ... [2025-01-09 05:41:25,219 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:41:24" (1/1) ... [2025-01-09 05:41:25,245 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:41:24" (1/1) ... [2025-01-09 05:41:25,270 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:41:24" (1/1) ... [2025-01-09 05:41:25,319 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:41:24" (1/1) ... [2025-01-09 05:41:25,336 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:41:24" (1/1) ... [2025-01-09 05:41:25,378 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 05:41:25,380 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 05:41:25,381 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 05:41:25,381 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 05:41:25,382 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:41:24" (1/1) ... [2025-01-09 05:41:25,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:41:25,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:41:25,413 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:41:25,420 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:41:25,436 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 05:41:25,437 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 05:41:25,437 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 05:41:25,437 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 05:41:25,531 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 05:41:25,534 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 05:41:29,963 INFO L? ?]: Removed 734 outVars from TransFormulas that were not future-live. [2025-01-09 05:41:29,963 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 05:41:29,981 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 05:41:29,981 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2025-01-09 05:41:29,982 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 05:41:29 BoogieIcfgContainer [2025-01-09 05:41:29,982 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 05:41:29,983 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 05:41:29,983 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 05:41:29,987 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 05:41:29,987 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 05:41:22" (1/3) ... [2025-01-09 05:41:29,987 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@84a092e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 05:41:29, skipping insertion in model container [2025-01-09 05:41:29,987 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:41:24" (2/3) ... [2025-01-09 05:41:29,987 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@84a092e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 05:41:29, skipping insertion in model container [2025-01-09 05:41:29,987 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 05:41:29" (3/3) ... [2025-01-09 05:41:29,988 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.3.1.ufo.UNBOUNDED.pals+Problem12_label02.c [2025-01-09 05:41:29,998 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 05:41:30,001 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.3.1.ufo.UNBOUNDED.pals+Problem12_label02.c that has 1 procedures, 873 locations, 1 initial locations, 2 loop locations, and 2 error locations. [2025-01-09 05:41:30,076 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 05:41:30,091 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3e219de3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 05:41:30,091 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-01-09 05:41:30,100 INFO L276 IsEmpty]: Start isEmpty. Operand has 873 states, 870 states have (on average 1.9045977011494253) internal successors, (1657), 872 states have internal predecessors, (1657), 0 states have call successors, (0), 0 states 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:41:30,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-01-09 05:41:30,107 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:41:30,108 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:41:30,112 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:41:30,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:41:30,120 INFO L85 PathProgramCache]: Analyzing trace with hash -169677164, now seen corresponding path program 1 times [2025-01-09 05:41:30,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:41:30,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561078161] [2025-01-09 05:41:30,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:41:30,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:41:30,211 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-09 05:41:30,233 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-09 05:41:30,234 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:41:30,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:41:30,279 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:41:30,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:41:30,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561078161] [2025-01-09 05:41:30,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561078161] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:41:30,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:41:30,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 05:41:30,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836050575] [2025-01-09 05:41:30,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:41:30,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 05:41:30,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:41:30,306 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 05:41:30,306 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 05:41:30,309 INFO L87 Difference]: Start difference. First operand has 873 states, 870 states have (on average 1.9045977011494253) internal successors, (1657), 872 states have internal predecessors, (1657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 10.0) 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:41:30,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:41:30,394 INFO L93 Difference]: Finished difference Result 1723 states and 3273 transitions. [2025-01-09 05:41:30,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 05:41:30,397 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.0) 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:41:30,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:41:30,408 INFO L225 Difference]: With dead ends: 1723 [2025-01-09 05:41:30,408 INFO L226 Difference]: Without dead ends: 808 [2025-01-09 05:41:30,414 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 05:41:30,416 INFO L435 NwaCegarLoop]: 1591 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1591 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:41:30,417 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1591 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:41:30,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 808 states. [2025-01-09 05:41:30,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 808 to 808. [2025-01-09 05:41:30,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 808 states, 806 states have (on average 1.8945409429280398) internal successors, (1527), 807 states have internal predecessors, (1527), 0 states have call successors, (0), 0 states 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:41:30,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 808 states to 808 states and 1527 transitions. [2025-01-09 05:41:30,496 INFO L78 Accepts]: Start accepts. Automaton has 808 states and 1527 transitions. Word has length 20 [2025-01-09 05:41:30,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:41:30,497 INFO L471 AbstractCegarLoop]: Abstraction has 808 states and 1527 transitions. [2025-01-09 05:41:30,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.0) 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:41:30,497 INFO L276 IsEmpty]: Start isEmpty. Operand 808 states and 1527 transitions. [2025-01-09 05:41:30,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-01-09 05:41:30,498 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:41:30,498 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:41:30,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 05:41:30,499 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:41:30,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:41:30,499 INFO L85 PathProgramCache]: Analyzing trace with hash -1180794414, now seen corresponding path program 1 times [2025-01-09 05:41:30,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:41:30,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129211336] [2025-01-09 05:41:30,500 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:41:30,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:41:30,509 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-09 05:41:30,539 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-09 05:41:30,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:41:30,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:41:30,727 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:41:30,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:41:30,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129211336] [2025-01-09 05:41:30,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129211336] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:41:30,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:41:30,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 05:41:30,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186594932] [2025-01-09 05:41:30,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:41:30,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 05:41:30,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:41:30,729 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 05:41:30,729 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 05:41:30,729 INFO L87 Difference]: Start difference. First operand 808 states and 1527 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 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:41:30,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:41:30,830 INFO L93 Difference]: Finished difference Result 844 states and 1581 transitions. [2025-01-09 05:41:30,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 05:41:30,835 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 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:41:30,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:41:30,838 INFO L225 Difference]: With dead ends: 844 [2025-01-09 05:41:30,841 INFO L226 Difference]: Without dead ends: 808 [2025-01-09 05:41:30,842 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:41:30,843 INFO L435 NwaCegarLoop]: 1525 mSDtfsCounter, 0 mSDsluCounter, 4554 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6079 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:41:30,843 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6079 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:41:30,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 808 states. [2025-01-09 05:41:30,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 808 to 808. [2025-01-09 05:41:30,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 808 states, 806 states have (on average 1.8746898263027296) internal successors, (1511), 807 states have internal predecessors, (1511), 0 states have call successors, (0), 0 states 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:41:30,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 808 states to 808 states and 1511 transitions. [2025-01-09 05:41:30,917 INFO L78 Accepts]: Start accepts. Automaton has 808 states and 1511 transitions. Word has length 20 [2025-01-09 05:41:30,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:41:30,917 INFO L471 AbstractCegarLoop]: Abstraction has 808 states and 1511 transitions. [2025-01-09 05:41:30,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 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:41:30,918 INFO L276 IsEmpty]: Start isEmpty. Operand 808 states and 1511 transitions. [2025-01-09 05:41:30,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-01-09 05:41:30,919 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:41:30,919 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] [2025-01-09 05:41:30,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 05:41:30,919 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:41:30,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:41:30,921 INFO L85 PathProgramCache]: Analyzing trace with hash 1991326346, now seen corresponding path program 1 times [2025-01-09 05:41:30,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:41:30,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631380784] [2025-01-09 05:41:30,921 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:41:30,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:41:30,932 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-01-09 05:41:30,941 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-01-09 05:41:30,941 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:41:30,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:41:31,037 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:41:31,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:41:31,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631380784] [2025-01-09 05:41:31,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631380784] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:41:31,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:41:31,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 05:41:31,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224533064] [2025-01-09 05:41:31,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:41:31,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 05:41:31,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:41:31,038 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 05:41:31,038 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 05:41:31,038 INFO L87 Difference]: Start difference. First operand 808 states and 1511 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states 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:41:31,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:41:31,140 INFO L93 Difference]: Finished difference Result 1000 states and 1811 transitions. [2025-01-09 05:41:31,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 05:41:31,141 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 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 35 [2025-01-09 05:41:31,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:41:31,146 INFO L225 Difference]: With dead ends: 1000 [2025-01-09 05:41:31,146 INFO L226 Difference]: Without dead ends: 968 [2025-01-09 05:41:31,147 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-01-09 05:41:31,149 INFO L435 NwaCegarLoop]: 1505 mSDtfsCounter, 4644 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4644 SdHoareTripleChecker+Valid, 1789 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:41:31,149 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4644 Valid, 1789 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:41:31,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 968 states. [2025-01-09 05:41:31,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 968 to 838. [2025-01-09 05:41:31,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 838 states, 836 states have (on average 1.8636363636363635) internal successors, (1558), 837 states have internal predecessors, (1558), 0 states have call successors, (0), 0 states 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:41:31,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 1558 transitions. [2025-01-09 05:41:31,180 INFO L78 Accepts]: Start accepts. Automaton has 838 states and 1558 transitions. Word has length 35 [2025-01-09 05:41:31,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:41:31,180 INFO L471 AbstractCegarLoop]: Abstraction has 838 states and 1558 transitions. [2025-01-09 05:41:31,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states 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:41:31,180 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 1558 transitions. [2025-01-09 05:41:31,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-01-09 05:41:31,183 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:41:31,183 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] [2025-01-09 05:41:31,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 05:41:31,184 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:41:31,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:41:31,186 INFO L85 PathProgramCache]: Analyzing trace with hash 1054964034, now seen corresponding path program 1 times [2025-01-09 05:41:31,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:41:31,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537707762] [2025-01-09 05:41:31,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:41:31,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:41:31,193 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-01-09 05:41:31,206 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-01-09 05:41:31,207 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:41:31,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:41:31,348 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:41:31,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:41:31,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537707762] [2025-01-09 05:41:31,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537707762] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:41:31,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:41:31,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 05:41:31,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962340632] [2025-01-09 05:41:31,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:41:31,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 05:41:31,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:41:31,350 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 05:41:31,350 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 05:41:31,350 INFO L87 Difference]: Start difference. First operand 838 states and 1558 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states 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:41:31,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:41:31,416 INFO L93 Difference]: Finished difference Result 902 states and 1656 transitions. [2025-01-09 05:41:31,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 05:41:31,417 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2025-01-09 05:41:31,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:41:31,420 INFO L225 Difference]: With dead ends: 902 [2025-01-09 05:41:31,420 INFO L226 Difference]: Without dead ends: 840 [2025-01-09 05:41:31,420 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:41:31,423 INFO L435 NwaCegarLoop]: 1506 mSDtfsCounter, 1478 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1478 SdHoareTripleChecker+Valid, 1644 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:41:31,423 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1478 Valid, 1644 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:41:31,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 840 states. [2025-01-09 05:41:31,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 840 to 838. [2025-01-09 05:41:31,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 838 states, 836 states have (on average 1.86244019138756) internal successors, (1557), 837 states have internal predecessors, (1557), 0 states have call successors, (0), 0 states 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:41:31,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 1557 transitions. [2025-01-09 05:41:31,442 INFO L78 Accepts]: Start accepts. Automaton has 838 states and 1557 transitions. Word has length 37 [2025-01-09 05:41:31,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:41:31,442 INFO L471 AbstractCegarLoop]: Abstraction has 838 states and 1557 transitions. [2025-01-09 05:41:31,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states 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:41:31,442 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 1557 transitions. [2025-01-09 05:41:31,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-01-09 05:41:31,443 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:41:31,443 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] [2025-01-09 05:41:31,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 05:41:31,443 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:41:31,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:41:31,445 INFO L85 PathProgramCache]: Analyzing trace with hash 988470522, now seen corresponding path program 1 times [2025-01-09 05:41:31,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:41:31,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985029997] [2025-01-09 05:41:31,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:41:31,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:41:31,453 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-01-09 05:41:31,463 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-01-09 05:41:31,463 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:41:31,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:41:31,524 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:41:31,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:41:31,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985029997] [2025-01-09 05:41:31,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985029997] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:41:31,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:41:31,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:41:31,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453379990] [2025-01-09 05:41:31,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:41:31,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:41:31,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:41:31,527 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:41:31,527 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:41:31,528 INFO L87 Difference]: Start difference. First operand 838 states and 1557 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states 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:41:31,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:41:31,554 INFO L93 Difference]: Finished difference Result 951 states and 1730 transitions. [2025-01-09 05:41:31,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:41:31,555 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2025-01-09 05:41:31,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:41:31,558 INFO L225 Difference]: With dead ends: 951 [2025-01-09 05:41:31,558 INFO L226 Difference]: Without dead ends: 889 [2025-01-09 05:41:31,558 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:41:31,559 INFO L435 NwaCegarLoop]: 1507 mSDtfsCounter, 1468 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1468 SdHoareTripleChecker+Valid, 1550 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:41:31,559 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1468 Valid, 1550 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:41:31,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 889 states. [2025-01-09 05:41:31,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 889 to 885. [2025-01-09 05:41:31,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 885 states, 883 states have (on average 1.8414496036240091) internal successors, (1626), 884 states have internal predecessors, (1626), 0 states have call successors, (0), 0 states 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:41:31,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 885 states to 885 states and 1626 transitions. [2025-01-09 05:41:31,577 INFO L78 Accepts]: Start accepts. Automaton has 885 states and 1626 transitions. Word has length 37 [2025-01-09 05:41:31,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:41:31,577 INFO L471 AbstractCegarLoop]: Abstraction has 885 states and 1626 transitions. [2025-01-09 05:41:31,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states 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:41:31,579 INFO L276 IsEmpty]: Start isEmpty. Operand 885 states and 1626 transitions. [2025-01-09 05:41:31,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-01-09 05:41:31,579 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:41:31,579 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] [2025-01-09 05:41:31,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 05:41:31,580 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:41:31,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:41:31,581 INFO L85 PathProgramCache]: Analyzing trace with hash -2070576533, now seen corresponding path program 1 times [2025-01-09 05:41:31,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:41:31,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201198093] [2025-01-09 05:41:31,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:41:31,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:41:31,588 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-01-09 05:41:31,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-01-09 05:41:31,606 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:41:31,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:41:31,792 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:41:31,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:41:31,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201198093] [2025-01-09 05:41:31,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201198093] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:41:31,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:41:31,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 05:41:31,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174900559] [2025-01-09 05:41:31,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:41:31,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 05:41:31,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:41:31,794 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 05:41:31,794 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 05:41:31,794 INFO L87 Difference]: Start difference. First operand 885 states and 1626 transitions. Second operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 0 states have call successors, (0), 0 states 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:41:31,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:41:31,867 INFO L93 Difference]: Finished difference Result 893 states and 1635 transitions. [2025-01-09 05:41:31,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 05:41:31,868 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 0 states have call successors, (0), 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 38 [2025-01-09 05:41:31,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:41:31,873 INFO L225 Difference]: With dead ends: 893 [2025-01-09 05:41:31,874 INFO L226 Difference]: Without dead ends: 891 [2025-01-09 05:41:31,875 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 05:41:31,875 INFO L435 NwaCegarLoop]: 1505 mSDtfsCounter, 0 mSDsluCounter, 9017 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 10522 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:41:31,876 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 10522 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:41:31,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 891 states. [2025-01-09 05:41:31,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 891 to 891. [2025-01-09 05:41:31,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 891 states, 889 states have (on average 1.8346456692913387) internal successors, (1631), 890 states have internal predecessors, (1631), 0 states have call successors, (0), 0 states 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:41:31,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 891 states to 891 states and 1631 transitions. [2025-01-09 05:41:31,902 INFO L78 Accepts]: Start accepts. Automaton has 891 states and 1631 transitions. Word has length 38 [2025-01-09 05:41:31,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:41:31,903 INFO L471 AbstractCegarLoop]: Abstraction has 891 states and 1631 transitions. [2025-01-09 05:41:31,903 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 0 states have call successors, (0), 0 states 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:41:31,903 INFO L276 IsEmpty]: Start isEmpty. Operand 891 states and 1631 transitions. [2025-01-09 05:41:31,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-01-09 05:41:31,904 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:41:31,904 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:41:31,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 05:41:31,904 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:41:31,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:41:31,905 INFO L85 PathProgramCache]: Analyzing trace with hash -103267006, now seen corresponding path program 1 times [2025-01-09 05:41:31,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:41:31,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711518856] [2025-01-09 05:41:31,905 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:41:31,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:41:31,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-01-09 05:41:31,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-01-09 05:41:31,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:41:31,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:41:31,953 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:41:31,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:41:31,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711518856] [2025-01-09 05:41:31,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711518856] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:41:31,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:41:31,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:41:31,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236890951] [2025-01-09 05:41:31,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:41:31,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:41:31,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:41:31,956 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:41:31,956 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:41:31,956 INFO L87 Difference]: Start difference. First operand 891 states and 1631 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:41:31,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:41:31,976 INFO L93 Difference]: Finished difference Result 1105 states and 1943 transitions. [2025-01-09 05:41:31,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:41:31,977 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2025-01-09 05:41:31,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:41:31,980 INFO L225 Difference]: With dead ends: 1105 [2025-01-09 05:41:31,980 INFO L226 Difference]: Without dead ends: 990 [2025-01-09 05:41:31,981 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:41:31,982 INFO L435 NwaCegarLoop]: 1538 mSDtfsCounter, 1477 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1477 SdHoareTripleChecker+Valid, 1593 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:41:31,982 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1477 Valid, 1593 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:41:31,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 990 states. [2025-01-09 05:41:31,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 990 to 988. [2025-01-09 05:41:31,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 988 states, 986 states have (on average 1.793103448275862) internal successors, (1768), 987 states have internal predecessors, (1768), 0 states have call successors, (0), 0 states 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:41:32,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 988 states to 988 states and 1768 transitions. [2025-01-09 05:41:32,002 INFO L78 Accepts]: Start accepts. Automaton has 988 states and 1768 transitions. Word has length 39 [2025-01-09 05:41:32,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:41:32,002 INFO L471 AbstractCegarLoop]: Abstraction has 988 states and 1768 transitions. [2025-01-09 05:41:32,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:41:32,002 INFO L276 IsEmpty]: Start isEmpty. Operand 988 states and 1768 transitions. [2025-01-09 05:41:32,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-01-09 05:41:32,002 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:41:32,002 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:41:32,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 05:41:32,003 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:41:32,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:41:32,003 INFO L85 PathProgramCache]: Analyzing trace with hash 1677665858, now seen corresponding path program 1 times [2025-01-09 05:41:32,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:41:32,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594572948] [2025-01-09 05:41:32,003 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:41:32,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:41:32,013 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-01-09 05:41:32,019 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-01-09 05:41:32,019 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:41:32,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:41:32,045 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:41:32,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:41:32,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594572948] [2025-01-09 05:41:32,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594572948] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:41:32,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:41:32,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:41:32,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163909234] [2025-01-09 05:41:32,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:41:32,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:41:32,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:41:32,047 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:41:32,047 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:41:32,047 INFO L87 Difference]: Start difference. First operand 988 states and 1768 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:41:32,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:41:32,071 INFO L93 Difference]: Finished difference Result 1380 states and 2326 transitions. [2025-01-09 05:41:32,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:41:32,071 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2025-01-09 05:41:32,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:41:32,075 INFO L225 Difference]: With dead ends: 1380 [2025-01-09 05:41:32,075 INFO L226 Difference]: Without dead ends: 1168 [2025-01-09 05:41:32,076 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:41:32,076 INFO L435 NwaCegarLoop]: 1536 mSDtfsCounter, 1475 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1475 SdHoareTripleChecker+Valid, 1595 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:41:32,077 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1475 Valid, 1595 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:41:32,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1168 states. [2025-01-09 05:41:32,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1168 to 1166. [2025-01-09 05:41:32,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1166 states, 1164 states have (on average 1.7268041237113403) internal successors, (2010), 1165 states have internal predecessors, (2010), 0 states have call successors, (0), 0 states 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:41:32,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1166 states to 1166 states and 2010 transitions. [2025-01-09 05:41:32,102 INFO L78 Accepts]: Start accepts. Automaton has 1166 states and 2010 transitions. Word has length 39 [2025-01-09 05:41:32,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:41:32,102 INFO L471 AbstractCegarLoop]: Abstraction has 1166 states and 2010 transitions. [2025-01-09 05:41:32,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:41:32,103 INFO L276 IsEmpty]: Start isEmpty. Operand 1166 states and 2010 transitions. [2025-01-09 05:41:32,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-01-09 05:41:32,104 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:41:32,104 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] [2025-01-09 05:41:32,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 05:41:32,105 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:41:32,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:41:32,105 INFO L85 PathProgramCache]: Analyzing trace with hash 599493661, now seen corresponding path program 1 times [2025-01-09 05:41:32,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:41:32,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091484838] [2025-01-09 05:41:32,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:41:32,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:41:32,113 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-01-09 05:41:32,119 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-01-09 05:41:32,121 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:41:32,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:41:32,157 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:41:32,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:41:32,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091484838] [2025-01-09 05:41:32,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091484838] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:41:32,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:41:32,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:41:32,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078515273] [2025-01-09 05:41:32,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:41:32,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:41:32,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:41:32,160 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:41:32,160 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:41:32,160 INFO L87 Difference]: Start difference. First operand 1166 states and 2010 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states 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:41:32,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:41:32,190 INFO L93 Difference]: Finished difference Result 1589 states and 2616 transitions. [2025-01-09 05:41:32,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:41:32,191 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 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 41 [2025-01-09 05:41:32,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:41:32,195 INFO L225 Difference]: With dead ends: 1589 [2025-01-09 05:41:32,196 INFO L226 Difference]: Without dead ends: 1354 [2025-01-09 05:41:32,196 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:41:32,198 INFO L435 NwaCegarLoop]: 1543 mSDtfsCounter, 1476 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1476 SdHoareTripleChecker+Valid, 1594 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:41:32,198 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1476 Valid, 1594 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:41:32,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1354 states. [2025-01-09 05:41:32,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1354 to 1352. [2025-01-09 05:41:32,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1352 states, 1350 states have (on average 1.677037037037037) internal successors, (2264), 1351 states have internal predecessors, (2264), 0 states have call successors, (0), 0 states 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:41:32,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1352 states to 1352 states and 2264 transitions. [2025-01-09 05:41:32,231 INFO L78 Accepts]: Start accepts. Automaton has 1352 states and 2264 transitions. Word has length 41 [2025-01-09 05:41:32,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:41:32,231 INFO L471 AbstractCegarLoop]: Abstraction has 1352 states and 2264 transitions. [2025-01-09 05:41:32,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states 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:41:32,231 INFO L276 IsEmpty]: Start isEmpty. Operand 1352 states and 2264 transitions. [2025-01-09 05:41:32,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-01-09 05:41:32,232 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:41:32,233 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] [2025-01-09 05:41:32,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 05:41:32,233 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:41:32,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:41:32,234 INFO L85 PathProgramCache]: Analyzing trace with hash -522911569, now seen corresponding path program 1 times [2025-01-09 05:41:32,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:41:32,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104867963] [2025-01-09 05:41:32,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:41:32,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:41:32,245 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-01-09 05:41:32,256 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-01-09 05:41:32,256 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:41:32,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:41:32,370 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 05:41:32,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:41:32,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104867963] [2025-01-09 05:41:32,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104867963] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:41:32,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:41:32,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 05:41:32,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597916673] [2025-01-09 05:41:32,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:41:32,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 05:41:32,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:41:32,371 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 05:41:32,371 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 05:41:32,371 INFO L87 Difference]: Start difference. First operand 1352 states and 2264 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states 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:41:32,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:41:32,469 INFO L93 Difference]: Finished difference Result 3208 states and 4844 transitions. [2025-01-09 05:41:32,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 05:41:32,470 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 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 54 [2025-01-09 05:41:32,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:41:32,483 INFO L225 Difference]: With dead ends: 3208 [2025-01-09 05:41:32,483 INFO L226 Difference]: Without dead ends: 2634 [2025-01-09 05:41:32,485 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-01-09 05:41:32,486 INFO L435 NwaCegarLoop]: 1552 mSDtfsCounter, 3054 mSDsluCounter, 1607 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3054 SdHoareTripleChecker+Valid, 3159 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:41:32,486 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3054 Valid, 3159 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:41:32,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2634 states. [2025-01-09 05:41:32,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2634 to 1924. [2025-01-09 05:41:32,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1924 states, 1922 states have (on average 1.5879292403746097) internal successors, (3052), 1923 states have internal predecessors, (3052), 0 states have call successors, (0), 0 states 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:41:32,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1924 states to 1924 states and 3052 transitions. [2025-01-09 05:41:32,555 INFO L78 Accepts]: Start accepts. Automaton has 1924 states and 3052 transitions. Word has length 54 [2025-01-09 05:41:32,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:41:32,555 INFO L471 AbstractCegarLoop]: Abstraction has 1924 states and 3052 transitions. [2025-01-09 05:41:32,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states 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:41:32,556 INFO L276 IsEmpty]: Start isEmpty. Operand 1924 states and 3052 transitions. [2025-01-09 05:41:32,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-01-09 05:41:32,556 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:41:32,557 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] [2025-01-09 05:41:32,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 05:41:32,557 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:41:32,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:41:32,558 INFO L85 PathProgramCache]: Analyzing trace with hash 1258021295, now seen corresponding path program 1 times [2025-01-09 05:41:32,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:41:32,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307687850] [2025-01-09 05:41:32,559 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:41:32,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:41:32,569 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-01-09 05:41:32,584 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-01-09 05:41:32,584 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:41:32,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:41:32,675 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-09 05:41:32,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:41:32,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307687850] [2025-01-09 05:41:32,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307687850] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:41:32,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:41:32,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 05:41:32,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639182594] [2025-01-09 05:41:32,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:41:32,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 05:41:32,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:41:32,680 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 05:41:32,680 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 05:41:32,681 INFO L87 Difference]: Start difference. First operand 1924 states and 3052 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 states 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:41:32,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:41:32,793 INFO L93 Difference]: Finished difference Result 3780 states and 5632 transitions. [2025-01-09 05:41:32,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 05:41:32,794 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 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 54 [2025-01-09 05:41:32,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:41:32,807 INFO L225 Difference]: With dead ends: 3780 [2025-01-09 05:41:32,808 INFO L226 Difference]: Without dead ends: 3206 [2025-01-09 05:41:32,810 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-01-09 05:41:32,810 INFO L435 NwaCegarLoop]: 1552 mSDtfsCounter, 3059 mSDsluCounter, 1596 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3059 SdHoareTripleChecker+Valid, 3148 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:41:32,810 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3059 Valid, 3148 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:41:32,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3206 states. [2025-01-09 05:41:32,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3206 to 2784. [2025-01-09 05:41:32,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2784 states, 2782 states have (on average 1.518332135154565) internal successors, (4224), 2783 states have internal predecessors, (4224), 0 states have call successors, (0), 0 states 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:41:32,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2784 states to 2784 states and 4224 transitions. [2025-01-09 05:41:32,894 INFO L78 Accepts]: Start accepts. Automaton has 2784 states and 4224 transitions. Word has length 54 [2025-01-09 05:41:32,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:41:32,894 INFO L471 AbstractCegarLoop]: Abstraction has 2784 states and 4224 transitions. [2025-01-09 05:41:32,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 states 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:41:32,895 INFO L276 IsEmpty]: Start isEmpty. Operand 2784 states and 4224 transitions. [2025-01-09 05:41:32,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-01-09 05:41:32,896 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:41:32,896 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] [2025-01-09 05:41:32,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 05:41:32,896 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:41:32,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:41:32,897 INFO L85 PathProgramCache]: Analyzing trace with hash -1356051929, now seen corresponding path program 1 times [2025-01-09 05:41:32,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:41:32,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506091299] [2025-01-09 05:41:32,897 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:41:32,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:41:32,906 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-01-09 05:41:32,918 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-01-09 05:41:32,918 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:41:32,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:41:32,978 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:41:32,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:41:32,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506091299] [2025-01-09 05:41:32,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506091299] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:41:32,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:41:32,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:41:32,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672090123] [2025-01-09 05:41:32,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:41:32,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:41:32,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:41:32,979 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:41:32,980 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:41:32,980 INFO L87 Difference]: Start difference. First operand 2784 states and 4224 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states 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:41:33,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:41:33,026 INFO L93 Difference]: Finished difference Result 4260 states and 6287 transitions. [2025-01-09 05:41:33,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:41:33,026 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 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 56 [2025-01-09 05:41:33,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:41:33,036 INFO L225 Difference]: With dead ends: 4260 [2025-01-09 05:41:33,036 INFO L226 Difference]: Without dead ends: 2254 [2025-01-09 05:41:33,039 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:41:33,040 INFO L435 NwaCegarLoop]: 1535 mSDtfsCounter, 34 mSDsluCounter, 1496 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 3031 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:41:33,040 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 3031 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:41:33,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2254 states. [2025-01-09 05:41:33,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2254 to 2252. [2025-01-09 05:41:33,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2252 states, 2250 states have (on average 1.5537777777777777) internal successors, (3496), 2251 states have internal predecessors, (3496), 0 states have call successors, (0), 0 states 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:41:33,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2252 states to 2252 states and 3496 transitions. [2025-01-09 05:41:33,100 INFO L78 Accepts]: Start accepts. Automaton has 2252 states and 3496 transitions. Word has length 56 [2025-01-09 05:41:33,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:41:33,100 INFO L471 AbstractCegarLoop]: Abstraction has 2252 states and 3496 transitions. [2025-01-09 05:41:33,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states 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:41:33,100 INFO L276 IsEmpty]: Start isEmpty. Operand 2252 states and 3496 transitions. [2025-01-09 05:41:33,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-01-09 05:41:33,101 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:41:33,101 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] [2025-01-09 05:41:33,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 05:41:33,102 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:41:33,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:41:33,102 INFO L85 PathProgramCache]: Analyzing trace with hash 1047994442, now seen corresponding path program 1 times [2025-01-09 05:41:33,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:41:33,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790222538] [2025-01-09 05:41:33,102 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:41:33,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:41:33,110 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-01-09 05:41:33,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-01-09 05:41:33,117 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:41:33,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:41:33,251 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 05:41:33,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:41:33,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790222538] [2025-01-09 05:41:33,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [790222538] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:41:33,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:41:33,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 05:41:33,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145775302] [2025-01-09 05:41:33,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:41:33,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 05:41:33,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:41:33,253 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 05:41:33,253 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 05:41:33,253 INFO L87 Difference]: Start difference. First operand 2252 states and 3496 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states 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:41:33,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:41:33,357 INFO L93 Difference]: Finished difference Result 3508 states and 5252 transitions. [2025-01-09 05:41:33,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 05:41:33,358 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-01-09 05:41:33,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:41:33,369 INFO L225 Difference]: With dead ends: 3508 [2025-01-09 05:41:33,369 INFO L226 Difference]: Without dead ends: 3090 [2025-01-09 05:41:33,370 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-01-09 05:41:33,371 INFO L435 NwaCegarLoop]: 1550 mSDtfsCounter, 3049 mSDsluCounter, 1632 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3049 SdHoareTripleChecker+Valid, 3182 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:41:33,371 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3049 Valid, 3182 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:41:33,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3090 states. [2025-01-09 05:41:33,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3090 to 2668. [2025-01-09 05:41:33,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2668 states, 2666 states have (on average 1.5273818454613652) internal successors, (4072), 2667 states have internal predecessors, (4072), 0 states have call successors, (0), 0 states 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:41:33,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2668 states to 2668 states and 4072 transitions. [2025-01-09 05:41:33,438 INFO L78 Accepts]: Start accepts. Automaton has 2668 states and 4072 transitions. Word has length 56 [2025-01-09 05:41:33,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:41:33,439 INFO L471 AbstractCegarLoop]: Abstraction has 2668 states and 4072 transitions. [2025-01-09 05:41:33,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states 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:41:33,439 INFO L276 IsEmpty]: Start isEmpty. Operand 2668 states and 4072 transitions. [2025-01-09 05:41:33,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-01-09 05:41:33,440 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:41:33,440 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] [2025-01-09 05:41:33,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 05:41:33,440 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:41:33,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:41:33,441 INFO L85 PathProgramCache]: Analyzing trace with hash -1880756140, now seen corresponding path program 1 times [2025-01-09 05:41:33,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:41:33,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300735696] [2025-01-09 05:41:33,441 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:41:33,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:41:33,449 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-01-09 05:41:33,459 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-01-09 05:41:33,460 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:41:33,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:41:33,515 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:41:33,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:41:33,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300735696] [2025-01-09 05:41:33,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300735696] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:41:33,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:41:33,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:41:33,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746782645] [2025-01-09 05:41:33,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:41:33,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:41:33,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:41:33,516 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:41:33,516 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:41:33,516 INFO L87 Difference]: Start difference. First operand 2668 states and 4072 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states 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:41:33,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:41:33,552 INFO L93 Difference]: Finished difference Result 3608 states and 5370 transitions. [2025-01-09 05:41:33,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:41:33,553 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2025-01-09 05:41:33,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:41:33,559 INFO L225 Difference]: With dead ends: 3608 [2025-01-09 05:41:33,560 INFO L226 Difference]: Without dead ends: 1734 [2025-01-09 05:41:33,562 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:41:33,562 INFO L435 NwaCegarLoop]: 1528 mSDtfsCounter, 29 mSDsluCounter, 1488 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 3016 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:41:33,563 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 3016 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:41:33,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1734 states. [2025-01-09 05:41:33,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1734 to 1732. [2025-01-09 05:41:33,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1732 states, 1730 states have (on average 1.5942196531791908) internal successors, (2758), 1731 states have internal predecessors, (2758), 0 states have call successors, (0), 0 states 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:41:33,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1732 states to 1732 states and 2758 transitions. [2025-01-09 05:41:33,601 INFO L78 Accepts]: Start accepts. Automaton has 1732 states and 2758 transitions. Word has length 57 [2025-01-09 05:41:33,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:41:33,602 INFO L471 AbstractCegarLoop]: Abstraction has 1732 states and 2758 transitions. [2025-01-09 05:41:33,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states 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:41:33,602 INFO L276 IsEmpty]: Start isEmpty. Operand 1732 states and 2758 transitions. [2025-01-09 05:41:33,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-01-09 05:41:33,603 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:41:33,603 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] [2025-01-09 05:41:33,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 05:41:33,603 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:41:33,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:41:33,604 INFO L85 PathProgramCache]: Analyzing trace with hash -975933434, now seen corresponding path program 1 times [2025-01-09 05:41:33,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:41:33,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153909482] [2025-01-09 05:41:33,604 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:41:33,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:41:33,611 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-01-09 05:41:33,620 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-01-09 05:41:33,620 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:41:33,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:41:33,675 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:41:33,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:41:33,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153909482] [2025-01-09 05:41:33,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153909482] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:41:33,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:41:33,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:41:33,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180574566] [2025-01-09 05:41:33,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:41:33,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:41:33,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:41:33,676 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:41:33,676 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:41:33,676 INFO L87 Difference]: Start difference. First operand 1732 states and 2758 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states 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:41:33,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:41:33,704 INFO L93 Difference]: Finished difference Result 2204 states and 3399 transitions. [2025-01-09 05:41:33,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:41:33,705 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 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 59 [2025-01-09 05:41:33,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:41:33,709 INFO L225 Difference]: With dead ends: 2204 [2025-01-09 05:41:33,710 INFO L226 Difference]: Without dead ends: 1266 [2025-01-09 05:41:33,711 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:41:33,711 INFO L435 NwaCegarLoop]: 1521 mSDtfsCounter, 26 mSDsluCounter, 1480 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 3001 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:41:33,711 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 3001 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:41:33,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1266 states. [2025-01-09 05:41:33,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1266 to 1264. [2025-01-09 05:41:33,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1264 states, 1262 states have (on average 1.6719492868462758) internal successors, (2110), 1263 states have internal predecessors, (2110), 0 states have call successors, (0), 0 states 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:41:33,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1264 states to 1264 states and 2110 transitions. [2025-01-09 05:41:33,738 INFO L78 Accepts]: Start accepts. Automaton has 1264 states and 2110 transitions. Word has length 59 [2025-01-09 05:41:33,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:41:33,738 INFO L471 AbstractCegarLoop]: Abstraction has 1264 states and 2110 transitions. [2025-01-09 05:41:33,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states 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:41:33,739 INFO L276 IsEmpty]: Start isEmpty. Operand 1264 states and 2110 transitions. [2025-01-09 05:41:33,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-01-09 05:41:33,739 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:41:33,739 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] [2025-01-09 05:41:33,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 05:41:33,740 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:41:33,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:41:33,740 INFO L85 PathProgramCache]: Analyzing trace with hash -956414408, now seen corresponding path program 1 times [2025-01-09 05:41:33,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:41:33,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306177196] [2025-01-09 05:41:33,741 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:41:33,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:41:33,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-01-09 05:41:33,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-01-09 05:41:33,759 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:41:33,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:41:34,814 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:41:34,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:41:34,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306177196] [2025-01-09 05:41:34,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306177196] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 05:41:34,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1058154262] [2025-01-09 05:41:34,814 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:41:34,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:41:34,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:41:34,816 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:41:34,818 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:41:34,868 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-01-09 05:41:34,895 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-01-09 05:41:34,895 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:41:34,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:41:34,897 INFO L256 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-01-09 05:41:34,901 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:41:35,135 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 05:41:35,135 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 05:41:35,265 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 05:41:35,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1058154262] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 05:41:35,266 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 05:41:35,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 6, 4] total 19 [2025-01-09 05:41:35,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921734368] [2025-01-09 05:41:35,266 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 05:41:35,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-01-09 05:41:35,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:41:35,267 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-01-09 05:41:35,267 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2025-01-09 05:41:35,267 INFO L87 Difference]: Start difference. First operand 1264 states and 2110 transitions. Second operand has 19 states, 19 states have (on average 8.736842105263158) internal successors, (166), 19 states have internal predecessors, (166), 0 states have call successors, (0), 0 states 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:41:36,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:41:36,773 INFO L93 Difference]: Finished difference Result 3665 states and 5284 transitions. [2025-01-09 05:41:36,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2025-01-09 05:41:36,774 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 8.736842105263158) internal successors, (166), 19 states have internal predecessors, (166), 0 states have call successors, (0), 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 61 [2025-01-09 05:41:36,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:41:36,781 INFO L225 Difference]: With dead ends: 3665 [2025-01-09 05:41:36,781 INFO L226 Difference]: Without dead ends: 3195 [2025-01-09 05:41:36,783 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 788 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=545, Invalid=2535, Unknown=0, NotChecked=0, Total=3080 [2025-01-09 05:41:36,783 INFO L435 NwaCegarLoop]: 1499 mSDtfsCounter, 15812 mSDsluCounter, 7739 mSDsCounter, 0 mSdLazyCounter, 759 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15812 SdHoareTripleChecker+Valid, 9238 SdHoareTripleChecker+Invalid, 805 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 759 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 05:41:36,784 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15812 Valid, 9238 Invalid, 805 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 759 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 05:41:36,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3195 states. [2025-01-09 05:41:36,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3195 to 3161. [2025-01-09 05:41:36,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3161 states, 3159 states have (on average 1.4102564102564104) internal successors, (4455), 3160 states have internal predecessors, (4455), 0 states have call successors, (0), 0 states 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:41:36,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3161 states to 3161 states and 4455 transitions. [2025-01-09 05:41:36,843 INFO L78 Accepts]: Start accepts. Automaton has 3161 states and 4455 transitions. Word has length 61 [2025-01-09 05:41:36,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:41:36,844 INFO L471 AbstractCegarLoop]: Abstraction has 3161 states and 4455 transitions. [2025-01-09 05:41:36,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 8.736842105263158) internal successors, (166), 19 states have internal predecessors, (166), 0 states have call successors, (0), 0 states 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:41:36,844 INFO L276 IsEmpty]: Start isEmpty. Operand 3161 states and 4455 transitions. [2025-01-09 05:41:36,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-01-09 05:41:36,845 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:41:36,845 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] [2025-01-09 05:41:36,852 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 05:41:37,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-01-09 05:41:37,046 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:41:37,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:41:37,046 INFO L85 PathProgramCache]: Analyzing trace with hash 434677662, now seen corresponding path program 1 times [2025-01-09 05:41:37,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:41:37,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656189834] [2025-01-09 05:41:37,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:41:37,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:41:37,053 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-01-09 05:41:37,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-01-09 05:41:37,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:41:37,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:41:37,315 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:41:37,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:41:37,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656189834] [2025-01-09 05:41:37,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656189834] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 05:41:37,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1630856317] [2025-01-09 05:41:37,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:41:37,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:41:37,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:41:37,317 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:41:37,319 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:41:37,368 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-01-09 05:41:37,399 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-01-09 05:41:37,399 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:41:37,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:41:37,400 INFO L256 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-09 05:41:37,402 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:41:37,734 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:41:37,734 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 05:41:38,247 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:41:38,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1630856317] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 05:41:38,248 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 05:41:38,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 22 [2025-01-09 05:41:38,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363345475] [2025-01-09 05:41:38,249 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 05:41:38,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-01-09 05:41:38,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:41:38,249 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-01-09 05:41:38,250 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=407, Unknown=0, NotChecked=0, Total=506 [2025-01-09 05:41:38,250 INFO L87 Difference]: Start difference. First operand 3161 states and 4455 transitions. Second operand has 23 states, 23 states have (on average 5.913043478260869) internal successors, (136), 22 states have internal predecessors, (136), 0 states have call successors, (0), 0 states 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:41:38,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:41:38,660 INFO L93 Difference]: Finished difference Result 7268 states and 9645 transitions. [2025-01-09 05:41:38,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 05:41:38,661 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 5.913043478260869) internal successors, (136), 22 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2025-01-09 05:41:38,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:41:38,675 INFO L225 Difference]: With dead ends: 7268 [2025-01-09 05:41:38,675 INFO L226 Difference]: Without dead ends: 5309 [2025-01-09 05:41:38,679 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=269, Invalid=787, Unknown=0, NotChecked=0, Total=1056 [2025-01-09 05:41:38,680 INFO L435 NwaCegarLoop]: 1497 mSDtfsCounter, 8959 mSDsluCounter, 6123 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8959 SdHoareTripleChecker+Valid, 7620 SdHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 05:41:38,680 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8959 Valid, 7620 Invalid, 320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 05:41:38,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5309 states. [2025-01-09 05:41:38,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5309 to 5243. [2025-01-09 05:41:38,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5243 states, 5241 states have (on average 1.3325701202060676) internal successors, (6984), 5242 states have internal predecessors, (6984), 0 states have call successors, (0), 0 states 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:41:38,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5243 states to 5243 states and 6984 transitions. [2025-01-09 05:41:38,782 INFO L78 Accepts]: Start accepts. Automaton has 5243 states and 6984 transitions. Word has length 62 [2025-01-09 05:41:38,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:41:38,782 INFO L471 AbstractCegarLoop]: Abstraction has 5243 states and 6984 transitions. [2025-01-09 05:41:38,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 5.913043478260869) internal successors, (136), 22 states have internal predecessors, (136), 0 states have call successors, (0), 0 states 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:41:38,782 INFO L276 IsEmpty]: Start isEmpty. Operand 5243 states and 6984 transitions. [2025-01-09 05:41:38,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-01-09 05:41:38,783 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:41:38,783 INFO L218 NwaCegarLoop]: trace histogram [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:41:38,790 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:41:38,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-01-09 05:41:38,984 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:41:38,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:41:38,985 INFO L85 PathProgramCache]: Analyzing trace with hash 854854928, now seen corresponding path program 1 times [2025-01-09 05:41:38,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:41:38,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556332172] [2025-01-09 05:41:38,985 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:41:38,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:41:38,992 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-01-09 05:41:39,005 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-01-09 05:41:39,006 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:41:39,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:41:39,194 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:41:39,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:41:39,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556332172] [2025-01-09 05:41:39,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556332172] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 05:41:39,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [402760861] [2025-01-09 05:41:39,195 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:41:39,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:41:39,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:41:39,199 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:41:39,201 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:41:39,250 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-01-09 05:41:39,276 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-01-09 05:41:39,276 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:41:39,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:41:39,277 INFO L256 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-01-09 05:41:39,278 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:41:39,560 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:41:39,560 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 05:41:40,003 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:41:40,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [402760861] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 05:41:40,003 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 05:41:40,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 22 [2025-01-09 05:41:40,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617514953] [2025-01-09 05:41:40,004 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 05:41:40,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-01-09 05:41:40,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:41:40,004 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-01-09 05:41:40,005 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=402, Unknown=0, NotChecked=0, Total=506 [2025-01-09 05:41:40,005 INFO L87 Difference]: Start difference. First operand 5243 states and 6984 transitions. Second operand has 23 states, 23 states have (on average 6.260869565217392) internal successors, (144), 22 states have internal predecessors, (144), 0 states have call successors, (0), 0 states 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:41:40,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:41:40,434 INFO L93 Difference]: Finished difference Result 8193 states and 10708 transitions. [2025-01-09 05:41:40,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 05:41:40,435 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 6.260869565217392) internal successors, (144), 22 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2025-01-09 05:41:40,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:41:40,446 INFO L225 Difference]: With dead ends: 8193 [2025-01-09 05:41:40,447 INFO L226 Difference]: Without dead ends: 5399 [2025-01-09 05:41:40,450 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=278, Invalid=844, Unknown=0, NotChecked=0, Total=1122 [2025-01-09 05:41:40,451 INFO L435 NwaCegarLoop]: 1493 mSDtfsCounter, 12191 mSDsluCounter, 4716 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12191 SdHoareTripleChecker+Valid, 6209 SdHoareTripleChecker+Invalid, 392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 05:41:40,451 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12191 Valid, 6209 Invalid, 392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 379 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 05:41:40,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5399 states. [2025-01-09 05:41:40,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5399 to 5047. [2025-01-09 05:41:40,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5047 states, 5045 states have (on average 1.3286422200198216) internal successors, (6703), 5046 states have internal predecessors, (6703), 0 states have call successors, (0), 0 states 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:41:40,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5047 states to 5047 states and 6703 transitions. [2025-01-09 05:41:40,567 INFO L78 Accepts]: Start accepts. Automaton has 5047 states and 6703 transitions. Word has length 62 [2025-01-09 05:41:40,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:41:40,567 INFO L471 AbstractCegarLoop]: Abstraction has 5047 states and 6703 transitions. [2025-01-09 05:41:40,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 6.260869565217392) internal successors, (144), 22 states have internal predecessors, (144), 0 states have call successors, (0), 0 states 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:41:40,567 INFO L276 IsEmpty]: Start isEmpty. Operand 5047 states and 6703 transitions. [2025-01-09 05:41:40,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-01-09 05:41:40,568 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:41:40,568 INFO L218 NwaCegarLoop]: trace histogram [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:41:40,577 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:41:40,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:41:40,773 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:41:40,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:41:40,773 INFO L85 PathProgramCache]: Analyzing trace with hash -1959005424, now seen corresponding path program 1 times [2025-01-09 05:41:40,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:41:40,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939626439] [2025-01-09 05:41:40,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:41:40,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:41:40,781 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-01-09 05:41:40,791 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-01-09 05:41:40,791 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:41:40,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:41:41,089 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:41:41,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:41:41,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939626439] [2025-01-09 05:41:41,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939626439] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 05:41:41,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1008839102] [2025-01-09 05:41:41,090 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:41:41,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:41:41,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:41:41,096 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:41:41,097 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:41:41,146 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-01-09 05:41:41,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-01-09 05:41:41,174 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:41:41,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:41:41,178 INFO L256 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-09 05:41:41,179 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:41:41,554 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:41:41,554 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 05:41:42,102 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:41:42,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1008839102] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 05:41:42,103 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 05:41:42,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 21 [2025-01-09 05:41:42,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083313882] [2025-01-09 05:41:42,103 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 05:41:42,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-01-09 05:41:42,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:41:42,104 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-01-09 05:41:42,104 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=386, Unknown=0, NotChecked=0, Total=462 [2025-01-09 05:41:42,104 INFO L87 Difference]: Start difference. First operand 5047 states and 6703 transitions. Second operand has 22 states, 22 states have (on average 6.0) internal successors, (132), 21 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:41:42,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:41:42,458 INFO L93 Difference]: Finished difference Result 9850 states and 12655 transitions. [2025-01-09 05:41:42,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 05:41:42,458 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 6.0) internal successors, (132), 21 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2025-01-09 05:41:42,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:41:42,469 INFO L225 Difference]: With dead ends: 9850 [2025-01-09 05:41:42,469 INFO L226 Difference]: Without dead ends: 6212 [2025-01-09 05:41:42,474 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=205, Invalid=665, Unknown=0, NotChecked=0, Total=870 [2025-01-09 05:41:42,474 INFO L435 NwaCegarLoop]: 1496 mSDtfsCounter, 18143 mSDsluCounter, 4722 mSDsCounter, 0 mSdLazyCounter, 305 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18143 SdHoareTripleChecker+Valid, 6218 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 05:41:42,475 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18143 Valid, 6218 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 305 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 05:41:42,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6212 states. [2025-01-09 05:41:42,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6212 to 6208. [2025-01-09 05:41:42,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6208 states, 6206 states have (on average 1.309055752497583) internal successors, (8124), 6207 states have internal predecessors, (8124), 0 states have call successors, (0), 0 states 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:41:42,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6208 states to 6208 states and 8124 transitions. [2025-01-09 05:41:42,583 INFO L78 Accepts]: Start accepts. Automaton has 6208 states and 8124 transitions. Word has length 62 [2025-01-09 05:41:42,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:41:42,584 INFO L471 AbstractCegarLoop]: Abstraction has 6208 states and 8124 transitions. [2025-01-09 05:41:42,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 6.0) internal successors, (132), 21 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:41:42,584 INFO L276 IsEmpty]: Start isEmpty. Operand 6208 states and 8124 transitions. [2025-01-09 05:41:42,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-01-09 05:41:42,585 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:41:42,585 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 05:41:42,593 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-09 05:41:42,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:41:42,790 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:41:42,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:41:42,792 INFO L85 PathProgramCache]: Analyzing trace with hash 1716111546, now seen corresponding path program 1 times [2025-01-09 05:41:42,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:41:42,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295825716] [2025-01-09 05:41:42,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:41:42,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:41:42,800 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-01-09 05:41:42,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-01-09 05:41:42,830 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:41:42,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:41:43,961 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:41:43,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:41:43,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295825716] [2025-01-09 05:41:43,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295825716] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 05:41:43,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [908528181] [2025-01-09 05:41:43,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:41:43,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:41:43,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:41:43,967 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:41:43,968 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:41:44,031 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-01-09 05:41:44,165 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-01-09 05:41:44,165 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:41:44,165 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:41:44,170 INFO L256 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-01-09 05:41:44,172 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:41:44,883 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:41:44,883 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 05:41:45,650 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:41:45,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [908528181] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 05:41:45,650 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 05:41:45,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13, 13] total 40 [2025-01-09 05:41:45,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469937407] [2025-01-09 05:41:45,650 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 05:41:45,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-01-09 05:41:45,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:41:45,651 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-01-09 05:41:45,651 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=1431, Unknown=0, NotChecked=0, Total=1560 [2025-01-09 05:41:45,652 INFO L87 Difference]: Start difference. First operand 6208 states and 8124 transitions. Second operand has 40 states, 40 states have (on average 4.175) internal successors, (167), 40 states have internal predecessors, (167), 0 states have call successors, (0), 0 states 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:41:55,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:41:55,733 INFO L93 Difference]: Finished difference Result 16341 states and 20526 transitions. [2025-01-09 05:41:55,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2025-01-09 05:41:55,734 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 4.175) internal successors, (167), 40 states have internal predecessors, (167), 0 states have call successors, (0), 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 63 [2025-01-09 05:41:55,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:41:55,752 INFO L225 Difference]: With dead ends: 16341 [2025-01-09 05:41:55,752 INFO L226 Difference]: Without dead ends: 13097 [2025-01-09 05:41:55,759 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5998 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=3755, Invalid=14877, Unknown=0, NotChecked=0, Total=18632 [2025-01-09 05:41:55,760 INFO L435 NwaCegarLoop]: 1589 mSDtfsCounter, 16021 mSDsluCounter, 24304 mSDsCounter, 0 mSdLazyCounter, 2044 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16021 SdHoareTripleChecker+Valid, 25893 SdHoareTripleChecker+Invalid, 2130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 2044 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-01-09 05:41:55,760 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16021 Valid, 25893 Invalid, 2130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 2044 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-01-09 05:41:55,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13097 states. [2025-01-09 05:41:55,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13097 to 5833. [2025-01-09 05:41:55,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5833 states, 5831 states have (on average 1.3146973074944264) internal successors, (7666), 5832 states have internal predecessors, (7666), 0 states have call successors, (0), 0 states 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:41:55,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5833 states to 5833 states and 7666 transitions. [2025-01-09 05:41:55,964 INFO L78 Accepts]: Start accepts. Automaton has 5833 states and 7666 transitions. Word has length 63 [2025-01-09 05:41:55,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:41:55,964 INFO L471 AbstractCegarLoop]: Abstraction has 5833 states and 7666 transitions. [2025-01-09 05:41:55,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 4.175) internal successors, (167), 40 states have internal predecessors, (167), 0 states have call successors, (0), 0 states 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:41:55,964 INFO L276 IsEmpty]: Start isEmpty. Operand 5833 states and 7666 transitions. [2025-01-09 05:41:55,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-01-09 05:41:55,965 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:41:55,965 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:41:55,973 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:41:56,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:41:56,172 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:41:56,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:41:56,176 INFO L85 PathProgramCache]: Analyzing trace with hash 649665724, now seen corresponding path program 1 times [2025-01-09 05:41:56,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:41:56,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392269616] [2025-01-09 05:41:56,176 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:41:56,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:41:56,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-01-09 05:41:56,190 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-01-09 05:41:56,190 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:41:56,190 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:41:56,288 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:41:56,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:41:56,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392269616] [2025-01-09 05:41:56,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392269616] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:41:56,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:41:56,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:41:56,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403082379] [2025-01-09 05:41:56,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:41:56,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 05:41:56,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:41:56,289 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 05:41:56,289 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 05:41:56,289 INFO L87 Difference]: Start difference. First operand 5833 states and 7666 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states 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:42:02,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:42:02,044 INFO L93 Difference]: Finished difference Result 8088 states and 11975 transitions. [2025-01-09 05:42:02,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 05:42:02,045 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 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 63 [2025-01-09 05:42:02,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:42:02,059 INFO L225 Difference]: With dead ends: 8088 [2025-01-09 05:42:02,059 INFO L226 Difference]: Without dead ends: 7335 [2025-01-09 05:42:02,064 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:42:02,066 INFO L435 NwaCegarLoop]: 765 mSDtfsCounter, 2319 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 5518 mSolverCounterSat, 1100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2319 SdHoareTripleChecker+Valid, 783 SdHoareTripleChecker+Invalid, 6618 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1100 IncrementalHoareTripleChecker+Valid, 5518 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2025-01-09 05:42:02,066 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2319 Valid, 783 Invalid, 6618 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1100 Valid, 5518 Invalid, 0 Unknown, 0 Unchecked, 5.6s Time] [2025-01-09 05:42:02,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7335 states. [2025-01-09 05:42:02,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7335 to 7335. [2025-01-09 05:42:02,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7335 states, 7333 states have (on average 1.3353334242465567) internal successors, (9792), 7334 states have internal predecessors, (9792), 0 states have call successors, (0), 0 states 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:42:02,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7335 states to 7335 states and 9792 transitions. [2025-01-09 05:42:02,236 INFO L78 Accepts]: Start accepts. Automaton has 7335 states and 9792 transitions. Word has length 63 [2025-01-09 05:42:02,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:42:02,236 INFO L471 AbstractCegarLoop]: Abstraction has 7335 states and 9792 transitions. [2025-01-09 05:42:02,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states 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:42:02,236 INFO L276 IsEmpty]: Start isEmpty. Operand 7335 states and 9792 transitions. [2025-01-09 05:42:02,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-01-09 05:42:02,236 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:42:02,236 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] [2025-01-09 05:42:02,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 05:42:02,237 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:42:02,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:42:02,237 INFO L85 PathProgramCache]: Analyzing trace with hash 1653026510, now seen corresponding path program 1 times [2025-01-09 05:42:02,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:42:02,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123422530] [2025-01-09 05:42:02,237 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:42:02,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:42:02,243 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-01-09 05:42:02,255 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-01-09 05:42:02,255 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:42:02,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:42:03,146 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:42:03,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:42:03,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123422530] [2025-01-09 05:42:03,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123422530] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 05:42:03,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1415736923] [2025-01-09 05:42:03,147 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:42:03,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:42:03,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:42:03,153 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:42:03,154 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:42:03,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-01-09 05:42:03,234 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-01-09 05:42:03,235 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:42:03,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:42:03,238 INFO L256 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-01-09 05:42:03,240 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:42:03,703 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:42:03,704 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 05:42:04,711 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:42:04,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1415736923] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 05:42:04,711 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 05:42:04,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 12, 12] total 39 [2025-01-09 05:42:04,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734644407] [2025-01-09 05:42:04,711 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 05:42:04,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-01-09 05:42:04,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:42:04,712 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-01-09 05:42:04,712 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=1363, Unknown=0, NotChecked=0, Total=1482 [2025-01-09 05:42:04,712 INFO L87 Difference]: Start difference. First operand 7335 states and 9792 transitions. Second operand has 39 states, 39 states have (on average 4.153846153846154) internal successors, (162), 39 states have internal predecessors, (162), 0 states have call successors, (0), 0 states 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:42:10,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:42:10,635 INFO L93 Difference]: Finished difference Result 15433 states and 19782 transitions. [2025-01-09 05:42:10,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2025-01-09 05:42:10,636 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 4.153846153846154) internal successors, (162), 39 states have internal predecessors, (162), 0 states have call successors, (0), 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 64 [2025-01-09 05:42:10,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:42:10,670 INFO L225 Difference]: With dead ends: 15433 [2025-01-09 05:42:10,670 INFO L226 Difference]: Without dead ends: 12102 [2025-01-09 05:42:10,682 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2840 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=2447, Invalid=9543, Unknown=0, NotChecked=0, Total=11990 [2025-01-09 05:42:10,684 INFO L435 NwaCegarLoop]: 1539 mSDtfsCounter, 13412 mSDsluCounter, 23859 mSDsCounter, 0 mSdLazyCounter, 2015 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13412 SdHoareTripleChecker+Valid, 25398 SdHoareTripleChecker+Invalid, 2073 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 2015 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-09 05:42:10,684 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13412 Valid, 25398 Invalid, 2073 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 2015 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-09 05:42:10,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12102 states. [2025-01-09 05:42:10,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12102 to 5428. [2025-01-09 05:42:10,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5428 states, 5426 states have (on average 1.37467747880575) internal successors, (7459), 5427 states have internal predecessors, (7459), 0 states have call successors, (0), 0 states 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:42:10,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5428 states to 5428 states and 7459 transitions. [2025-01-09 05:42:10,999 INFO L78 Accepts]: Start accepts. Automaton has 5428 states and 7459 transitions. Word has length 64 [2025-01-09 05:42:10,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:42:10,999 INFO L471 AbstractCegarLoop]: Abstraction has 5428 states and 7459 transitions. [2025-01-09 05:42:10,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 4.153846153846154) internal successors, (162), 39 states have internal predecessors, (162), 0 states have call successors, (0), 0 states 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:42:10,999 INFO L276 IsEmpty]: Start isEmpty. Operand 5428 states and 7459 transitions. [2025-01-09 05:42:11,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-01-09 05:42:11,000 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:42:11,000 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] [2025-01-09 05:42:11,007 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:42:11,200 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,SelfDestructingSolverStorable21 [2025-01-09 05:42:11,201 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:42:11,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:42:11,201 INFO L85 PathProgramCache]: Analyzing trace with hash 1083522640, now seen corresponding path program 1 times [2025-01-09 05:42:11,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:42:11,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130668875] [2025-01-09 05:42:11,201 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:42:11,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:42:11,217 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-01-09 05:42:11,233 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-01-09 05:42:11,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:42:11,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:42:11,666 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:42:11,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:42:11,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130668875] [2025-01-09 05:42:11,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130668875] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 05:42:11,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [342823316] [2025-01-09 05:42:11,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:42:11,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:42:11,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:42:11,669 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:42:11,670 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:42:11,716 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-01-09 05:42:11,754 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-01-09 05:42:11,754 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:42:11,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:42:11,756 INFO L256 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-01-09 05:42:11,757 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:42:15,546 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:42:15,547 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 05:42:16,950 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:42:16,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [342823316] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 05:42:16,951 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 05:42:16,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 19, 16] total 40 [2025-01-09 05:42:16,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406708826] [2025-01-09 05:42:16,951 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 05:42:16,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-01-09 05:42:16,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:42:16,952 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-01-09 05:42:16,952 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=211, Invalid=1349, Unknown=0, NotChecked=0, Total=1560 [2025-01-09 05:42:16,952 INFO L87 Difference]: Start difference. First operand 5428 states and 7459 transitions. Second operand has 40 states, 40 states have (on average 4.225) internal successors, (169), 40 states have internal predecessors, (169), 0 states have call successors, (0), 0 states 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:42:23,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:42:23,551 INFO L93 Difference]: Finished difference Result 8529 states and 11340 transitions. [2025-01-09 05:42:23,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2025-01-09 05:42:23,552 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 4.225) internal successors, (169), 40 states have internal predecessors, (169), 0 states have call successors, (0), 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:42:23,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:42:23,561 INFO L225 Difference]: With dead ends: 8529 [2025-01-09 05:42:23,561 INFO L226 Difference]: Without dead ends: 6983 [2025-01-09 05:42:23,566 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1739 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=1356, Invalid=5450, Unknown=0, NotChecked=0, Total=6806 [2025-01-09 05:42:23,566 INFO L435 NwaCegarLoop]: 1484 mSDtfsCounter, 20409 mSDsluCounter, 22499 mSDsCounter, 0 mSdLazyCounter, 1056 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20409 SdHoareTripleChecker+Valid, 23983 SdHoareTripleChecker+Invalid, 1112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 1056 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-09 05:42:23,567 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20409 Valid, 23983 Invalid, 1112 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [56 Valid, 1056 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-09 05:42:23,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6983 states. [2025-01-09 05:42:23,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6983 to 5369. [2025-01-09 05:42:23,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5369 states, 5367 states have (on average 1.3810322340227315) internal successors, (7412), 5368 states have internal predecessors, (7412), 0 states have call successors, (0), 0 states 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:42:23,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5369 states to 5369 states and 7412 transitions. [2025-01-09 05:42:23,733 INFO L78 Accepts]: Start accepts. Automaton has 5369 states and 7412 transitions. Word has length 65 [2025-01-09 05:42:23,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:42:23,734 INFO L471 AbstractCegarLoop]: Abstraction has 5369 states and 7412 transitions. [2025-01-09 05:42:23,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 4.225) internal successors, (169), 40 states have internal predecessors, (169), 0 states have call successors, (0), 0 states 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:42:23,735 INFO L276 IsEmpty]: Start isEmpty. Operand 5369 states and 7412 transitions. [2025-01-09 05:42:23,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-01-09 05:42:23,736 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:42:23,736 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:23,751 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-01-09 05:42:23,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:42:23,937 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:42:23,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:42:23,937 INFO L85 PathProgramCache]: Analyzing trace with hash -1809894949, now seen corresponding path program 1 times [2025-01-09 05:42:23,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:42:23,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690918610] [2025-01-09 05:42:23,937 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:42:23,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:42:23,945 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-01-09 05:42:23,957 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-01-09 05:42:23,959 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:42:23,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:42:24,484 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 30 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:42:24,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:42:24,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690918610] [2025-01-09 05:42:24,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690918610] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 05:42:24,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1161205308] [2025-01-09 05:42:24,485 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:42:24,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:42:24,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:42:24,487 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:42:24,488 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:42:24,547 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-01-09 05:42:24,586 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-01-09 05:42:24,587 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:42:24,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:42:24,588 INFO L256 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-01-09 05:42:24,591 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:42:25,526 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 32 proven. 62 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:42:25,527 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 05:42:28,021 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 30 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:42:28,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1161205308] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 05:42:28,021 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 05:42:28,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 33 [2025-01-09 05:42:28,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459606428] [2025-01-09 05:42:28,021 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 05:42:28,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-01-09 05:42:28,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:42:28,022 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-01-09 05:42:28,022 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=943, Unknown=0, NotChecked=0, Total=1056 [2025-01-09 05:42:28,023 INFO L87 Difference]: Start difference. First operand 5369 states and 7412 transitions. Second operand has 33 states, 33 states have (on average 7.575757575757576) internal successors, (250), 33 states have internal predecessors, (250), 0 states have call successors, (0), 0 states 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:42:31,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:42:31,854 INFO L93 Difference]: Finished difference Result 14023 states and 18247 transitions. [2025-01-09 05:42:31,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2025-01-09 05:42:31,855 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 7.575757575757576) internal successors, (250), 33 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 104 [2025-01-09 05:42:31,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:42:31,867 INFO L225 Difference]: With dead ends: 14023 [2025-01-09 05:42:31,867 INFO L226 Difference]: Without dead ends: 11260 [2025-01-09 05:42:31,873 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 190 SyntacticMatches, 1 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2952 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=1986, Invalid=8726, Unknown=0, NotChecked=0, Total=10712 [2025-01-09 05:42:31,873 INFO L435 NwaCegarLoop]: 1595 mSDtfsCounter, 20157 mSDsluCounter, 8551 mSDsCounter, 0 mSdLazyCounter, 1824 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20157 SdHoareTripleChecker+Valid, 10146 SdHoareTripleChecker+Invalid, 1869 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 1824 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 05:42:31,873 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20157 Valid, 10146 Invalid, 1869 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 1824 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 05:42:31,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11260 states. [2025-01-09 05:42:32,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11260 to 6852. [2025-01-09 05:42:32,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6852 states, 6850 states have (on average 1.341897810218978) internal successors, (9192), 6851 states have internal predecessors, (9192), 0 states have call successors, (0), 0 states 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:42:32,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6852 states to 6852 states and 9192 transitions. [2025-01-09 05:42:32,166 INFO L78 Accepts]: Start accepts. Automaton has 6852 states and 9192 transitions. Word has length 104 [2025-01-09 05:42:32,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:42:32,167 INFO L471 AbstractCegarLoop]: Abstraction has 6852 states and 9192 transitions. [2025-01-09 05:42:32,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 7.575757575757576) internal successors, (250), 33 states have internal predecessors, (250), 0 states have call successors, (0), 0 states 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:42:32,167 INFO L276 IsEmpty]: Start isEmpty. Operand 6852 states and 9192 transitions. [2025-01-09 05:42:32,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-01-09 05:42:32,169 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:42:32,169 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:32,178 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:42:32,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:42:32,370 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:42:32,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:42:32,371 INFO L85 PathProgramCache]: Analyzing trace with hash -1389717683, now seen corresponding path program 1 times [2025-01-09 05:42:32,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:42:32,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889648769] [2025-01-09 05:42:32,372 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:42:32,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:42:32,388 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-01-09 05:42:32,407 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-01-09 05:42:32,408 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:42:32,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:42:33,543 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 16 proven. 73 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:42:33,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:42:33,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889648769] [2025-01-09 05:42:33,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889648769] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 05:42:33,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1539113476] [2025-01-09 05:42:33,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:42:33,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:42:33,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:42:33,548 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:42:33,550 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:42:33,608 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-01-09 05:42:33,661 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-01-09 05:42:33,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:42:33,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:42:33,663 INFO L256 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-01-09 05:42:33,665 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:42:34,246 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 18 proven. 71 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:42:34,246 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 05:42:35,469 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 16 proven. 73 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:42:35,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1539113476] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 05:42:35,470 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 05:42:35,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 11, 11] total 39 [2025-01-09 05:42:35,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11699970] [2025-01-09 05:42:35,470 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 05:42:35,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-01-09 05:42:35,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:42:35,471 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-01-09 05:42:35,472 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=1418, Unknown=0, NotChecked=0, Total=1560 [2025-01-09 05:42:35,472 INFO L87 Difference]: Start difference. First operand 6852 states and 9192 transitions. Second operand has 40 states, 40 states have (on average 6.4) internal successors, (256), 39 states have internal predecessors, (256), 0 states have call successors, (0), 0 states 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:42:39,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:42:39,244 INFO L93 Difference]: Finished difference Result 9715 states and 12740 transitions. [2025-01-09 05:42:39,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2025-01-09 05:42:39,245 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 6.4) internal successors, (256), 39 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 104 [2025-01-09 05:42:39,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:42:39,251 INFO L225 Difference]: With dead ends: 9715 [2025-01-09 05:42:39,252 INFO L226 Difference]: Without dead ends: 6937 [2025-01-09 05:42:39,255 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1890 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=1216, Invalid=6616, Unknown=0, NotChecked=0, Total=7832 [2025-01-09 05:42:39,255 INFO L435 NwaCegarLoop]: 1507 mSDtfsCounter, 31597 mSDsluCounter, 22811 mSDsCounter, 0 mSdLazyCounter, 1492 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31597 SdHoareTripleChecker+Valid, 24318 SdHoareTripleChecker+Invalid, 1560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 1492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 05:42:39,256 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31597 Valid, 24318 Invalid, 1560 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [68 Valid, 1492 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 05:42:39,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6937 states. [2025-01-09 05:42:39,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6937 to 6780. [2025-01-09 05:42:39,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6780 states, 6778 states have (on average 1.335792269105931) internal successors, (9054), 6779 states have internal predecessors, (9054), 0 states have call successors, (0), 0 states 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:42:39,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6780 states to 6780 states and 9054 transitions. [2025-01-09 05:42:39,518 INFO L78 Accepts]: Start accepts. Automaton has 6780 states and 9054 transitions. Word has length 104 [2025-01-09 05:42:39,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:42:39,520 INFO L471 AbstractCegarLoop]: Abstraction has 6780 states and 9054 transitions. [2025-01-09 05:42:39,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 6.4) internal successors, (256), 39 states have internal predecessors, (256), 0 states have call successors, (0), 0 states 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:42:39,520 INFO L276 IsEmpty]: Start isEmpty. Operand 6780 states and 9054 transitions. [2025-01-09 05:42:39,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-01-09 05:42:39,522 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:42:39,522 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:39,530 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-01-09 05:42:39,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:42:39,723 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:42:39,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:42:39,723 INFO L85 PathProgramCache]: Analyzing trace with hash 91389261, now seen corresponding path program 1 times [2025-01-09 05:42:39,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:42:39,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649280507] [2025-01-09 05:42:39,724 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:42:39,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:42:39,735 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-01-09 05:42:39,750 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-01-09 05:42:39,750 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:42:39,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:42:40,202 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 34 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:42:40,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:42:40,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649280507] [2025-01-09 05:42:40,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649280507] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 05:42:40,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1225911280] [2025-01-09 05:42:40,203 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:42:40,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:42:40,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:42:40,205 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:42:40,206 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:42:40,264 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-01-09 05:42:40,299 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-01-09 05:42:40,299 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:42:40,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:42:40,300 INFO L256 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-01-09 05:42:40,302 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:42:40,791 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 38 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:42:40,791 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 05:42:42,146 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 34 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:42:42,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1225911280] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 05:42:42,147 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 05:42:42,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11, 11] total 30 [2025-01-09 05:42:42,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127987845] [2025-01-09 05:42:42,147 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 05:42:42,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-01-09 05:42:42,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:42:42,148 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-01-09 05:42:42,148 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=810, Unknown=0, NotChecked=0, Total=930 [2025-01-09 05:42:42,149 INFO L87 Difference]: Start difference. First operand 6780 states and 9054 transitions. Second operand has 31 states, 31 states have (on average 7.870967741935484) internal successors, (244), 30 states have internal predecessors, (244), 0 states have call successors, (0), 0 states 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:42:43,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:42:43,286 INFO L93 Difference]: Finished difference Result 9638 states and 12545 transitions. [2025-01-09 05:42:43,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-01-09 05:42:43,287 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 7.870967741935484) internal successors, (244), 30 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 104 [2025-01-09 05:42:43,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:42:43,294 INFO L225 Difference]: With dead ends: 9638 [2025-01-09 05:42:43,294 INFO L226 Difference]: Without dead ends: 6272 [2025-01-09 05:42:43,297 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 193 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 588 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=667, Invalid=2413, Unknown=0, NotChecked=0, Total=3080 [2025-01-09 05:42:43,298 INFO L435 NwaCegarLoop]: 1522 mSDtfsCounter, 21009 mSDsluCounter, 10755 mSDsCounter, 0 mSdLazyCounter, 672 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21009 SdHoareTripleChecker+Valid, 12277 SdHoareTripleChecker+Invalid, 705 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 672 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 05:42:43,299 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21009 Valid, 12277 Invalid, 705 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 672 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 05:42:43,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6272 states. [2025-01-09 05:42:43,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6272 to 6234. [2025-01-09 05:42:43,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6234 states, 6232 states have (on average 1.339216944801027) internal successors, (8346), 6233 states have internal predecessors, (8346), 0 states have call successors, (0), 0 states 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:42:43,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6234 states to 6234 states and 8346 transitions. [2025-01-09 05:42:43,505 INFO L78 Accepts]: Start accepts. Automaton has 6234 states and 8346 transitions. Word has length 104 [2025-01-09 05:42:43,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:42:43,505 INFO L471 AbstractCegarLoop]: Abstraction has 6234 states and 8346 transitions. [2025-01-09 05:42:43,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 7.870967741935484) internal successors, (244), 30 states have internal predecessors, (244), 0 states have call successors, (0), 0 states 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:42:43,506 INFO L276 IsEmpty]: Start isEmpty. Operand 6234 states and 8346 transitions. [2025-01-09 05:42:43,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-01-09 05:42:43,507 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:42:43,507 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 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:42:43,514 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-01-09 05:42:43,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-01-09 05:42:43,708 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:42:43,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:42:43,708 INFO L85 PathProgramCache]: Analyzing trace with hash -1482130915, now seen corresponding path program 1 times [2025-01-09 05:42:43,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:42:43,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271294691] [2025-01-09 05:42:43,708 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:42:43,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:42:43,718 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-01-09 05:42:43,738 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-01-09 05:42:43,738 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:42:43,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:42:44,425 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 26 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:42:44,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:42:44,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271294691] [2025-01-09 05:42:44,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271294691] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 05:42:44,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1643090487] [2025-01-09 05:42:44,426 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:42:44,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:42:44,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:42:44,429 INFO L229 MonitoredProcess]: Starting monitored process 12 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:42:44,432 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-01-09 05:42:44,507 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-01-09 05:42:44,559 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-01-09 05:42:44,559 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:42:44,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:42:44,567 INFO L256 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 49 conjuncts are in the unsatisfiable core [2025-01-09 05:42:44,570 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:42:46,998 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 16 proven. 74 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:42:46,998 INFO L312 TraceCheckSpWp]: Computing backward predicates...