./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.4.1.ufo.BOUNDED-8.pals+Problem12_label09.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/pals_lcr.4.1.ufo.BOUNDED-8.pals+Problem12_label09.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 52f0467b9e67537a0ac20514e4a1726e96ded28a47950e156d374c001df2ce1c --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 05:45:08,601 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 05:45:08,653 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:45:08,660 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 05:45:08,660 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 05:45:08,679 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 05:45:08,679 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 05:45:08,680 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 05:45:08,680 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 05:45:08,680 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 05:45:08,681 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 05:45:08,681 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 05:45:08,681 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 05:45:08,681 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 05:45:08,682 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 05:45:08,682 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 05:45:08,682 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 05:45:08,682 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 05:45:08,682 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 05:45:08,682 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 05:45:08,682 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 05:45:08,683 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 05:45:08,683 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 05:45:08,683 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 05:45:08,683 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 05:45:08,683 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 05:45:08,683 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 05:45:08,683 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 05:45:08,683 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 05:45:08,683 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 05:45:08,683 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 05:45:08,684 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 05:45:08,684 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:45:08,684 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 05:45:08,684 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 05:45:08,684 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 05:45:08,684 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 05:45:08,684 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:45:08,684 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 05:45:08,684 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 05:45:08,684 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 05:45:08,684 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 05:45:08,685 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 05:45:08,685 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 05:45:08,685 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 05:45:08,685 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 05:45:08,685 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 05:45:08,685 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 05:45:08,685 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 -> 52f0467b9e67537a0ac20514e4a1726e96ded28a47950e156d374c001df2ce1c [2025-01-09 05:45:08,919 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 05:45:08,928 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 05:45:08,930 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 05:45:08,931 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 05:45:08,931 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 05:45:08,932 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.4.1.ufo.BOUNDED-8.pals+Problem12_label09.c [2025-01-09 05:45:10,186 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/14f1b0d64/e127c07817c24817899f819ba76ab392/FLAG172cb905a [2025-01-09 05:45:10,684 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 05:45:10,685 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.4.1.ufo.BOUNDED-8.pals+Problem12_label09.c [2025-01-09 05:45:10,716 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/14f1b0d64/e127c07817c24817899f819ba76ab392/FLAG172cb905a [2025-01-09 05:45:10,749 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/14f1b0d64/e127c07817c24817899f819ba76ab392 [2025-01-09 05:45:10,752 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 05:45:10,754 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 05:45:10,754 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 05:45:10,754 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 05:45:10,759 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 05:45:10,759 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 05:45:10" (1/1) ... [2025-01-09 05:45:10,760 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70ffc96a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:45:10, skipping insertion in model container [2025-01-09 05:45:10,760 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 05:45:10" (1/1) ... [2025-01-09 05:45:10,840 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 05:45:11,138 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.4.1.ufo.BOUNDED-8.pals+Problem12_label09.c[8653,8666] [2025-01-09 05:45:11,195 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.4.1.ufo.BOUNDED-8.pals+Problem12_label09.c[16401,16414] [2025-01-09 05:45:11,677 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 05:45:11,686 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 05:45:11,706 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.4.1.ufo.BOUNDED-8.pals+Problem12_label09.c[8653,8666] [2025-01-09 05:45:11,713 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.4.1.ufo.BOUNDED-8.pals+Problem12_label09.c[16401,16414] [2025-01-09 05:45:11,963 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 05:45:11,984 INFO L204 MainTranslator]: Completed translation [2025-01-09 05:45:11,985 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:45:11 WrapperNode [2025-01-09 05:45:11,986 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 05:45:11,986 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 05:45:11,986 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 05:45:11,986 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 05:45:11,992 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:45:11" (1/1) ... [2025-01-09 05:45:12,034 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:45:11" (1/1) ... [2025-01-09 05:45:12,373 INFO L138 Inliner]: procedures = 34, calls = 20, calls flagged for inlining = 15, calls inlined = 15, statements flattened = 5034 [2025-01-09 05:45:12,373 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 05:45:12,378 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 05:45:12,378 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 05:45:12,378 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 05:45:12,392 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:45:11" (1/1) ... [2025-01-09 05:45:12,396 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:45:11" (1/1) ... [2025-01-09 05:45:12,452 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:45:11" (1/1) ... [2025-01-09 05:45:12,577 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:45:12,577 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:45:11" (1/1) ... [2025-01-09 05:45:12,578 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:45:11" (1/1) ... [2025-01-09 05:45:12,745 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:45:11" (1/1) ... [2025-01-09 05:45:12,773 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:45:11" (1/1) ... [2025-01-09 05:45:12,792 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:45:11" (1/1) ... [2025-01-09 05:45:12,817 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:45:11" (1/1) ... [2025-01-09 05:45:12,834 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:45:11" (1/1) ... [2025-01-09 05:45:12,886 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 05:45:12,888 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 05:45:12,888 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 05:45:12,888 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 05:45:12,889 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:45:11" (1/1) ... [2025-01-09 05:45:12,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:45:12,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:45:12,922 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:45:12,930 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:45:12,950 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 05:45:12,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 05:45:12,950 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 05:45:12,951 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 05:45:13,038 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 05:45:13,040 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 05:45:16,715 INFO L? ?]: Removed 737 outVars from TransFormulas that were not future-live. [2025-01-09 05:45:16,716 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 05:45:16,740 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 05:45:16,741 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 05:45:16,741 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 05:45:16 BoogieIcfgContainer [2025-01-09 05:45:16,741 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 05:45:16,743 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 05:45:16,743 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 05:45:16,746 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 05:45:16,747 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 05:45:10" (1/3) ... [2025-01-09 05:45:16,747 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27a2d60f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 05:45:16, skipping insertion in model container [2025-01-09 05:45:16,747 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:45:11" (2/3) ... [2025-01-09 05:45:16,747 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27a2d60f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 05:45:16, skipping insertion in model container [2025-01-09 05:45:16,748 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 05:45:16" (3/3) ... [2025-01-09 05:45:16,748 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.4.1.ufo.BOUNDED-8.pals+Problem12_label09.c [2025-01-09 05:45:16,762 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 05:45:16,764 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.4.1.ufo.BOUNDED-8.pals+Problem12_label09.c that has 1 procedures, 884 locations, 1 initial locations, 2 loop locations, and 2 error locations. [2025-01-09 05:45:16,840 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 05:45:16,848 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;@27c83743, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 05:45:16,848 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-01-09 05:45:16,855 INFO L276 IsEmpty]: Start isEmpty. Operand has 884 states, 881 states have (on average 1.9046538024971622) internal successors, (1678), 883 states have internal predecessors, (1678), 0 states have call successors, (0), 0 states have 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:45:16,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-01-09 05:45:16,860 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:45:16,860 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:45:16,861 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:45:16,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:45:16,865 INFO L85 PathProgramCache]: Analyzing trace with hash 1605999950, now seen corresponding path program 1 times [2025-01-09 05:45:16,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:45:16,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852809966] [2025-01-09 05:45:16,873 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:45:16,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:45:16,928 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-09 05:45:16,960 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-09 05:45:16,961 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:45:16,961 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:45:17,036 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:45:17,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:45:17,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852809966] [2025-01-09 05:45:17,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852809966] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:45:17,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:45:17,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 05:45:17,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658840820] [2025-01-09 05:45:17,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:45:17,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 05:45:17,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:45:17,056 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 05:45:17,056 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 05:45:17,060 INFO L87 Difference]: Start difference. First operand has 884 states, 881 states have (on average 1.9046538024971622) internal successors, (1678), 883 states have internal predecessors, (1678), 0 states have call successors, (0), 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 11.0) internal successors, (22), 2 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:45:17,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:45:17,113 INFO L93 Difference]: Finished difference Result 1739 states and 3302 transitions. [2025-01-09 05:45:17,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 05:45:17,114 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-01-09 05:45:17,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:45:17,123 INFO L225 Difference]: With dead ends: 1739 [2025-01-09 05:45:17,124 INFO L226 Difference]: Without dead ends: 819 [2025-01-09 05:45:17,127 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:45:17,132 INFO L435 NwaCegarLoop]: 1614 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, 1614 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:45:17,132 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1614 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:45:17,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 819 states. [2025-01-09 05:45:17,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 819 to 819. [2025-01-09 05:45:17,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 819 states, 817 states have (on average 1.894736842105263) internal successors, (1548), 818 states have internal predecessors, (1548), 0 states have call successors, (0), 0 states have 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:45:17,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819 states to 819 states and 1548 transitions. [2025-01-09 05:45:17,200 INFO L78 Accepts]: Start accepts. Automaton has 819 states and 1548 transitions. Word has length 22 [2025-01-09 05:45:17,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:45:17,200 INFO L471 AbstractCegarLoop]: Abstraction has 819 states and 1548 transitions. [2025-01-09 05:45:17,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:45:17,201 INFO L276 IsEmpty]: Start isEmpty. Operand 819 states and 1548 transitions. [2025-01-09 05:45:17,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-01-09 05:45:17,201 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:45:17,201 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:45:17,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 05:45:17,202 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:45:17,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:45:17,202 INFO L85 PathProgramCache]: Analyzing trace with hash 584931596, now seen corresponding path program 1 times [2025-01-09 05:45:17,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:45:17,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617530120] [2025-01-09 05:45:17,203 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:45:17,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:45:17,240 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-09 05:45:17,256 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-09 05:45:17,256 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:45:17,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:45:17,400 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:45:17,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:45:17,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617530120] [2025-01-09 05:45:17,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617530120] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:45:17,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:45:17,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 05:45:17,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139942224] [2025-01-09 05:45:17,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:45:17,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 05:45:17,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:45:17,403 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 05:45:17,403 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 05:45:17,404 INFO L87 Difference]: Start difference. First operand 819 states and 1548 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:45:17,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:45:17,491 INFO L93 Difference]: Finished difference Result 895 states and 1666 transitions. [2025-01-09 05:45:17,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 05:45:17,491 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-01-09 05:45:17,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:45:17,494 INFO L225 Difference]: With dead ends: 895 [2025-01-09 05:45:17,494 INFO L226 Difference]: Without dead ends: 855 [2025-01-09 05:45:17,497 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:45:17,497 INFO L435 NwaCegarLoop]: 1544 mSDtfsCounter, 56 mSDsluCounter, 4603 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 6147 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:45:17,498 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 6147 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:45:17,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 855 states. [2025-01-09 05:45:17,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 855 to 819. [2025-01-09 05:45:17,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 819 states, 817 states have (on average 1.8665850673194615) internal successors, (1525), 818 states have internal predecessors, (1525), 0 states have call successors, (0), 0 states have 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:45:17,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819 states to 819 states and 1525 transitions. [2025-01-09 05:45:17,522 INFO L78 Accepts]: Start accepts. Automaton has 819 states and 1525 transitions. Word has length 22 [2025-01-09 05:45:17,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:45:17,522 INFO L471 AbstractCegarLoop]: Abstraction has 819 states and 1525 transitions. [2025-01-09 05:45:17,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:45:17,523 INFO L276 IsEmpty]: Start isEmpty. Operand 819 states and 1525 transitions. [2025-01-09 05:45:17,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-01-09 05:45:17,525 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:45:17,525 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:45:17,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 05:45:17,525 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:45:17,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:45:17,526 INFO L85 PathProgramCache]: Analyzing trace with hash 1015331463, now seen corresponding path program 1 times [2025-01-09 05:45:17,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:45:17,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208180772] [2025-01-09 05:45:17,526 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:45:17,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:45:17,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-01-09 05:45:17,557 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-01-09 05:45:17,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:45:17,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:45:17,691 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:45:17,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:45:17,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208180772] [2025-01-09 05:45:17,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208180772] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:45:17,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:45:17,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:45:17,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684557149] [2025-01-09 05:45:17,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:45:17,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:45:17,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:45:17,694 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:45:17,694 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:45:17,695 INFO L87 Difference]: Start difference. First operand 819 states and 1525 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:45:17,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:45:17,838 INFO L93 Difference]: Finished difference Result 1107 states and 1981 transitions. [2025-01-09 05:45:17,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:45:17,838 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2025-01-09 05:45:17,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:45:17,842 INFO L225 Difference]: With dead ends: 1107 [2025-01-09 05:45:17,842 INFO L226 Difference]: Without dead ends: 1071 [2025-01-09 05:45:17,843 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-01-09 05:45:17,843 INFO L435 NwaCegarLoop]: 1521 mSDtfsCounter, 6217 mSDsluCounter, 788 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6217 SdHoareTripleChecker+Valid, 2309 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 05:45:17,844 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6217 Valid, 2309 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 05:45:17,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1071 states. [2025-01-09 05:45:17,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1071 to 853. [2025-01-09 05:45:17,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 853 states, 851 states have (on average 1.8554641598119859) internal successors, (1579), 852 states have internal predecessors, (1579), 0 states have call successors, (0), 0 states have 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:45:17,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 853 states to 853 states and 1579 transitions. [2025-01-09 05:45:17,865 INFO L78 Accepts]: Start accepts. Automaton has 853 states and 1579 transitions. Word has length 44 [2025-01-09 05:45:17,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:45:17,865 INFO L471 AbstractCegarLoop]: Abstraction has 853 states and 1579 transitions. [2025-01-09 05:45:17,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:45:17,865 INFO L276 IsEmpty]: Start isEmpty. Operand 853 states and 1579 transitions. [2025-01-09 05:45:17,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-01-09 05:45:17,868 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:45:17,868 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:45:17,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 05:45:17,869 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:45:17,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:45:17,870 INFO L85 PathProgramCache]: Analyzing trace with hash -639739561, now seen corresponding path program 1 times [2025-01-09 05:45:17,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:45:17,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159977777] [2025-01-09 05:45:17,870 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:45:17,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:45:17,878 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-01-09 05:45:17,889 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-01-09 05:45:17,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:45:17,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:45:17,961 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:45:17,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:45:17,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159977777] [2025-01-09 05:45:17,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159977777] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:45:17,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:45:17,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:45:17,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850534570] [2025-01-09 05:45:17,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:45:17,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:45:17,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:45:17,963 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:45:17,963 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:45:17,963 INFO L87 Difference]: Start difference. First operand 853 states and 1579 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:45:17,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:45:17,988 INFO L93 Difference]: Finished difference Result 982 states and 1782 transitions. [2025-01-09 05:45:17,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:45:17,988 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2025-01-09 05:45:17,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:45:17,993 INFO L225 Difference]: With dead ends: 982 [2025-01-09 05:45:17,993 INFO L226 Difference]: Without dead ends: 912 [2025-01-09 05:45:17,994 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:45:17,995 INFO L435 NwaCegarLoop]: 1523 mSDtfsCounter, 1474 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1474 SdHoareTripleChecker+Valid, 1575 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:45:17,996 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1474 Valid, 1575 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:45:17,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 912 states. [2025-01-09 05:45:18,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 912 to 910. [2025-01-09 05:45:18,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 910 states, 908 states have (on average 1.8359030837004404) internal successors, (1667), 909 states have internal predecessors, (1667), 0 states have call successors, (0), 0 states have 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:45:18,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 910 states to 910 states and 1667 transitions. [2025-01-09 05:45:18,018 INFO L78 Accepts]: Start accepts. Automaton has 910 states and 1667 transitions. Word has length 46 [2025-01-09 05:45:18,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:45:18,019 INFO L471 AbstractCegarLoop]: Abstraction has 910 states and 1667 transitions. [2025-01-09 05:45:18,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:45:18,019 INFO L276 IsEmpty]: Start isEmpty. Operand 910 states and 1667 transitions. [2025-01-09 05:45:18,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-01-09 05:45:18,019 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:45:18,020 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:45:18,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 05:45:18,020 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:45:18,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:45:18,020 INFO L85 PathProgramCache]: Analyzing trace with hash -573246049, now seen corresponding path program 1 times [2025-01-09 05:45:18,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:45:18,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595115908] [2025-01-09 05:45:18,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:45:18,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:45:18,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-01-09 05:45:18,033 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-01-09 05:45:18,033 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:45:18,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:45:18,226 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:45:18,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:45:18,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595115908] [2025-01-09 05:45:18,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595115908] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:45:18,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:45:18,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:45:18,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078393332] [2025-01-09 05:45:18,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:45:18,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:45:18,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:45:18,228 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:45:18,228 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:45:18,229 INFO L87 Difference]: Start difference. First operand 910 states and 1667 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:45:18,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:45:18,330 INFO L93 Difference]: Finished difference Result 1039 states and 1867 transitions. [2025-01-09 05:45:18,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 05:45:18,330 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2025-01-09 05:45:18,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:45:18,335 INFO L225 Difference]: With dead ends: 1039 [2025-01-09 05:45:18,335 INFO L226 Difference]: Without dead ends: 912 [2025-01-09 05:45:18,336 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2025-01-09 05:45:18,337 INFO L435 NwaCegarLoop]: 1519 mSDtfsCounter, 4446 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4446 SdHoareTripleChecker+Valid, 1678 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:45:18,337 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4446 Valid, 1678 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:45:18,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 912 states. [2025-01-09 05:45:18,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 912 to 910. [2025-01-09 05:45:18,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 910 states, 908 states have (on average 1.8337004405286343) internal successors, (1665), 909 states have internal predecessors, (1665), 0 states have call successors, (0), 0 states have 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:45:18,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 910 states to 910 states and 1665 transitions. [2025-01-09 05:45:18,354 INFO L78 Accepts]: Start accepts. Automaton has 910 states and 1665 transitions. Word has length 46 [2025-01-09 05:45:18,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:45:18,355 INFO L471 AbstractCegarLoop]: Abstraction has 910 states and 1665 transitions. [2025-01-09 05:45:18,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:45:18,355 INFO L276 IsEmpty]: Start isEmpty. Operand 910 states and 1665 transitions. [2025-01-09 05:45:18,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-01-09 05:45:18,355 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:45:18,355 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:45:18,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 05:45:18,356 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:45:18,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:45:18,356 INFO L85 PathProgramCache]: Analyzing trace with hash -1005481493, now seen corresponding path program 1 times [2025-01-09 05:45:18,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:45:18,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145714680] [2025-01-09 05:45:18,356 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:45:18,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:45:18,362 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-01-09 05:45:18,371 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-01-09 05:45:18,371 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:45:18,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:45:18,522 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:45:18,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:45:18,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145714680] [2025-01-09 05:45:18,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145714680] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:45:18,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:45:18,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 05:45:18,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64243064] [2025-01-09 05:45:18,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:45:18,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 05:45:18,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:45:18,524 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 05:45:18,524 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 05:45:18,524 INFO L87 Difference]: Start difference. First operand 910 states and 1665 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:45:18,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:45:18,553 INFO L93 Difference]: Finished difference Result 918 states and 1674 transitions. [2025-01-09 05:45:18,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 05:45:18,553 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2025-01-09 05:45:18,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:45:18,556 INFO L225 Difference]: With dead ends: 918 [2025-01-09 05:45:18,556 INFO L226 Difference]: Without dead ends: 916 [2025-01-09 05:45:18,557 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:45:18,558 INFO L435 NwaCegarLoop]: 1522 mSDtfsCounter, 0 mSDsluCounter, 4557 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6079 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:45:18,558 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6079 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:45:18,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 916 states. [2025-01-09 05:45:18,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 916 to 916. [2025-01-09 05:45:18,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 916 states, 914 states have (on average 1.8271334792122538) internal successors, (1670), 915 states have internal predecessors, (1670), 0 states have call successors, (0), 0 states have 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:45:18,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 916 states to 916 states and 1670 transitions. [2025-01-09 05:45:18,577 INFO L78 Accepts]: Start accepts. Automaton has 916 states and 1670 transitions. Word has length 47 [2025-01-09 05:45:18,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:45:18,578 INFO L471 AbstractCegarLoop]: Abstraction has 916 states and 1670 transitions. [2025-01-09 05:45:18,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:45:18,578 INFO L276 IsEmpty]: Start isEmpty. Operand 916 states and 1670 transitions. [2025-01-09 05:45:18,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-01-09 05:45:18,579 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:45:18,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:45:18,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 05:45:18,580 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:45:18,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:45:18,580 INFO L85 PathProgramCache]: Analyzing trace with hash -467852289, now seen corresponding path program 1 times [2025-01-09 05:45:18,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:45:18,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379450933] [2025-01-09 05:45:18,580 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:45:18,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:45:18,588 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-01-09 05:45:18,595 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-01-09 05:45:18,595 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:45:18,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:45:18,626 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:45:18,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:45:18,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379450933] [2025-01-09 05:45:18,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379450933] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:45:18,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:45:18,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:45:18,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629119695] [2025-01-09 05:45:18,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:45:18,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:45:18,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:45:18,628 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:45:18,628 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:45:18,629 INFO L87 Difference]: Start difference. First operand 916 states and 1670 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:45:18,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:45:18,647 INFO L93 Difference]: Finished difference Result 1062 states and 1891 transitions. [2025-01-09 05:45:18,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:45:18,648 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2025-01-09 05:45:18,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:45:18,651 INFO L225 Difference]: With dead ends: 1062 [2025-01-09 05:45:18,651 INFO L226 Difference]: Without dead ends: 986 [2025-01-09 05:45:18,651 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:45:18,653 INFO L435 NwaCegarLoop]: 1567 mSDtfsCounter, 1486 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1486 SdHoareTripleChecker+Valid, 1625 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:45:18,653 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1486 Valid, 1625 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:45:18,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 986 states. [2025-01-09 05:45:18,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 986 to 984. [2025-01-09 05:45:18,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 984 states, 982 states have (on average 1.8034623217922607) internal successors, (1771), 983 states have internal predecessors, (1771), 0 states have call successors, (0), 0 states have 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:45:18,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 984 states to 984 states and 1771 transitions. [2025-01-09 05:45:18,672 INFO L78 Accepts]: Start accepts. Automaton has 984 states and 1771 transitions. Word has length 48 [2025-01-09 05:45:18,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:45:18,672 INFO L471 AbstractCegarLoop]: Abstraction has 984 states and 1771 transitions. [2025-01-09 05:45:18,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:45:18,672 INFO L276 IsEmpty]: Start isEmpty. Operand 984 states and 1771 transitions. [2025-01-09 05:45:18,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-01-09 05:45:18,673 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:45:18,673 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:45:18,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 05:45:18,673 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:45:18,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:45:18,673 INFO L85 PathProgramCache]: Analyzing trace with hash 770409727, now seen corresponding path program 1 times [2025-01-09 05:45:18,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:45:18,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567531483] [2025-01-09 05:45:18,674 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:45:18,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:45:18,700 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-01-09 05:45:18,707 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-01-09 05:45:18,709 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:45:18,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:45:18,744 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:45:18,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:45:18,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567531483] [2025-01-09 05:45:18,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567531483] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:45:18,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:45:18,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:45:18,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344050001] [2025-01-09 05:45:18,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:45:18,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:45:18,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:45:18,745 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:45:18,745 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:45:18,745 INFO L87 Difference]: Start difference. First operand 984 states and 1771 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:45:18,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:45:18,767 INFO L93 Difference]: Finished difference Result 1358 states and 2331 transitions. [2025-01-09 05:45:18,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:45:18,768 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2025-01-09 05:45:18,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:45:18,771 INFO L225 Difference]: With dead ends: 1358 [2025-01-09 05:45:18,771 INFO L226 Difference]: Without dead ends: 1159 [2025-01-09 05:45:18,772 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:45:18,772 INFO L435 NwaCegarLoop]: 1569 mSDtfsCounter, 1484 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1484 SdHoareTripleChecker+Valid, 1631 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:45:18,772 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1484 Valid, 1631 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:45:18,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1159 states. [2025-01-09 05:45:18,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1159 to 1157. [2025-01-09 05:45:18,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1157 states, 1155 states have (on average 1.7515151515151515) internal successors, (2023), 1156 states have internal predecessors, (2023), 0 states have call successors, (0), 0 states have 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:45:18,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1157 states to 1157 states and 2023 transitions. [2025-01-09 05:45:18,793 INFO L78 Accepts]: Start accepts. Automaton has 1157 states and 2023 transitions. Word has length 48 [2025-01-09 05:45:18,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:45:18,793 INFO L471 AbstractCegarLoop]: Abstraction has 1157 states and 2023 transitions. [2025-01-09 05:45:18,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:45:18,793 INFO L276 IsEmpty]: Start isEmpty. Operand 1157 states and 2023 transitions. [2025-01-09 05:45:18,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-01-09 05:45:18,794 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:45:18,794 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:45:18,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 05:45:18,794 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:45:18,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:45:18,794 INFO L85 PathProgramCache]: Analyzing trace with hash -1445059073, now seen corresponding path program 1 times [2025-01-09 05:45:18,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:45:18,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402662998] [2025-01-09 05:45:18,795 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:45:18,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:45:18,800 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-01-09 05:45:18,805 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-01-09 05:45:18,805 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:45:18,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:45:18,836 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:45:18,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:45:18,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402662998] [2025-01-09 05:45:18,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402662998] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:45:18,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:45:18,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:45:18,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517019834] [2025-01-09 05:45:18,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:45:18,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:45:18,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:45:18,837 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:45:18,837 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:45:18,837 INFO L87 Difference]: Start difference. First operand 1157 states and 2023 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:45:18,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:45:18,863 INFO L93 Difference]: Finished difference Result 1853 states and 3045 transitions. [2025-01-09 05:45:18,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:45:18,863 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2025-01-09 05:45:18,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:45:18,869 INFO L225 Difference]: With dead ends: 1853 [2025-01-09 05:45:18,869 INFO L226 Difference]: Without dead ends: 1481 [2025-01-09 05:45:18,870 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:45:18,870 INFO L435 NwaCegarLoop]: 1567 mSDtfsCounter, 1482 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1482 SdHoareTripleChecker+Valid, 1633 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:45:18,871 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1482 Valid, 1633 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:45:18,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1481 states. [2025-01-09 05:45:18,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1481 to 1479. [2025-01-09 05:45:18,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1479 states, 1477 states have (on average 1.6784021665538253) internal successors, (2479), 1478 states have internal predecessors, (2479), 0 states have call successors, (0), 0 states have 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:45:18,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1479 states to 1479 states and 2479 transitions. [2025-01-09 05:45:18,899 INFO L78 Accepts]: Start accepts. Automaton has 1479 states and 2479 transitions. Word has length 48 [2025-01-09 05:45:18,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:45:18,900 INFO L471 AbstractCegarLoop]: Abstraction has 1479 states and 2479 transitions. [2025-01-09 05:45:18,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:45:18,900 INFO L276 IsEmpty]: Start isEmpty. Operand 1479 states and 2479 transitions. [2025-01-09 05:45:18,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-01-09 05:45:18,901 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:45:18,901 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:45:18,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 05:45:18,901 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:45:18,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:45:18,902 INFO L85 PathProgramCache]: Analyzing trace with hash 335873791, now seen corresponding path program 1 times [2025-01-09 05:45:18,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:45:18,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590279331] [2025-01-09 05:45:18,902 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:45:18,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:45:18,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-01-09 05:45:18,918 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-01-09 05:45:18,918 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:45:18,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:45:18,949 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:45:18,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:45:18,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590279331] [2025-01-09 05:45:18,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590279331] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:45:18,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:45:18,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:45:18,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643751882] [2025-01-09 05:45:18,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:45:18,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:45:18,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:45:18,951 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:45:18,951 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:45:18,951 INFO L87 Difference]: Start difference. First operand 1479 states and 2479 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:45:18,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:45:18,981 INFO L93 Difference]: Finished difference Result 2771 states and 4329 transitions. [2025-01-09 05:45:18,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:45:18,981 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2025-01-09 05:45:18,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:45:18,988 INFO L225 Difference]: With dead ends: 2771 [2025-01-09 05:45:18,988 INFO L226 Difference]: Without dead ends: 2077 [2025-01-09 05:45:18,989 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:45:18,990 INFO L435 NwaCegarLoop]: 1565 mSDtfsCounter, 1480 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1480 SdHoareTripleChecker+Valid, 1635 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:45:18,990 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1480 Valid, 1635 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:45:18,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2077 states. [2025-01-09 05:45:19,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2077 to 2075. [2025-01-09 05:45:19,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2075 states, 2073 states have (on average 1.5894838398456343) internal successors, (3295), 2074 states have internal predecessors, (3295), 0 states have call successors, (0), 0 states have 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:45:19,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2075 states to 2075 states and 3295 transitions. [2025-01-09 05:45:19,030 INFO L78 Accepts]: Start accepts. Automaton has 2075 states and 3295 transitions. Word has length 48 [2025-01-09 05:45:19,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:45:19,031 INFO L471 AbstractCegarLoop]: Abstraction has 2075 states and 3295 transitions. [2025-01-09 05:45:19,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:45:19,031 INFO L276 IsEmpty]: Start isEmpty. Operand 2075 states and 3295 transitions. [2025-01-09 05:45:19,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-01-09 05:45:19,032 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:45:19,032 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:45:19,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 05:45:19,032 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:45:19,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:45:19,032 INFO L85 PathProgramCache]: Analyzing trace with hash -161363137, now seen corresponding path program 1 times [2025-01-09 05:45:19,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:45:19,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182945715] [2025-01-09 05:45:19,033 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:45:19,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:45:19,039 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-01-09 05:45:19,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-01-09 05:45:19,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:45:19,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:45:19,121 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 05:45:19,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:45:19,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182945715] [2025-01-09 05:45:19,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182945715] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:45:19,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:45:19,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:45:19,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912843819] [2025-01-09 05:45:19,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:45:19,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:45:19,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:45:19,123 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:45:19,123 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:45:19,123 INFO L87 Difference]: Start difference. First operand 2075 states and 3295 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have 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:45:19,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:45:19,265 INFO L93 Difference]: Finished difference Result 7165 states and 10484 transitions. [2025-01-09 05:45:19,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 05:45:19,266 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 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:45:19,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:45:19,285 INFO L225 Difference]: With dead ends: 7165 [2025-01-09 05:45:19,285 INFO L226 Difference]: Without dead ends: 6235 [2025-01-09 05:45:19,288 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-01-09 05:45:19,288 INFO L435 NwaCegarLoop]: 1577 mSDtfsCounter, 4645 mSDsluCounter, 1812 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4645 SdHoareTripleChecker+Valid, 3389 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 05:45:19,289 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4645 Valid, 3389 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 05:45:19,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6235 states. [2025-01-09 05:45:19,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6235 to 3187. [2025-01-09 05:45:19,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3187 states, 3185 states have (on average 1.5218210361067503) internal successors, (4847), 3186 states have internal predecessors, (4847), 0 states have call successors, (0), 0 states have 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:45:19,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3187 states to 3187 states and 4847 transitions. [2025-01-09 05:45:19,374 INFO L78 Accepts]: Start accepts. Automaton has 3187 states and 4847 transitions. Word has length 65 [2025-01-09 05:45:19,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:45:19,375 INFO L471 AbstractCegarLoop]: Abstraction has 3187 states and 4847 transitions. [2025-01-09 05:45:19,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have 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:45:19,375 INFO L276 IsEmpty]: Start isEmpty. Operand 3187 states and 4847 transitions. [2025-01-09 05:45:19,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-01-09 05:45:19,379 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:45:19,379 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:45:19,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 05:45:19,379 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:45:19,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:45:19,380 INFO L85 PathProgramCache]: Analyzing trace with hash 1076898879, now seen corresponding path program 1 times [2025-01-09 05:45:19,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:45:19,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197914051] [2025-01-09 05:45:19,380 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:45:19,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:45:19,388 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-01-09 05:45:19,401 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-01-09 05:45:19,402 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:45:19,402 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:45:19,486 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 05:45:19,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:45:19,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197914051] [2025-01-09 05:45:19,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197914051] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:45:19,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:45:19,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:45:19,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452554022] [2025-01-09 05:45:19,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:45:19,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:45:19,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:45:19,488 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:45:19,488 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:45:19,488 INFO L87 Difference]: Start difference. First operand 3187 states and 4847 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:45:19,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:45:19,736 INFO L93 Difference]: Finished difference Result 8453 states and 12292 transitions. [2025-01-09 05:45:19,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 05:45:19,738 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2025-01-09 05:45:19,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:45:19,782 INFO L225 Difference]: With dead ends: 8453 [2025-01-09 05:45:19,782 INFO L226 Difference]: Without dead ends: 7163 [2025-01-09 05:45:19,792 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-01-09 05:45:19,793 INFO L435 NwaCegarLoop]: 1576 mSDtfsCounter, 4647 mSDsluCounter, 1790 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4647 SdHoareTripleChecker+Valid, 3366 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 05:45:19,793 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4647 Valid, 3366 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 05:45:19,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7163 states. [2025-01-09 05:45:19,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7163 to 4939. [2025-01-09 05:45:19,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4939 states, 4937 states have (on average 1.4759975693741139) internal successors, (7287), 4938 states have internal predecessors, (7287), 0 states have call successors, (0), 0 states have 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:45:19,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4939 states to 4939 states and 7287 transitions. [2025-01-09 05:45:19,944 INFO L78 Accepts]: Start accepts. Automaton has 4939 states and 7287 transitions. Word has length 65 [2025-01-09 05:45:19,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:45:19,944 INFO L471 AbstractCegarLoop]: Abstraction has 4939 states and 7287 transitions. [2025-01-09 05:45:19,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:45:19,944 INFO L276 IsEmpty]: Start isEmpty. Operand 4939 states and 7287 transitions. [2025-01-09 05:45:19,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-01-09 05:45:19,945 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:45:19,946 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:45:19,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 05:45:19,946 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:45:19,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:45:19,946 INFO L85 PathProgramCache]: Analyzing trace with hash -1138569921, now seen corresponding path program 1 times [2025-01-09 05:45:19,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:45:19,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13143545] [2025-01-09 05:45:19,946 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:45:19,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:45:19,953 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-01-09 05:45:19,960 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-01-09 05:45:19,960 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:45:19,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:45:20,033 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-09 05:45:20,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:45:20,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13143545] [2025-01-09 05:45:20,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13143545] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:45:20,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:45:20,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:45:20,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370015272] [2025-01-09 05:45:20,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:45:20,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:45:20,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:45:20,035 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:45:20,035 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:45:20,035 INFO L87 Difference]: Start difference. First operand 4939 states and 7287 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:45:20,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:45:20,232 INFO L93 Difference]: Finished difference Result 9741 states and 14092 transitions. [2025-01-09 05:45:20,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 05:45:20,232 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2025-01-09 05:45:20,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:45:20,251 INFO L225 Difference]: With dead ends: 9741 [2025-01-09 05:45:20,251 INFO L226 Difference]: Without dead ends: 8451 [2025-01-09 05:45:20,254 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-01-09 05:45:20,254 INFO L435 NwaCegarLoop]: 1574 mSDtfsCounter, 4671 mSDsluCounter, 1762 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4671 SdHoareTripleChecker+Valid, 3336 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:45:20,255 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4671 Valid, 3336 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:45:20,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8451 states. [2025-01-09 05:45:20,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8451 to 6227. [2025-01-09 05:45:20,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6227 states, 6225 states have (on average 1.4597590361445782) internal successors, (9087), 6226 states have internal predecessors, (9087), 0 states have call successors, (0), 0 states have 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:45:20,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6227 states to 6227 states and 9087 transitions. [2025-01-09 05:45:20,394 INFO L78 Accepts]: Start accepts. Automaton has 6227 states and 9087 transitions. Word has length 65 [2025-01-09 05:45:20,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:45:20,394 INFO L471 AbstractCegarLoop]: Abstraction has 6227 states and 9087 transitions. [2025-01-09 05:45:20,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:45:20,395 INFO L276 IsEmpty]: Start isEmpty. Operand 6227 states and 9087 transitions. [2025-01-09 05:45:20,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-01-09 05:45:20,396 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:45:20,397 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:45:20,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 05:45:20,397 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:45:20,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:45:20,398 INFO L85 PathProgramCache]: Analyzing trace with hash 642362943, now seen corresponding path program 1 times [2025-01-09 05:45:20,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:45:20,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672046683] [2025-01-09 05:45:20,398 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:45:20,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:45:20,404 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-01-09 05:45:20,411 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-01-09 05:45:20,411 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:45:20,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:45:20,494 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-09 05:45:20,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:45:20,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672046683] [2025-01-09 05:45:20,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672046683] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:45:20,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:45:20,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:45:20,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749747713] [2025-01-09 05:45:20,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:45:20,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:45:20,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:45:20,495 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:45:20,495 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:45:20,495 INFO L87 Difference]: Start difference. First operand 6227 states and 9087 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:45:20,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:45:20,691 INFO L93 Difference]: Finished difference Result 11029 states and 15892 transitions. [2025-01-09 05:45:20,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 05:45:20,692 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2025-01-09 05:45:20,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:45:20,709 INFO L225 Difference]: With dead ends: 11029 [2025-01-09 05:45:20,709 INFO L226 Difference]: Without dead ends: 9739 [2025-01-09 05:45:20,712 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-01-09 05:45:20,712 INFO L435 NwaCegarLoop]: 1573 mSDtfsCounter, 4659 mSDsluCounter, 1794 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4659 SdHoareTripleChecker+Valid, 3367 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 05:45:20,713 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4659 Valid, 3367 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 05:45:20,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9739 states. [2025-01-09 05:45:20,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9739 to 7515. [2025-01-09 05:45:20,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7515 states, 7513 states have (on average 1.4490882470384667) internal successors, (10887), 7514 states have internal predecessors, (10887), 0 states have call successors, (0), 0 states have 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:45:20,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7515 states to 7515 states and 10887 transitions. [2025-01-09 05:45:20,860 INFO L78 Accepts]: Start accepts. Automaton has 7515 states and 10887 transitions. Word has length 65 [2025-01-09 05:45:20,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:45:20,860 INFO L471 AbstractCegarLoop]: Abstraction has 7515 states and 10887 transitions. [2025-01-09 05:45:20,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:45:20,860 INFO L276 IsEmpty]: Start isEmpty. Operand 7515 states and 10887 transitions. [2025-01-09 05:45:20,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-01-09 05:45:20,862 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:45:20,862 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:45:20,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 05:45:20,862 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:45:20,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:45:20,862 INFO L85 PathProgramCache]: Analyzing trace with hash 1093101628, now seen corresponding path program 1 times [2025-01-09 05:45:20,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:45:20,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99857196] [2025-01-09 05:45:20,863 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:45:20,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:45:20,868 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-01-09 05:45:20,878 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-01-09 05:45:20,879 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:45:20,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:45:20,926 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:45:20,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:45:20,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99857196] [2025-01-09 05:45:20,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99857196] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:45:20,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:45:20,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:45:20,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492351844] [2025-01-09 05:45:20,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:45:20,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:45:20,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:45:20,928 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:45:20,928 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:45:20,928 INFO L87 Difference]: Start difference. First operand 7515 states and 10887 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:45:21,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:45:21,042 INFO L93 Difference]: Finished difference Result 14247 states and 20305 transitions. [2025-01-09 05:45:21,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:45:21,043 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2025-01-09 05:45:21,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:45:21,056 INFO L225 Difference]: With dead ends: 14247 [2025-01-09 05:45:21,056 INFO L226 Difference]: Without dead ends: 7517 [2025-01-09 05:45:21,061 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:45:21,062 INFO L435 NwaCegarLoop]: 1551 mSDtfsCounter, 37 mSDsluCounter, 1513 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 3064 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:45:21,062 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 3064 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:45:21,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7517 states. [2025-01-09 05:45:21,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7517 to 7515. [2025-01-09 05:45:21,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7515 states, 7513 states have (on average 1.4325835218953813) internal successors, (10763), 7514 states have internal predecessors, (10763), 0 states have call successors, (0), 0 states have 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:45:21,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7515 states to 7515 states and 10763 transitions. [2025-01-09 05:45:21,364 INFO L78 Accepts]: Start accepts. Automaton has 7515 states and 10763 transitions. Word has length 66 [2025-01-09 05:45:21,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:45:21,367 INFO L471 AbstractCegarLoop]: Abstraction has 7515 states and 10763 transitions. [2025-01-09 05:45:21,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:45:21,368 INFO L276 IsEmpty]: Start isEmpty. Operand 7515 states and 10763 transitions. [2025-01-09 05:45:21,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-01-09 05:45:21,369 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:45:21,369 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:45:21,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 05:45:21,369 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:45:21,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:45:21,370 INFO L85 PathProgramCache]: Analyzing trace with hash -1536501417, now seen corresponding path program 1 times [2025-01-09 05:45:21,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:45:21,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347808285] [2025-01-09 05:45:21,370 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:45:21,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:45:21,379 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-01-09 05:45:21,388 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-01-09 05:45:21,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:45:21,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:45:21,442 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:45:21,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:45:21,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347808285] [2025-01-09 05:45:21,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347808285] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:45:21,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:45:21,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:45:21,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922133818] [2025-01-09 05:45:21,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:45:21,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:45:21,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:45:21,444 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:45:21,444 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:45:21,444 INFO L87 Difference]: Start difference. First operand 7515 states and 10763 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:45:21,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:45:21,489 INFO L93 Difference]: Finished difference Result 10088 states and 14347 transitions. [2025-01-09 05:45:21,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:45:21,489 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2025-01-09 05:45:21,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:45:21,496 INFO L225 Difference]: With dead ends: 10088 [2025-01-09 05:45:21,496 INFO L226 Difference]: Without dead ends: 3358 [2025-01-09 05:45:21,502 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:45:21,502 INFO L435 NwaCegarLoop]: 1549 mSDtfsCounter, 31 mSDsluCounter, 1512 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 3061 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:45:21,502 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 3061 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:45:21,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3358 states. [2025-01-09 05:45:21,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3358 to 3350. [2025-01-09 05:45:21,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3350 states, 3348 states have (on average 1.494026284348865) internal successors, (5002), 3349 states have internal predecessors, (5002), 0 states have call successors, (0), 0 states have 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:45:21,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3350 states to 3350 states and 5002 transitions. [2025-01-09 05:45:21,556 INFO L78 Accepts]: Start accepts. Automaton has 3350 states and 5002 transitions. Word has length 67 [2025-01-09 05:45:21,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:45:21,556 INFO L471 AbstractCegarLoop]: Abstraction has 3350 states and 5002 transitions. [2025-01-09 05:45:21,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:45:21,556 INFO L276 IsEmpty]: Start isEmpty. Operand 3350 states and 5002 transitions. [2025-01-09 05:45:21,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-01-09 05:45:21,557 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:45:21,557 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, 1, 1, 1, 1] [2025-01-09 05:45:21,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 05:45:21,557 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:45:21,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:45:21,558 INFO L85 PathProgramCache]: Analyzing trace with hash -173945335, now seen corresponding path program 1 times [2025-01-09 05:45:21,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:45:21,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594498596] [2025-01-09 05:45:21,558 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:45:21,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:45:21,563 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-01-09 05:45:21,568 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-01-09 05:45:21,568 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:45:21,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:45:21,679 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:45:21,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:45:21,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594498596] [2025-01-09 05:45:21,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594498596] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:45:21,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:45:21,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:45:21,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160543137] [2025-01-09 05:45:21,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:45:21,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 05:45:21,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:45:21,681 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 05:45:21,681 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 05:45:21,681 INFO L87 Difference]: Start difference. First operand 3350 states and 5002 transitions. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:45:26,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:45:26,344 INFO L93 Difference]: Finished difference Result 5605 states and 9311 transitions. [2025-01-09 05:45:26,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 05:45:26,345 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2025-01-09 05:45:26,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:45:26,354 INFO L225 Difference]: With dead ends: 5605 [2025-01-09 05:45:26,355 INFO L226 Difference]: Without dead ends: 4852 [2025-01-09 05:45:26,357 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:45:26,358 INFO L435 NwaCegarLoop]: 761 mSDtfsCounter, 2351 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 5354 mSolverCounterSat, 1153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2351 SdHoareTripleChecker+Valid, 779 SdHoareTripleChecker+Invalid, 6507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1153 IncrementalHoareTripleChecker+Valid, 5354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2025-01-09 05:45:26,359 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2351 Valid, 779 Invalid, 6507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1153 Valid, 5354 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2025-01-09 05:45:26,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4852 states. [2025-01-09 05:45:26,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4852 to 4852. [2025-01-09 05:45:26,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4852 states, 4850 states have (on average 1.4672164948453608) internal successors, (7116), 4851 states have internal predecessors, (7116), 0 states have call successors, (0), 0 states have 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:45:26,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4852 states to 4852 states and 7116 transitions. [2025-01-09 05:45:26,437 INFO L78 Accepts]: Start accepts. Automaton has 4852 states and 7116 transitions. Word has length 67 [2025-01-09 05:45:26,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:45:26,438 INFO L471 AbstractCegarLoop]: Abstraction has 4852 states and 7116 transitions. [2025-01-09 05:45:26,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:45:26,438 INFO L276 IsEmpty]: Start isEmpty. Operand 4852 states and 7116 transitions. [2025-01-09 05:45:26,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-01-09 05:45:26,439 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:45:26,439 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:45:26,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 05:45:26,440 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:45:26,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:45:26,440 INFO L85 PathProgramCache]: Analyzing trace with hash 1693309582, now seen corresponding path program 1 times [2025-01-09 05:45:26,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:45:26,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694339117] [2025-01-09 05:45:26,441 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:45:26,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:45:26,454 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-01-09 05:45:26,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-01-09 05:45:26,470 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:45:26,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:45:26,528 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:45:26,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:45:26,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694339117] [2025-01-09 05:45:26,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694339117] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:45:26,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:45:26,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:45:26,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806020591] [2025-01-09 05:45:26,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:45:26,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:45:26,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:45:26,529 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:45:26,529 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:45:26,530 INFO L87 Difference]: Start difference. First operand 4852 states and 7116 transitions. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:45:26,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:45:26,559 INFO L93 Difference]: Finished difference Result 6132 states and 8878 transitions. [2025-01-09 05:45:26,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:45:26,560 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2025-01-09 05:45:26,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:45:26,566 INFO L225 Difference]: With dead ends: 6132 [2025-01-09 05:45:26,566 INFO L226 Difference]: Without dead ends: 3578 [2025-01-09 05:45:26,568 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:45:26,569 INFO L435 NwaCegarLoop]: 1543 mSDtfsCounter, 33 mSDsluCounter, 1497 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 3040 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:45:26,569 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 3040 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:45:26,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3578 states. [2025-01-09 05:45:26,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3578 to 3576. [2025-01-09 05:45:26,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3576 states, 3574 states have (on average 1.4924454392837156) internal successors, (5334), 3575 states have internal predecessors, (5334), 0 states have call successors, (0), 0 states have 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:45:26,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3576 states to 3576 states and 5334 transitions. [2025-01-09 05:45:26,616 INFO L78 Accepts]: Start accepts. Automaton has 3576 states and 5334 transitions. Word has length 68 [2025-01-09 05:45:26,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:45:26,616 INFO L471 AbstractCegarLoop]: Abstraction has 3576 states and 5334 transitions. [2025-01-09 05:45:26,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:45:26,616 INFO L276 IsEmpty]: Start isEmpty. Operand 3576 states and 5334 transitions. [2025-01-09 05:45:26,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-01-09 05:45:26,616 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:45:26,616 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:45:26,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 05:45:26,617 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:45:26,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:45:26,617 INFO L85 PathProgramCache]: Analyzing trace with hash 2022357856, now seen corresponding path program 1 times [2025-01-09 05:45:26,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:45:26,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441270675] [2025-01-09 05:45:26,617 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:45:26,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:45:26,629 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-01-09 05:45:26,638 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-01-09 05:45:26,638 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:45:26,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:45:26,687 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:45:26,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:45:26,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441270675] [2025-01-09 05:45:26,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441270675] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:45:26,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:45:26,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:45:26,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765980858] [2025-01-09 05:45:26,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:45:26,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:45:26,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:45:26,688 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:45:26,689 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:45:26,689 INFO L87 Difference]: Start difference. First operand 3576 states and 5334 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:45:26,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:45:26,712 INFO L93 Difference]: Finished difference Result 4218 states and 6205 transitions. [2025-01-09 05:45:26,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:45:26,712 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2025-01-09 05:45:26,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:45:26,717 INFO L225 Difference]: With dead ends: 4218 [2025-01-09 05:45:26,717 INFO L226 Difference]: Without dead ends: 2940 [2025-01-09 05:45:26,719 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:45:26,719 INFO L435 NwaCegarLoop]: 1536 mSDtfsCounter, 30 mSDsluCounter, 1489 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 3025 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:45:26,720 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 3025 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:45:26,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2940 states. [2025-01-09 05:45:26,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2940 to 2938. [2025-01-09 05:45:26,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2938 states, 2936 states have (on average 1.5170299727520435) internal successors, (4454), 2937 states have internal predecessors, (4454), 0 states have call successors, (0), 0 states have 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:45:26,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2938 states to 2938 states and 4454 transitions. [2025-01-09 05:45:26,766 INFO L78 Accepts]: Start accepts. Automaton has 2938 states and 4454 transitions. Word has length 70 [2025-01-09 05:45:26,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:45:26,766 INFO L471 AbstractCegarLoop]: Abstraction has 2938 states and 4454 transitions. [2025-01-09 05:45:26,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:45:26,767 INFO L276 IsEmpty]: Start isEmpty. Operand 2938 states and 4454 transitions. [2025-01-09 05:45:26,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-01-09 05:45:26,767 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:45:26,767 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:45:26,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 05:45:26,768 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:45:26,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:45:26,768 INFO L85 PathProgramCache]: Analyzing trace with hash -1521538382, now seen corresponding path program 1 times [2025-01-09 05:45:26,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:45:26,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413928148] [2025-01-09 05:45:26,768 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:45:26,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:45:26,776 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-01-09 05:45:26,791 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-01-09 05:45:26,795 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:45:26,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:45:26,881 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 05:45:26,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:45:26,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413928148] [2025-01-09 05:45:26,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413928148] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 05:45:26,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1802284711] [2025-01-09 05:45:26,881 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:45:26,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:45:26,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:45:26,884 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:45:26,885 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:45:26,942 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-01-09 05:45:26,974 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-01-09 05:45:26,974 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:45:26,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:45:26,978 INFO L256 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-09 05:45:26,982 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:45:27,370 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:45:27,370 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 05:45:28,046 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:45:28,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1802284711] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 05:45:28,046 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 05:45:28,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 9, 9] total 20 [2025-01-09 05:45:28,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606872657] [2025-01-09 05:45:28,047 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 05:45:28,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-01-09 05:45:28,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:45:28,047 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-01-09 05:45:28,048 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=314, Unknown=0, NotChecked=0, Total=380 [2025-01-09 05:45:28,048 INFO L87 Difference]: Start difference. First operand 2938 states and 4454 transitions. Second operand has 20 states, 20 states have (on average 9.55) internal successors, (191), 20 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:45:28,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:45:28,669 INFO L93 Difference]: Finished difference Result 4926 states and 7059 transitions. [2025-01-09 05:45:28,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-01-09 05:45:28,670 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 9.55) internal successors, (191), 20 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2025-01-09 05:45:28,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:45:28,676 INFO L225 Difference]: With dead ends: 4926 [2025-01-09 05:45:28,677 INFO L226 Difference]: Without dead ends: 4286 [2025-01-09 05:45:28,679 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 326 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=394, Invalid=1246, Unknown=0, NotChecked=0, Total=1640 [2025-01-09 05:45:28,680 INFO L435 NwaCegarLoop]: 1496 mSDtfsCounter, 15906 mSDsluCounter, 3168 mSDsCounter, 0 mSdLazyCounter, 349 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15906 SdHoareTripleChecker+Valid, 4664 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 05:45:28,680 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15906 Valid, 4664 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 349 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 05:45:28,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4286 states. [2025-01-09 05:45:28,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4286 to 4134. [2025-01-09 05:45:28,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4134 states, 4132 states have (on average 1.4385285575992255) internal successors, (5944), 4133 states have internal predecessors, (5944), 0 states have call successors, (0), 0 states have 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:45:28,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4134 states to 4134 states and 5944 transitions. [2025-01-09 05:45:28,739 INFO L78 Accepts]: Start accepts. Automaton has 4134 states and 5944 transitions. Word has length 72 [2025-01-09 05:45:28,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:45:28,739 INFO L471 AbstractCegarLoop]: Abstraction has 4134 states and 5944 transitions. [2025-01-09 05:45:28,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 9.55) internal successors, (191), 20 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:45:28,739 INFO L276 IsEmpty]: Start isEmpty. Operand 4134 states and 5944 transitions. [2025-01-09 05:45:28,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-01-09 05:45:28,740 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:45:28,740 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:45:28,748 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 05:45:28,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:45:28,944 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:45:28,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:45:28,945 INFO L85 PathProgramCache]: Analyzing trace with hash 1074842387, now seen corresponding path program 1 times [2025-01-09 05:45:28,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:45:28,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472843256] [2025-01-09 05:45:28,946 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:45:28,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:45:28,954 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-01-09 05:45:28,984 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-01-09 05:45:28,985 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:45:28,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:45:29,969 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:45:29,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:45:29,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472843256] [2025-01-09 05:45:29,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472843256] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 05:45:29,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [773809620] [2025-01-09 05:45:29,970 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:45:29,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:45:29,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:45:29,972 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:45:29,973 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:45:30,022 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-01-09 05:45:30,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-01-09 05:45:30,055 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:45:30,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:45:30,056 INFO L256 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-01-09 05:45:30,058 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:45:30,345 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:45:30,345 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 05:45:31,149 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:45:31,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [773809620] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 05:45:31,150 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 05:45:31,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 28 [2025-01-09 05:45:31,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328174817] [2025-01-09 05:45:31,150 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 05:45:31,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-01-09 05:45:31,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:45:31,151 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-01-09 05:45:31,151 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=692, Unknown=0, NotChecked=0, Total=812 [2025-01-09 05:45:31,151 INFO L87 Difference]: Start difference. First operand 4134 states and 5944 transitions. Second operand has 29 states, 29 states have (on average 6.310344827586207) internal successors, (183), 28 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have 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:45:32,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:45:32,256 INFO L93 Difference]: Finished difference Result 8477 states and 11576 transitions. [2025-01-09 05:45:32,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-01-09 05:45:32,256 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 6.310344827586207) internal successors, (183), 28 states have internal predecessors, (183), 0 states have call successors, (0), 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 73 [2025-01-09 05:45:32,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:45:32,267 INFO L225 Difference]: With dead ends: 8477 [2025-01-09 05:45:32,267 INFO L226 Difference]: Without dead ends: 6934 [2025-01-09 05:45:32,270 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 747 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=669, Invalid=2523, Unknown=0, NotChecked=0, Total=3192 [2025-01-09 05:45:32,271 INFO L435 NwaCegarLoop]: 1492 mSDtfsCounter, 26412 mSDsluCounter, 6318 mSDsCounter, 0 mSdLazyCounter, 726 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26412 SdHoareTripleChecker+Valid, 7810 SdHoareTripleChecker+Invalid, 764 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 726 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 05:45:32,271 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26412 Valid, 7810 Invalid, 764 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 726 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 05:45:32,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6934 states. [2025-01-09 05:45:32,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6934 to 6892. [2025-01-09 05:45:32,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6892 states, 6890 states have (on average 1.3750362844702468) internal successors, (9474), 6891 states have internal predecessors, (9474), 0 states have call successors, (0), 0 states have 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:45:32,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6892 states to 6892 states and 9474 transitions. [2025-01-09 05:45:32,384 INFO L78 Accepts]: Start accepts. Automaton has 6892 states and 9474 transitions. Word has length 73 [2025-01-09 05:45:32,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:45:32,385 INFO L471 AbstractCegarLoop]: Abstraction has 6892 states and 9474 transitions. [2025-01-09 05:45:32,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 6.310344827586207) internal successors, (183), 28 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have 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:45:32,385 INFO L276 IsEmpty]: Start isEmpty. Operand 6892 states and 9474 transitions. [2025-01-09 05:45:32,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-01-09 05:45:32,386 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:45:32,386 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:45:32,393 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:45:32,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:45:32,587 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:45:32,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:45:32,588 INFO L85 PathProgramCache]: Analyzing trace with hash -1730489837, now seen corresponding path program 1 times [2025-01-09 05:45:32,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:45:32,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127396121] [2025-01-09 05:45:32,588 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:45:32,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:45:32,595 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-01-09 05:45:32,611 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-01-09 05:45:32,611 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:45:32,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:45:32,880 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:45:32,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:45:32,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127396121] [2025-01-09 05:45:32,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127396121] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 05:45:32,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [62891247] [2025-01-09 05:45:32,881 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:45:32,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:45:32,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:45:32,883 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:45:32,886 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:45:32,937 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-01-09 05:45:32,968 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-01-09 05:45:32,968 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:45:32,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:45:32,970 INFO L256 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-09 05:45:32,972 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:45:33,293 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:45:33,294 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 05:45:33,942 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:45:33,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [62891247] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 05:45:33,943 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 05:45:33,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2025-01-09 05:45:33,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385631496] [2025-01-09 05:45:33,943 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 05:45:33,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-01-09 05:45:33,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:45:33,944 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-01-09 05:45:33,944 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=343, Unknown=0, NotChecked=0, Total=420 [2025-01-09 05:45:33,945 INFO L87 Difference]: Start difference. First operand 6892 states and 9474 transitions. Second operand has 21 states, 21 states have (on average 7.9523809523809526) internal successors, (167), 20 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:45:34,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:45:34,365 INFO L93 Difference]: Finished difference Result 15472 states and 20633 transitions. [2025-01-09 05:45:34,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 05:45:34,368 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 7.9523809523809526) internal successors, (167), 20 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 73 [2025-01-09 05:45:34,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:45:34,379 INFO L225 Difference]: With dead ends: 15472 [2025-01-09 05:45:34,379 INFO L226 Difference]: Without dead ends: 11470 [2025-01-09 05:45:34,383 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=228, Invalid=702, Unknown=0, NotChecked=0, Total=930 [2025-01-09 05:45:34,384 INFO L435 NwaCegarLoop]: 1498 mSDtfsCounter, 15346 mSDsluCounter, 3189 mSDsCounter, 0 mSdLazyCounter, 305 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15346 SdHoareTripleChecker+Valid, 4687 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 05:45:34,385 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15346 Valid, 4687 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 305 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 05:45:34,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11470 states. [2025-01-09 05:45:34,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11470 to 11354. [2025-01-09 05:45:34,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11354 states, 11352 states have (on average 1.3290169133192389) internal successors, (15087), 11353 states have internal predecessors, (15087), 0 states have call successors, (0), 0 states have 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:45:34,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11354 states to 11354 states and 15087 transitions. [2025-01-09 05:45:34,612 INFO L78 Accepts]: Start accepts. Automaton has 11354 states and 15087 transitions. Word has length 73 [2025-01-09 05:45:34,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:45:34,612 INFO L471 AbstractCegarLoop]: Abstraction has 11354 states and 15087 transitions. [2025-01-09 05:45:34,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 7.9523809523809526) internal successors, (167), 20 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:45:34,613 INFO L276 IsEmpty]: Start isEmpty. Operand 11354 states and 15087 transitions. [2025-01-09 05:45:34,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-01-09 05:45:34,614 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:45:34,614 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:45:34,622 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:45:34,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:45:34,814 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:45:34,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:45:34,816 INFO L85 PathProgramCache]: Analyzing trace with hash 376725732, now seen corresponding path program 1 times [2025-01-09 05:45:34,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:45:34,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323381019] [2025-01-09 05:45:34,816 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:45:34,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:45:34,826 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-01-09 05:45:34,839 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-01-09 05:45:34,840 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:45:34,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:45:35,096 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:45:35,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:45:35,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323381019] [2025-01-09 05:45:35,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323381019] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 05:45:35,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [533041487] [2025-01-09 05:45:35,097 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:45:35,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:45:35,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:45:35,099 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:45:35,106 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:45:35,160 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-01-09 05:45:35,201 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-01-09 05:45:35,201 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:45:35,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:45:35,206 INFO L256 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-01-09 05:45:35,208 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:45:35,648 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:45:35,648 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 05:45:36,236 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:45:36,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [533041487] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 05:45:36,236 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 05:45:36,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 13] total 29 [2025-01-09 05:45:36,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204581559] [2025-01-09 05:45:36,237 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 05:45:36,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-01-09 05:45:36,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:45:36,237 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-01-09 05:45:36,237 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=668, Unknown=0, NotChecked=0, Total=812 [2025-01-09 05:45:36,238 INFO L87 Difference]: Start difference. First operand 11354 states and 15087 transitions. Second operand has 29 states, 29 states have (on average 6.551724137931035) internal successors, (190), 29 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have 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:45:36,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:45:36,889 INFO L93 Difference]: Finished difference Result 19784 states and 26000 transitions. [2025-01-09 05:45:36,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-01-09 05:45:36,890 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 6.551724137931035) internal successors, (190), 29 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2025-01-09 05:45:36,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:45:36,902 INFO L225 Difference]: With dead ends: 19784 [2025-01-09 05:45:36,902 INFO L226 Difference]: Without dead ends: 11678 [2025-01-09 05:45:36,909 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 436 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=434, Invalid=1458, Unknown=0, NotChecked=0, Total=1892 [2025-01-09 05:45:36,909 INFO L435 NwaCegarLoop]: 1513 mSDtfsCounter, 16550 mSDsluCounter, 7773 mSDsCounter, 0 mSdLazyCounter, 476 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16550 SdHoareTripleChecker+Valid, 9286 SdHoareTripleChecker+Invalid, 505 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 476 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 05:45:36,910 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16550 Valid, 9286 Invalid, 505 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 476 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 05:45:36,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11678 states. [2025-01-09 05:45:37,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11678 to 11198. [2025-01-09 05:45:37,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11198 states, 11196 states have (on average 1.3218113612004287) internal successors, (14799), 11197 states have internal predecessors, (14799), 0 states have call successors, (0), 0 states have 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:45:37,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11198 states to 11198 states and 14799 transitions. [2025-01-09 05:45:37,234 INFO L78 Accepts]: Start accepts. Automaton has 11198 states and 14799 transitions. Word has length 74 [2025-01-09 05:45:37,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:45:37,234 INFO L471 AbstractCegarLoop]: Abstraction has 11198 states and 14799 transitions. [2025-01-09 05:45:37,234 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 6.551724137931035) internal successors, (190), 29 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have 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:45:37,235 INFO L276 IsEmpty]: Start isEmpty. Operand 11198 states and 14799 transitions. [2025-01-09 05:45:37,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-01-09 05:45:37,236 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:45:37,236 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:45:37,242 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-09 05:45:37,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-01-09 05:45:37,437 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:45:37,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:45:37,437 INFO L85 PathProgramCache]: Analyzing trace with hash -368926045, now seen corresponding path program 1 times [2025-01-09 05:45:37,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:45:37,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752507274] [2025-01-09 05:45:37,437 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:45:37,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:45:37,446 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-01-09 05:45:37,470 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-01-09 05:45:37,470 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:45:37,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:45:38,126 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:45:38,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:45:38,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752507274] [2025-01-09 05:45:38,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752507274] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 05:45:38,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1658667011] [2025-01-09 05:45:38,128 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:45:38,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:45:38,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:45:38,134 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:45:38,135 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:45:38,185 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-01-09 05:45:38,216 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-01-09 05:45:38,217 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:45:38,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:45:38,218 INFO L256 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-01-09 05:45:38,221 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:45:38,760 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:45:38,761 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 05:45:39,768 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:45:39,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1658667011] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 05:45:39,768 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 05:45:39,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 13] total 35 [2025-01-09 05:45:39,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56822891] [2025-01-09 05:45:39,768 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 05:45:39,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-01-09 05:45:39,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:45:39,769 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-01-09 05:45:39,770 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=1074, Unknown=0, NotChecked=0, Total=1190 [2025-01-09 05:45:39,770 INFO L87 Difference]: Start difference. First operand 11198 states and 14799 transitions. Second operand has 35 states, 35 states have (on average 5.9714285714285715) internal successors, (209), 35 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:45:45,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:45:45,953 INFO L93 Difference]: Finished difference Result 24178 states and 31667 transitions. [2025-01-09 05:45:45,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2025-01-09 05:45:45,953 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 5.9714285714285715) internal successors, (209), 35 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2025-01-09 05:45:45,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:45:45,968 INFO L225 Difference]: With dead ends: 24178 [2025-01-09 05:45:45,969 INFO L226 Difference]: Without dead ends: 19520 [2025-01-09 05:45:45,974 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4605 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=2795, Invalid=11247, Unknown=0, NotChecked=0, Total=14042 [2025-01-09 05:45:45,975 INFO L435 NwaCegarLoop]: 1541 mSDtfsCounter, 15794 mSDsluCounter, 21802 mSDsCounter, 0 mSdLazyCounter, 1719 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15794 SdHoareTripleChecker+Valid, 23343 SdHoareTripleChecker+Invalid, 1790 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 1719 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 05:45:45,975 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15794 Valid, 23343 Invalid, 1790 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 1719 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 05:45:45,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19520 states. [2025-01-09 05:45:46,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19520 to 9741. [2025-01-09 05:45:46,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9741 states, 9739 states have (on average 1.3316562275387618) internal successors, (12969), 9740 states have internal predecessors, (12969), 0 states have call successors, (0), 0 states have 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:45:46,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9741 states to 9741 states and 12969 transitions. [2025-01-09 05:45:46,199 INFO L78 Accepts]: Start accepts. Automaton has 9741 states and 12969 transitions. Word has length 75 [2025-01-09 05:45:46,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:45:46,199 INFO L471 AbstractCegarLoop]: Abstraction has 9741 states and 12969 transitions. [2025-01-09 05:45:46,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 5.9714285714285715) internal successors, (209), 35 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:45:46,199 INFO L276 IsEmpty]: Start isEmpty. Operand 9741 states and 12969 transitions. [2025-01-09 05:45:46,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-01-09 05:45:46,200 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:45:46,200 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:45:46,210 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:45:46,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-01-09 05:45:46,404 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:45:46,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:45:46,404 INFO L85 PathProgramCache]: Analyzing trace with hash 1647941027, now seen corresponding path program 1 times [2025-01-09 05:45:46,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:45:46,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141644656] [2025-01-09 05:45:46,404 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:45:46,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:45:46,410 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-01-09 05:45:46,429 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-01-09 05:45:46,433 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:45:46,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:45:46,970 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:45:46,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:45:46,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141644656] [2025-01-09 05:45:46,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141644656] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 05:45:46,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [562278303] [2025-01-09 05:45:46,971 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:45:46,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:45:46,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:45:46,974 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:45:46,975 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:45:47,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-01-09 05:45:47,059 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-01-09 05:45:47,059 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:45:47,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:45:47,064 INFO L256 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 50 conjuncts are in the unsatisfiable core [2025-01-09 05:45:47,066 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:45:49,671 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:45:49,671 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 05:45:52,907 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:45:52,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [562278303] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 05:45:52,907 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 05:45:52,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 27, 23] total 58 [2025-01-09 05:45:52,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793716746] [2025-01-09 05:45:52,908 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 05:45:52,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2025-01-09 05:45:52,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:45:52,908 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2025-01-09 05:45:52,909 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=449, Invalid=2857, Unknown=0, NotChecked=0, Total=3306 [2025-01-09 05:45:52,909 INFO L87 Difference]: Start difference. First operand 9741 states and 12969 transitions. Second operand has 58 states, 58 states have (on average 3.603448275862069) internal successors, (209), 58 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:46:06,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:46:06,886 INFO L93 Difference]: Finished difference Result 13402 states and 17648 transitions. [2025-01-09 05:46:06,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2025-01-09 05:46:06,887 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 58 states have (on average 3.603448275862069) internal successors, (209), 58 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2025-01-09 05:46:06,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:46:06,896 INFO L225 Difference]: With dead ends: 13402 [2025-01-09 05:46:06,896 INFO L226 Difference]: Without dead ends: 8880 [2025-01-09 05:46:06,903 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5405 ImplicationChecksByTransitivity, 14.3s TimeCoverageRelationStatistics Valid=3468, Invalid=16272, Unknown=0, NotChecked=0, Total=19740 [2025-01-09 05:46:06,904 INFO L435 NwaCegarLoop]: 1527 mSDtfsCounter, 20876 mSDsluCounter, 27722 mSDsCounter, 0 mSdLazyCounter, 2517 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20876 SdHoareTripleChecker+Valid, 29249 SdHoareTripleChecker+Invalid, 2622 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 2517 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-01-09 05:46:06,904 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20876 Valid, 29249 Invalid, 2622 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [105 Valid, 2517 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-01-09 05:46:06,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8880 states. [2025-01-09 05:46:07,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8880 to 6617. [2025-01-09 05:46:07,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6617 states, 6615 states have (on average 1.3712773998488283) internal successors, (9071), 6616 states have internal predecessors, (9071), 0 states have call successors, (0), 0 states have 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:46:07,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6617 states to 6617 states and 9071 transitions. [2025-01-09 05:46:07,073 INFO L78 Accepts]: Start accepts. Automaton has 6617 states and 9071 transitions. Word has length 75 [2025-01-09 05:46:07,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:46:07,073 INFO L471 AbstractCegarLoop]: Abstraction has 6617 states and 9071 transitions. [2025-01-09 05:46:07,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 58 states have (on average 3.603448275862069) internal successors, (209), 58 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:46:07,074 INFO L276 IsEmpty]: Start isEmpty. Operand 6617 states and 9071 transitions. [2025-01-09 05:46:07,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-01-09 05:46:07,074 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:46:07,074 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:46:07,082 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:46:07,279 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,SelfDestructingSolverStorable24 [2025-01-09 05:46:07,279 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:46:07,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:46:07,279 INFO L85 PathProgramCache]: Analyzing trace with hash 1441370690, now seen corresponding path program 1 times [2025-01-09 05:46:07,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:46:07,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251025183] [2025-01-09 05:46:07,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:46:07,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:46:07,286 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-01-09 05:46:07,310 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-01-09 05:46:07,310 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:46:07,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:46:08,824 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:46:08,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:46:08,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251025183] [2025-01-09 05:46:08,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251025183] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 05:46:08,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1166422990] [2025-01-09 05:46:08,825 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:46:08,825 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:46:08,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:46:08,827 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:46:08,828 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:46:08,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-01-09 05:46:08,925 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-01-09 05:46:08,925 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:46:08,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:46:08,927 INFO L256 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-01-09 05:46:08,929 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:46:10,994 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:46:10,994 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 05:46:12,799 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:46:12,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1166422990] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 05:46:12,799 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 05:46:12,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 17, 20] total 59 [2025-01-09 05:46:12,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170729610] [2025-01-09 05:46:12,799 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 05:46:12,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2025-01-09 05:46:12,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:46:12,800 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2025-01-09 05:46:12,801 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=3169, Unknown=0, NotChecked=0, Total=3422 [2025-01-09 05:46:12,801 INFO L87 Difference]: Start difference. First operand 6617 states and 9071 transitions. Second operand has 59 states, 59 states have (on average 3.440677966101695) internal successors, (203), 59 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have 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:46:24,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:46:24,991 INFO L93 Difference]: Finished difference Result 19439 states and 25787 transitions. [2025-01-09 05:46:24,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2025-01-09 05:46:24,992 INFO L78 Accepts]: Start accepts. Automaton has has 59 states, 59 states have (on average 3.440677966101695) internal successors, (203), 59 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2025-01-09 05:46:24,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:46:25,005 INFO L225 Difference]: With dead ends: 19439 [2025-01-09 05:46:25,005 INFO L226 Difference]: Without dead ends: 16926 [2025-01-09 05:46:25,011 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5409 ImplicationChecksByTransitivity, 11.7s TimeCoverageRelationStatistics Valid=2817, Invalid=17775, Unknown=0, NotChecked=0, Total=20592 [2025-01-09 05:46:25,011 INFO L435 NwaCegarLoop]: 1495 mSDtfsCounter, 34989 mSDsluCounter, 24460 mSDsCounter, 0 mSdLazyCounter, 3067 mSolverCounterSat, 133 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34989 SdHoareTripleChecker+Valid, 25955 SdHoareTripleChecker+Invalid, 3200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 3067 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-01-09 05:46:25,011 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34989 Valid, 25955 Invalid, 3200 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [133 Valid, 3067 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-01-09 05:46:25,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16926 states. [2025-01-09 05:46:25,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16926 to 6458. [2025-01-09 05:46:25,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6458 states, 6456 states have (on average 1.3782527881040891) internal successors, (8898), 6457 states have internal predecessors, (8898), 0 states have call successors, (0), 0 states have 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:46:25,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6458 states to 6458 states and 8898 transitions. [2025-01-09 05:46:25,231 INFO L78 Accepts]: Start accepts. Automaton has 6458 states and 8898 transitions. Word has length 76 [2025-01-09 05:46:25,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:46:25,232 INFO L471 AbstractCegarLoop]: Abstraction has 6458 states and 8898 transitions. [2025-01-09 05:46:25,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 59 states have (on average 3.440677966101695) internal successors, (203), 59 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have 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:46:25,232 INFO L276 IsEmpty]: Start isEmpty. Operand 6458 states and 8898 transitions. [2025-01-09 05:46:25,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-01-09 05:46:25,234 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:46:25,234 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:46:25,241 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-01-09 05:46:25,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:46:25,435 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:46:25,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:46:25,435 INFO L85 PathProgramCache]: Analyzing trace with hash -767481135, now seen corresponding path program 1 times [2025-01-09 05:46:25,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:46:25,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692466910] [2025-01-09 05:46:25,435 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:46:25,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:46:25,444 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-01-09 05:46:25,459 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-01-09 05:46:25,459 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:46:25,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:46:25,960 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 30 proven. 74 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:46:25,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:46:25,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692466910] [2025-01-09 05:46:25,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692466910] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 05:46:25,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1620378163] [2025-01-09 05:46:25,960 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:46:25,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:46:25,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:46:25,962 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:46:25,970 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:46:26,029 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-01-09 05:46:26,074 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-01-09 05:46:26,074 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:46:26,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:46:26,080 INFO L256 TraceCheckSpWp]: Trace formula consists of 521 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-01-09 05:46:26,082 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:46:26,916 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 40 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:46:26,917 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 05:46:28,884 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 38 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:46:28,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1620378163] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 05:46:28,884 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 05:46:28,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 13] total 35 [2025-01-09 05:46:28,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441633795] [2025-01-09 05:46:28,885 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 05:46:28,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-01-09 05:46:28,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:46:28,885 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-01-09 05:46:28,886 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=1076, Unknown=0, NotChecked=0, Total=1190 [2025-01-09 05:46:28,886 INFO L87 Difference]: Start difference. First operand 6458 states and 8898 transitions. Second operand has 35 states, 35 states have (on average 9.228571428571428) internal successors, (323), 35 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)