./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.6.ufo.UNBOUNDED.pals+Problem12_label03.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/pals_lcr.6.ufo.UNBOUNDED.pals+Problem12_label03.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e1d9709d5a0621fd4bc0599bfe40ccbc8c215c029862756c658cfcd57bd9db9f --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 05:55:06,681 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 05:55:06,738 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:55:06,745 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 05:55:06,745 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 05:55:06,767 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 05:55:06,768 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 05:55:06,768 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 05:55:06,769 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 05:55:06,769 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 05:55:06,769 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 05:55:06,770 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 05:55:06,770 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 05:55:06,770 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 05:55:06,770 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 05:55:06,771 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 05:55:06,771 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 05:55:06,771 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 05:55:06,771 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 05:55:06,771 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 05:55:06,771 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 05:55:06,771 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 05:55:06,771 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 05:55:06,771 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 05:55:06,771 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 05:55:06,771 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 05:55:06,772 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 05:55:06,772 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 05:55:06,772 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 05:55:06,772 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 05:55:06,772 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 05:55:06,772 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 05:55:06,772 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:55:06,772 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 05:55:06,772 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 05:55:06,773 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 05:55:06,773 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 05:55:06,773 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:55:06,773 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 05:55:06,773 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 05:55:06,773 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 05:55:06,773 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 05:55:06,773 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 05:55:06,773 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 05:55:06,773 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 05:55:06,774 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 05:55:06,774 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 05:55:06,774 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 05:55:06,774 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 -> e1d9709d5a0621fd4bc0599bfe40ccbc8c215c029862756c658cfcd57bd9db9f [2025-01-09 05:55:07,019 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 05:55:07,027 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 05:55:07,028 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 05:55:07,030 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 05:55:07,030 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 05:55:07,031 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.6.ufo.UNBOUNDED.pals+Problem12_label03.c [2025-01-09 05:55:08,233 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/15c9afe4e/5ba80510e7654091b98f3d70a23eedc4/FLAG1f64c1130 [2025-01-09 05:55:08,681 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 05:55:08,681 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.6.ufo.UNBOUNDED.pals+Problem12_label03.c [2025-01-09 05:55:08,714 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/15c9afe4e/5ba80510e7654091b98f3d70a23eedc4/FLAG1f64c1130 [2025-01-09 05:55:08,783 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/15c9afe4e/5ba80510e7654091b98f3d70a23eedc4 [2025-01-09 05:55:08,785 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 05:55:08,786 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 05:55:08,788 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 05:55:08,788 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 05:55:08,791 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 05:55:08,792 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 05:55:08" (1/1) ... [2025-01-09 05:55:08,793 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5578ca5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:55:08, skipping insertion in model container [2025-01-09 05:55:08,793 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 05:55:08" (1/1) ... [2025-01-09 05:55:08,873 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 05:55:09,209 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.6.ufo.UNBOUNDED.pals+Problem12_label03.c[15510,15523] [2025-01-09 05:55:09,239 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.6.ufo.UNBOUNDED.pals+Problem12_label03.c[17847,17860] [2025-01-09 05:55:09,677 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 05:55:09,687 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 05:55:09,722 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.6.ufo.UNBOUNDED.pals+Problem12_label03.c[15510,15523] [2025-01-09 05:55:09,726 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.6.ufo.UNBOUNDED.pals+Problem12_label03.c[17847,17860] [2025-01-09 05:55:09,987 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 05:55:10,008 INFO L204 MainTranslator]: Completed translation [2025-01-09 05:55:10,010 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:55:10 WrapperNode [2025-01-09 05:55:10,010 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 05:55:10,011 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 05:55:10,012 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 05:55:10,012 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 05:55:10,016 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:55:10" (1/1) ... [2025-01-09 05:55:10,070 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:55:10" (1/1) ... [2025-01-09 05:55:10,328 INFO L138 Inliner]: procedures = 38, calls = 23, calls flagged for inlining = 18, calls inlined = 18, statements flattened = 5151 [2025-01-09 05:55:10,329 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 05:55:10,329 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 05:55:10,329 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 05:55:10,329 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 05:55:10,336 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:55:10" (1/1) ... [2025-01-09 05:55:10,337 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:55:10" (1/1) ... [2025-01-09 05:55:10,369 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:55:10" (1/1) ... [2025-01-09 05:55:10,506 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:55:10,506 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:55:10" (1/1) ... [2025-01-09 05:55:10,506 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:55:10" (1/1) ... [2025-01-09 05:55:10,629 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:55:10" (1/1) ... [2025-01-09 05:55:10,649 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:55:10" (1/1) ... [2025-01-09 05:55:10,730 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:55:10" (1/1) ... [2025-01-09 05:55:10,761 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:55:10" (1/1) ... [2025-01-09 05:55:10,779 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:55:10" (1/1) ... [2025-01-09 05:55:10,833 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 05:55:10,835 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 05:55:10,835 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 05:55:10,835 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 05:55:10,836 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:55:10" (1/1) ... [2025-01-09 05:55:10,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:55:10,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:55:10,862 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:55:10,866 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:55:10,883 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 05:55:10,883 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 05:55:10,884 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 05:55:10,884 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 05:55:10,978 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 05:55:10,980 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 05:55:14,244 INFO L? ?]: Removed 749 outVars from TransFormulas that were not future-live. [2025-01-09 05:55:14,244 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 05:55:14,274 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 05:55:14,274 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2025-01-09 05:55:14,275 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 05:55:14 BoogieIcfgContainer [2025-01-09 05:55:14,275 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 05:55:14,276 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 05:55:14,276 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 05:55:14,279 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 05:55:14,279 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 05:55:08" (1/3) ... [2025-01-09 05:55:14,280 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@253e7a98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 05:55:14, skipping insertion in model container [2025-01-09 05:55:14,281 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:55:10" (2/3) ... [2025-01-09 05:55:14,282 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@253e7a98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 05:55:14, skipping insertion in model container [2025-01-09 05:55:14,282 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 05:55:14" (3/3) ... [2025-01-09 05:55:14,283 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.6.ufo.UNBOUNDED.pals+Problem12_label03.c [2025-01-09 05:55:14,293 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 05:55:14,296 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.6.ufo.UNBOUNDED.pals+Problem12_label03.c that has 1 procedures, 915 locations, 1 initial locations, 2 loop locations, and 2 error locations. [2025-01-09 05:55:14,355 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 05:55:14,366 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;@3f7d66c2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 05:55:14,366 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-01-09 05:55:14,372 INFO L276 IsEmpty]: Start isEmpty. Operand has 915 states, 912 states have (on average 1.9024122807017543) internal successors, (1735), 914 states have internal predecessors, (1735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:55:14,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-01-09 05:55:14,378 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:55:14,378 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:55:14,379 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:55:14,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:55:14,383 INFO L85 PathProgramCache]: Analyzing trace with hash 1505814368, now seen corresponding path program 1 times [2025-01-09 05:55:14,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:55:14,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703670813] [2025-01-09 05:55:14,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:55:14,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:55:14,441 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-09 05:55:14,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-09 05:55:14,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:55:14,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:55:14,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:55:14,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:55:14,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703670813] [2025-01-09 05:55:14,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703670813] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:55:14,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:55:14,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 05:55:14,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262584786] [2025-01-09 05:55:14,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:55:14,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:55:14,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:55:14,616 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:55:14,616 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:55:14,619 INFO L87 Difference]: Start difference. First operand has 915 states, 912 states have (on average 1.9024122807017543) internal successors, (1735), 914 states have internal predecessors, (1735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:55:17,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:55:17,507 INFO L93 Difference]: Finished difference Result 2538 states and 4882 transitions. [2025-01-09 05:55:17,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:55:17,509 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-01-09 05:55:17,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:55:17,524 INFO L225 Difference]: With dead ends: 2538 [2025-01-09 05:55:17,524 INFO L226 Difference]: Without dead ends: 1601 [2025-01-09 05:55:17,528 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:55:17,530 INFO L435 NwaCegarLoop]: 313 mSDtfsCounter, 1044 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 2437 mSolverCounterSat, 771 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1044 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 3208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 771 IncrementalHoareTripleChecker+Valid, 2437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-01-09 05:55:17,531 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1044 Valid, 324 Invalid, 3208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [771 Valid, 2437 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-01-09 05:55:17,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1601 states. [2025-01-09 05:55:17,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1601 to 1601. [2025-01-09 05:55:17,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1601 states, 1599 states have (on average 1.8411507191994998) internal successors, (2944), 1600 states have internal predecessors, (2944), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:55:17,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1601 states to 1601 states and 2944 transitions. [2025-01-09 05:55:17,605 INFO L78 Accepts]: Start accepts. Automaton has 1601 states and 2944 transitions. Word has length 20 [2025-01-09 05:55:17,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:55:17,606 INFO L471 AbstractCegarLoop]: Abstraction has 1601 states and 2944 transitions. [2025-01-09 05:55:17,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:55:17,606 INFO L276 IsEmpty]: Start isEmpty. Operand 1601 states and 2944 transitions. [2025-01-09 05:55:17,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-01-09 05:55:17,607 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:55:17,607 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] [2025-01-09 05:55:17,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 05:55:17,608 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:55:17,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:55:17,608 INFO L85 PathProgramCache]: Analyzing trace with hash -558316505, now seen corresponding path program 1 times [2025-01-09 05:55:17,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:55:17,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241131438] [2025-01-09 05:55:17,609 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:55:17,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:55:17,620 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-09 05:55:17,640 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-09 05:55:17,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:55:17,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:55:17,799 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:55:17,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:55:17,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241131438] [2025-01-09 05:55:17,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241131438] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:55:17,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:55:17,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 05:55:17,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071622071] [2025-01-09 05:55:17,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:55:17,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 05:55:17,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:55:17,802 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 05:55:17,803 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 05:55:17,803 INFO L87 Difference]: Start difference. First operand 1601 states and 2944 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:55:17,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:55:17,861 INFO L93 Difference]: Finished difference Result 1655 states and 3028 transitions. [2025-01-09 05:55:17,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 05:55:17,862 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-01-09 05:55:17,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:55:17,867 INFO L225 Difference]: With dead ends: 1655 [2025-01-09 05:55:17,867 INFO L226 Difference]: Without dead ends: 1601 [2025-01-09 05:55:17,867 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:55:17,868 INFO L435 NwaCegarLoop]: 1603 mSDtfsCounter, 0 mSDsluCounter, 4764 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6367 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:55:17,868 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6367 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:55:17,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1601 states. [2025-01-09 05:55:17,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1601 to 1601. [2025-01-09 05:55:17,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1601 states, 1599 states have (on average 1.8161350844277673) internal successors, (2904), 1600 states have internal predecessors, (2904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:55:17,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1601 states to 1601 states and 2904 transitions. [2025-01-09 05:55:17,909 INFO L78 Accepts]: Start accepts. Automaton has 1601 states and 2904 transitions. Word has length 26 [2025-01-09 05:55:17,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:55:17,909 INFO L471 AbstractCegarLoop]: Abstraction has 1601 states and 2904 transitions. [2025-01-09 05:55:17,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:55:17,909 INFO L276 IsEmpty]: Start isEmpty. Operand 1601 states and 2904 transitions. [2025-01-09 05:55:17,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-01-09 05:55:17,911 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:55:17,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:55:17,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 05:55:17,911 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:55:17,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:55:17,911 INFO L85 PathProgramCache]: Analyzing trace with hash 1992870259, now seen corresponding path program 1 times [2025-01-09 05:55:17,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:55:17,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131650746] [2025-01-09 05:55:17,912 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:55:17,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:55:17,925 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-01-09 05:55:17,939 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-01-09 05:55:17,939 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:55:17,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:55:18,099 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:55:18,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:55:18,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131650746] [2025-01-09 05:55:18,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131650746] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:55:18,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:55:18,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 05:55:18,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408530455] [2025-01-09 05:55:18,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:55:18,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 05:55:18,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:55:18,101 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 05:55:18,101 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 05:55:18,102 INFO L87 Difference]: Start difference. First operand 1601 states and 2904 transitions. Second operand has 8 states, 8 states have (on average 8.125) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:55:18,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:55:18,349 INFO L93 Difference]: Finished difference Result 2201 states and 3864 transitions. [2025-01-09 05:55:18,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 05:55:18,350 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.125) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 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:55:18,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:55:18,357 INFO L225 Difference]: With dead ends: 2201 [2025-01-09 05:55:18,357 INFO L226 Difference]: Without dead ends: 2151 [2025-01-09 05:55:18,360 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=181, Unknown=0, NotChecked=0, Total=272 [2025-01-09 05:55:18,362 INFO L435 NwaCegarLoop]: 1559 mSDtfsCounter, 9729 mSDsluCounter, 1968 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9729 SdHoareTripleChecker+Valid, 3527 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 05:55:18,362 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9729 Valid, 3527 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 05:55:18,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2151 states. [2025-01-09 05:55:18,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2151 to 1649. [2025-01-09 05:55:18,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1649 states, 1647 states have (on average 1.8099574984820888) internal successors, (2981), 1648 states have internal predecessors, (2981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:55:18,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1649 states to 1649 states and 2981 transitions. [2025-01-09 05:55:18,396 INFO L78 Accepts]: Start accepts. Automaton has 1649 states and 2981 transitions. Word has length 65 [2025-01-09 05:55:18,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:55:18,397 INFO L471 AbstractCegarLoop]: Abstraction has 1649 states and 2981 transitions. [2025-01-09 05:55:18,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.125) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:55:18,397 INFO L276 IsEmpty]: Start isEmpty. Operand 1649 states and 2981 transitions. [2025-01-09 05:55:18,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-01-09 05:55:18,401 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:55:18,402 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:55:18,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 05:55:18,402 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:55:18,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:55:18,402 INFO L85 PathProgramCache]: Analyzing trace with hash -1822789277, now seen corresponding path program 1 times [2025-01-09 05:55:18,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:55:18,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396561198] [2025-01-09 05:55:18,404 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:55:18,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:55:18,413 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-01-09 05:55:18,423 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-01-09 05:55:18,423 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:55:18,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:55:18,497 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:55:18,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:55:18,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396561198] [2025-01-09 05:55:18,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396561198] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:55:18,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:55:18,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:55:18,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327855495] [2025-01-09 05:55:18,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:55:18,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:55:18,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:55:18,498 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:55:18,498 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:55:18,498 INFO L87 Difference]: Start difference. First operand 1649 states and 2981 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:55:18,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:55:18,529 INFO L93 Difference]: Finished difference Result 1834 states and 3276 transitions. [2025-01-09 05:55:18,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:55:18,530 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:55:18,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:55:18,535 INFO L225 Difference]: With dead ends: 1834 [2025-01-09 05:55:18,535 INFO L226 Difference]: Without dead ends: 1736 [2025-01-09 05:55:18,536 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:55:18,536 INFO L435 NwaCegarLoop]: 1561 mSDtfsCounter, 1492 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1492 SdHoareTripleChecker+Valid, 1634 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:55:18,536 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1492 Valid, 1634 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:55:18,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1736 states. [2025-01-09 05:55:18,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1736 to 1732. [2025-01-09 05:55:18,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1732 states, 1730 states have (on average 1.7982658959537572) internal successors, (3111), 1731 states have internal predecessors, (3111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:55:18,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1732 states to 1732 states and 3111 transitions. [2025-01-09 05:55:18,565 INFO L78 Accepts]: Start accepts. Automaton has 1732 states and 3111 transitions. Word has length 67 [2025-01-09 05:55:18,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:55:18,565 INFO L471 AbstractCegarLoop]: Abstraction has 1732 states and 3111 transitions. [2025-01-09 05:55:18,565 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:55:18,565 INFO L276 IsEmpty]: Start isEmpty. Operand 1732 states and 3111 transitions. [2025-01-09 05:55:18,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-01-09 05:55:18,566 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:55:18,567 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:55:18,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 05:55:18,567 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:55:18,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:55:18,567 INFO L85 PathProgramCache]: Analyzing trace with hash -1756295765, now seen corresponding path program 1 times [2025-01-09 05:55:18,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:55:18,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604568381] [2025-01-09 05:55:18,567 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:55:18,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:55:18,575 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-01-09 05:55:18,588 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-01-09 05:55:18,588 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:55:18,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:55:18,907 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:55:18,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:55:18,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604568381] [2025-01-09 05:55:18,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604568381] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:55:18,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:55:18,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 05:55:18,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95517085] [2025-01-09 05:55:18,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:55:18,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 05:55:18,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:55:18,909 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 05:55:18,909 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-01-09 05:55:18,909 INFO L87 Difference]: Start difference. First operand 1732 states and 3111 transitions. Second operand has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 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:55:19,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:55:19,113 INFO L93 Difference]: Finished difference Result 1915 states and 3399 transitions. [2025-01-09 05:55:19,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 05:55:19,114 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 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:55:19,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:55:19,119 INFO L225 Difference]: With dead ends: 1915 [2025-01-09 05:55:19,120 INFO L226 Difference]: Without dead ends: 1734 [2025-01-09 05:55:19,121 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2025-01-09 05:55:19,121 INFO L435 NwaCegarLoop]: 1558 mSDtfsCounter, 4525 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4525 SdHoareTripleChecker+Valid, 1941 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 05:55:19,122 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4525 Valid, 1941 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 05:55:19,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1734 states. [2025-01-09 05:55:19,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1734 to 1732. [2025-01-09 05:55:19,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1732 states, 1730 states have (on average 1.7971098265895953) internal successors, (3109), 1731 states have internal predecessors, (3109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:55:19,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1732 states to 1732 states and 3109 transitions. [2025-01-09 05:55:19,154 INFO L78 Accepts]: Start accepts. Automaton has 1732 states and 3109 transitions. Word has length 67 [2025-01-09 05:55:19,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:55:19,155 INFO L471 AbstractCegarLoop]: Abstraction has 1732 states and 3109 transitions. [2025-01-09 05:55:19,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 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:55:19,156 INFO L276 IsEmpty]: Start isEmpty. Operand 1732 states and 3109 transitions. [2025-01-09 05:55:19,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-01-09 05:55:19,157 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:55:19,157 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:55:19,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 05:55:19,157 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:55:19,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:55:19,158 INFO L85 PathProgramCache]: Analyzing trace with hash 974683136, now seen corresponding path program 1 times [2025-01-09 05:55:19,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:55:19,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872940094] [2025-01-09 05:55:19,159 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:55:19,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:55:19,172 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-01-09 05:55:19,192 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-01-09 05:55:19,192 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:55:19,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:55:19,360 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:55:19,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:55:19,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872940094] [2025-01-09 05:55:19,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872940094] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:55:19,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:55:19,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 05:55:19,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261347319] [2025-01-09 05:55:19,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:55:19,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 05:55:19,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:55:19,361 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 05:55:19,361 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 05:55:19,362 INFO L87 Difference]: Start difference. First operand 1732 states and 3109 transitions. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 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:55:19,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:55:19,393 INFO L93 Difference]: Finished difference Result 1740 states and 3118 transitions. [2025-01-09 05:55:19,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 05:55:19,393 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 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:55:19,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:55:19,398 INFO L225 Difference]: With dead ends: 1740 [2025-01-09 05:55:19,398 INFO L226 Difference]: Without dead ends: 1738 [2025-01-09 05:55:19,399 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:55:19,399 INFO L435 NwaCegarLoop]: 1562 mSDtfsCounter, 0 mSDsluCounter, 4677 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6239 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:55:19,400 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6239 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:55:19,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1738 states. [2025-01-09 05:55:19,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1738 to 1738. [2025-01-09 05:55:19,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1738 states, 1736 states have (on average 1.793778801843318) internal successors, (3114), 1737 states have internal predecessors, (3114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:55:19,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1738 states to 1738 states and 3114 transitions. [2025-01-09 05:55:19,463 INFO L78 Accepts]: Start accepts. Automaton has 1738 states and 3114 transitions. Word has length 68 [2025-01-09 05:55:19,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:55:19,464 INFO L471 AbstractCegarLoop]: Abstraction has 1738 states and 3114 transitions. [2025-01-09 05:55:19,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 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:55:19,464 INFO L276 IsEmpty]: Start isEmpty. Operand 1738 states and 3114 transitions. [2025-01-09 05:55:19,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-01-09 05:55:19,465 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:55:19,465 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:55:19,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 05:55:19,465 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:55:19,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:55:19,465 INFO L85 PathProgramCache]: Analyzing trace with hash 523852843, now seen corresponding path program 1 times [2025-01-09 05:55:19,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:55:19,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532300014] [2025-01-09 05:55:19,465 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:55:19,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:55:19,474 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-09 05:55:19,482 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 05:55:19,483 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:55:19,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:55:19,513 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:55:19,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:55:19,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532300014] [2025-01-09 05:55:19,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532300014] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:55:19,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:55:19,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:55:19,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906179330] [2025-01-09 05:55:19,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:55:19,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:55:19,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:55:19,514 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:55:19,515 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:55:19,515 INFO L87 Difference]: Start difference. First operand 1738 states and 3114 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:55:19,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:55:19,538 INFO L93 Difference]: Finished difference Result 2096 states and 3666 transitions. [2025-01-09 05:55:19,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:55:19,539 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 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 69 [2025-01-09 05:55:19,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:55:19,544 INFO L225 Difference]: With dead ends: 2096 [2025-01-09 05:55:19,545 INFO L226 Difference]: Without dead ends: 1909 [2025-01-09 05:55:19,545 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:55:19,546 INFO L435 NwaCegarLoop]: 1622 mSDtfsCounter, 1507 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1507 SdHoareTripleChecker+Valid, 1707 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:55:19,546 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1507 Valid, 1707 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:55:19,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1909 states. [2025-01-09 05:55:19,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1909 to 1907. [2025-01-09 05:55:19,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1907 states, 1905 states have (on average 1.7695538057742781) internal successors, (3371), 1906 states have internal predecessors, (3371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:55:19,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1907 states to 1907 states and 3371 transitions. [2025-01-09 05:55:19,579 INFO L78 Accepts]: Start accepts. Automaton has 1907 states and 3371 transitions. Word has length 69 [2025-01-09 05:55:19,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:55:19,579 INFO L471 AbstractCegarLoop]: Abstraction has 1907 states and 3371 transitions. [2025-01-09 05:55:19,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:55:19,579 INFO L276 IsEmpty]: Start isEmpty. Operand 1907 states and 3371 transitions. [2025-01-09 05:55:19,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-01-09 05:55:19,580 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:55:19,580 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:55:19,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 05:55:19,580 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:55:19,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:55:19,581 INFO L85 PathProgramCache]: Analyzing trace with hash 787709227, now seen corresponding path program 1 times [2025-01-09 05:55:19,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:55:19,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904791686] [2025-01-09 05:55:19,581 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:55:19,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:55:19,588 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-09 05:55:19,597 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 05:55:19,597 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:55:19,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:55:19,629 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:55:19,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:55:19,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904791686] [2025-01-09 05:55:19,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904791686] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:55:19,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:55:19,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:55:19,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441230804] [2025-01-09 05:55:19,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:55:19,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:55:19,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:55:19,631 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:55:19,631 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:55:19,631 INFO L87 Difference]: Start difference. First operand 1907 states and 3371 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:55:19,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:55:19,663 INFO L93 Difference]: Finished difference Result 2587 states and 4409 transitions. [2025-01-09 05:55:19,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:55:19,664 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 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 69 [2025-01-09 05:55:19,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:55:19,671 INFO L225 Difference]: With dead ends: 2587 [2025-01-09 05:55:19,672 INFO L226 Difference]: Without dead ends: 2231 [2025-01-09 05:55:19,673 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:55:19,674 INFO L435 NwaCegarLoop]: 1620 mSDtfsCounter, 1505 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1505 SdHoareTripleChecker+Valid, 1709 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:55:19,674 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1505 Valid, 1709 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:55:19,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2231 states. [2025-01-09 05:55:19,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2231 to 2229. [2025-01-09 05:55:19,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2229 states, 2227 states have (on average 1.7301302200269422) internal successors, (3853), 2228 states have internal predecessors, (3853), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:55:19,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2229 states to 2229 states and 3853 transitions. [2025-01-09 05:55:19,719 INFO L78 Accepts]: Start accepts. Automaton has 2229 states and 3853 transitions. Word has length 69 [2025-01-09 05:55:19,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:55:19,719 INFO L471 AbstractCegarLoop]: Abstraction has 2229 states and 3853 transitions. [2025-01-09 05:55:19,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:55:19,719 INFO L276 IsEmpty]: Start isEmpty. Operand 2229 states and 3853 transitions. [2025-01-09 05:55:19,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-01-09 05:55:19,720 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:55:19,720 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:55:19,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 05:55:19,720 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:55:19,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:55:19,721 INFO L85 PathProgramCache]: Analyzing trace with hash 2025971243, now seen corresponding path program 1 times [2025-01-09 05:55:19,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:55:19,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185606551] [2025-01-09 05:55:19,721 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:55:19,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:55:19,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-09 05:55:19,740 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 05:55:19,741 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:55:19,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:55:19,770 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:55:19,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:55:19,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185606551] [2025-01-09 05:55:19,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185606551] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:55:19,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:55:19,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:55:19,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348510996] [2025-01-09 05:55:19,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:55:19,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:55:19,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:55:19,772 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:55:19,772 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:55:19,773 INFO L87 Difference]: Start difference. First operand 2229 states and 3853 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:55:19,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:55:19,807 INFO L93 Difference]: Finished difference Result 3521 states and 5799 transitions. [2025-01-09 05:55:19,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:55:19,808 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 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 69 [2025-01-09 05:55:19,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:55:19,815 INFO L225 Difference]: With dead ends: 3521 [2025-01-09 05:55:19,815 INFO L226 Difference]: Without dead ends: 2843 [2025-01-09 05:55:19,817 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:55:19,817 INFO L435 NwaCegarLoop]: 1618 mSDtfsCounter, 1503 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1503 SdHoareTripleChecker+Valid, 1711 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:55:19,817 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1503 Valid, 1711 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:55:19,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2843 states. [2025-01-09 05:55:19,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2843 to 2841. [2025-01-09 05:55:19,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2841 states, 2839 states have (on average 1.674181049665375) internal successors, (4753), 2840 states have internal predecessors, (4753), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:55:19,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2841 states to 2841 states and 4753 transitions. [2025-01-09 05:55:19,866 INFO L78 Accepts]: Start accepts. Automaton has 2841 states and 4753 transitions. Word has length 69 [2025-01-09 05:55:19,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:55:19,866 INFO L471 AbstractCegarLoop]: Abstraction has 2841 states and 4753 transitions. [2025-01-09 05:55:19,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:55:19,866 INFO L276 IsEmpty]: Start isEmpty. Operand 2841 states and 4753 transitions. [2025-01-09 05:55:19,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-01-09 05:55:19,867 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:55:19,867 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:55:19,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 05:55:19,867 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:55:19,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:55:19,867 INFO L85 PathProgramCache]: Analyzing trace with hash -189497557, now seen corresponding path program 1 times [2025-01-09 05:55:19,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:55:19,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208266264] [2025-01-09 05:55:19,868 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:55:19,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:55:19,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-09 05:55:19,879 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 05:55:19,879 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:55:19,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:55:19,907 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:55:19,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:55:19,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208266264] [2025-01-09 05:55:19,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208266264] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:55:19,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:55:19,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:55:19,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256965577] [2025-01-09 05:55:19,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:55:19,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:55:19,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:55:19,908 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:55:19,909 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:55:19,909 INFO L87 Difference]: Start difference. First operand 2841 states and 4753 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:55:19,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:55:19,954 INFO L93 Difference]: Finished difference Result 5293 states and 8387 transitions. [2025-01-09 05:55:19,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:55:19,954 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 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 69 [2025-01-09 05:55:19,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:55:19,965 INFO L225 Difference]: With dead ends: 5293 [2025-01-09 05:55:19,966 INFO L226 Difference]: Without dead ends: 4003 [2025-01-09 05:55:19,968 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:55:19,968 INFO L435 NwaCegarLoop]: 1616 mSDtfsCounter, 1501 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1501 SdHoareTripleChecker+Valid, 1713 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:55:19,969 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1501 Valid, 1713 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:55:19,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4003 states. [2025-01-09 05:55:20,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4003 to 4001. [2025-01-09 05:55:20,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4001 states, 3999 states have (on average 1.606651662915729) internal successors, (6425), 4000 states have internal predecessors, (6425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:55:20,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4001 states to 4001 states and 6425 transitions. [2025-01-09 05:55:20,060 INFO L78 Accepts]: Start accepts. Automaton has 4001 states and 6425 transitions. Word has length 69 [2025-01-09 05:55:20,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:55:20,061 INFO L471 AbstractCegarLoop]: Abstraction has 4001 states and 6425 transitions. [2025-01-09 05:55:20,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:55:20,061 INFO L276 IsEmpty]: Start isEmpty. Operand 4001 states and 6425 transitions. [2025-01-09 05:55:20,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-01-09 05:55:20,062 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:55:20,062 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:55:20,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 05:55:20,062 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:55:20,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:55:20,062 INFO L85 PathProgramCache]: Analyzing trace with hash 1591435307, now seen corresponding path program 1 times [2025-01-09 05:55:20,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:55:20,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649388661] [2025-01-09 05:55:20,062 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:55:20,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:55:20,070 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-09 05:55:20,075 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 05:55:20,076 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:55:20,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:55:20,104 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:55:20,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:55:20,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649388661] [2025-01-09 05:55:20,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649388661] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:55:20,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:55:20,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:55:20,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391531947] [2025-01-09 05:55:20,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:55:20,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:55:20,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:55:20,105 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:55:20,105 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:55:20,105 INFO L87 Difference]: Start difference. First operand 4001 states and 6425 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:55:20,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:55:20,182 INFO L93 Difference]: Finished difference Result 8645 states and 13179 transitions. [2025-01-09 05:55:20,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:55:20,183 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 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 69 [2025-01-09 05:55:20,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:55:20,208 INFO L225 Difference]: With dead ends: 8645 [2025-01-09 05:55:20,209 INFO L226 Difference]: Without dead ends: 6195 [2025-01-09 05:55:20,214 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:55:20,215 INFO L435 NwaCegarLoop]: 1614 mSDtfsCounter, 1499 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1499 SdHoareTripleChecker+Valid, 1715 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:55:20,215 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1499 Valid, 1715 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:55:20,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6195 states. [2025-01-09 05:55:20,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6195 to 6193. [2025-01-09 05:55:20,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6193 states, 6191 states have (on average 1.5365853658536586) internal successors, (9513), 6192 states have internal predecessors, (9513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:55:20,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6193 states to 6193 states and 9513 transitions. [2025-01-09 05:55:20,365 INFO L78 Accepts]: Start accepts. Automaton has 6193 states and 9513 transitions. Word has length 69 [2025-01-09 05:55:20,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:55:20,366 INFO L471 AbstractCegarLoop]: Abstraction has 6193 states and 9513 transitions. [2025-01-09 05:55:20,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:55:20,366 INFO L276 IsEmpty]: Start isEmpty. Operand 6193 states and 9513 transitions. [2025-01-09 05:55:20,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-01-09 05:55:20,367 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:55:20,367 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:55:20,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 05:55:20,367 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:55:20,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:55:20,367 INFO L85 PathProgramCache]: Analyzing trace with hash 1172876230, now seen corresponding path program 1 times [2025-01-09 05:55:20,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:55:20,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098121021] [2025-01-09 05:55:20,368 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:55:20,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:55:20,374 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-01-09 05:55:20,379 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-01-09 05:55:20,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:55:20,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:55:20,414 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:55:20,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:55:20,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098121021] [2025-01-09 05:55:20,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098121021] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:55:20,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:55:20,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:55:20,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110425504] [2025-01-09 05:55:20,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:55:20,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:55:20,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:55:20,417 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:55:20,417 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:55:20,417 INFO L87 Difference]: Start difference. First operand 6193 states and 9513 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:55:20,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:55:20,549 INFO L93 Difference]: Finished difference Result 11064 states and 16623 transitions. [2025-01-09 05:55:20,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:55:20,550 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 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 71 [2025-01-09 05:55:20,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:55:20,564 INFO L225 Difference]: With dead ends: 11064 [2025-01-09 05:55:20,565 INFO L226 Difference]: Without dead ends: 8437 [2025-01-09 05:55:20,569 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:55:20,570 INFO L435 NwaCegarLoop]: 1627 mSDtfsCounter, 1506 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1506 SdHoareTripleChecker+Valid, 1708 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:55:20,570 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1506 Valid, 1708 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:55:20,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8437 states. [2025-01-09 05:55:20,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8437 to 8435. [2025-01-09 05:55:20,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8435 states, 8433 states have (on average 1.503972489031187) internal successors, (12683), 8434 states have internal predecessors, (12683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:55:20,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8435 states to 8435 states and 12683 transitions. [2025-01-09 05:55:20,791 INFO L78 Accepts]: Start accepts. Automaton has 8435 states and 12683 transitions. Word has length 71 [2025-01-09 05:55:20,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:55:20,791 INFO L471 AbstractCegarLoop]: Abstraction has 8435 states and 12683 transitions. [2025-01-09 05:55:20,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:55:20,791 INFO L276 IsEmpty]: Start isEmpty. Operand 8435 states and 12683 transitions. [2025-01-09 05:55:20,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-01-09 05:55:20,794 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:55:20,794 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:55:20,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 05:55:20,795 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:55:20,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:55:20,795 INFO L85 PathProgramCache]: Analyzing trace with hash 370001726, now seen corresponding path program 1 times [2025-01-09 05:55:20,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:55:20,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791647011] [2025-01-09 05:55:20,795 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:55:20,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:55:20,807 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-01-09 05:55:20,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-01-09 05:55:20,814 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:55:20,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:55:20,912 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:55:20,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:55:20,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791647011] [2025-01-09 05:55:20,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791647011] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:55:20,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:55:20,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 05:55:20,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781837676] [2025-01-09 05:55:20,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:55:20,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:55:20,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:55:20,914 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:55:20,914 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:55:20,914 INFO L87 Difference]: Start difference. First operand 8435 states and 12683 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 2 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:55:23,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:55:23,434 INFO L93 Difference]: Finished difference Result 11441 states and 18234 transitions. [2025-01-09 05:55:23,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:55:23,435 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 2 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 89 [2025-01-09 05:55:23,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:55:23,452 INFO L225 Difference]: With dead ends: 11441 [2025-01-09 05:55:23,452 INFO L226 Difference]: Without dead ends: 9937 [2025-01-09 05:55:23,458 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:55:23,458 INFO L435 NwaCegarLoop]: 594 mSDtfsCounter, 855 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2261 mSolverCounterSat, 652 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 855 SdHoareTripleChecker+Valid, 601 SdHoareTripleChecker+Invalid, 2913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 652 IncrementalHoareTripleChecker+Valid, 2261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-01-09 05:55:23,458 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [855 Valid, 601 Invalid, 2913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [652 Valid, 2261 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-01-09 05:55:23,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9937 states. [2025-01-09 05:55:23,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9937 to 9937. [2025-01-09 05:55:23,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9937 states, 9935 states have (on average 1.4700553598389532) internal successors, (14605), 9936 states have internal predecessors, (14605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:55:23,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9937 states to 9937 states and 14605 transitions. [2025-01-09 05:55:23,679 INFO L78 Accepts]: Start accepts. Automaton has 9937 states and 14605 transitions. Word has length 89 [2025-01-09 05:55:23,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:55:23,679 INFO L471 AbstractCegarLoop]: Abstraction has 9937 states and 14605 transitions. [2025-01-09 05:55:23,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 2 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:55:23,680 INFO L276 IsEmpty]: Start isEmpty. Operand 9937 states and 14605 transitions. [2025-01-09 05:55:23,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-01-09 05:55:23,682 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:55:23,682 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:55:23,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 05:55:23,682 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:55:23,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:55:23,682 INFO L85 PathProgramCache]: Analyzing trace with hash -1167843191, now seen corresponding path program 1 times [2025-01-09 05:55:23,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:55:23,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106368644] [2025-01-09 05:55:23,683 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:55:23,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:55:23,693 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-01-09 05:55:23,701 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-01-09 05:55:23,702 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:55:23,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:55:23,830 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 05:55:23,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:55:23,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106368644] [2025-01-09 05:55:23,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106368644] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:55:23,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:55:23,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 05:55:23,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991450180] [2025-01-09 05:55:23,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:55:23,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 05:55:23,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:55:23,832 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 05:55:23,832 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 05:55:23,832 INFO L87 Difference]: Start difference. First operand 9937 states and 14605 transitions. Second operand has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:55:24,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:55:24,396 INFO L93 Difference]: Finished difference Result 52671 states and 75732 transitions. [2025-01-09 05:55:24,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 05:55:24,398 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 0 states have call successors, (0), 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 90 [2025-01-09 05:55:24,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:55:24,463 INFO L225 Difference]: With dead ends: 52671 [2025-01-09 05:55:24,463 INFO L226 Difference]: Without dead ends: 45789 [2025-01-09 05:55:24,471 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-01-09 05:55:24,472 INFO L435 NwaCegarLoop]: 1644 mSDtfsCounter, 8053 mSDsluCounter, 2399 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8053 SdHoareTripleChecker+Valid, 4043 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 05:55:24,473 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8053 Valid, 4043 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 05:55:24,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45789 states. [2025-01-09 05:55:24,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45789 to 16817. [2025-01-09 05:55:24,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16817 states, 16815 states have (on average 1.4490038655961939) internal successors, (24365), 16816 states have internal predecessors, (24365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:55:24,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16817 states to 16817 states and 24365 transitions. [2025-01-09 05:55:24,873 INFO L78 Accepts]: Start accepts. Automaton has 16817 states and 24365 transitions. Word has length 90 [2025-01-09 05:55:24,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:55:24,873 INFO L471 AbstractCegarLoop]: Abstraction has 16817 states and 24365 transitions. [2025-01-09 05:55:24,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:55:24,873 INFO L276 IsEmpty]: Start isEmpty. Operand 16817 states and 24365 transitions. [2025-01-09 05:55:24,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-01-09 05:55:24,877 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:55:24,877 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:55:24,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 05:55:24,877 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:55:24,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:55:24,878 INFO L85 PathProgramCache]: Analyzing trace with hash -903986807, now seen corresponding path program 1 times [2025-01-09 05:55:24,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:55:24,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093320188] [2025-01-09 05:55:24,878 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:55:24,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:55:24,886 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-01-09 05:55:24,894 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-01-09 05:55:24,896 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:55:24,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:55:25,012 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-09 05:55:25,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:55:25,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093320188] [2025-01-09 05:55:25,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093320188] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:55:25,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:55:25,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 05:55:25,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491932908] [2025-01-09 05:55:25,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:55:25,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 05:55:25,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:55:25,014 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 05:55:25,014 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 05:55:25,014 INFO L87 Difference]: Start difference. First operand 16817 states and 24365 transitions. Second operand has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:55:25,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:55:25,692 INFO L93 Difference]: Finished difference Result 59551 states and 85492 transitions. [2025-01-09 05:55:25,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 05:55:25,692 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 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 90 [2025-01-09 05:55:25,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:55:25,778 INFO L225 Difference]: With dead ends: 59551 [2025-01-09 05:55:25,778 INFO L226 Difference]: Without dead ends: 52669 [2025-01-09 05:55:25,798 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-01-09 05:55:25,798 INFO L435 NwaCegarLoop]: 1641 mSDtfsCounter, 8074 mSDsluCounter, 2321 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8074 SdHoareTripleChecker+Valid, 3962 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 05:55:25,798 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8074 Valid, 3962 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 05:55:25,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52669 states. [2025-01-09 05:55:26,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52669 to 27153. [2025-01-09 05:55:26,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27153 states, 27151 states have (on average 1.4336488527126072) internal successors, (38925), 27152 states have internal predecessors, (38925), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:55:26,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27153 states to 27153 states and 38925 transitions. [2025-01-09 05:55:26,691 INFO L78 Accepts]: Start accepts. Automaton has 27153 states and 38925 transitions. Word has length 90 [2025-01-09 05:55:26,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:55:26,692 INFO L471 AbstractCegarLoop]: Abstraction has 27153 states and 38925 transitions. [2025-01-09 05:55:26,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:55:26,692 INFO L276 IsEmpty]: Start isEmpty. Operand 27153 states and 38925 transitions. [2025-01-09 05:55:26,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-01-09 05:55:26,695 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:55:26,695 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:55:26,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 05:55:26,696 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:55:26,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:55:26,696 INFO L85 PathProgramCache]: Analyzing trace with hash 334275209, now seen corresponding path program 1 times [2025-01-09 05:55:26,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:55:26,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943999406] [2025-01-09 05:55:26,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:55:26,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:55:26,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-01-09 05:55:26,718 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-01-09 05:55:26,718 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:55:26,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:55:26,875 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-09 05:55:26,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:55:26,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943999406] [2025-01-09 05:55:26,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943999406] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:55:26,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:55:26,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 05:55:26,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718778504] [2025-01-09 05:55:26,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:55:26,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 05:55:26,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:55:26,878 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 05:55:26,878 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 05:55:26,878 INFO L87 Difference]: Start difference. First operand 27153 states and 38925 transitions. Second operand has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:55:27,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:55:27,728 INFO L93 Difference]: Finished difference Result 66431 states and 95252 transitions. [2025-01-09 05:55:27,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 05:55:27,729 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 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 90 [2025-01-09 05:55:27,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:55:27,811 INFO L225 Difference]: With dead ends: 66431 [2025-01-09 05:55:27,811 INFO L226 Difference]: Without dead ends: 59549 [2025-01-09 05:55:27,831 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-01-09 05:55:27,832 INFO L435 NwaCegarLoop]: 1638 mSDtfsCounter, 8119 mSDsluCounter, 2253 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8119 SdHoareTripleChecker+Valid, 3891 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 05:55:27,832 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8119 Valid, 3891 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 05:55:27,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59549 states. [2025-01-09 05:55:28,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59549 to 34033. [2025-01-09 05:55:28,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34033 states, 34031 states have (on average 1.4306073873820928) internal successors, (48685), 34032 states have internal predecessors, (48685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:55:28,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34033 states to 34033 states and 48685 transitions. [2025-01-09 05:55:28,673 INFO L78 Accepts]: Start accepts. Automaton has 34033 states and 48685 transitions. Word has length 90 [2025-01-09 05:55:28,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:55:28,673 INFO L471 AbstractCegarLoop]: Abstraction has 34033 states and 48685 transitions. [2025-01-09 05:55:28,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:55:28,675 INFO L276 IsEmpty]: Start isEmpty. Operand 34033 states and 48685 transitions. [2025-01-09 05:55:28,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-01-09 05:55:28,678 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:55:28,678 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:55:28,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 05:55:28,678 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:55:28,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:55:28,679 INFO L85 PathProgramCache]: Analyzing trace with hash -1881193591, now seen corresponding path program 1 times [2025-01-09 05:55:28,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:55:28,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400436464] [2025-01-09 05:55:28,680 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:55:28,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:55:28,689 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-01-09 05:55:28,701 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-01-09 05:55:28,702 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:55:28,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:55:28,814 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-09 05:55:28,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:55:28,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400436464] [2025-01-09 05:55:28,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400436464] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:55:28,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:55:28,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 05:55:28,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945274547] [2025-01-09 05:55:28,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:55:28,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 05:55:28,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:55:28,816 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 05:55:28,816 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 05:55:28,816 INFO L87 Difference]: Start difference. First operand 34033 states and 48685 transitions. Second operand has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:55:29,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:55:29,764 INFO L93 Difference]: Finished difference Result 73311 states and 105012 transitions. [2025-01-09 05:55:29,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 05:55:29,764 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 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 90 [2025-01-09 05:55:29,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:55:29,845 INFO L225 Difference]: With dead ends: 73311 [2025-01-09 05:55:29,845 INFO L226 Difference]: Without dead ends: 66429 [2025-01-09 05:55:29,862 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-01-09 05:55:29,862 INFO L435 NwaCegarLoop]: 1635 mSDtfsCounter, 8168 mSDsluCounter, 2280 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8168 SdHoareTripleChecker+Valid, 3915 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 05:55:29,862 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8168 Valid, 3915 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 05:55:29,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66429 states. [2025-01-09 05:55:30,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66429 to 40913. [2025-01-09 05:55:30,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40913 states, 40911 states have (on average 1.428588888074112) internal successors, (58445), 40912 states have internal predecessors, (58445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:55:30,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40913 states to 40913 states and 58445 transitions. [2025-01-09 05:55:30,939 INFO L78 Accepts]: Start accepts. Automaton has 40913 states and 58445 transitions. Word has length 90 [2025-01-09 05:55:30,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:55:30,939 INFO L471 AbstractCegarLoop]: Abstraction has 40913 states and 58445 transitions. [2025-01-09 05:55:30,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:55:30,939 INFO L276 IsEmpty]: Start isEmpty. Operand 40913 states and 58445 transitions. [2025-01-09 05:55:30,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-01-09 05:55:30,943 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:55:30,943 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:55:30,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 05:55:30,943 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:55:30,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:55:30,944 INFO L85 PathProgramCache]: Analyzing trace with hash -100260727, now seen corresponding path program 1 times [2025-01-09 05:55:30,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:55:30,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221144210] [2025-01-09 05:55:30,944 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:55:30,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:55:30,955 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-01-09 05:55:30,965 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-01-09 05:55:30,965 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:55:30,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:55:31,100 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 05:55:31,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:55:31,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221144210] [2025-01-09 05:55:31,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221144210] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:55:31,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:55:31,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 05:55:31,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470969701] [2025-01-09 05:55:31,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:55:31,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 05:55:31,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:55:31,101 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 05:55:31,101 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 05:55:31,102 INFO L87 Difference]: Start difference. First operand 40913 states and 58445 transitions. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:55:32,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:55:32,606 INFO L93 Difference]: Finished difference Result 80191 states and 114772 transitions. [2025-01-09 05:55:32,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 05:55:32,607 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 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 90 [2025-01-09 05:55:32,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:55:32,703 INFO L225 Difference]: With dead ends: 80191 [2025-01-09 05:55:32,703 INFO L226 Difference]: Without dead ends: 73309 [2025-01-09 05:55:32,728 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-01-09 05:55:32,728 INFO L435 NwaCegarLoop]: 1642 mSDtfsCounter, 8072 mSDsluCounter, 2346 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8072 SdHoareTripleChecker+Valid, 3988 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 05:55:32,728 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8072 Valid, 3988 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 05:55:32,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73309 states. [2025-01-09 05:55:33,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73309 to 47793. [2025-01-09 05:55:33,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47793 states, 47791 states have (on average 1.427151555732251) internal successors, (68205), 47792 states have internal predecessors, (68205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:55:33,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47793 states to 47793 states and 68205 transitions. [2025-01-09 05:55:33,810 INFO L78 Accepts]: Start accepts. Automaton has 47793 states and 68205 transitions. Word has length 90 [2025-01-09 05:55:33,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:55:33,811 INFO L471 AbstractCegarLoop]: Abstraction has 47793 states and 68205 transitions. [2025-01-09 05:55:33,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:55:33,811 INFO L276 IsEmpty]: Start isEmpty. Operand 47793 states and 68205 transitions. [2025-01-09 05:55:33,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-01-09 05:55:33,815 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:55:33,815 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:55:33,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 05:55:33,816 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:55:33,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:55:33,816 INFO L85 PathProgramCache]: Analyzing trace with hash 1634924353, now seen corresponding path program 1 times [2025-01-09 05:55:33,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:55:33,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723088267] [2025-01-09 05:55:33,816 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:55:33,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:55:33,824 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-01-09 05:55:33,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-01-09 05:55:33,841 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:55:33,841 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:55:33,891 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:55:33,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:55:33,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723088267] [2025-01-09 05:55:33,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723088267] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:55:33,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:55:33,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:55:33,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791168534] [2025-01-09 05:55:33,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:55:33,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:55:33,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:55:33,893 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:55:33,893 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:55:33,893 INFO L87 Difference]: Start difference. First operand 47793 states and 68205 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:55:34,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:55:34,362 INFO L93 Difference]: Finished difference Result 79435 states and 113574 transitions. [2025-01-09 05:55:34,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:55:34,363 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 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 92 [2025-01-09 05:55:34,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:55:34,406 INFO L225 Difference]: With dead ends: 79435 [2025-01-09 05:55:34,406 INFO L226 Difference]: Without dead ends: 34697 [2025-01-09 05:55:34,442 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:55:34,442 INFO L435 NwaCegarLoop]: 1613 mSDtfsCounter, 58 mSDsluCounter, 1550 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 3163 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:55:34,442 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 3163 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:55:34,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34697 states. [2025-01-09 05:55:35,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34697 to 34695. [2025-01-09 05:55:35,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34695 states, 34693 states have (on average 1.4325368229902287) internal successors, (49699), 34694 states have internal predecessors, (49699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:55:35,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34695 states to 34695 states and 49699 transitions. [2025-01-09 05:55:35,487 INFO L78 Accepts]: Start accepts. Automaton has 34695 states and 49699 transitions. Word has length 92 [2025-01-09 05:55:35,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:55:35,487 INFO L471 AbstractCegarLoop]: Abstraction has 34695 states and 49699 transitions. [2025-01-09 05:55:35,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:55:35,487 INFO L276 IsEmpty]: Start isEmpty. Operand 34695 states and 49699 transitions. [2025-01-09 05:55:35,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-01-09 05:55:35,489 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:55:35,489 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:55:35,490 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 05:55:35,490 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:55:35,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:55:35,490 INFO L85 PathProgramCache]: Analyzing trace with hash -1049374556, now seen corresponding path program 1 times [2025-01-09 05:55:35,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:55:35,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288671858] [2025-01-09 05:55:35,490 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:55:35,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:55:35,500 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-01-09 05:55:35,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-01-09 05:55:35,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:55:35,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:55:35,649 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 05:55:35,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:55:35,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288671858] [2025-01-09 05:55:35,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288671858] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:55:35,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:55:35,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 05:55:35,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778828924] [2025-01-09 05:55:35,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:55:35,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 05:55:35,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:55:35,650 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 05:55:35,651 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 05:55:35,651 INFO L87 Difference]: Start difference. First operand 34695 states and 49699 transitions. Second operand has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:55:36,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:55:36,942 INFO L93 Difference]: Finished difference Result 63893 states and 91562 transitions. [2025-01-09 05:55:36,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 05:55:36,943 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 92 [2025-01-09 05:55:36,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:55:37,021 INFO L225 Difference]: With dead ends: 63893 [2025-01-09 05:55:37,021 INFO L226 Difference]: Without dead ends: 59027 [2025-01-09 05:55:37,043 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-01-09 05:55:37,044 INFO L435 NwaCegarLoop]: 1634 mSDtfsCounter, 8058 mSDsluCounter, 2563 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8058 SdHoareTripleChecker+Valid, 4197 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 05:55:37,044 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8058 Valid, 4197 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 05:55:37,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59027 states. [2025-01-09 05:55:38,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59027 to 39559. [2025-01-09 05:55:38,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39559 states, 39557 states have (on average 1.431124706120282) internal successors, (56611), 39558 states have internal predecessors, (56611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:55:38,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39559 states to 39559 states and 56611 transitions. [2025-01-09 05:55:38,179 INFO L78 Accepts]: Start accepts. Automaton has 39559 states and 56611 transitions. Word has length 92 [2025-01-09 05:55:38,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:55:38,179 INFO L471 AbstractCegarLoop]: Abstraction has 39559 states and 56611 transitions. [2025-01-09 05:55:38,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:55:38,179 INFO L276 IsEmpty]: Start isEmpty. Operand 39559 states and 56611 transitions. [2025-01-09 05:55:38,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-01-09 05:55:38,182 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:55:38,182 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:55:38,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 05:55:38,182 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:55:38,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:55:38,182 INFO L85 PathProgramCache]: Analyzing trace with hash 73439256, now seen corresponding path program 1 times [2025-01-09 05:55:38,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:55:38,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063694439] [2025-01-09 05:55:38,182 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:55:38,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:55:38,190 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-01-09 05:55:38,198 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-01-09 05:55:38,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:55:38,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:55:38,245 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:55:38,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:55:38,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063694439] [2025-01-09 05:55:38,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063694439] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:55:38,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:55:38,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:55:38,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010473967] [2025-01-09 05:55:38,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:55:38,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:55:38,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:55:38,247 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:55:38,247 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:55:38,247 INFO L87 Difference]: Start difference. First operand 39559 states and 56611 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:55:38,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:55:38,548 INFO L93 Difference]: Finished difference Result 57803 states and 82533 transitions. [2025-01-09 05:55:38,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:55:38,549 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 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 93 [2025-01-09 05:55:38,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:55:38,573 INFO L225 Difference]: With dead ends: 57803 [2025-01-09 05:55:38,573 INFO L226 Difference]: Without dead ends: 21321 [2025-01-09 05:55:38,596 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:55:38,596 INFO L435 NwaCegarLoop]: 1606 mSDtfsCounter, 53 mSDsluCounter, 1542 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 3148 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:55:38,597 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 3148 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:55:38,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21321 states. [2025-01-09 05:55:38,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21321 to 21319. [2025-01-09 05:55:38,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21319 states, 21317 states have (on average 1.428484308298541) internal successors, (30451), 21318 states have internal predecessors, (30451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:55:38,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21319 states to 21319 states and 30451 transitions. [2025-01-09 05:55:38,965 INFO L78 Accepts]: Start accepts. Automaton has 21319 states and 30451 transitions. Word has length 93 [2025-01-09 05:55:38,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:55:38,966 INFO L471 AbstractCegarLoop]: Abstraction has 21319 states and 30451 transitions. [2025-01-09 05:55:38,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:55:38,966 INFO L276 IsEmpty]: Start isEmpty. Operand 21319 states and 30451 transitions. [2025-01-09 05:55:38,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-01-09 05:55:38,967 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:55:38,967 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:55:38,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 05:55:38,968 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:55:38,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:55:38,968 INFO L85 PathProgramCache]: Analyzing trace with hash -1541447286, now seen corresponding path program 1 times [2025-01-09 05:55:38,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:55:38,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205602136] [2025-01-09 05:55:38,968 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:55:38,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:55:38,975 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-01-09 05:55:38,983 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-01-09 05:55:38,984 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:55:38,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:55:39,025 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:55:39,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:55:39,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205602136] [2025-01-09 05:55:39,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205602136] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:55:39,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:55:39,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:55:39,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008626392] [2025-01-09 05:55:39,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:55:39,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:55:39,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:55:39,026 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:55:39,026 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:55:39,026 INFO L87 Difference]: Start difference. First operand 21319 states and 30451 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:55:39,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:55:39,187 INFO L93 Difference]: Finished difference Result 30443 states and 43293 transitions. [2025-01-09 05:55:39,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:55:39,188 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2025-01-09 05:55:39,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:55:39,203 INFO L225 Difference]: With dead ends: 30443 [2025-01-09 05:55:39,203 INFO L226 Difference]: Without dead ends: 12201 [2025-01-09 05:55:39,216 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:55:39,217 INFO L435 NwaCegarLoop]: 1599 mSDtfsCounter, 50 mSDsluCounter, 1534 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 3133 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:55:39,218 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 3133 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:55:39,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12201 states. [2025-01-09 05:55:39,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12201 to 12199. [2025-01-09 05:55:39,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12199 states, 12197 states have (on average 1.43404115766172) internal successors, (17491), 12198 states have internal predecessors, (17491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:55:39,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12199 states to 12199 states and 17491 transitions. [2025-01-09 05:55:39,544 INFO L78 Accepts]: Start accepts. Automaton has 12199 states and 17491 transitions. Word has length 95 [2025-01-09 05:55:39,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:55:39,544 INFO L471 AbstractCegarLoop]: Abstraction has 12199 states and 17491 transitions. [2025-01-09 05:55:39,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:55:39,544 INFO L276 IsEmpty]: Start isEmpty. Operand 12199 states and 17491 transitions. [2025-01-09 05:55:39,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-01-09 05:55:39,545 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:55:39,545 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:55:39,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 05:55:39,545 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:55:39,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:55:39,546 INFO L85 PathProgramCache]: Analyzing trace with hash 1705365884, now seen corresponding path program 1 times [2025-01-09 05:55:39,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:55:39,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396191658] [2025-01-09 05:55:39,546 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:55:39,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:55:39,553 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-01-09 05:55:39,561 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-01-09 05:55:39,561 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:55:39,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:55:39,601 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:55:39,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:55:39,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396191658] [2025-01-09 05:55:39,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396191658] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:55:39,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:55:39,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:55:39,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700921742] [2025-01-09 05:55:39,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:55:39,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:55:39,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:55:39,602 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:55:39,602 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:55:39,602 INFO L87 Difference]: Start difference. First operand 12199 states and 17491 transitions. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:55:39,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:55:39,689 INFO L93 Difference]: Finished difference Result 16763 states and 23853 transitions. [2025-01-09 05:55:39,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:55:39,689 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 97 [2025-01-09 05:55:39,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:55:39,698 INFO L225 Difference]: With dead ends: 16763 [2025-01-09 05:55:39,699 INFO L226 Difference]: Without dead ends: 7641 [2025-01-09 05:55:39,705 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:55:39,706 INFO L435 NwaCegarLoop]: 1592 mSDtfsCounter, 47 mSDsluCounter, 1526 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 3118 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:55:39,706 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 3118 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:55:39,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7641 states. [2025-01-09 05:55:39,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7641 to 7639. [2025-01-09 05:55:39,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7639 states, 7637 states have (on average 1.4496530051067174) internal successors, (11071), 7638 states have internal predecessors, (11071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:55:39,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7639 states to 7639 states and 11071 transitions. [2025-01-09 05:55:39,818 INFO L78 Accepts]: Start accepts. Automaton has 7639 states and 11071 transitions. Word has length 97 [2025-01-09 05:55:39,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:55:39,819 INFO L471 AbstractCegarLoop]: Abstraction has 7639 states and 11071 transitions. [2025-01-09 05:55:39,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:55:39,819 INFO L276 IsEmpty]: Start isEmpty. Operand 7639 states and 11071 transitions. [2025-01-09 05:55:39,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-01-09 05:55:39,820 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:55:39,821 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:55:39,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-09 05:55:39,821 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:55:39,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:55:39,821 INFO L85 PathProgramCache]: Analyzing trace with hash -1944982446, now seen corresponding path program 1 times [2025-01-09 05:55:39,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:55:39,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986840807] [2025-01-09 05:55:39,821 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:55:39,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:55:39,829 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-01-09 05:55:39,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-01-09 05:55:39,834 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:55:39,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:55:39,863 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:55:39,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:55:39,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986840807] [2025-01-09 05:55:39,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986840807] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:55:39,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:55:39,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 05:55:39,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494678229] [2025-01-09 05:55:39,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:55:39,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:55:39,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:55:39,864 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:55:39,864 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:55:39,864 INFO L87 Difference]: Start difference. First operand 7639 states and 11071 transitions. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 2 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:55:42,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:55:42,299 INFO L93 Difference]: Finished difference Result 13651 states and 20467 transitions. [2025-01-09 05:55:42,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:55:42,299 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 2 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 97 [2025-01-09 05:55:42,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:55:42,310 INFO L225 Difference]: With dead ends: 13651 [2025-01-09 05:55:42,310 INFO L226 Difference]: Without dead ends: 10645 [2025-01-09 05:55:42,313 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:55:42,313 INFO L435 NwaCegarLoop]: 702 mSDtfsCounter, 1039 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2380 mSolverCounterSat, 550 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1039 SdHoareTripleChecker+Valid, 709 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:55:42,313 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1039 Valid, 709 Invalid, 2930 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [550 Valid, 2380 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-01-09 05:55:42,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10645 states. [2025-01-09 05:55:42,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10645 to 9892. [2025-01-09 05:55:42,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9892 states, 9890 states have (on average 1.4298281092012133) internal successors, (14141), 9891 states have internal predecessors, (14141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:55:42,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9892 states to 9892 states and 14141 transitions. [2025-01-09 05:55:42,509 INFO L78 Accepts]: Start accepts. Automaton has 9892 states and 14141 transitions. Word has length 97 [2025-01-09 05:55:42,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:55:42,510 INFO L471 AbstractCegarLoop]: Abstraction has 9892 states and 14141 transitions. [2025-01-09 05:55:42,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 2 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:55:42,510 INFO L276 IsEmpty]: Start isEmpty. Operand 9892 states and 14141 transitions. [2025-01-09 05:55:42,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-01-09 05:55:42,511 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:55:42,511 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, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:42,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-01-09 05:55:42,511 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:55:42,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:55:42,511 INFO L85 PathProgramCache]: Analyzing trace with hash 1668745198, now seen corresponding path program 1 times [2025-01-09 05:55:42,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:55:42,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463671789] [2025-01-09 05:55:42,511 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:55:42,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:55:42,521 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-01-09 05:55:42,535 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-01-09 05:55:42,535 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:55:42,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:55:42,601 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:55:42,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:55:42,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463671789] [2025-01-09 05:55:42,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463671789] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:55:42,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:55:42,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:55:42,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679835396] [2025-01-09 05:55:42,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:55:42,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:55:42,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:55:42,602 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:55:42,602 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:55:42,602 INFO L87 Difference]: Start difference. First operand 9892 states and 14141 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:55:42,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:55:42,693 INFO L93 Difference]: Finished difference Result 12176 states and 17293 transitions. [2025-01-09 05:55:42,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:55:42,693 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 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 99 [2025-01-09 05:55:42,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:55:42,701 INFO L225 Difference]: With dead ends: 12176 [2025-01-09 05:55:42,702 INFO L226 Difference]: Without dead ends: 7614 [2025-01-09 05:55:42,705 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:55:42,705 INFO L435 NwaCegarLoop]: 1585 mSDtfsCounter, 44 mSDsluCounter, 1518 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 3103 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:55:42,705 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 3103 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:55:42,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7614 states. [2025-01-09 05:55:42,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7614 to 7612. [2025-01-09 05:55:42,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7612 states, 7610 states have (on average 1.440341655716163) internal successors, (10961), 7611 states have internal predecessors, (10961), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:55:42,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7612 states to 7612 states and 10961 transitions. [2025-01-09 05:55:42,842 INFO L78 Accepts]: Start accepts. Automaton has 7612 states and 10961 transitions. Word has length 99 [2025-01-09 05:55:42,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:55:42,842 INFO L471 AbstractCegarLoop]: Abstraction has 7612 states and 10961 transitions. [2025-01-09 05:55:42,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:55:42,842 INFO L276 IsEmpty]: Start isEmpty. Operand 7612 states and 10961 transitions. [2025-01-09 05:55:42,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-01-09 05:55:42,843 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:55:42,843 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:42,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-01-09 05:55:42,843 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:55:42,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:55:42,844 INFO L85 PathProgramCache]: Analyzing trace with hash -109173536, now seen corresponding path program 1 times [2025-01-09 05:55:42,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:55:42,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253958039] [2025-01-09 05:55:42,844 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:55:42,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:55:42,854 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-01-09 05:55:42,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-01-09 05:55:42,864 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:55:42,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:55:42,929 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:55:42,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:55:42,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253958039] [2025-01-09 05:55:42,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253958039] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:55:42,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:55:42,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:55:42,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161754405] [2025-01-09 05:55:42,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:55:42,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:55:42,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:55:42,930 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:55:42,930 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:55:42,930 INFO L87 Difference]: Start difference. First operand 7612 states and 10961 transitions. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:55:42,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:55:42,994 INFO L93 Difference]: Finished difference Result 8756 states and 12523 transitions. [2025-01-09 05:55:42,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:55:42,994 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 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 101 [2025-01-09 05:55:42,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:55:43,003 INFO L225 Difference]: With dead ends: 8756 [2025-01-09 05:55:43,004 INFO L226 Difference]: Without dead ends: 6474 [2025-01-09 05:55:43,007 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:55:43,007 INFO L435 NwaCegarLoop]: 1578 mSDtfsCounter, 41 mSDsluCounter, 1510 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 3088 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:55:43,008 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 3088 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:55:43,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6474 states. [2025-01-09 05:55:43,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6474 to 6472. [2025-01-09 05:55:43,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6472 states, 6470 states have (on average 1.450695517774343) internal successors, (9386), 6471 states have internal predecessors, (9386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:55:43,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6472 states to 6472 states and 9386 transitions. [2025-01-09 05:55:43,119 INFO L78 Accepts]: Start accepts. Automaton has 6472 states and 9386 transitions. Word has length 101 [2025-01-09 05:55:43,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:55:43,119 INFO L471 AbstractCegarLoop]: Abstraction has 6472 states and 9386 transitions. [2025-01-09 05:55:43,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:55:43,120 INFO L276 IsEmpty]: Start isEmpty. Operand 6472 states and 9386 transitions. [2025-01-09 05:55:43,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-01-09 05:55:43,121 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:55:43,121 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:43,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-01-09 05:55:43,121 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:55:43,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:55:43,122 INFO L85 PathProgramCache]: Analyzing trace with hash -1223800750, now seen corresponding path program 1 times [2025-01-09 05:55:43,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:55:43,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141192836] [2025-01-09 05:55:43,123 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:55:43,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:55:43,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-01-09 05:55:43,158 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-01-09 05:55:43,158 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:55:43,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:55:43,798 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:55:43,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:55:43,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141192836] [2025-01-09 05:55:43,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141192836] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 05:55:43,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [577534492] [2025-01-09 05:55:43,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:55:43,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:55:43,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:55:43,805 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:55:43,807 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:55:43,894 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-01-09 05:55:43,944 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-01-09 05:55:43,944 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:55:43,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:55:43,947 INFO L256 TraceCheckSpWp]: Trace formula consists of 491 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-01-09 05:55:43,952 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:55:44,191 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 05:55:44,192 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 05:55:44,407 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 05:55:44,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [577534492] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 05:55:44,407 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 05:55:44,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 6, 4] total 19 [2025-01-09 05:55:44,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742250816] [2025-01-09 05:55:44,408 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 05:55:44,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-01-09 05:55:44,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:55:44,409 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-01-09 05:55:44,410 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2025-01-09 05:55:44,410 INFO L87 Difference]: Start difference. First operand 6472 states and 9386 transitions. Second operand has 19 states, 19 states have (on average 15.368421052631579) internal successors, (292), 19 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:55:46,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:55:46,665 INFO L93 Difference]: Finished difference Result 15303 states and 21328 transitions. [2025-01-09 05:55:46,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2025-01-09 05:55:46,666 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 15.368421052631579) internal successors, (292), 19 states have internal predecessors, (292), 0 states have call successors, (0), 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 103 [2025-01-09 05:55:46,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:55:46,680 INFO L225 Difference]: With dead ends: 15303 [2025-01-09 05:55:46,681 INFO L226 Difference]: Without dead ends: 14161 [2025-01-09 05:55:46,685 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1292 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=774, Invalid=3516, Unknown=0, NotChecked=0, Total=4290 [2025-01-09 05:55:46,685 INFO L435 NwaCegarLoop]: 1535 mSDtfsCounter, 16438 mSDsluCounter, 8014 mSDsCounter, 0 mSdLazyCounter, 980 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16438 SdHoareTripleChecker+Valid, 9549 SdHoareTripleChecker+Invalid, 1036 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 980 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 05:55:46,686 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16438 Valid, 9549 Invalid, 1036 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 980 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 05:55:46,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14161 states. [2025-01-09 05:55:46,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14161 to 14109. [2025-01-09 05:55:46,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14109 states, 14107 states have (on average 1.3677606861841638) internal successors, (19295), 14108 states have internal predecessors, (19295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:55:46,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14109 states to 14109 states and 19295 transitions. [2025-01-09 05:55:46,941 INFO L78 Accepts]: Start accepts. Automaton has 14109 states and 19295 transitions. Word has length 103 [2025-01-09 05:55:46,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:55:46,941 INFO L471 AbstractCegarLoop]: Abstraction has 14109 states and 19295 transitions. [2025-01-09 05:55:46,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 15.368421052631579) internal successors, (292), 19 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:55:46,941 INFO L276 IsEmpty]: Start isEmpty. Operand 14109 states and 19295 transitions. [2025-01-09 05:55:46,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-01-09 05:55:46,942 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:55:46,942 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:46,950 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:55:47,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-01-09 05:55:47,143 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:55:47,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:55:47,143 INFO L85 PathProgramCache]: Analyzing trace with hash 1075439892, now seen corresponding path program 1 times [2025-01-09 05:55:47,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:55:47,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054987902] [2025-01-09 05:55:47,143 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:55:47,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:55:47,151 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-01-09 05:55:47,168 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-01-09 05:55:47,168 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:55:47,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:55:47,733 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:55:47,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:55:47,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054987902] [2025-01-09 05:55:47,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054987902] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 05:55:47,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1981103053] [2025-01-09 05:55:47,733 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:55:47,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:55:47,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:55:47,735 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:55:47,736 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:55:47,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-01-09 05:55:47,833 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-01-09 05:55:47,833 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:55:47,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:55:47,834 INFO L256 TraceCheckSpWp]: Trace formula consists of 496 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-09 05:55:47,836 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:55:48,207 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:55:48,207 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 05:55:48,864 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:55:48,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1981103053] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 05:55:48,864 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 05:55:48,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 27 [2025-01-09 05:55:48,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105755239] [2025-01-09 05:55:48,864 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 05:55:48,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-01-09 05:55:48,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:55:48,865 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-01-09 05:55:48,865 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=657, Unknown=0, NotChecked=0, Total=756 [2025-01-09 05:55:48,865 INFO L87 Difference]: Start difference. First operand 14109 states and 19295 transitions. Second operand has 28 states, 28 states have (on average 9.428571428571429) internal successors, (264), 27 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:55:50,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:55:50,258 INFO L93 Difference]: Finished difference Result 39213 states and 52188 transitions. [2025-01-09 05:55:50,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-01-09 05:55:50,258 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 9.428571428571429) internal successors, (264), 27 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 104 [2025-01-09 05:55:50,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:55:50,291 INFO L225 Difference]: With dead ends: 39213 [2025-01-09 05:55:50,291 INFO L226 Difference]: Without dead ends: 30698 [2025-01-09 05:55:50,300 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 480 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=502, Invalid=1850, Unknown=0, NotChecked=0, Total=2352 [2025-01-09 05:55:50,301 INFO L435 NwaCegarLoop]: 1525 mSDtfsCounter, 22660 mSDsluCounter, 6513 mSDsCounter, 0 mSdLazyCounter, 752 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22660 SdHoareTripleChecker+Valid, 8038 SdHoareTripleChecker+Invalid, 793 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 752 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 05:55:50,301 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22660 Valid, 8038 Invalid, 793 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 752 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 05:55:50,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30698 states. [2025-01-09 05:55:50,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30698 to 30604. [2025-01-09 05:55:50,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30604 states, 30602 states have (on average 1.3249787595581988) internal successors, (40547), 30603 states have internal predecessors, (40547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:55:51,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30604 states to 30604 states and 40547 transitions. [2025-01-09 05:55:51,018 INFO L78 Accepts]: Start accepts. Automaton has 30604 states and 40547 transitions. Word has length 104 [2025-01-09 05:55:51,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:55:51,019 INFO L471 AbstractCegarLoop]: Abstraction has 30604 states and 40547 transitions. [2025-01-09 05:55:51,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 9.428571428571429) internal successors, (264), 27 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:55:51,019 INFO L276 IsEmpty]: Start isEmpty. Operand 30604 states and 40547 transitions. [2025-01-09 05:55:51,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-01-09 05:55:51,020 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:55:51,020 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:51,028 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 05:55:51,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-01-09 05:55:51,221 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:55:51,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:55:51,221 INFO L85 PathProgramCache]: Analyzing trace with hash 1147051284, now seen corresponding path program 1 times [2025-01-09 05:55:51,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:55:51,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058309026] [2025-01-09 05:55:51,222 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:55:51,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:55:51,230 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-01-09 05:55:51,239 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-01-09 05:55:51,240 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:55:51,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:55:51,471 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:55:51,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:55:51,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058309026] [2025-01-09 05:55:51,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058309026] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 05:55:51,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1623483728] [2025-01-09 05:55:51,472 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:55:51,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:55:51,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:55:51,474 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:55:51,478 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:55:51,553 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-01-09 05:55:51,594 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-01-09 05:55:51,594 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:55:51,594 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:55:51,596 INFO L256 TraceCheckSpWp]: Trace formula consists of 496 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-09 05:55:51,598 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:55:51,924 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:55:51,924 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 05:55:52,586 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:55:52,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1623483728] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 05:55:52,586 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 05:55:52,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 22 [2025-01-09 05:55:52,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883082939] [2025-01-09 05:55:52,587 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 05:55:52,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-01-09 05:55:52,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:55:52,588 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-01-09 05:55:52,588 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=407, Unknown=0, NotChecked=0, Total=506 [2025-01-09 05:55:52,588 INFO L87 Difference]: Start difference. First operand 30604 states and 40547 transitions. Second operand has 23 states, 23 states have (on average 11.217391304347826) internal successors, (258), 22 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:55:53,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:55:53,546 INFO L93 Difference]: Finished difference Result 55394 states and 72695 transitions. [2025-01-09 05:55:53,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 05:55:53,547 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 11.217391304347826) internal successors, (258), 22 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 104 [2025-01-09 05:55:53,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:55:53,630 INFO L225 Difference]: With dead ends: 55394 [2025-01-09 05:55:53,630 INFO L226 Difference]: Without dead ends: 31394 [2025-01-09 05:55:53,641 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=269, Invalid=787, Unknown=0, NotChecked=0, Total=1056 [2025-01-09 05:55:53,642 INFO L435 NwaCegarLoop]: 1531 mSDtfsCounter, 11010 mSDsluCounter, 3359 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11010 SdHoareTripleChecker+Valid, 4890 SdHoareTripleChecker+Invalid, 386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 05:55:53,642 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11010 Valid, 4890 Invalid, 386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 371 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 05:55:53,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31394 states. [2025-01-09 05:55:54,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31394 to 26726. [2025-01-09 05:55:54,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26726 states, 26724 states have (on average 1.3091228857955395) internal successors, (34985), 26725 states have internal predecessors, (34985), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:55:54,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26726 states to 26726 states and 34985 transitions. [2025-01-09 05:55:54,198 INFO L78 Accepts]: Start accepts. Automaton has 26726 states and 34985 transitions. Word has length 104 [2025-01-09 05:55:54,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:55:54,198 INFO L471 AbstractCegarLoop]: Abstraction has 26726 states and 34985 transitions. [2025-01-09 05:55:54,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 11.217391304347826) internal successors, (258), 22 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:55:54,198 INFO L276 IsEmpty]: Start isEmpty. Operand 26726 states and 34985 transitions. [2025-01-09 05:55:54,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-01-09 05:55:54,199 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:55:54,199 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:54,244 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-09 05:55:54,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:55:54,400 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:55:54,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:55:54,400 INFO L85 PathProgramCache]: Analyzing trace with hash -1267975148, now seen corresponding path program 1 times [2025-01-09 05:55:54,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:55:54,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779530897] [2025-01-09 05:55:54,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:55:54,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:55:54,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-01-09 05:55:54,418 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-01-09 05:55:54,418 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:55:54,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:55:54,941 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:55:54,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:55:54,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779530897] [2025-01-09 05:55:54,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779530897] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 05:55:54,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1257193518] [2025-01-09 05:55:54,941 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:55:54,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:55:54,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:55:54,943 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:55:54,944 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:55:55,004 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-01-09 05:55:55,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-01-09 05:55:55,039 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:55:55,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:55:55,041 INFO L256 TraceCheckSpWp]: Trace formula consists of 496 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-09 05:55:55,042 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:55:55,337 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 15 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:55:55,337 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 05:55:56,025 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 15 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:55:56,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1257193518] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 05:55:56,025 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 05:55:56,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 27 [2025-01-09 05:55:56,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719628097] [2025-01-09 05:55:56,025 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 05:55:56,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-01-09 05:55:56,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:55:56,026 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-01-09 05:55:56,026 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=657, Unknown=0, NotChecked=0, Total=756 [2025-01-09 05:55:56,026 INFO L87 Difference]: Start difference. First operand 26726 states and 34985 transitions. Second operand has 28 states, 28 states have (on average 9.214285714285714) internal successors, (258), 27 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:55:58,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:55:58,793 INFO L93 Difference]: Finished difference Result 98925 states and 126347 transitions. [2025-01-09 05:55:58,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-01-09 05:55:58,794 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 9.214285714285714) internal successors, (258), 27 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 104 [2025-01-09 05:55:58,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:55:58,882 INFO L225 Difference]: With dead ends: 98925 [2025-01-09 05:55:58,882 INFO L226 Difference]: Without dead ends: 79170 [2025-01-09 05:55:58,902 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 664 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=661, Invalid=2419, Unknown=0, NotChecked=0, Total=3080 [2025-01-09 05:55:58,902 INFO L435 NwaCegarLoop]: 1554 mSDtfsCounter, 25644 mSDsluCounter, 5159 mSDsCounter, 0 mSdLazyCounter, 831 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25644 SdHoareTripleChecker+Valid, 6713 SdHoareTripleChecker+Invalid, 871 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 831 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 05:55:58,902 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25644 Valid, 6713 Invalid, 871 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 831 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 05:55:58,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79170 states. [2025-01-09 05:56:00,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79170 to 78166. [2025-01-09 05:56:01,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78166 states, 78164 states have (on average 1.2724399979530219) internal successors, (99459), 78165 states have internal predecessors, (99459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:56:01,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78166 states to 78166 states and 99459 transitions. [2025-01-09 05:56:01,154 INFO L78 Accepts]: Start accepts. Automaton has 78166 states and 99459 transitions. Word has length 104 [2025-01-09 05:56:01,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:56:01,155 INFO L471 AbstractCegarLoop]: Abstraction has 78166 states and 99459 transitions. [2025-01-09 05:56:01,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 9.214285714285714) internal successors, (258), 27 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:56:01,155 INFO L276 IsEmpty]: Start isEmpty. Operand 78166 states and 99459 transitions. [2025-01-09 05:56:01,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-01-09 05:56:01,157 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:56:01,157 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:01,164 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:56:01,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:56:01,358 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:56:01,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:56:01,358 INFO L85 PathProgramCache]: Analyzing trace with hash -2096293948, now seen corresponding path program 1 times [2025-01-09 05:56:01,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:56:01,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91314573] [2025-01-09 05:56:01,358 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:56:01,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:56:01,368 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-01-09 05:56:01,382 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-01-09 05:56:01,382 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:56:01,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:56:01,710 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:56:01,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:56:01,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91314573] [2025-01-09 05:56:01,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91314573] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 05:56:01,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1151339293] [2025-01-09 05:56:01,711 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:56:01,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:56:01,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:56:01,713 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:56:01,715 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:56:01,785 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-01-09 05:56:01,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-01-09 05:56:01,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:56:01,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:56:01,842 INFO L256 TraceCheckSpWp]: Trace formula consists of 498 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-01-09 05:56:01,845 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:56:03,956 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:56:03,957 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 05:56:06,971 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:56:06,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1151339293] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 05:56:06,972 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 05:56:06,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 20, 21] total 47 [2025-01-09 05:56:06,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817068924] [2025-01-09 05:56:06,972 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 05:56:06,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2025-01-09 05:56:06,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:56:06,972 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2025-01-09 05:56:06,973 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=297, Invalid=1865, Unknown=0, NotChecked=0, Total=2162 [2025-01-09 05:56:06,973 INFO L87 Difference]: Start difference. First operand 78166 states and 99459 transitions. Second operand has 47 states, 47 states have (on average 5.851063829787234) internal successors, (275), 47 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)