./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.4.ufo.UNBOUNDED.pals+Problem12_label07.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/pals_lcr.4.ufo.UNBOUNDED.pals+Problem12_label07.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 4fdd5c1041cb450f4848a5d2243efab154355b9039f1e674dfe24010b27b76eb --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 05:47:35,003 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 05:47:35,063 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 05:47:35,068 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 05:47:35,070 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 05:47:35,090 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 05:47:35,091 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 05:47:35,091 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 05:47:35,091 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 05:47:35,091 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 05:47:35,091 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 05:47:35,091 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 05:47:35,091 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 05:47:35,092 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 05:47:35,092 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 05:47:35,092 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 05:47:35,092 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 05:47:35,092 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 05:47:35,092 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 05:47:35,092 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 05:47:35,092 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 05:47:35,092 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 05:47:35,092 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 05:47:35,092 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 05:47:35,093 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 05:47:35,093 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 05:47:35,093 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 05:47:35,093 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 05:47:35,093 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 05:47:35,093 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 05:47:35,093 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 05:47:35,093 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 05:47:35,093 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:47:35,093 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 05:47:35,093 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 05:47:35,093 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 05:47:35,093 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 05:47:35,093 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:47:35,093 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 05:47:35,093 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 05:47:35,093 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 05:47:35,094 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 05:47:35,094 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 05:47:35,094 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 05:47:35,094 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 05:47:35,094 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 05:47:35,094 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 05:47:35,094 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 05:47:35,094 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 -> 4fdd5c1041cb450f4848a5d2243efab154355b9039f1e674dfe24010b27b76eb [2025-01-09 05:47:35,412 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 05:47:35,419 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 05:47:35,420 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 05:47:35,421 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 05:47:35,421 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 05:47:35,422 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.4.ufo.UNBOUNDED.pals+Problem12_label07.c [2025-01-09 05:47:36,534 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d51957668/960b5511ef8e40faa9ad214aadb5f779/FLAG31dc508bc [2025-01-09 05:47:37,032 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 05:47:37,033 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.4.ufo.UNBOUNDED.pals+Problem12_label07.c [2025-01-09 05:47:37,061 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d51957668/960b5511ef8e40faa9ad214aadb5f779/FLAG31dc508bc [2025-01-09 05:47:37,120 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d51957668/960b5511ef8e40faa9ad214aadb5f779 [2025-01-09 05:47:37,122 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 05:47:37,123 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 05:47:37,125 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 05:47:37,125 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 05:47:37,128 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 05:47:37,129 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 05:47:37" (1/1) ... [2025-01-09 05:47:37,129 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2545dd05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:47:37, skipping insertion in model container [2025-01-09 05:47:37,129 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 05:47:37" (1/1) ... [2025-01-09 05:47:37,203 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 05:47:37,489 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.4.ufo.UNBOUNDED.pals+Problem12_label07.c[8712,8725] [2025-01-09 05:47:37,517 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.4.ufo.UNBOUNDED.pals+Problem12_label07.c[9554,9567] [2025-01-09 05:47:37,998 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 05:47:38,011 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 05:47:38,035 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.4.ufo.UNBOUNDED.pals+Problem12_label07.c[8712,8725] [2025-01-09 05:47:38,041 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.4.ufo.UNBOUNDED.pals+Problem12_label07.c[9554,9567] [2025-01-09 05:47:38,316 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 05:47:38,335 INFO L204 MainTranslator]: Completed translation [2025-01-09 05:47:38,336 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:47:38 WrapperNode [2025-01-09 05:47:38,337 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 05:47:38,337 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 05:47:38,338 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 05:47:38,339 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 05:47:38,342 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:47:38" (1/1) ... [2025-01-09 05:47:38,386 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:47:38" (1/1) ... [2025-01-09 05:47:38,665 INFO L138 Inliner]: procedures = 36, calls = 21, calls flagged for inlining = 16, calls inlined = 16, statements flattened = 5033 [2025-01-09 05:47:38,666 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 05:47:38,666 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 05:47:38,666 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 05:47:38,667 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 05:47:38,673 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:47:38" (1/1) ... [2025-01-09 05:47:38,673 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:47:38" (1/1) ... [2025-01-09 05:47:38,705 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:47:38" (1/1) ... [2025-01-09 05:47:38,861 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 05:47:38,861 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:47:38" (1/1) ... [2025-01-09 05:47:38,861 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:47:38" (1/1) ... [2025-01-09 05:47:38,947 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:47:38" (1/1) ... [2025-01-09 05:47:38,964 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:47:38" (1/1) ... [2025-01-09 05:47:38,989 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:47:38" (1/1) ... [2025-01-09 05:47:39,027 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:47:38" (1/1) ... [2025-01-09 05:47:39,046 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:47:38" (1/1) ... [2025-01-09 05:47:39,084 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 05:47:39,086 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 05:47:39,086 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 05:47:39,086 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 05:47:39,087 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:47:38" (1/1) ... [2025-01-09 05:47:39,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:47:39,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:47:39,159 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 05:47:39,162 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 05:47:39,177 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 05:47:39,177 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 05:47:39,178 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 05:47:39,178 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 05:47:39,261 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 05:47:39,262 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 05:47:42,649 INFO L? ?]: Removed 739 outVars from TransFormulas that were not future-live. [2025-01-09 05:47:42,649 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 05:47:42,684 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 05:47:42,684 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2025-01-09 05:47:42,684 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 05:47:42 BoogieIcfgContainer [2025-01-09 05:47:42,684 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 05:47:42,689 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 05:47:42,689 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 05:47:42,693 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 05:47:42,693 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 05:47:37" (1/3) ... [2025-01-09 05:47:42,694 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68b02cf9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 05:47:42, skipping insertion in model container [2025-01-09 05:47:42,695 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:47:38" (2/3) ... [2025-01-09 05:47:42,695 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68b02cf9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 05:47:42, skipping insertion in model container [2025-01-09 05:47:42,695 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 05:47:42" (3/3) ... [2025-01-09 05:47:42,696 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.4.ufo.UNBOUNDED.pals+Problem12_label07.c [2025-01-09 05:47:42,707 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 05:47:42,713 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.4.ufo.UNBOUNDED.pals+Problem12_label07.c that has 1 procedures, 886 locations, 1 initial locations, 2 loop locations, and 2 error locations. [2025-01-09 05:47:42,843 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 05:47:42,867 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;@c56aa26, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 05:47:42,868 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-01-09 05:47:42,879 INFO L276 IsEmpty]: Start isEmpty. Operand has 886 states, 883 states have (on average 1.9037372593431483) internal successors, (1681), 885 states have internal predecessors, (1681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:47:42,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-01-09 05:47:42,887 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:47:42,888 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:47:42,888 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:47:42,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:47:42,897 INFO L85 PathProgramCache]: Analyzing trace with hash 2101757216, now seen corresponding path program 1 times [2025-01-09 05:47:42,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:47:42,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939397013] [2025-01-09 05:47:42,913 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:47:42,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:47:43,030 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-09 05:47:43,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-09 05:47:43,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:47:43,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:47:43,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:47:43,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:47:43,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939397013] [2025-01-09 05:47:43,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939397013] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:47:43,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:47:43,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 05:47:43,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044448506] [2025-01-09 05:47:43,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:47:43,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:47:43,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:47:43,248 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:47:43,248 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:47:43,256 INFO L87 Difference]: Start difference. First operand has 886 states, 883 states have (on average 1.9037372593431483) internal successors, (1681), 885 states have internal predecessors, (1681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:47:47,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:47:47,668 INFO L93 Difference]: Finished difference Result 2513 states and 4824 transitions. [2025-01-09 05:47:47,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:47:47,670 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 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 7 [2025-01-09 05:47:47,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:47:47,704 INFO L225 Difference]: With dead ends: 2513 [2025-01-09 05:47:47,706 INFO L226 Difference]: Without dead ends: 1572 [2025-01-09 05:47:47,716 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:47:47,723 INFO L435 NwaCegarLoop]: 628 mSDtfsCounter, 926 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 2337 mSolverCounterSat, 696 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 926 SdHoareTripleChecker+Valid, 639 SdHoareTripleChecker+Invalid, 3033 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 696 IncrementalHoareTripleChecker+Valid, 2337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2025-01-09 05:47:47,726 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [926 Valid, 639 Invalid, 3033 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [696 Valid, 2337 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2025-01-09 05:47:47,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1572 states. [2025-01-09 05:47:47,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1572 to 1572. [2025-01-09 05:47:47,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1572 states, 1570 states have (on average 1.6114649681528663) internal successors, (2530), 1571 states have internal predecessors, (2530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:47:47,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2530 transitions. [2025-01-09 05:47:47,995 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2530 transitions. Word has length 7 [2025-01-09 05:47:47,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:47:47,996 INFO L471 AbstractCegarLoop]: Abstraction has 1572 states and 2530 transitions. [2025-01-09 05:47:47,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:47:47,996 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2530 transitions. [2025-01-09 05:47:48,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-01-09 05:47:48,001 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:47:48,001 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:47:48,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 05:47:48,001 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:47:48,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:47:48,003 INFO L85 PathProgramCache]: Analyzing trace with hash 37471187, now seen corresponding path program 1 times [2025-01-09 05:47:48,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:47:48,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304462100] [2025-01-09 05:47:48,003 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:47:48,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:47:48,015 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-09 05:47:48,044 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-09 05:47:48,045 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:47:48,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:47:48,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:47:48,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:47:48,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304462100] [2025-01-09 05:47:48,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304462100] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:47:48,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:47:48,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 05:47:48,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218673677] [2025-01-09 05:47:48,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:47:48,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 05:47:48,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:47:48,215 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 05:47:48,215 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 05:47:48,215 INFO L87 Difference]: Start difference. First operand 1572 states and 2530 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:47:48,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:47:48,301 INFO L93 Difference]: Finished difference Result 1614 states and 2594 transitions. [2025-01-09 05:47:48,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 05:47:48,302 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-01-09 05:47:48,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:47:48,310 INFO L225 Difference]: With dead ends: 1614 [2025-01-09 05:47:48,313 INFO L226 Difference]: Without dead ends: 1572 [2025-01-09 05:47:48,314 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 05:47:48,314 INFO L435 NwaCegarLoop]: 1549 mSDtfsCounter, 0 mSDsluCounter, 4619 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6168 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:47:48,314 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6168 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:47:48,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1572 states. [2025-01-09 05:47:48,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1572 to 1572. [2025-01-09 05:47:48,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1572 states, 1570 states have (on average 1.5968152866242038) internal successors, (2507), 1571 states have internal predecessors, (2507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:47:48,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2507 transitions. [2025-01-09 05:47:48,354 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2507 transitions. Word has length 22 [2025-01-09 05:47:48,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:47:48,354 INFO L471 AbstractCegarLoop]: Abstraction has 1572 states and 2507 transitions. [2025-01-09 05:47:48,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:47:48,354 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2507 transitions. [2025-01-09 05:47:48,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-01-09 05:47:48,355 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:47:48,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] [2025-01-09 05:47:48,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 05:47:48,355 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:47:48,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:47:48,356 INFO L85 PathProgramCache]: Analyzing trace with hash 467871054, now seen corresponding path program 1 times [2025-01-09 05:47:48,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:47:48,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054299120] [2025-01-09 05:47:48,356 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:47:48,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:47:48,363 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-01-09 05:47:48,371 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-01-09 05:47:48,371 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:47:48,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:47:48,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:47:48,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:47:48,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054299120] [2025-01-09 05:47:48,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054299120] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:47:48,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:47:48,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:47:48,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727260520] [2025-01-09 05:47:48,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:47:48,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:47:48,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:47:48,462 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:47:48,463 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:47:48,463 INFO L87 Difference]: Start difference. First operand 1572 states and 2507 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:47:48,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:47:48,586 INFO L93 Difference]: Finished difference Result 1876 states and 2987 transitions. [2025-01-09 05:47:48,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:47:48,587 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2025-01-09 05:47:48,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:47:48,593 INFO L225 Difference]: With dead ends: 1876 [2025-01-09 05:47:48,593 INFO L226 Difference]: Without dead ends: 1838 [2025-01-09 05:47:48,594 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-01-09 05:47:48,595 INFO L435 NwaCegarLoop]: 1522 mSDtfsCounter, 6285 mSDsluCounter, 613 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6285 SdHoareTripleChecker+Valid, 2135 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 05:47:48,595 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6285 Valid, 2135 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 05:47:48,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1838 states. [2025-01-09 05:47:48,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1838 to 1608. [2025-01-09 05:47:48,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1608 states, 1606 states have (on average 1.5965130759651307) internal successors, (2564), 1607 states have internal predecessors, (2564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:47:48,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1608 states to 1608 states and 2564 transitions. [2025-01-09 05:47:48,622 INFO L78 Accepts]: Start accepts. Automaton has 1608 states and 2564 transitions. Word has length 44 [2025-01-09 05:47:48,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:47:48,623 INFO L471 AbstractCegarLoop]: Abstraction has 1608 states and 2564 transitions. [2025-01-09 05:47:48,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:47:48,623 INFO L276 IsEmpty]: Start isEmpty. Operand 1608 states and 2564 transitions. [2025-01-09 05:47:48,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-01-09 05:47:48,624 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:47:48,624 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:47:48,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 05:47:48,624 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:47:48,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:47:48,625 INFO L85 PathProgramCache]: Analyzing trace with hash 1531785022, now seen corresponding path program 1 times [2025-01-09 05:47:48,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:47:48,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524428988] [2025-01-09 05:47:48,625 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:47:48,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:47:48,631 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-01-09 05:47:48,639 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-01-09 05:47:48,639 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:47:48,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:47:48,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:47:48,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:47:48,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524428988] [2025-01-09 05:47:48,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524428988] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:47:48,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:47:48,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:47:48,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552619399] [2025-01-09 05:47:48,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:47:48,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:47:48,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:47:48,690 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:47:48,690 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:47:48,690 INFO L87 Difference]: Start difference. First operand 1608 states and 2564 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:47:48,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:47:48,718 INFO L93 Difference]: Finished difference Result 1745 states and 2779 transitions. [2025-01-09 05:47:48,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:47:48,719 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2025-01-09 05:47:48,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:47:48,723 INFO L225 Difference]: With dead ends: 1745 [2025-01-09 05:47:48,723 INFO L226 Difference]: Without dead ends: 1671 [2025-01-09 05:47:48,724 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:47:48,724 INFO L435 NwaCegarLoop]: 1524 mSDtfsCounter, 1476 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1476 SdHoareTripleChecker+Valid, 1577 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:47:48,724 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1476 Valid, 1577 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:47:48,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1671 states. [2025-01-09 05:47:48,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1671 to 1667. [2025-01-09 05:47:48,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1667 states, 1665 states have (on average 1.593993993993994) internal successors, (2654), 1666 states have internal predecessors, (2654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:47:48,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1667 states to 1667 states and 2654 transitions. [2025-01-09 05:47:48,749 INFO L78 Accepts]: Start accepts. Automaton has 1667 states and 2654 transitions. Word has length 46 [2025-01-09 05:47:48,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:47:48,749 INFO L471 AbstractCegarLoop]: Abstraction has 1667 states and 2654 transitions. [2025-01-09 05:47:48,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:47:48,749 INFO L276 IsEmpty]: Start isEmpty. Operand 1667 states and 2654 transitions. [2025-01-09 05:47:48,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-01-09 05:47:48,750 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:47:48,750 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:47:48,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 05:47:48,750 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:47:48,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:47:48,751 INFO L85 PathProgramCache]: Analyzing trace with hash 1598278534, now seen corresponding path program 1 times [2025-01-09 05:47:48,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:47:48,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366459922] [2025-01-09 05:47:48,751 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:47:48,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:47:48,757 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-01-09 05:47:48,763 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-01-09 05:47:48,764 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:47:48,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:47:49,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:47:49,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:47:49,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366459922] [2025-01-09 05:47:49,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366459922] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:47:49,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:47:49,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:47:49,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190323754] [2025-01-09 05:47:49,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:47:49,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:47:49,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:47:49,007 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:47:49,007 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:47:49,008 INFO L87 Difference]: Start difference. First operand 1667 states and 2654 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:47:49,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:47:49,109 INFO L93 Difference]: Finished difference Result 1802 states and 2862 transitions. [2025-01-09 05:47:49,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 05:47:49,110 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2025-01-09 05:47:49,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:47:49,114 INFO L225 Difference]: With dead ends: 1802 [2025-01-09 05:47:49,114 INFO L226 Difference]: Without dead ends: 1669 [2025-01-09 05:47:49,115 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2025-01-09 05:47:49,115 INFO L435 NwaCegarLoop]: 1522 mSDtfsCounter, 2974 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2974 SdHoareTripleChecker+Valid, 1693 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:47:49,115 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2974 Valid, 1693 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:47:49,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1669 states. [2025-01-09 05:47:49,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1669 to 1667. [2025-01-09 05:47:49,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1667 states, 1665 states have (on average 1.5927927927927927) internal successors, (2652), 1666 states have internal predecessors, (2652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:47:49,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1667 states to 1667 states and 2652 transitions. [2025-01-09 05:47:49,140 INFO L78 Accepts]: Start accepts. Automaton has 1667 states and 2652 transitions. Word has length 46 [2025-01-09 05:47:49,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:47:49,140 INFO L471 AbstractCegarLoop]: Abstraction has 1667 states and 2652 transitions. [2025-01-09 05:47:49,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:47:49,140 INFO L276 IsEmpty]: Start isEmpty. Operand 1667 states and 2652 transitions. [2025-01-09 05:47:49,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-01-09 05:47:49,145 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:47:49,145 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:47:49,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 05:47:49,145 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:47:49,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:47:49,145 INFO L85 PathProgramCache]: Analyzing trace with hash 1887271147, now seen corresponding path program 1 times [2025-01-09 05:47:49,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:47:49,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625966882] [2025-01-09 05:47:49,145 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:47:49,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:47:49,155 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-01-09 05:47:49,175 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-01-09 05:47:49,175 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:47:49,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:47:49,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:47:49,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:47:49,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625966882] [2025-01-09 05:47:49,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625966882] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:47:49,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:47:49,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 05:47:49,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931857132] [2025-01-09 05:47:49,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:47:49,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 05:47:49,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:47:49,394 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 05:47:49,394 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 05:47:49,394 INFO L87 Difference]: Start difference. First operand 1667 states and 2652 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:47:49,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:47:49,453 INFO L93 Difference]: Finished difference Result 1675 states and 2661 transitions. [2025-01-09 05:47:49,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 05:47:49,453 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2025-01-09 05:47:49,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:47:49,462 INFO L225 Difference]: With dead ends: 1675 [2025-01-09 05:47:49,462 INFO L226 Difference]: Without dead ends: 1673 [2025-01-09 05:47:49,463 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 05:47:49,463 INFO L435 NwaCegarLoop]: 1525 mSDtfsCounter, 0 mSDsluCounter, 4566 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6091 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:47:49,463 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6091 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:47:49,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1673 states. [2025-01-09 05:47:49,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1673 to 1673. [2025-01-09 05:47:49,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1673 states, 1671 states have (on average 1.590065828845003) internal successors, (2657), 1672 states have internal predecessors, (2657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:47:49,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1673 states to 1673 states and 2657 transitions. [2025-01-09 05:47:49,517 INFO L78 Accepts]: Start accepts. Automaton has 1673 states and 2657 transitions. Word has length 47 [2025-01-09 05:47:49,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:47:49,518 INFO L471 AbstractCegarLoop]: Abstraction has 1673 states and 2657 transitions. [2025-01-09 05:47:49,518 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:47:49,518 INFO L276 IsEmpty]: Start isEmpty. Operand 1673 states and 2657 transitions. [2025-01-09 05:47:49,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-01-09 05:47:49,518 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:47:49,522 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:47:49,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 05:47:49,523 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:47:49,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:47:49,523 INFO L85 PathProgramCache]: Analyzing trace with hash 251428358, now seen corresponding path program 1 times [2025-01-09 05:47:49,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:47:49,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056764911] [2025-01-09 05:47:49,523 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:47:49,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:47:49,532 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-01-09 05:47:49,542 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-01-09 05:47:49,542 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:47:49,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:47:49,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:47:49,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:47:49,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056764911] [2025-01-09 05:47:49,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056764911] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:47:49,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:47:49,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:47:49,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748881039] [2025-01-09 05:47:49,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:47:49,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:47:49,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:47:49,597 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:47:49,600 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:47:49,601 INFO L87 Difference]: Start difference. First operand 1673 states and 2657 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:47:49,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:47:49,642 INFO L93 Difference]: Finished difference Result 1935 states and 3049 transitions. [2025-01-09 05:47:49,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:47:49,643 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2025-01-09 05:47:49,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:47:49,653 INFO L225 Difference]: With dead ends: 1935 [2025-01-09 05:47:49,656 INFO L226 Difference]: Without dead ends: 1796 [2025-01-09 05:47:49,657 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:47:49,658 INFO L435 NwaCegarLoop]: 1565 mSDtfsCounter, 1487 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1487 SdHoareTripleChecker+Valid, 1630 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:47:49,658 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1487 Valid, 1630 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:47:49,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1796 states. [2025-01-09 05:47:49,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1796 to 1794. [2025-01-09 05:47:49,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1794 states, 1792 states have (on average 1.5814732142857142) internal successors, (2834), 1793 states have internal predecessors, (2834), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:47:49,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1794 states to 1794 states and 2834 transitions. [2025-01-09 05:47:49,713 INFO L78 Accepts]: Start accepts. Automaton has 1794 states and 2834 transitions. Word has length 48 [2025-01-09 05:47:49,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:47:49,713 INFO L471 AbstractCegarLoop]: Abstraction has 1794 states and 2834 transitions. [2025-01-09 05:47:49,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:47:49,713 INFO L276 IsEmpty]: Start isEmpty. Operand 1794 states and 2834 transitions. [2025-01-09 05:47:49,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-01-09 05:47:49,714 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:47:49,714 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:47:49,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 05:47:49,714 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:47:49,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:47:49,714 INFO L85 PathProgramCache]: Analyzing trace with hash -1964040442, now seen corresponding path program 1 times [2025-01-09 05:47:49,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:47:49,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858707388] [2025-01-09 05:47:49,714 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:47:49,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:47:49,723 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-01-09 05:47:49,731 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-01-09 05:47:49,735 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:47:49,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:47:49,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:47:49,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:47:49,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858707388] [2025-01-09 05:47:49,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858707388] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:47:49,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:47:49,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:47:49,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291732033] [2025-01-09 05:47:49,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:47:49,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:47:49,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:47:49,785 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:47:49,785 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:47:49,786 INFO L87 Difference]: Start difference. First operand 1794 states and 2834 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:47:49,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:47:49,832 INFO L93 Difference]: Finished difference Result 2282 states and 3552 transitions. [2025-01-09 05:47:49,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:47:49,833 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2025-01-09 05:47:49,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:47:49,842 INFO L225 Difference]: With dead ends: 2282 [2025-01-09 05:47:49,842 INFO L226 Difference]: Without dead ends: 2022 [2025-01-09 05:47:49,843 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:47:49,848 INFO L435 NwaCegarLoop]: 1563 mSDtfsCounter, 1485 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1485 SdHoareTripleChecker+Valid, 1632 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:47:49,848 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1485 Valid, 1632 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:47:49,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2022 states. [2025-01-09 05:47:49,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2022 to 2020. [2025-01-09 05:47:49,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2020 states, 2018 states have (on average 1.5639246778989098) internal successors, (3156), 2019 states have internal predecessors, (3156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:47:49,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2020 states to 2020 states and 3156 transitions. [2025-01-09 05:47:49,910 INFO L78 Accepts]: Start accepts. Automaton has 2020 states and 3156 transitions. Word has length 48 [2025-01-09 05:47:49,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:47:49,910 INFO L471 AbstractCegarLoop]: Abstraction has 2020 states and 3156 transitions. [2025-01-09 05:47:49,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:47:49,910 INFO L276 IsEmpty]: Start isEmpty. Operand 2020 states and 3156 transitions. [2025-01-09 05:47:49,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-01-09 05:47:49,911 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:47:49,911 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:47:49,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 05:47:49,911 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:47:49,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:47:49,911 INFO L85 PathProgramCache]: Analyzing trace with hash -183107578, now seen corresponding path program 1 times [2025-01-09 05:47:49,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:47:49,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854436309] [2025-01-09 05:47:49,911 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:47:49,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:47:49,921 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-01-09 05:47:49,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-01-09 05:47:49,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:47:49,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:47:49,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:47:49,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:47:49,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854436309] [2025-01-09 05:47:49,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854436309] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:47:49,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:47:49,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:47:49,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742528970] [2025-01-09 05:47:49,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:47:49,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:47:49,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:47:49,985 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:47:49,985 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:47:49,986 INFO L87 Difference]: Start difference. First operand 2020 states and 3156 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:47:50,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:47:50,047 INFO L93 Difference]: Finished difference Result 2928 states and 4462 transitions. [2025-01-09 05:47:50,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:47:50,048 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2025-01-09 05:47:50,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:47:50,063 INFO L225 Difference]: With dead ends: 2928 [2025-01-09 05:47:50,063 INFO L226 Difference]: Without dead ends: 2442 [2025-01-09 05:47:50,064 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:47:50,064 INFO L435 NwaCegarLoop]: 1561 mSDtfsCounter, 1483 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1483 SdHoareTripleChecker+Valid, 1634 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:47:50,064 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1483 Valid, 1634 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:47:50,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2442 states. [2025-01-09 05:47:50,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2442 to 2440. [2025-01-09 05:47:50,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2440 states, 2438 states have (on average 1.5324036095159967) internal successors, (3736), 2439 states have internal predecessors, (3736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:47:50,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2440 states to 2440 states and 3736 transitions. [2025-01-09 05:47:50,147 INFO L78 Accepts]: Start accepts. Automaton has 2440 states and 3736 transitions. Word has length 48 [2025-01-09 05:47:50,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:47:50,152 INFO L471 AbstractCegarLoop]: Abstraction has 2440 states and 3736 transitions. [2025-01-09 05:47:50,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:47:50,153 INFO L276 IsEmpty]: Start isEmpty. Operand 2440 states and 3736 transitions. [2025-01-09 05:47:50,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-01-09 05:47:50,153 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:47:50,153 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:47:50,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 05:47:50,153 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:47:50,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:47:50,153 INFO L85 PathProgramCache]: Analyzing trace with hash 211109921, now seen corresponding path program 1 times [2025-01-09 05:47:50,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:47:50,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341226695] [2025-01-09 05:47:50,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:47:50,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:47:50,163 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-01-09 05:47:50,169 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-01-09 05:47:50,169 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:47:50,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:47:50,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:47:50,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:47:50,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341226695] [2025-01-09 05:47:50,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341226695] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:47:50,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:47:50,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:47:50,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708051980] [2025-01-09 05:47:50,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:47:50,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:47:50,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:47:50,210 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:47:50,210 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:47:50,210 INFO L87 Difference]: Start difference. First operand 2440 states and 3736 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:47:50,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:47:50,245 INFO L93 Difference]: Finished difference Result 3407 states and 5134 transitions. [2025-01-09 05:47:50,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:47:50,246 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2025-01-09 05:47:50,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:47:50,253 INFO L225 Difference]: With dead ends: 3407 [2025-01-09 05:47:50,253 INFO L226 Difference]: Without dead ends: 2876 [2025-01-09 05:47:50,254 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:47:50,254 INFO L435 NwaCegarLoop]: 1570 mSDtfsCounter, 1486 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1486 SdHoareTripleChecker+Valid, 1631 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:47:50,254 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1486 Valid, 1631 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:47:50,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2876 states. [2025-01-09 05:47:50,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2876 to 2874. [2025-01-09 05:47:50,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2874 states, 2872 states have (on average 1.5104456824512535) internal successors, (4338), 2873 states have internal predecessors, (4338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:47:50,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2874 states to 2874 states and 4338 transitions. [2025-01-09 05:47:50,299 INFO L78 Accepts]: Start accepts. Automaton has 2874 states and 4338 transitions. Word has length 50 [2025-01-09 05:47:50,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:47:50,299 INFO L471 AbstractCegarLoop]: Abstraction has 2874 states and 4338 transitions. [2025-01-09 05:47:50,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:47:50,300 INFO L276 IsEmpty]: Start isEmpty. Operand 2874 states and 4338 transitions. [2025-01-09 05:47:50,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-01-09 05:47:50,300 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:47:50,300 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:47:50,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 05:47:50,301 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:47:50,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:47:50,301 INFO L85 PathProgramCache]: Analyzing trace with hash 1730235462, now seen corresponding path program 1 times [2025-01-09 05:47:50,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:47:50,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492224177] [2025-01-09 05:47:50,301 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:47:50,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:47:50,309 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-01-09 05:47:50,315 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-01-09 05:47:50,316 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:47:50,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:47:50,393 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 05:47:50,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:47:50,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492224177] [2025-01-09 05:47:50,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492224177] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:47:50,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:47:50,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:47:50,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955392773] [2025-01-09 05:47:50,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:47:50,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:47:50,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:47:50,394 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:47:50,394 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:47:50,394 INFO L87 Difference]: Start difference. First operand 2874 states and 4338 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:47:50,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:47:50,544 INFO L93 Difference]: Finished difference Result 8524 states and 12295 transitions. [2025-01-09 05:47:50,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 05:47:50,545 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2025-01-09 05:47:50,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:47:50,563 INFO L225 Difference]: With dead ends: 8524 [2025-01-09 05:47:50,563 INFO L226 Difference]: Without dead ends: 7186 [2025-01-09 05:47:50,566 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-01-09 05:47:50,566 INFO L435 NwaCegarLoop]: 1582 mSDtfsCounter, 4663 mSDsluCounter, 1786 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4663 SdHoareTripleChecker+Valid, 3368 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:47:50,569 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4663 Valid, 3368 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:47:50,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7186 states. [2025-01-09 05:47:50,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7186 to 4210. [2025-01-09 05:47:50,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4210 states, 4208 states have (on average 1.4738593155893536) internal successors, (6202), 4209 states have internal predecessors, (6202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:47:50,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4210 states to 4210 states and 6202 transitions. [2025-01-09 05:47:50,886 INFO L78 Accepts]: Start accepts. Automaton has 4210 states and 6202 transitions. Word has length 65 [2025-01-09 05:47:50,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:47:50,886 INFO L471 AbstractCegarLoop]: Abstraction has 4210 states and 6202 transitions. [2025-01-09 05:47:50,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:47:50,886 INFO L276 IsEmpty]: Start isEmpty. Operand 4210 states and 6202 transitions. [2025-01-09 05:47:50,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-01-09 05:47:50,891 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:47:50,891 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:47:50,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 05:47:50,892 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:47:50,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:47:50,892 INFO L85 PathProgramCache]: Analyzing trace with hash -485233338, now seen corresponding path program 1 times [2025-01-09 05:47:50,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:47:50,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625935093] [2025-01-09 05:47:50,892 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:47:50,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:47:50,899 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-01-09 05:47:50,912 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-01-09 05:47:50,916 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:47:50,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:47:51,066 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-09 05:47:51,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:47:51,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625935093] [2025-01-09 05:47:51,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625935093] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:47:51,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:47:51,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:47:51,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053495375] [2025-01-09 05:47:51,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:47:51,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:47:51,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:47:51,067 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:47:51,067 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:47:51,068 INFO L87 Difference]: Start difference. First operand 4210 states and 6202 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:47:51,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:47:51,415 INFO L93 Difference]: Finished difference Result 9860 states and 14159 transitions. [2025-01-09 05:47:51,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 05:47:51,417 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2025-01-09 05:47:51,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:47:51,451 INFO L225 Difference]: With dead ends: 9860 [2025-01-09 05:47:51,451 INFO L226 Difference]: Without dead ends: 8522 [2025-01-09 05:47:51,458 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-01-09 05:47:51,459 INFO L435 NwaCegarLoop]: 1579 mSDtfsCounter, 4692 mSDsluCounter, 1732 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4692 SdHoareTripleChecker+Valid, 3311 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 05:47:51,459 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4692 Valid, 3311 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 05:47:51,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8522 states. [2025-01-09 05:47:51,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8522 to 6218. [2025-01-09 05:47:51,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6218 states, 6216 states have (on average 1.4443371943371943) internal successors, (8978), 6217 states have internal predecessors, (8978), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:47:51,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6218 states to 6218 states and 8978 transitions. [2025-01-09 05:47:51,808 INFO L78 Accepts]: Start accepts. Automaton has 6218 states and 8978 transitions. Word has length 65 [2025-01-09 05:47:51,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:47:51,808 INFO L471 AbstractCegarLoop]: Abstraction has 6218 states and 8978 transitions. [2025-01-09 05:47:51,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:47:51,811 INFO L276 IsEmpty]: Start isEmpty. Operand 6218 states and 8978 transitions. [2025-01-09 05:47:51,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-01-09 05:47:51,813 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:47:51,813 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:47:51,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 05:47:51,814 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:47:51,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:47:51,814 INFO L85 PathProgramCache]: Analyzing trace with hash 1295699526, now seen corresponding path program 1 times [2025-01-09 05:47:51,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:47:51,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508411970] [2025-01-09 05:47:51,814 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:47:51,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:47:51,830 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-01-09 05:47:51,846 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-01-09 05:47:51,849 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:47:51,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:47:52,043 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-09 05:47:52,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:47:52,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508411970] [2025-01-09 05:47:52,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508411970] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:47:52,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:47:52,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:47:52,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135696950] [2025-01-09 05:47:52,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:47:52,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:47:52,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:47:52,049 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:47:52,049 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:47:52,049 INFO L87 Difference]: Start difference. First operand 6218 states and 8978 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:47:52,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:47:52,381 INFO L93 Difference]: Finished difference Result 11196 states and 16023 transitions. [2025-01-09 05:47:52,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 05:47:52,382 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2025-01-09 05:47:52,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:47:52,400 INFO L225 Difference]: With dead ends: 11196 [2025-01-09 05:47:52,400 INFO L226 Difference]: Without dead ends: 9858 [2025-01-09 05:47:52,405 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-01-09 05:47:52,406 INFO L435 NwaCegarLoop]: 1583 mSDtfsCounter, 4673 mSDsluCounter, 1774 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4673 SdHoareTripleChecker+Valid, 3357 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 05:47:52,407 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4673 Valid, 3357 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 05:47:52,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9858 states. [2025-01-09 05:47:52,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9858 to 7554. [2025-01-09 05:47:52,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7554 states, 7552 states have (on average 1.435646186440678) internal successors, (10842), 7553 states have internal predecessors, (10842), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:47:52,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7554 states to 7554 states and 10842 transitions. [2025-01-09 05:47:52,567 INFO L78 Accepts]: Start accepts. Automaton has 7554 states and 10842 transitions. Word has length 65 [2025-01-09 05:47:52,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:47:52,567 INFO L471 AbstractCegarLoop]: Abstraction has 7554 states and 10842 transitions. [2025-01-09 05:47:52,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:47:52,568 INFO L276 IsEmpty]: Start isEmpty. Operand 7554 states and 10842 transitions. [2025-01-09 05:47:52,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-01-09 05:47:52,572 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:47:52,572 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:47:52,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 05:47:52,572 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:47:52,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:47:52,572 INFO L85 PathProgramCache]: Analyzing trace with hash -289438111, now seen corresponding path program 1 times [2025-01-09 05:47:52,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:47:52,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792528731] [2025-01-09 05:47:52,573 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:47:52,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:47:52,586 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-01-09 05:47:52,593 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-01-09 05:47:52,593 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:47:52,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:47:52,690 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 05:47:52,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:47:52,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792528731] [2025-01-09 05:47:52,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792528731] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:47:52,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:47:52,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:47:52,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030959294] [2025-01-09 05:47:52,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:47:52,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:47:52,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:47:52,692 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:47:52,692 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:47:52,692 INFO L87 Difference]: Start difference. First operand 7554 states and 10842 transitions. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:47:53,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:47:53,004 INFO L93 Difference]: Finished difference Result 11780 states and 16863 transitions. [2025-01-09 05:47:53,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 05:47:53,004 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2025-01-09 05:47:53,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:47:53,024 INFO L225 Difference]: With dead ends: 11780 [2025-01-09 05:47:53,024 INFO L226 Difference]: Without dead ends: 10818 [2025-01-09 05:47:53,028 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-01-09 05:47:53,028 INFO L435 NwaCegarLoop]: 1584 mSDtfsCounter, 4659 mSDsluCounter, 1833 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4659 SdHoareTripleChecker+Valid, 3417 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 05:47:53,029 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4659 Valid, 3417 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 05:47:53,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10818 states. [2025-01-09 05:47:53,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10818 to 8514. [2025-01-09 05:47:53,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8514 states, 8512 states have (on average 1.4335056390977443) internal successors, (12202), 8513 states have internal predecessors, (12202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:47:53,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8514 states to 8514 states and 12202 transitions. [2025-01-09 05:47:53,324 INFO L78 Accepts]: Start accepts. Automaton has 8514 states and 12202 transitions. Word has length 67 [2025-01-09 05:47:53,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:47:53,324 INFO L471 AbstractCegarLoop]: Abstraction has 8514 states and 12202 transitions. [2025-01-09 05:47:53,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:47:53,324 INFO L276 IsEmpty]: Start isEmpty. Operand 8514 states and 12202 transitions. [2025-01-09 05:47:53,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-01-09 05:47:53,325 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:47:53,326 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:47:53,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 05:47:53,326 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:47:53,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:47:53,326 INFO L85 PathProgramCache]: Analyzing trace with hash -745270146, now seen corresponding path program 1 times [2025-01-09 05:47:53,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:47:53,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801456842] [2025-01-09 05:47:53,327 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:47:53,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:47:53,333 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-01-09 05:47:53,347 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-01-09 05:47:53,347 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:47:53,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:47:53,458 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:47:53,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:47:53,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801456842] [2025-01-09 05:47:53,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801456842] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:47:53,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:47:53,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:47:53,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112473922] [2025-01-09 05:47:53,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:47:53,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:47:53,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:47:53,459 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:47:53,459 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:47:53,459 INFO L87 Difference]: Start difference. First operand 8514 states and 12202 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:47:53,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:47:53,543 INFO L93 Difference]: Finished difference Result 13816 states and 19703 transitions. [2025-01-09 05:47:53,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:47:53,544 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2025-01-09 05:47:53,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:47:53,553 INFO L225 Difference]: With dead ends: 13816 [2025-01-09 05:47:53,553 INFO L226 Difference]: Without dead ends: 6838 [2025-01-09 05:47:53,559 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:47:53,560 INFO L435 NwaCegarLoop]: 1560 mSDtfsCounter, 42 mSDsluCounter, 1513 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 3073 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:47:53,560 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 3073 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:47:53,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6838 states. [2025-01-09 05:47:53,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6838 to 6836. [2025-01-09 05:47:53,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6836 states, 6834 states have (on average 1.4427860696517414) internal successors, (9860), 6835 states have internal predecessors, (9860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:47:53,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6836 states to 6836 states and 9860 transitions. [2025-01-09 05:47:53,669 INFO L78 Accepts]: Start accepts. Automaton has 6836 states and 9860 transitions. Word has length 67 [2025-01-09 05:47:53,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:47:53,669 INFO L471 AbstractCegarLoop]: Abstraction has 6836 states and 9860 transitions. [2025-01-09 05:47:53,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:47:53,669 INFO L276 IsEmpty]: Start isEmpty. Operand 6836 states and 9860 transitions. [2025-01-09 05:47:53,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-01-09 05:47:53,670 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:47:53,670 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:47:53,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 05:47:53,670 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:47:53,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:47:53,671 INFO L85 PathProgramCache]: Analyzing trace with hash 1417744737, now seen corresponding path program 1 times [2025-01-09 05:47:53,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:47:53,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571778466] [2025-01-09 05:47:53,671 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:47:53,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:47:53,677 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-01-09 05:47:53,685 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-01-09 05:47:53,685 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:47:53,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:47:53,741 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:47:53,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:47:53,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571778466] [2025-01-09 05:47:53,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571778466] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:47:53,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:47:53,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:47:53,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281093206] [2025-01-09 05:47:53,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:47:53,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:47:53,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:47:53,742 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:47:53,742 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:47:53,743 INFO L87 Difference]: Start difference. First operand 6836 states and 9860 transitions. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:47:53,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:47:53,792 INFO L93 Difference]: Finished difference Result 9480 states and 13558 transitions. [2025-01-09 05:47:53,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:47:53,792 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2025-01-09 05:47:53,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:47:53,799 INFO L225 Difference]: With dead ends: 9480 [2025-01-09 05:47:53,799 INFO L226 Difference]: Without dead ends: 4198 [2025-01-09 05:47:53,804 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:47:53,805 INFO L435 NwaCegarLoop]: 1553 mSDtfsCounter, 37 mSDsluCounter, 1505 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 3058 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:47:53,805 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 3058 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:47:53,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4198 states. [2025-01-09 05:47:53,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4198 to 4196. [2025-01-09 05:47:53,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4196 states, 4194 states have (on average 1.4592274678111588) internal successors, (6120), 4195 states have internal predecessors, (6120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:47:53,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4196 states to 4196 states and 6120 transitions. [2025-01-09 05:47:53,869 INFO L78 Accepts]: Start accepts. Automaton has 4196 states and 6120 transitions. Word has length 68 [2025-01-09 05:47:53,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:47:53,869 INFO L471 AbstractCegarLoop]: Abstraction has 4196 states and 6120 transitions. [2025-01-09 05:47:53,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:47:53,869 INFO L276 IsEmpty]: Start isEmpty. Operand 4196 states and 6120 transitions. [2025-01-09 05:47:53,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-01-09 05:47:53,870 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:47:53,870 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:47:53,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 05:47:53,870 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:47:53,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:47:53,871 INFO L85 PathProgramCache]: Analyzing trace with hash 142724947, now seen corresponding path program 1 times [2025-01-09 05:47:53,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:47:53,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23454926] [2025-01-09 05:47:53,871 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:47:53,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:47:53,877 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-01-09 05:47:53,885 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-01-09 05:47:53,885 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:47:53,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:47:53,944 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:47:53,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:47:53,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23454926] [2025-01-09 05:47:53,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23454926] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:47:53,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:47:53,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:47:53,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764950558] [2025-01-09 05:47:53,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:47:53,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:47:53,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:47:53,945 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:47:53,946 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:47:53,946 INFO L87 Difference]: Start difference. First operand 4196 states and 6120 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:47:53,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:47:53,979 INFO L93 Difference]: Finished difference Result 5520 states and 7948 transitions. [2025-01-09 05:47:53,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:47:53,980 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2025-01-09 05:47:53,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:47:53,986 INFO L225 Difference]: With dead ends: 5520 [2025-01-09 05:47:53,986 INFO L226 Difference]: Without dead ends: 2878 [2025-01-09 05:47:53,988 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:47:53,989 INFO L435 NwaCegarLoop]: 1546 mSDtfsCounter, 34 mSDsluCounter, 1497 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 3043 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:47:53,989 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 3043 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:47:53,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2878 states. [2025-01-09 05:47:54,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2878 to 2876. [2025-01-09 05:47:54,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2876 states, 2874 states have (on average 1.4864300626304803) internal successors, (4272), 2875 states have internal predecessors, (4272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:47:54,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2876 states to 2876 states and 4272 transitions. [2025-01-09 05:47:54,030 INFO L78 Accepts]: Start accepts. Automaton has 2876 states and 4272 transitions. Word has length 70 [2025-01-09 05:47:54,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:47:54,030 INFO L471 AbstractCegarLoop]: Abstraction has 2876 states and 4272 transitions. [2025-01-09 05:47:54,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:47:54,031 INFO L276 IsEmpty]: Start isEmpty. Operand 2876 states and 4272 transitions. [2025-01-09 05:47:54,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-01-09 05:47:54,031 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:47:54,032 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:47:54,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 05:47:54,032 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:47:54,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:47:54,033 INFO L85 PathProgramCache]: Analyzing trace with hash -2030791739, now seen corresponding path program 1 times [2025-01-09 05:47:54,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:47:54,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419265490] [2025-01-09 05:47:54,033 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:47:54,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:47:54,040 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-01-09 05:47:54,049 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-01-09 05:47:54,049 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:47:54,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:47:54,110 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:47:54,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:47:54,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419265490] [2025-01-09 05:47:54,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419265490] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:47:54,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:47:54,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:47:54,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133305036] [2025-01-09 05:47:54,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:47:54,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:47:54,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:47:54,111 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:47:54,111 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:47:54,111 INFO L87 Difference]: Start difference. First operand 2876 states and 4272 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:47:54,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:47:54,134 INFO L93 Difference]: Finished difference Result 3540 states and 5176 transitions. [2025-01-09 05:47:54,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:47:54,135 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2025-01-09 05:47:54,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:47:54,138 INFO L225 Difference]: With dead ends: 3540 [2025-01-09 05:47:54,138 INFO L226 Difference]: Without dead ends: 2218 [2025-01-09 05:47:54,140 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:47:54,140 INFO L435 NwaCegarLoop]: 1539 mSDtfsCounter, 31 mSDsluCounter, 1489 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 3028 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:47:54,140 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 3028 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:47:54,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2218 states. [2025-01-09 05:47:54,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2218 to 2216. [2025-01-09 05:47:54,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2216 states, 2214 states have (on average 1.517163504968383) internal successors, (3359), 2215 states have internal predecessors, (3359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:47:54,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2216 states to 2216 states and 3359 transitions. [2025-01-09 05:47:54,171 INFO L78 Accepts]: Start accepts. Automaton has 2216 states and 3359 transitions. Word has length 72 [2025-01-09 05:47:54,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:47:54,171 INFO L471 AbstractCegarLoop]: Abstraction has 2216 states and 3359 transitions. [2025-01-09 05:47:54,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:47:54,171 INFO L276 IsEmpty]: Start isEmpty. Operand 2216 states and 3359 transitions. [2025-01-09 05:47:54,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-01-09 05:47:54,172 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:47:54,172 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:47:54,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 05:47:54,172 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:47:54,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:47:54,172 INFO L85 PathProgramCache]: Analyzing trace with hash -1062961481, now seen corresponding path program 1 times [2025-01-09 05:47:54,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:47:54,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441432117] [2025-01-09 05:47:54,172 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:47:54,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:47:54,181 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-01-09 05:47:54,197 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-01-09 05:47:54,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:47:54,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:47:55,617 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:47:55,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:47:55,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441432117] [2025-01-09 05:47:55,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441432117] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 05:47:55,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [155988710] [2025-01-09 05:47:55,617 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:47:55,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:47:55,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:47:55,619 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 05:47:55,624 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 05:47:55,682 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-01-09 05:47:55,719 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-01-09 05:47:55,719 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:47:55,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:47:55,721 INFO L256 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-01-09 05:47:55,724 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:47:55,973 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:47:55,973 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 05:47:56,203 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:47:56,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [155988710] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 05:47:56,203 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 05:47:56,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7, 6] total 22 [2025-01-09 05:47:56,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041019764] [2025-01-09 05:47:56,205 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 05:47:56,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-01-09 05:47:56,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:47:56,206 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-01-09 05:47:56,206 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=392, Unknown=0, NotChecked=0, Total=462 [2025-01-09 05:47:56,206 INFO L87 Difference]: Start difference. First operand 2216 states and 3359 transitions. Second operand has 22 states, 22 states have (on average 9.5) internal successors, (209), 22 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:47:59,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:47:59,548 INFO L93 Difference]: Finished difference Result 8272 states and 11407 transitions. [2025-01-09 05:47:59,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2025-01-09 05:47:59,549 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 9.5) internal successors, (209), 22 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2025-01-09 05:47:59,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:47:59,559 INFO L225 Difference]: With dead ends: 8272 [2025-01-09 05:47:59,560 INFO L226 Difference]: Without dead ends: 7536 [2025-01-09 05:47:59,563 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2857 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1313, Invalid=7243, Unknown=0, NotChecked=0, Total=8556 [2025-01-09 05:47:59,563 INFO L435 NwaCegarLoop]: 1511 mSDtfsCounter, 14057 mSDsluCounter, 9407 mSDsCounter, 0 mSdLazyCounter, 1857 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14057 SdHoareTripleChecker+Valid, 10918 SdHoareTripleChecker+Invalid, 1975 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 1857 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 05:47:59,564 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14057 Valid, 10918 Invalid, 1975 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 1857 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-09 05:47:59,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7536 states. [2025-01-09 05:47:59,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7536 to 7038. [2025-01-09 05:47:59,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7038 states, 7036 states have (on average 1.3683911313246162) internal successors, (9628), 7037 states have internal predecessors, (9628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:47:59,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7038 states to 7038 states and 9628 transitions. [2025-01-09 05:47:59,686 INFO L78 Accepts]: Start accepts. Automaton has 7038 states and 9628 transitions. Word has length 74 [2025-01-09 05:47:59,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:47:59,686 INFO L471 AbstractCegarLoop]: Abstraction has 7038 states and 9628 transitions. [2025-01-09 05:47:59,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 9.5) internal successors, (209), 22 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:47:59,686 INFO L276 IsEmpty]: Start isEmpty. Operand 7038 states and 9628 transitions. [2025-01-09 05:47:59,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-01-09 05:47:59,687 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:47:59,687 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:47:59,696 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 05:47:59,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:47:59,892 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:47:59,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:47:59,892 INFO L85 PathProgramCache]: Analyzing trace with hash -1655134909, now seen corresponding path program 1 times [2025-01-09 05:47:59,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:47:59,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588200363] [2025-01-09 05:47:59,892 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:47:59,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:47:59,909 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-01-09 05:47:59,930 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-01-09 05:47:59,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:47:59,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:48:00,705 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:48:00,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:48:00,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588200363] [2025-01-09 05:48:00,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588200363] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 05:48:00,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1941977235] [2025-01-09 05:48:00,705 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:48:00,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:48:00,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:48:00,707 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:48:00,709 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:48:00,759 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-01-09 05:48:00,788 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-01-09 05:48:00,789 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:48:00,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:48:00,792 INFO L256 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-09 05:48:00,794 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:48:01,132 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:48:01,132 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 05:48:01,766 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:48:01,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1941977235] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 05:48:01,767 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 05:48:01,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 28 [2025-01-09 05:48:01,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223718210] [2025-01-09 05:48:01,767 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 05:48:01,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-01-09 05:48:01,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:48:01,768 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-01-09 05:48:01,769 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=711, Unknown=0, NotChecked=0, Total=812 [2025-01-09 05:48:01,769 INFO L87 Difference]: Start difference. First operand 7038 states and 9628 transitions. Second operand has 29 states, 29 states have (on average 6.586206896551724) internal successors, (191), 28 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:48:03,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:48:03,418 INFO L93 Difference]: Finished difference Result 24208 states and 32160 transitions. [2025-01-09 05:48:03,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-01-09 05:48:03,418 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 6.586206896551724) internal successors, (191), 28 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2025-01-09 05:48:03,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:48:03,444 INFO L225 Difference]: With dead ends: 24208 [2025-01-09 05:48:03,445 INFO L226 Difference]: Without dead ends: 18776 [2025-01-09 05:48:03,454 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 677 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=755, Invalid=2785, Unknown=0, NotChecked=0, Total=3540 [2025-01-09 05:48:03,456 INFO L435 NwaCegarLoop]: 1498 mSDtfsCounter, 23227 mSDsluCounter, 6357 mSDsCounter, 0 mSdLazyCounter, 662 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23227 SdHoareTripleChecker+Valid, 7855 SdHoareTripleChecker+Invalid, 697 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 662 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 05:48:03,456 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23227 Valid, 7855 Invalid, 697 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 662 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 05:48:03,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18776 states. [2025-01-09 05:48:03,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18776 to 18700. [2025-01-09 05:48:03,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18700 states, 18698 states have (on average 1.3110493100866403) internal successors, (24514), 18699 states have internal predecessors, (24514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:48:03,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18700 states to 18700 states and 24514 transitions. [2025-01-09 05:48:03,917 INFO L78 Accepts]: Start accepts. Automaton has 18700 states and 24514 transitions. Word has length 75 [2025-01-09 05:48:03,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:48:03,918 INFO L471 AbstractCegarLoop]: Abstraction has 18700 states and 24514 transitions. [2025-01-09 05:48:03,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 6.586206896551724) internal successors, (191), 28 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:48:03,919 INFO L276 IsEmpty]: Start isEmpty. Operand 18700 states and 24514 transitions. [2025-01-09 05:48:03,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-01-09 05:48:03,920 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:48:03,920 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:48:03,927 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:48:04,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:48:04,125 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:48:04,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:48:04,126 INFO L85 PathProgramCache]: Analyzing trace with hash -399507787, now seen corresponding path program 1 times [2025-01-09 05:48:04,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:48:04,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821352844] [2025-01-09 05:48:04,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:48:04,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:48:04,134 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-01-09 05:48:04,144 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-01-09 05:48:04,145 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:48:04,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:48:04,395 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:48:04,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:48:04,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821352844] [2025-01-09 05:48:04,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [821352844] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 05:48:04,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [385503224] [2025-01-09 05:48:04,396 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:48:04,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:48:04,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:48:04,400 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:48:04,401 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:48:04,451 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-01-09 05:48:04,481 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-01-09 05:48:04,482 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:48:04,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:48:04,483 INFO L256 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-09 05:48:04,485 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:48:04,801 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:48:04,801 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 05:48:05,312 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:48:05,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [385503224] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 05:48:05,312 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 05:48:05,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2025-01-09 05:48:05,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835237631] [2025-01-09 05:48:05,313 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 05:48:05,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-01-09 05:48:05,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:48:05,314 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-01-09 05:48:05,314 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=343, Unknown=0, NotChecked=0, Total=420 [2025-01-09 05:48:05,314 INFO L87 Difference]: Start difference. First operand 18700 states and 24514 transitions. Second operand has 21 states, 21 states have (on average 8.142857142857142) internal successors, (171), 20 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:48:06,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:48:06,156 INFO L93 Difference]: Finished difference Result 36326 states and 47296 transitions. [2025-01-09 05:48:06,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 05:48:06,156 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 8.142857142857142) internal successors, (171), 20 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2025-01-09 05:48:06,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:48:06,177 INFO L225 Difference]: With dead ends: 36326 [2025-01-09 05:48:06,177 INFO L226 Difference]: Without dead ends: 19358 [2025-01-09 05:48:06,185 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=228, Invalid=702, Unknown=0, NotChecked=0, Total=930 [2025-01-09 05:48:06,187 INFO L435 NwaCegarLoop]: 1507 mSDtfsCounter, 12234 mSDsluCounter, 3322 mSDsCounter, 0 mSdLazyCounter, 397 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12234 SdHoareTripleChecker+Valid, 4829 SdHoareTripleChecker+Invalid, 410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 05:48:06,187 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12234 Valid, 4829 Invalid, 410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 397 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 05:48:06,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19358 states. [2025-01-09 05:48:06,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19358 to 17742. [2025-01-09 05:48:06,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17742 states, 17740 states have (on average 1.301860202931229) internal successors, (23095), 17741 states have internal predecessors, (23095), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:48:06,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17742 states to 17742 states and 23095 transitions. [2025-01-09 05:48:06,638 INFO L78 Accepts]: Start accepts. Automaton has 17742 states and 23095 transitions. Word has length 75 [2025-01-09 05:48:06,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:48:06,639 INFO L471 AbstractCegarLoop]: Abstraction has 17742 states and 23095 transitions. [2025-01-09 05:48:06,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 8.142857142857142) internal successors, (171), 20 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:48:06,639 INFO L276 IsEmpty]: Start isEmpty. Operand 17742 states and 23095 transitions. [2025-01-09 05:48:06,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-01-09 05:48:06,640 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:48:06,640 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:48:06,647 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 05:48:06,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:48:06,842 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:48:06,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:48:06,843 INFO L85 PathProgramCache]: Analyzing trace with hash -1891375623, now seen corresponding path program 1 times [2025-01-09 05:48:06,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:48:06,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147399105] [2025-01-09 05:48:06,843 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:48:06,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:48:06,854 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-01-09 05:48:06,870 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-01-09 05:48:06,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:48:06,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:48:07,505 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:48:07,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:48:07,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147399105] [2025-01-09 05:48:07,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147399105] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 05:48:07,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1828420765] [2025-01-09 05:48:07,505 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:48:07,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:48:07,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:48:07,508 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 05:48:07,509 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 05:48:07,568 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-01-09 05:48:07,605 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-01-09 05:48:07,606 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:48:07,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:48:07,607 INFO L256 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-01-09 05:48:07,609 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:48:07,919 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:48:07,919 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 05:48:08,642 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:48:08,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1828420765] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 05:48:08,642 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 05:48:08,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 27 [2025-01-09 05:48:08,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441488103] [2025-01-09 05:48:08,643 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 05:48:08,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-01-09 05:48:08,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:48:08,643 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-01-09 05:48:08,644 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=652, Unknown=0, NotChecked=0, Total=756 [2025-01-09 05:48:08,644 INFO L87 Difference]: Start difference. First operand 17742 states and 23095 transitions. Second operand has 28 states, 28 states have (on average 6.75) internal successors, (189), 27 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:48:11,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:48:11,163 INFO L93 Difference]: Finished difference Result 78418 states and 99718 transitions. [2025-01-09 05:48:11,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2025-01-09 05:48:11,166 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 6.75) internal successors, (189), 27 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2025-01-09 05:48:11,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:48:11,235 INFO L225 Difference]: With dead ends: 78418 [2025-01-09 05:48:11,235 INFO L226 Difference]: Without dead ends: 62900 [2025-01-09 05:48:11,251 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 891 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=737, Invalid=3045, Unknown=0, NotChecked=0, Total=3782 [2025-01-09 05:48:11,252 INFO L435 NwaCegarLoop]: 1501 mSDtfsCounter, 10033 mSDsluCounter, 10855 mSDsCounter, 0 mSdLazyCounter, 930 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10033 SdHoareTripleChecker+Valid, 12356 SdHoareTripleChecker+Invalid, 956 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 930 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 05:48:11,252 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10033 Valid, 12356 Invalid, 956 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 930 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 05:48:11,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62900 states. [2025-01-09 05:48:12,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62900 to 52122. [2025-01-09 05:48:12,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52122 states, 52120 states have (on average 1.2753261703760552) internal successors, (66470), 52121 states have internal predecessors, (66470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:48:13,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52122 states to 52122 states and 66470 transitions. [2025-01-09 05:48:13,017 INFO L78 Accepts]: Start accepts. Automaton has 52122 states and 66470 transitions. Word has length 76 [2025-01-09 05:48:13,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:48:13,018 INFO L471 AbstractCegarLoop]: Abstraction has 52122 states and 66470 transitions. [2025-01-09 05:48:13,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 6.75) internal successors, (189), 27 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:48:13,019 INFO L276 IsEmpty]: Start isEmpty. Operand 52122 states and 66470 transitions. [2025-01-09 05:48:13,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-01-09 05:48:13,020 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:48:13,020 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:48:13,030 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-09 05:48:13,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-01-09 05:48:13,221 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:48:13,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:48:13,221 INFO L85 PathProgramCache]: Analyzing trace with hash -1312503671, now seen corresponding path program 1 times [2025-01-09 05:48:13,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:48:13,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034055950] [2025-01-09 05:48:13,222 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:48:13,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:48:13,229 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-01-09 05:48:13,243 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-01-09 05:48:13,244 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:48:13,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:48:13,505 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:48:13,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:48:13,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034055950] [2025-01-09 05:48:13,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034055950] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 05:48:13,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [164046044] [2025-01-09 05:48:13,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:48:13,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:48:13,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:48:13,508 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 05:48:13,511 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-09 05:48:13,570 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-01-09 05:48:13,601 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-01-09 05:48:13,601 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:48:13,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:48:13,602 INFO L256 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-01-09 05:48:13,603 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:48:14,114 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:48:14,115 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 05:48:14,768 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:48:14,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [164046044] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 05:48:14,769 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 05:48:14,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13, 13] total 32 [2025-01-09 05:48:14,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133086815] [2025-01-09 05:48:14,769 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 05:48:14,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-01-09 05:48:14,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:48:14,770 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-01-09 05:48:14,770 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=886, Unknown=0, NotChecked=0, Total=992 [2025-01-09 05:48:14,770 INFO L87 Difference]: Start difference. First operand 52122 states and 66470 transitions. Second operand has 32 states, 32 states have (on average 6.125) internal successors, (196), 32 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:48:17,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:48:17,523 INFO L93 Difference]: Finished difference Result 107898 states and 137171 transitions. [2025-01-09 05:48:17,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-01-09 05:48:17,524 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 6.125) internal successors, (196), 32 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2025-01-09 05:48:17,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:48:17,582 INFO L225 Difference]: With dead ends: 107898 [2025-01-09 05:48:17,582 INFO L226 Difference]: Without dead ends: 58926 [2025-01-09 05:48:17,600 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 749 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=723, Invalid=3059, Unknown=0, NotChecked=0, Total=3782 [2025-01-09 05:48:17,601 INFO L435 NwaCegarLoop]: 1506 mSDtfsCounter, 14737 mSDsluCounter, 10904 mSDsCounter, 0 mSdLazyCounter, 867 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14737 SdHoareTripleChecker+Valid, 12410 SdHoareTripleChecker+Invalid, 904 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 867 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 05:48:17,601 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14737 Valid, 12410 Invalid, 904 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 867 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 05:48:17,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58926 states. [2025-01-09 05:48:19,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58926 to 45438. [2025-01-09 05:48:19,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45438 states, 45436 states have (on average 1.2558103706312176) internal successors, (57059), 45437 states have internal predecessors, (57059), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:48:19,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45438 states to 45438 states and 57059 transitions. [2025-01-09 05:48:19,163 INFO L78 Accepts]: Start accepts. Automaton has 45438 states and 57059 transitions. Word has length 76 [2025-01-09 05:48:19,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:48:19,163 INFO L471 AbstractCegarLoop]: Abstraction has 45438 states and 57059 transitions. [2025-01-09 05:48:19,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 6.125) internal successors, (196), 32 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:48:19,164 INFO L276 IsEmpty]: Start isEmpty. Operand 45438 states and 57059 transitions. [2025-01-09 05:48:19,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-01-09 05:48:19,168 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:48:19,169 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:48:19,176 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-01-09 05:48:19,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-01-09 05:48:19,369 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:48:19,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:48:19,374 INFO L85 PathProgramCache]: Analyzing trace with hash -1112270555, now seen corresponding path program 1 times [2025-01-09 05:48:19,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:48:19,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117848204] [2025-01-09 05:48:19,374 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:48:19,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:48:19,388 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-01-09 05:48:19,420 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-01-09 05:48:19,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:48:19,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:48:19,869 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:48:19,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:48:19,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117848204] [2025-01-09 05:48:19,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117848204] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 05:48:19,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [985637553] [2025-01-09 05:48:19,870 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:48:19,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:48:19,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:48:19,872 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 05:48:19,874 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-09 05:48:19,930 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-01-09 05:48:19,962 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-01-09 05:48:19,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:48:19,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:48:19,964 INFO L256 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-01-09 05:48:19,965 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:48:20,665 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:48:20,665 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 05:48:21,729 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:48:21,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [985637553] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 05:48:21,730 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 05:48:21,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 13] total 35 [2025-01-09 05:48:21,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901721246] [2025-01-09 05:48:21,730 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 05:48:21,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-01-09 05:48:21,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:48:21,731 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-01-09 05:48:21,731 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=1076, Unknown=0, NotChecked=0, Total=1190 [2025-01-09 05:48:21,731 INFO L87 Difference]: Start difference. First operand 45438 states and 57059 transitions. Second operand has 35 states, 35 states have (on average 6.142857142857143) internal successors, (215), 35 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:48:28,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:48:28,887 INFO L93 Difference]: Finished difference Result 101795 states and 128441 transitions. [2025-01-09 05:48:28,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2025-01-09 05:48:28,887 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 6.142857142857143) internal successors, (215), 35 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2025-01-09 05:48:28,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:48:28,964 INFO L225 Difference]: With dead ends: 101795 [2025-01-09 05:48:28,964 INFO L226 Difference]: Without dead ends: 73807 [2025-01-09 05:48:28,984 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2846 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=2174, Invalid=7726, Unknown=0, NotChecked=0, Total=9900 [2025-01-09 05:48:28,985 INFO L435 NwaCegarLoop]: 1534 mSDtfsCounter, 21566 mSDsluCounter, 19894 mSDsCounter, 0 mSdLazyCounter, 1194 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21566 SdHoareTripleChecker+Valid, 21428 SdHoareTripleChecker+Invalid, 1280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 1194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 05:48:28,985 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21566 Valid, 21428 Invalid, 1280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 1194 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 05:48:29,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73807 states. [2025-01-09 05:48:30,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73807 to 33474. [2025-01-09 05:48:30,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33474 states, 33472 states have (on average 1.2559751434034416) internal successors, (42040), 33473 states have internal predecessors, (42040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:48:30,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33474 states to 33474 states and 42040 transitions. [2025-01-09 05:48:30,128 INFO L78 Accepts]: Start accepts. Automaton has 33474 states and 42040 transitions. Word has length 77 [2025-01-09 05:48:30,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:48:30,129 INFO L471 AbstractCegarLoop]: Abstraction has 33474 states and 42040 transitions. [2025-01-09 05:48:30,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 6.142857142857143) internal successors, (215), 35 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:48:30,129 INFO L276 IsEmpty]: Start isEmpty. Operand 33474 states and 42040 transitions. [2025-01-09 05:48:30,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-01-09 05:48:30,130 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:48:30,130 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:48:30,136 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-01-09 05:48:30,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-01-09 05:48:30,334 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:48:30,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:48:30,334 INFO L85 PathProgramCache]: Analyzing trace with hash -971243090, now seen corresponding path program 1 times [2025-01-09 05:48:30,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:48:30,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762996082] [2025-01-09 05:48:30,335 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:48:30,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:48:30,344 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-01-09 05:48:30,348 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-01-09 05:48:30,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:48:30,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:48:30,378 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:48:30,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:48:30,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762996082] [2025-01-09 05:48:30,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762996082] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:48:30,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:48:30,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 05:48:30,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273368514] [2025-01-09 05:48:30,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:48:30,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:48:30,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:48:30,379 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:48:30,379 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:48:30,379 INFO L87 Difference]: Start difference. First operand 33474 states and 42040 transitions. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 2 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:48:33,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:48:33,565 INFO L93 Difference]: Finished difference Result 36482 states and 46872 transitions. [2025-01-09 05:48:33,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:48:33,566 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 2 states have internal predecessors, (82), 0 states have call successors, (0), 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 82 [2025-01-09 05:48:33,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:48:33,600 INFO L225 Difference]: With dead ends: 36482 [2025-01-09 05:48:33,600 INFO L226 Difference]: Without dead ends: 34978 [2025-01-09 05:48:33,609 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:48:33,611 INFO L435 NwaCegarLoop]: 665 mSDtfsCounter, 1004 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2380 mSolverCounterSat, 550 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1004 SdHoareTripleChecker+Valid, 672 SdHoareTripleChecker+Invalid, 2930 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 550 IncrementalHoareTripleChecker+Valid, 2380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-01-09 05:48:33,612 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1004 Valid, 672 Invalid, 2930 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [550 Valid, 2380 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-01-09 05:48:33,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34978 states. [2025-01-09 05:48:34,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34978 to 34976. [2025-01-09 05:48:34,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34976 states, 34974 states have (on average 1.2583919483044548) internal successors, (44011), 34975 states have internal predecessors, (44011), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:48:34,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34976 states to 34976 states and 44011 transitions. [2025-01-09 05:48:34,952 INFO L78 Accepts]: Start accepts. Automaton has 34976 states and 44011 transitions. Word has length 82 [2025-01-09 05:48:34,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:48:34,952 INFO L471 AbstractCegarLoop]: Abstraction has 34976 states and 44011 transitions. [2025-01-09 05:48:34,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 2 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:48:34,952 INFO L276 IsEmpty]: Start isEmpty. Operand 34976 states and 44011 transitions. [2025-01-09 05:48:34,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-01-09 05:48:34,957 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:48:34,957 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:48:34,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-01-09 05:48:34,957 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:48:34,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:48:34,958 INFO L85 PathProgramCache]: Analyzing trace with hash -1430192520, now seen corresponding path program 1 times [2025-01-09 05:48:34,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:48:34,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769649354] [2025-01-09 05:48:34,958 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:48:34,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:48:34,981 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-01-09 05:48:35,003 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-01-09 05:48:35,003 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:48:35,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:48:35,236 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:48:35,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:48:35,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769649354] [2025-01-09 05:48:35,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769649354] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:48:35,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:48:35,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:48:35,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642034320] [2025-01-09 05:48:35,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:48:35,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 05:48:35,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:48:35,239 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 05:48:35,239 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 05:48:35,239 INFO L87 Difference]: Start difference. First operand 34976 states and 44011 transitions. Second operand has 4 states, 4 states have (on average 27.75) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:48:40,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:48:40,743 INFO L93 Difference]: Finished difference Result 41737 states and 53655 transitions. [2025-01-09 05:48:40,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 05:48:40,743 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.75) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 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 111 [2025-01-09 05:48:40,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:48:40,784 INFO L225 Difference]: With dead ends: 41737 [2025-01-09 05:48:40,785 INFO L226 Difference]: Without dead ends: 38731 [2025-01-09 05:48:40,797 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 05:48:40,798 INFO L435 NwaCegarLoop]: 487 mSDtfsCounter, 2285 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 5087 mSolverCounterSat, 674 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2285 SdHoareTripleChecker+Valid, 504 SdHoareTripleChecker+Invalid, 5761 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 674 IncrementalHoareTripleChecker+Valid, 5087 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:48:40,798 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2285 Valid, 504 Invalid, 5761 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [674 Valid, 5087 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2025-01-09 05:48:40,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38731 states. [2025-01-09 05:48:41,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38731 to 38731. [2025-01-09 05:48:41,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38731 states, 38729 states have (on average 1.265459991221049) internal successors, (49010), 38730 states have internal predecessors, (49010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:48:41,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38731 states to 38731 states and 49010 transitions. [2025-01-09 05:48:41,978 INFO L78 Accepts]: Start accepts. Automaton has 38731 states and 49010 transitions. Word has length 111 [2025-01-09 05:48:41,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:48:41,979 INFO L471 AbstractCegarLoop]: Abstraction has 38731 states and 49010 transitions. [2025-01-09 05:48:41,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.75) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:48:41,979 INFO L276 IsEmpty]: Start isEmpty. Operand 38731 states and 49010 transitions. [2025-01-09 05:48:41,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-01-09 05:48:41,985 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:48:41,985 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:48:41,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-01-09 05:48:41,985 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:48:41,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:48:41,989 INFO L85 PathProgramCache]: Analyzing trace with hash -1728802058, now seen corresponding path program 1 times [2025-01-09 05:48:41,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:48:41,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745650901] [2025-01-09 05:48:41,990 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:48:41,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:48:42,008 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-01-09 05:48:42,037 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-01-09 05:48:42,037 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:48:42,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:48:42,849 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 22 proven. 85 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:48:42,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:48:42,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745650901] [2025-01-09 05:48:42,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745650901] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 05:48:42,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1985160109] [2025-01-09 05:48:42,850 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:48:42,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:48:42,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:48:42,857 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 05:48:42,858 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-09 05:48:42,928 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-01-09 05:48:42,974 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-01-09 05:48:42,974 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:48:42,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:48:42,976 INFO L256 TraceCheckSpWp]: Trace formula consists of 520 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-01-09 05:48:42,978 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:48:43,606 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 53 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:48:43,607 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 05:48:45,482 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 47 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:48:45,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1985160109] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 05:48:45,486 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 05:48:45,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 31 [2025-01-09 05:48:45,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170751405] [2025-01-09 05:48:45,487 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 05:48:45,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-01-09 05:48:45,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:48:45,487 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-01-09 05:48:45,488 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=885, Unknown=0, NotChecked=0, Total=992 [2025-01-09 05:48:45,488 INFO L87 Difference]: Start difference. First operand 38731 states and 49010 transitions. Second operand has 32 states, 32 states have (on average 10.15625) internal successors, (325), 31 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:48:49,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:48:49,491 INFO L93 Difference]: Finished difference Result 63124 states and 79356 transitions. [2025-01-09 05:48:49,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-01-09 05:48:49,492 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 10.15625) internal successors, (325), 31 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 123 [2025-01-09 05:48:49,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:48:49,535 INFO L225 Difference]: With dead ends: 63124 [2025-01-09 05:48:49,535 INFO L226 Difference]: Without dead ends: 39123 [2025-01-09 05:48:49,556 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 227 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 703 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=882, Invalid=3408, Unknown=0, NotChecked=0, Total=4290 [2025-01-09 05:48:49,557 INFO L435 NwaCegarLoop]: 1519 mSDtfsCounter, 25958 mSDsluCounter, 12512 mSDsCounter, 0 mSdLazyCounter, 991 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25958 SdHoareTripleChecker+Valid, 14031 SdHoareTripleChecker+Invalid, 1031 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 991 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 05:48:49,557 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25958 Valid, 14031 Invalid, 1031 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 991 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 05:48:49,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39123 states. [2025-01-09 05:48:50,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39123 to 38731. [2025-01-09 05:48:50,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38731 states, 38729 states have (on average 1.2518784373466911) internal successors, (48484), 38730 states have internal predecessors, (48484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:48:50,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38731 states to 38731 states and 48484 transitions. [2025-01-09 05:48:50,879 INFO L78 Accepts]: Start accepts. Automaton has 38731 states and 48484 transitions. Word has length 123 [2025-01-09 05:48:50,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:48:50,880 INFO L471 AbstractCegarLoop]: Abstraction has 38731 states and 48484 transitions. [2025-01-09 05:48:50,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 10.15625) internal successors, (325), 31 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:48:50,880 INFO L276 IsEmpty]: Start isEmpty. Operand 38731 states and 48484 transitions. [2025-01-09 05:48:50,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-01-09 05:48:50,882 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:48:50,883 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:48:50,889 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-01-09 05:48:51,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:48:51,084 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:48:51,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:48:51,084 INFO L85 PathProgramCache]: Analyzing trace with hash 2052026678, now seen corresponding path program 1 times [2025-01-09 05:48:51,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:48:51,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143327192] [2025-01-09 05:48:51,084 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:48:51,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:48:51,096 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-01-09 05:48:51,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-01-09 05:48:51,104 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:48:51,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:48:51,586 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 34 proven. 69 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:48:51,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:48:51,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143327192] [2025-01-09 05:48:51,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143327192] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 05:48:51,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2042618215] [2025-01-09 05:48:51,586 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:48:51,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:48:51,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:48:51,588 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 05:48:51,589 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-01-09 05:48:51,653 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-01-09 05:48:51,701 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-01-09 05:48:51,701 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:48:51,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:48:51,702 INFO L256 TraceCheckSpWp]: Trace formula consists of 524 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-01-09 05:48:51,704 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:48:52,263 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 36 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:48:52,263 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 05:48:53,494 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 34 proven. 69 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:48:53,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2042618215] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 05:48:53,494 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 05:48:53,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 26 [2025-01-09 05:48:53,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032039064] [2025-01-09 05:48:53,494 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 05:48:53,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-01-09 05:48:53,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:48:53,495 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-01-09 05:48:53,495 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=595, Unknown=0, NotChecked=0, Total=702 [2025-01-09 05:48:53,496 INFO L87 Difference]: Start difference. First operand 38731 states and 48484 transitions. Second operand has 27 states, 27 states have (on average 10.0) internal successors, (270), 26 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:48:55,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:48:55,275 INFO L93 Difference]: Finished difference Result 59127 states and 73639 transitions. [2025-01-09 05:48:55,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 05:48:55,275 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 10.0) internal successors, (270), 26 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 124 [2025-01-09 05:48:55,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:48:55,320 INFO L225 Difference]: With dead ends: 59127 [2025-01-09 05:48:55,320 INFO L226 Difference]: Without dead ends: 40847 [2025-01-09 05:48:55,340 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 233 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 280 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=345, Invalid=1215, Unknown=0, NotChecked=0, Total=1560 [2025-01-09 05:48:55,340 INFO L435 NwaCegarLoop]: 1530 mSDtfsCounter, 15046 mSDsluCounter, 10651 mSDsCounter, 0 mSdLazyCounter, 442 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15046 SdHoareTripleChecker+Valid, 12181 SdHoareTripleChecker+Invalid, 467 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 442 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 05:48:55,340 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15046 Valid, 12181 Invalid, 467 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 442 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 05:48:55,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40847 states. [2025-01-09 05:48:56,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40847 to 38731. [2025-01-09 05:48:56,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38731 states, 38729 states have (on average 1.2442355857367864) internal successors, (48188), 38730 states have internal predecessors, (48188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:48:56,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38731 states to 38731 states and 48188 transitions. [2025-01-09 05:48:56,802 INFO L78 Accepts]: Start accepts. Automaton has 38731 states and 48188 transitions. Word has length 124 [2025-01-09 05:48:56,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:48:56,803 INFO L471 AbstractCegarLoop]: Abstraction has 38731 states and 48188 transitions. [2025-01-09 05:48:56,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 10.0) internal successors, (270), 26 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:48:56,803 INFO L276 IsEmpty]: Start isEmpty. Operand 38731 states and 48188 transitions. [2025-01-09 05:48:56,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-01-09 05:48:56,806 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:48:56,806 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:48:56,812 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-01-09 05:48:57,006 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-01-09 05:48:57,006 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:48:57,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:48:57,007 INFO L85 PathProgramCache]: Analyzing trace with hash 1504055192, now seen corresponding path program 1 times [2025-01-09 05:48:57,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:48:57,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364847878] [2025-01-09 05:48:57,007 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:48:57,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:48:57,019 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-01-09 05:48:57,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-01-09 05:48:57,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:48:57,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:48:57,960 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 16 proven. 88 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:48:57,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:48:57,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364847878] [2025-01-09 05:48:57,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364847878] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 05:48:57,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [384807840] [2025-01-09 05:48:57,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:48:57,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:48:57,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:48:57,963 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 05:48:57,963 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-01-09 05:48:58,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-01-09 05:48:58,071 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-01-09 05:48:58,071 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:48:58,071 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:48:58,072 INFO L256 TraceCheckSpWp]: Trace formula consists of 526 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-01-09 05:48:58,074 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:48:59,376 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 25 proven. 79 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:48:59,376 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 05:49:01,807 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 25 proven. 79 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:49:01,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [384807840] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 05:49:01,807 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 05:49:01,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 52 [2025-01-09 05:49:01,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057826397] [2025-01-09 05:49:01,808 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 05:49:01,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2025-01-09 05:49:01,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:49:01,812 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2025-01-09 05:49:01,813 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=2462, Unknown=0, NotChecked=0, Total=2652 [2025-01-09 05:49:01,813 INFO L87 Difference]: Start difference. First operand 38731 states and 48188 transitions. Second operand has 52 states, 52 states have (on average 6.788461538461538) internal successors, (353), 52 states have internal predecessors, (353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)