./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.6.1.ufo.BOUNDED-12.pals+Problem12_label05.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.1.ufo.BOUNDED-12.pals+Problem12_label05.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 87305a5a64643923e8c67b443e2c0728b204b4b8052ef3905bef24700762109e --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 05:53:15,984 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 05:53:16,039 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:53:16,044 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 05:53:16,046 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 05:53:16,058 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 05:53:16,059 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 05:53:16,059 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 05:53:16,059 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 05:53:16,059 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 05:53:16,060 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 05:53:16,060 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 05:53:16,060 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 05:53:16,060 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 05:53:16,060 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 05:53:16,060 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 05:53:16,060 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 05:53:16,060 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 05:53:16,060 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 05:53:16,061 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 05:53:16,061 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 05:53:16,061 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 05:53:16,061 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 05:53:16,061 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 05:53:16,061 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 05:53:16,061 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 05:53:16,061 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 05:53:16,061 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 05:53:16,061 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 05:53:16,061 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 05:53:16,062 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 05:53:16,062 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 05:53:16,062 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:53:16,062 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 05:53:16,062 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 05:53:16,062 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 05:53:16,062 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 05:53:16,062 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:53:16,062 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 05:53:16,062 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 05:53:16,062 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 05:53:16,062 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 05:53:16,062 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 05:53:16,062 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 05:53:16,062 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 05:53:16,062 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 05:53:16,062 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 05:53:16,062 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 05:53:16,062 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 -> 87305a5a64643923e8c67b443e2c0728b204b4b8052ef3905bef24700762109e [2025-01-09 05:53:16,297 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 05:53:16,304 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 05:53:16,307 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 05:53:16,308 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 05:53:16,308 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 05:53:16,309 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.6.1.ufo.BOUNDED-12.pals+Problem12_label05.c [2025-01-09 05:53:17,548 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/af35289ae/fcafa709578b4301b618db1cd743fc69/FLAG9b5e4f106 [2025-01-09 05:53:17,980 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 05:53:17,980 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.6.1.ufo.BOUNDED-12.pals+Problem12_label05.c [2025-01-09 05:53:18,014 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/af35289ae/fcafa709578b4301b618db1cd743fc69/FLAG9b5e4f106 [2025-01-09 05:53:18,133 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/af35289ae/fcafa709578b4301b618db1cd743fc69 [2025-01-09 05:53:18,136 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 05:53:18,137 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 05:53:18,139 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 05:53:18,140 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 05:53:18,143 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 05:53:18,144 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 05:53:18" (1/1) ... [2025-01-09 05:53:18,144 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a07a7d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:53:18, skipping insertion in model container [2025-01-09 05:53:18,145 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 05:53:18" (1/1) ... [2025-01-09 05:53:18,220 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 05:53:18,460 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.1.ufo.BOUNDED-12.pals+Problem12_label05.c[15519,15532] [2025-01-09 05:53:18,521 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.1.ufo.BOUNDED-12.pals+Problem12_label05.c[22455,22468] [2025-01-09 05:53:18,955 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 05:53:18,963 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 05:53:18,999 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.1.ufo.BOUNDED-12.pals+Problem12_label05.c[15519,15532] [2025-01-09 05:53:19,004 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.1.ufo.BOUNDED-12.pals+Problem12_label05.c[22455,22468] [2025-01-09 05:53:19,250 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 05:53:19,269 INFO L204 MainTranslator]: Completed translation [2025-01-09 05:53:19,271 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:53:19 WrapperNode [2025-01-09 05:53:19,271 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 05:53:19,272 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 05:53:19,272 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 05:53:19,272 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 05:53:19,278 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:53:19" (1/1) ... [2025-01-09 05:53:19,329 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:53:19" (1/1) ... [2025-01-09 05:53:19,544 INFO L138 Inliner]: procedures = 37, calls = 23, calls flagged for inlining = 18, calls inlined = 18, statements flattened = 5154 [2025-01-09 05:53:19,545 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 05:53:19,546 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 05:53:19,546 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 05:53:19,546 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 05:53:19,552 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:53:19" (1/1) ... [2025-01-09 05:53:19,552 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:53:19" (1/1) ... [2025-01-09 05:53:19,587 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:53:19" (1/1) ... [2025-01-09 05:53:19,768 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:53:19,768 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:53:19" (1/1) ... [2025-01-09 05:53:19,769 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:53:19" (1/1) ... [2025-01-09 05:53:19,999 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:53:19" (1/1) ... [2025-01-09 05:53:20,036 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:53:19" (1/1) ... [2025-01-09 05:53:20,076 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:53:19" (1/1) ... [2025-01-09 05:53:20,119 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:53:19" (1/1) ... [2025-01-09 05:53:20,152 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:53:19" (1/1) ... [2025-01-09 05:53:20,196 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 05:53:20,198 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 05:53:20,198 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 05:53:20,198 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 05:53:20,199 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:53:19" (1/1) ... [2025-01-09 05:53:20,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:53:20,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:53:20,221 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:53:20,227 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:53:20,242 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 05:53:20,242 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 05:53:20,242 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 05:53:20,242 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 05:53:20,331 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 05:53:20,332 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 05:53:23,721 INFO L? ?]: Removed 749 outVars from TransFormulas that were not future-live. [2025-01-09 05:53:23,721 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 05:53:23,743 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 05:53:23,743 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 05:53:23,744 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 05:53:23 BoogieIcfgContainer [2025-01-09 05:53:23,744 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 05:53:23,745 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 05:53:23,745 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 05:53:23,748 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 05:53:23,748 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 05:53:18" (1/3) ... [2025-01-09 05:53:23,749 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@220e608a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 05:53:23, skipping insertion in model container [2025-01-09 05:53:23,749 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:53:19" (2/3) ... [2025-01-09 05:53:23,749 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@220e608a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 05:53:23, skipping insertion in model container [2025-01-09 05:53:23,749 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 05:53:23" (3/3) ... [2025-01-09 05:53:23,750 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.6.1.ufo.BOUNDED-12.pals+Problem12_label05.c [2025-01-09 05:53:23,759 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 05:53:23,762 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.6.1.ufo.BOUNDED-12.pals+Problem12_label05.c that has 1 procedures, 913 locations, 1 initial locations, 2 loop locations, and 2 error locations. [2025-01-09 05:53:23,809 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 05:53:23,816 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;@32e00ac4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 05:53:23,817 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-01-09 05:53:23,821 INFO L276 IsEmpty]: Start isEmpty. Operand has 913 states, 910 states have (on average 1.9032967032967032) internal successors, (1732), 912 states have internal predecessors, (1732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:53:23,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-01-09 05:53:23,826 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:53:23,826 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:53:23,827 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:53:23,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:53:23,830 INFO L85 PathProgramCache]: Analyzing trace with hash 778313314, now seen corresponding path program 1 times [2025-01-09 05:53:23,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:53:23,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851107082] [2025-01-09 05:53:23,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:53:23,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:53:23,898 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-09 05:53:23,952 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-09 05:53:23,953 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:53:23,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:53:24,056 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:53:24,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:53:24,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851107082] [2025-01-09 05:53:24,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851107082] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:53:24,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:53:24,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 05:53:24,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165159650] [2025-01-09 05:53:24,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:53:24,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 05:53:24,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:53:24,071 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 05:53:24,071 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 05:53:24,074 INFO L87 Difference]: Start difference. First operand has 913 states, 910 states have (on average 1.9032967032967032) internal successors, (1732), 912 states have internal predecessors, (1732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 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:53:24,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:53:24,128 INFO L93 Difference]: Finished difference Result 1780 states and 3376 transitions. [2025-01-09 05:53:24,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 05:53:24,129 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 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:53:24,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:53:24,143 INFO L225 Difference]: With dead ends: 1780 [2025-01-09 05:53:24,143 INFO L226 Difference]: Without dead ends: 848 [2025-01-09 05:53:24,147 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 05:53:24,151 INFO L435 NwaCegarLoop]: 1668 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1668 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:53:24,151 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1668 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:53:24,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 848 states. [2025-01-09 05:53:24,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 848 to 848. [2025-01-09 05:53:24,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 848 states, 846 states have (on average 1.8936170212765957) internal successors, (1602), 847 states have internal predecessors, (1602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:53:24,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 848 states to 848 states and 1602 transitions. [2025-01-09 05:53:24,221 INFO L78 Accepts]: Start accepts. Automaton has 848 states and 1602 transitions. Word has length 26 [2025-01-09 05:53:24,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:53:24,222 INFO L471 AbstractCegarLoop]: Abstraction has 848 states and 1602 transitions. [2025-01-09 05:53:24,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 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:53:24,222 INFO L276 IsEmpty]: Start isEmpty. Operand 848 states and 1602 transitions. [2025-01-09 05:53:24,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-01-09 05:53:24,223 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:53:24,223 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:53:24,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 05:53:24,223 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:53:24,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:53:24,224 INFO L85 PathProgramCache]: Analyzing trace with hash -39335136, now seen corresponding path program 1 times [2025-01-09 05:53:24,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:53:24,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191141920] [2025-01-09 05:53:24,224 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:53:24,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:53:24,232 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-09 05:53:24,250 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-09 05:53:24,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:53:24,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:53:24,438 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:53:24,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:53:24,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191141920] [2025-01-09 05:53:24,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191141920] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:53:24,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:53:24,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 05:53:24,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638118254] [2025-01-09 05:53:24,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:53:24,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 05:53:24,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:53:24,440 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 05:53:24,440 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 05:53:24,440 INFO L87 Difference]: Start difference. First operand 848 states and 1602 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:53:24,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:53:24,534 INFO L93 Difference]: Finished difference Result 900 states and 1683 transitions. [2025-01-09 05:53:24,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 05:53:24,534 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:53:24,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:53:24,539 INFO L225 Difference]: With dead ends: 900 [2025-01-09 05:53:24,539 INFO L226 Difference]: Without dead ends: 848 [2025-01-09 05:53:24,540 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:53:24,542 INFO L435 NwaCegarLoop]: 1600 mSDtfsCounter, 0 mSDsluCounter, 4755 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6355 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:53:24,542 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6355 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:53:24,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 848 states. [2025-01-09 05:53:24,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 848 to 848. [2025-01-09 05:53:24,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 848 states, 846 states have (on average 1.846335697399527) internal successors, (1562), 847 states have internal predecessors, (1562), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:53:24,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 848 states to 848 states and 1562 transitions. [2025-01-09 05:53:24,569 INFO L78 Accepts]: Start accepts. Automaton has 848 states and 1562 transitions. Word has length 26 [2025-01-09 05:53:24,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:53:24,569 INFO L471 AbstractCegarLoop]: Abstraction has 848 states and 1562 transitions. [2025-01-09 05:53:24,569 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:53:24,569 INFO L276 IsEmpty]: Start isEmpty. Operand 848 states and 1562 transitions. [2025-01-09 05:53:24,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-01-09 05:53:24,571 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:53:24,572 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] [2025-01-09 05:53:24,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 05:53:24,572 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:53:24,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:53:24,575 INFO L85 PathProgramCache]: Analyzing trace with hash 32361376, now seen corresponding path program 1 times [2025-01-09 05:53:24,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:53:24,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703636767] [2025-01-09 05:53:24,575 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:53:24,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:53:24,589 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-01-09 05:53:24,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-01-09 05:53:24,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:53:24,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:53:24,677 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:53:24,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:53:24,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703636767] [2025-01-09 05:53:24,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703636767] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:53:24,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:53:24,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 05:53:24,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745777507] [2025-01-09 05:53:24,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:53:24,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:53:24,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:53:24,679 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:53:24,679 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:53:24,679 INFO L87 Difference]: Start difference. First operand 848 states and 1562 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 2 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:53:27,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:53:27,874 INFO L93 Difference]: Finished difference Result 2352 states and 4435 transitions. [2025-01-09 05:53:27,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:53:27,875 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 2 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2025-01-09 05:53:27,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:53:27,880 INFO L225 Difference]: With dead ends: 2352 [2025-01-09 05:53:27,880 INFO L226 Difference]: Without dead ends: 1599 [2025-01-09 05:53:27,881 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:53:27,882 INFO L435 NwaCegarLoop]: 591 mSDtfsCounter, 864 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2261 mSolverCounterSat, 652 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 864 SdHoareTripleChecker+Valid, 598 SdHoareTripleChecker+Invalid, 2913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 652 IncrementalHoareTripleChecker+Valid, 2261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2025-01-09 05:53:27,882 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [864 Valid, 598 Invalid, 2913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [652 Valid, 2261 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2025-01-09 05:53:27,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1599 states. [2025-01-09 05:53:27,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1599 to 1599. [2025-01-09 05:53:27,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1599 states, 1597 states have (on average 1.591108328115216) internal successors, (2541), 1598 states have internal predecessors, (2541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:53:27,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1599 states to 1599 states and 2541 transitions. [2025-01-09 05:53:27,947 INFO L78 Accepts]: Start accepts. Automaton has 1599 states and 2541 transitions. Word has length 60 [2025-01-09 05:53:27,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:53:27,947 INFO L471 AbstractCegarLoop]: Abstraction has 1599 states and 2541 transitions. [2025-01-09 05:53:27,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 2 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:53:27,947 INFO L276 IsEmpty]: Start isEmpty. Operand 1599 states and 2541 transitions. [2025-01-09 05:53:27,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-01-09 05:53:27,948 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:53:27,949 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:53:27,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 05:53:27,953 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:53:27,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:53:27,953 INFO L85 PathProgramCache]: Analyzing trace with hash -1783115668, now seen corresponding path program 1 times [2025-01-09 05:53:27,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:53:27,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673329882] [2025-01-09 05:53:27,953 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:53:27,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:53:27,972 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-01-09 05:53:27,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-01-09 05:53:27,992 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:53:27,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:53:28,181 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:53:28,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:53:28,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673329882] [2025-01-09 05:53:28,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673329882] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:53:28,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:53:28,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 05:53:28,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338350598] [2025-01-09 05:53:28,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:53:28,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 05:53:28,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:53:28,183 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 05:53:28,183 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 05:53:28,183 INFO L87 Difference]: Start difference. First operand 1599 states and 2541 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:53:28,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:53:28,433 INFO L93 Difference]: Finished difference Result 2175 states and 3465 transitions. [2025-01-09 05:53:28,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 05:53:28,434 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:53:28,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:53:28,440 INFO L225 Difference]: With dead ends: 2175 [2025-01-09 05:53:28,440 INFO L226 Difference]: Without dead ends: 2127 [2025-01-09 05:53:28,441 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:53:28,441 INFO L435 NwaCegarLoop]: 1558 mSDtfsCounter, 9697 mSDsluCounter, 2377 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9697 SdHoareTripleChecker+Valid, 3935 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 05:53:28,441 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9697 Valid, 3935 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 05:53:28,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2127 states. [2025-01-09 05:53:28,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2127 to 1645. [2025-01-09 05:53:28,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1645 states, 1643 states have (on average 1.591600730371272) internal successors, (2615), 1644 states have internal predecessors, (2615), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:53:28,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1645 states to 1645 states and 2615 transitions. [2025-01-09 05:53:28,545 INFO L78 Accepts]: Start accepts. Automaton has 1645 states and 2615 transitions. Word has length 65 [2025-01-09 05:53:28,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:53:28,546 INFO L471 AbstractCegarLoop]: Abstraction has 1645 states and 2615 transitions. [2025-01-09 05:53:28,546 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:53:28,546 INFO L276 IsEmpty]: Start isEmpty. Operand 1645 states and 2615 transitions. [2025-01-09 05:53:28,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-01-09 05:53:28,547 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:53:28,547 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:53:28,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 05:53:28,548 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:53:28,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:53:28,551 INFO L85 PathProgramCache]: Analyzing trace with hash -1297900228, now seen corresponding path program 1 times [2025-01-09 05:53:28,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:53:28,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19960941] [2025-01-09 05:53:28,552 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:53:28,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:53:28,568 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-01-09 05:53:28,579 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-01-09 05:53:28,579 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:53:28,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:53:28,655 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:53:28,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:53:28,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19960941] [2025-01-09 05:53:28,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19960941] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:53:28,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:53:28,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:53:28,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51206759] [2025-01-09 05:53:28,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:53:28,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:53:28,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:53:28,659 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:53:28,659 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:53:28,659 INFO L87 Difference]: Start difference. First operand 1645 states and 2615 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:53:28,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:53:28,683 INFO L93 Difference]: Finished difference Result 1822 states and 2898 transitions. [2025-01-09 05:53:28,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:53:28,684 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:53:28,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:53:28,689 INFO L225 Difference]: With dead ends: 1822 [2025-01-09 05:53:28,689 INFO L226 Difference]: Without dead ends: 1728 [2025-01-09 05:53:28,689 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:53:28,690 INFO L435 NwaCegarLoop]: 1560 mSDtfsCounter, 1490 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1490 SdHoareTripleChecker+Valid, 1632 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:53:28,691 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1490 Valid, 1632 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:53:28,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1728 states. [2025-01-09 05:53:28,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1728 to 1726. [2025-01-09 05:53:28,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1726 states, 1724 states have (on average 1.5910672853828307) internal successors, (2743), 1725 states have internal predecessors, (2743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:53:28,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1726 states to 1726 states and 2743 transitions. [2025-01-09 05:53:28,718 INFO L78 Accepts]: Start accepts. Automaton has 1726 states and 2743 transitions. Word has length 67 [2025-01-09 05:53:28,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:53:28,718 INFO L471 AbstractCegarLoop]: Abstraction has 1726 states and 2743 transitions. [2025-01-09 05:53:28,718 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:53:28,718 INFO L276 IsEmpty]: Start isEmpty. Operand 1726 states and 2743 transitions. [2025-01-09 05:53:28,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-01-09 05:53:28,719 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:53:28,719 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:53:28,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 05:53:28,720 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:53:28,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:53:28,720 INFO L85 PathProgramCache]: Analyzing trace with hash -1231406716, now seen corresponding path program 1 times [2025-01-09 05:53:28,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:53:28,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950308475] [2025-01-09 05:53:28,721 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:53:28,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:53:28,730 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-01-09 05:53:28,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-01-09 05:53:28,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:53:28,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:53:28,986 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:53:28,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:53:28,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950308475] [2025-01-09 05:53:28,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950308475] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:53:28,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:53:28,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 05:53:28,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637357853] [2025-01-09 05:53:28,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:53:28,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 05:53:28,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:53:28,987 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 05:53:28,987 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-01-09 05:53:28,987 INFO L87 Difference]: Start difference. First operand 1726 states and 2743 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:53:29,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:53:29,182 INFO L93 Difference]: Finished difference Result 1903 states and 3023 transitions. [2025-01-09 05:53:29,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 05:53:29,182 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:53:29,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:53:29,187 INFO L225 Difference]: With dead ends: 1903 [2025-01-09 05:53:29,188 INFO L226 Difference]: Without dead ends: 1728 [2025-01-09 05:53:29,188 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:53:29,189 INFO L435 NwaCegarLoop]: 1554 mSDtfsCounter, 7500 mSDsluCounter, 371 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7500 SdHoareTripleChecker+Valid, 1925 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 05:53:29,189 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7500 Valid, 1925 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 05:53:29,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1728 states. [2025-01-09 05:53:29,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1728 to 1726. [2025-01-09 05:53:29,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1726 states, 1724 states have (on average 1.589907192575406) internal successors, (2741), 1725 states have internal predecessors, (2741), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:53:29,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1726 states to 1726 states and 2741 transitions. [2025-01-09 05:53:29,219 INFO L78 Accepts]: Start accepts. Automaton has 1726 states and 2741 transitions. Word has length 67 [2025-01-09 05:53:29,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:53:29,219 INFO L471 AbstractCegarLoop]: Abstraction has 1726 states and 2741 transitions. [2025-01-09 05:53:29,220 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:53:29,220 INFO L276 IsEmpty]: Start isEmpty. Operand 1726 states and 2741 transitions. [2025-01-09 05:53:29,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-01-09 05:53:29,221 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:53:29,221 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:53:29,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 05:53:29,221 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:53:29,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:53:29,222 INFO L85 PathProgramCache]: Analyzing trace with hash 66374464, now seen corresponding path program 1 times [2025-01-09 05:53:29,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:53:29,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665986892] [2025-01-09 05:53:29,222 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:53:29,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:53:29,231 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-01-09 05:53:29,249 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-01-09 05:53:29,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:53:29,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:53:29,410 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:53:29,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:53:29,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665986892] [2025-01-09 05:53:29,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665986892] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:53:29,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:53:29,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 05:53:29,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472185968] [2025-01-09 05:53:29,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:53:29,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 05:53:29,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:53:29,411 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 05:53:29,411 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 05:53:29,411 INFO L87 Difference]: Start difference. First operand 1726 states and 2741 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:53:29,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:53:29,443 INFO L93 Difference]: Finished difference Result 1734 states and 2750 transitions. [2025-01-09 05:53:29,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 05:53:29,444 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:53:29,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:53:29,448 INFO L225 Difference]: With dead ends: 1734 [2025-01-09 05:53:29,448 INFO L226 Difference]: Without dead ends: 1732 [2025-01-09 05:53:29,449 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:53:29,450 INFO L435 NwaCegarLoop]: 1559 mSDtfsCounter, 0 mSDsluCounter, 4668 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6227 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:53:29,451 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6227 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:53:29,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1732 states. [2025-01-09 05:53:29,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1732 to 1732. [2025-01-09 05:53:29,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1732 states, 1730 states have (on average 1.5872832369942196) internal successors, (2746), 1731 states have internal predecessors, (2746), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:53:29,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1732 states to 1732 states and 2746 transitions. [2025-01-09 05:53:29,478 INFO L78 Accepts]: Start accepts. Automaton has 1732 states and 2746 transitions. Word has length 68 [2025-01-09 05:53:29,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:53:29,479 INFO L471 AbstractCegarLoop]: Abstraction has 1732 states and 2746 transitions. [2025-01-09 05:53:29,479 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:53:29,479 INFO L276 IsEmpty]: Start isEmpty. Operand 1732 states and 2746 transitions. [2025-01-09 05:53:29,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-01-09 05:53:29,480 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:53:29,480 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:53:29,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 05:53:29,480 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:53:29,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:53:29,481 INFO L85 PathProgramCache]: Analyzing trace with hash -2026826780, now seen corresponding path program 1 times [2025-01-09 05:53:29,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:53:29,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967792913] [2025-01-09 05:53:29,481 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:53:29,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:53:29,491 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-09 05:53:29,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 05:53:29,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:53:29,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:53:29,549 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:53:29,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:53:29,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967792913] [2025-01-09 05:53:29,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967792913] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:53:29,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:53:29,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:53:29,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635501064] [2025-01-09 05:53:29,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:53:29,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:53:29,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:53:29,553 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:53:29,553 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:53:29,553 INFO L87 Difference]: Start difference. First operand 1732 states and 2746 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:53:29,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:53:29,598 INFO L93 Difference]: Finished difference Result 1926 states and 3047 transitions. [2025-01-09 05:53:29,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:53:29,599 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:53:29,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:53:29,608 INFO L225 Difference]: With dead ends: 1926 [2025-01-09 05:53:29,608 INFO L226 Difference]: Without dead ends: 1826 [2025-01-09 05:53:29,609 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:53:29,609 INFO L435 NwaCegarLoop]: 1624 mSDtfsCounter, 1506 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1506 SdHoareTripleChecker+Valid, 1702 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:53:29,610 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1506 Valid, 1702 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:53:29,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1826 states. [2025-01-09 05:53:29,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1826 to 1824. [2025-01-09 05:53:29,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1824 states, 1822 states have (on average 1.5845225027442371) internal successors, (2887), 1823 states have internal predecessors, (2887), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:53:29,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1824 states to 1824 states and 2887 transitions. [2025-01-09 05:53:29,676 INFO L78 Accepts]: Start accepts. Automaton has 1824 states and 2887 transitions. Word has length 69 [2025-01-09 05:53:29,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:53:29,676 INFO L471 AbstractCegarLoop]: Abstraction has 1824 states and 2887 transitions. [2025-01-09 05:53:29,676 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:53:29,676 INFO L276 IsEmpty]: Start isEmpty. Operand 1824 states and 2887 transitions. [2025-01-09 05:53:29,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-01-09 05:53:29,677 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:53:29,677 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:53:29,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 05:53:29,677 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:53:29,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:53:29,677 INFO L85 PathProgramCache]: Analyzing trace with hash -1863912220, now seen corresponding path program 1 times [2025-01-09 05:53:29,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:53:29,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758775859] [2025-01-09 05:53:29,678 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:53:29,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:53:29,686 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-09 05:53:29,693 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 05:53:29,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:53:29,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:53:29,724 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:53:29,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:53:29,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758775859] [2025-01-09 05:53:29,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758775859] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:53:29,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:53:29,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:53:29,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724664652] [2025-01-09 05:53:29,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:53:29,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:53:29,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:53:29,726 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:53:29,726 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:53:29,726 INFO L87 Difference]: Start difference. First operand 1824 states and 2887 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:53:29,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:53:29,748 INFO L93 Difference]: Finished difference Result 2342 states and 3687 transitions. [2025-01-09 05:53:29,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:53:29,749 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:53:29,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:53:29,754 INFO L225 Difference]: With dead ends: 2342 [2025-01-09 05:53:29,754 INFO L226 Difference]: Without dead ends: 2071 [2025-01-09 05:53:29,755 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:53:29,755 INFO L435 NwaCegarLoop]: 1626 mSDtfsCounter, 1504 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1504 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:53:29,755 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1504 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:53:29,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2071 states. [2025-01-09 05:53:29,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2071 to 2069. [2025-01-09 05:53:29,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2069 states, 2067 states have (on average 1.5766811804547654) internal successors, (3259), 2068 states have internal predecessors, (3259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:53:29,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2069 states to 2069 states and 3259 transitions. [2025-01-09 05:53:29,785 INFO L78 Accepts]: Start accepts. Automaton has 2069 states and 3259 transitions. Word has length 69 [2025-01-09 05:53:29,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:53:29,785 INFO L471 AbstractCegarLoop]: Abstraction has 2069 states and 3259 transitions. [2025-01-09 05:53:29,785 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:53:29,785 INFO L276 IsEmpty]: Start isEmpty. Operand 2069 states and 3259 transitions. [2025-01-09 05:53:29,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-01-09 05:53:29,788 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:53:29,788 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:53:29,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 05:53:29,788 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:53:29,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:53:29,791 INFO L85 PathProgramCache]: Analyzing trace with hash -1600055836, now seen corresponding path program 1 times [2025-01-09 05:53:29,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:53:29,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66069249] [2025-01-09 05:53:29,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:53:29,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:53:29,798 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-09 05:53:29,806 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 05:53:29,807 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:53:29,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:53:29,861 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:53:29,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:53:29,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66069249] [2025-01-09 05:53:29,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66069249] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:53:29,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:53:29,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:53:29,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750287785] [2025-01-09 05:53:29,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:53:29,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:53:29,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:53:29,862 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:53:29,862 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:53:29,862 INFO L87 Difference]: Start difference. First operand 2069 states and 3259 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:53:29,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:53:29,889 INFO L93 Difference]: Finished difference Result 3053 states and 4761 transitions. [2025-01-09 05:53:29,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:53:29,890 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:53:29,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:53:29,896 INFO L225 Difference]: With dead ends: 3053 [2025-01-09 05:53:29,896 INFO L226 Difference]: Without dead ends: 2537 [2025-01-09 05:53:29,897 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:53:29,897 INFO L435 NwaCegarLoop]: 1624 mSDtfsCounter, 1502 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1502 SdHoareTripleChecker+Valid, 1710 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:53:29,898 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1502 Valid, 1710 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:53:29,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2537 states. [2025-01-09 05:53:29,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2537 to 2535. [2025-01-09 05:53:29,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2535 states, 2533 states have (on average 1.5613896565337544) internal successors, (3955), 2534 states have internal predecessors, (3955), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:53:29,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2535 states to 2535 states and 3955 transitions. [2025-01-09 05:53:29,937 INFO L78 Accepts]: Start accepts. Automaton has 2535 states and 3955 transitions. Word has length 69 [2025-01-09 05:53:29,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:53:29,937 INFO L471 AbstractCegarLoop]: Abstraction has 2535 states and 3955 transitions. [2025-01-09 05:53:29,937 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:53:29,937 INFO L276 IsEmpty]: Start isEmpty. Operand 2535 states and 3955 transitions. [2025-01-09 05:53:29,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-01-09 05:53:29,938 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:53:29,938 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:53:29,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 05:53:29,938 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:53:29,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:53:29,938 INFO L85 PathProgramCache]: Analyzing trace with hash -361793820, now seen corresponding path program 1 times [2025-01-09 05:53:29,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:53:29,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898347880] [2025-01-09 05:53:29,939 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:53:29,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:53:29,945 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-09 05:53:29,950 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 05:53:29,950 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:53:29,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:53:29,979 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:53:29,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:53:29,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898347880] [2025-01-09 05:53:29,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898347880] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:53:29,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:53:29,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:53:29,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531208139] [2025-01-09 05:53:29,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:53:29,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:53:29,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:53:29,980 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:53:29,980 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:53:29,980 INFO L87 Difference]: Start difference. First operand 2535 states and 3955 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:53:30,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:53:30,013 INFO L93 Difference]: Finished difference Result 4403 states and 6765 transitions. [2025-01-09 05:53:30,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:53:30,014 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:53:30,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:53:30,023 INFO L225 Difference]: With dead ends: 4403 [2025-01-09 05:53:30,023 INFO L226 Difference]: Without dead ends: 3421 [2025-01-09 05:53:30,025 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:53:30,025 INFO L435 NwaCegarLoop]: 1622 mSDtfsCounter, 1500 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1500 SdHoareTripleChecker+Valid, 1712 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:53:30,025 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1500 Valid, 1712 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:53:30,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3421 states. [2025-01-09 05:53:30,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3421 to 3419. [2025-01-09 05:53:30,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3419 states, 3417 states have (on average 1.5367281240854551) internal successors, (5251), 3418 states have internal predecessors, (5251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:53:30,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3419 states to 3419 states and 5251 transitions. [2025-01-09 05:53:30,081 INFO L78 Accepts]: Start accepts. Automaton has 3419 states and 5251 transitions. Word has length 69 [2025-01-09 05:53:30,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:53:30,081 INFO L471 AbstractCegarLoop]: Abstraction has 3419 states and 5251 transitions. [2025-01-09 05:53:30,082 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:53:30,082 INFO L276 IsEmpty]: Start isEmpty. Operand 3419 states and 5251 transitions. [2025-01-09 05:53:30,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-01-09 05:53:30,082 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:53:30,082 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:53:30,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 05:53:30,082 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:53:30,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:53:30,083 INFO L85 PathProgramCache]: Analyzing trace with hash -796329756, now seen corresponding path program 1 times [2025-01-09 05:53:30,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:53:30,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576691201] [2025-01-09 05:53:30,083 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:53:30,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:53:30,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-09 05:53:30,095 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 05:53:30,095 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:53:30,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:53:30,124 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:53:30,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:53:30,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576691201] [2025-01-09 05:53:30,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576691201] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:53:30,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:53:30,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:53:30,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075736007] [2025-01-09 05:53:30,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:53:30,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:53:30,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:53:30,126 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:53:30,126 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:53:30,126 INFO L87 Difference]: Start difference. First operand 3419 states and 5251 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:53:30,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:53:30,176 INFO L93 Difference]: Finished difference Result 6959 states and 10485 transitions. [2025-01-09 05:53:30,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:53:30,177 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:53:30,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:53:30,191 INFO L225 Difference]: With dead ends: 6959 [2025-01-09 05:53:30,192 INFO L226 Difference]: Without dead ends: 5093 [2025-01-09 05:53:30,194 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:53:30,195 INFO L435 NwaCegarLoop]: 1610 mSDtfsCounter, 1496 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1496 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:53:30,195 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1496 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:53:30,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5093 states. [2025-01-09 05:53:30,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5093 to 5091. [2025-01-09 05:53:30,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5091 states, 5089 states have (on average 1.5034387895460797) internal successors, (7651), 5090 states have internal predecessors, (7651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:53:30,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5091 states to 5091 states and 7651 transitions. [2025-01-09 05:53:30,296 INFO L78 Accepts]: Start accepts. Automaton has 5091 states and 7651 transitions. Word has length 69 [2025-01-09 05:53:30,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:53:30,296 INFO L471 AbstractCegarLoop]: Abstraction has 5091 states and 7651 transitions. [2025-01-09 05:53:30,297 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:53:30,297 INFO L276 IsEmpty]: Start isEmpty. Operand 5091 states and 7651 transitions. [2025-01-09 05:53:30,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-01-09 05:53:30,297 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:53:30,297 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:53:30,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 05:53:30,298 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:53:30,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:53:30,298 INFO L85 PathProgramCache]: Analyzing trace with hash 1717704676, now seen corresponding path program 1 times [2025-01-09 05:53:30,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:53:30,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216881667] [2025-01-09 05:53:30,298 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:53:30,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:53:30,304 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-09 05:53:30,310 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 05:53:30,310 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:53:30,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:53:30,341 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:53:30,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:53:30,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216881667] [2025-01-09 05:53:30,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216881667] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:53:30,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:53:30,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:53:30,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025573998] [2025-01-09 05:53:30,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:53:30,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:53:30,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:53:30,342 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:53:30,342 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:53:30,343 INFO L87 Difference]: Start difference. First operand 5091 states and 7651 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:53:30,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:53:30,422 INFO L93 Difference]: Finished difference Result 11783 states and 17349 transitions. [2025-01-09 05:53:30,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:53:30,423 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:53:30,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:53:30,436 INFO L225 Difference]: With dead ends: 11783 [2025-01-09 05:53:30,436 INFO L226 Difference]: Without dead ends: 8245 [2025-01-09 05:53:30,440 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:53:30,441 INFO L435 NwaCegarLoop]: 1620 mSDtfsCounter, 1498 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1498 SdHoareTripleChecker+Valid, 1714 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:53:30,441 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1498 Valid, 1714 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:53:30,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8245 states. [2025-01-09 05:53:30,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8245 to 8243. [2025-01-09 05:53:30,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8243 states, 8241 states have (on average 1.464264045625531) internal successors, (12067), 8242 states have internal predecessors, (12067), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:53:30,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8243 states to 8243 states and 12067 transitions. [2025-01-09 05:53:30,620 INFO L78 Accepts]: Start accepts. Automaton has 8243 states and 12067 transitions. Word has length 69 [2025-01-09 05:53:30,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:53:30,620 INFO L471 AbstractCegarLoop]: Abstraction has 8243 states and 12067 transitions. [2025-01-09 05:53:30,620 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:53:30,620 INFO L276 IsEmpty]: Start isEmpty. Operand 8243 states and 12067 transitions. [2025-01-09 05:53:30,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-01-09 05:53:30,623 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:53:30,623 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:53:30,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 05:53:30,623 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:53:30,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:53:30,623 INFO L85 PathProgramCache]: Analyzing trace with hash -1175898238, now seen corresponding path program 1 times [2025-01-09 05:53:30,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:53:30,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263894897] [2025-01-09 05:53:30,624 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:53:30,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:53:30,631 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-01-09 05:53:30,639 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-01-09 05:53:30,639 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:53:30,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:53:30,757 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:53:30,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:53:30,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263894897] [2025-01-09 05:53:30,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263894897] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:53:30,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:53:30,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 05:53:30,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213093184] [2025-01-09 05:53:30,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:53:30,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 05:53:30,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:53:30,758 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 05:53:30,759 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 05:53:30,759 INFO L87 Difference]: Start difference. First operand 8243 states and 12067 transitions. Second operand has 8 states, 8 states have (on average 11.125) internal successors, (89), 8 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:53:31,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:53:31,241 INFO L93 Difference]: Finished difference Result 47841 states and 68842 transitions. [2025-01-09 05:53:31,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 05:53:31,242 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.125) internal successors, (89), 8 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 90 [2025-01-09 05:53:31,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:53:31,306 INFO L225 Difference]: With dead ends: 47841 [2025-01-09 05:53:31,306 INFO L226 Difference]: Without dead ends: 43103 [2025-01-09 05:53:31,317 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:53:31,317 INFO L435 NwaCegarLoop]: 1636 mSDtfsCounter, 8083 mSDsluCounter, 2490 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8083 SdHoareTripleChecker+Valid, 4126 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 05:53:31,318 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8083 Valid, 4126 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 05:53:31,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43103 states. [2025-01-09 05:53:31,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43103 to 13971. [2025-01-09 05:53:31,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13971 states, 13969 states have (on average 1.445701195504331) internal successors, (20195), 13970 states have internal predecessors, (20195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:53:31,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13971 states to 13971 states and 20195 transitions. [2025-01-09 05:53:31,699 INFO L78 Accepts]: Start accepts. Automaton has 13971 states and 20195 transitions. Word has length 90 [2025-01-09 05:53:31,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:53:31,700 INFO L471 AbstractCegarLoop]: Abstraction has 13971 states and 20195 transitions. [2025-01-09 05:53:31,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.125) internal successors, (89), 8 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:53:31,700 INFO L276 IsEmpty]: Start isEmpty. Operand 13971 states and 20195 transitions. [2025-01-09 05:53:31,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-01-09 05:53:31,703 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:53:31,703 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:53:31,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 05:53:31,703 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:53:31,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:53:31,703 INFO L85 PathProgramCache]: Analyzing trace with hash -1012983678, now seen corresponding path program 1 times [2025-01-09 05:53:31,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:53:31,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356408733] [2025-01-09 05:53:31,703 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:53:31,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:53:31,743 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-01-09 05:53:31,751 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-01-09 05:53:31,751 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:53:31,751 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:53:31,888 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:53:31,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:53:31,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356408733] [2025-01-09 05:53:31,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356408733] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:53:31,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:53:31,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 05:53:31,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710549388] [2025-01-09 05:53:31,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:53:31,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 05:53:31,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:53:31,890 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 05:53:31,890 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 05:53:31,890 INFO L87 Difference]: Start difference. First operand 13971 states and 20195 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:53:32,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:53:32,627 INFO L93 Difference]: Finished difference Result 54529 states and 78378 transitions. [2025-01-09 05:53:32,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 05:53:32,628 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:53:32,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:53:32,711 INFO L225 Difference]: With dead ends: 54529 [2025-01-09 05:53:32,711 INFO L226 Difference]: Without dead ends: 47839 [2025-01-09 05:53:32,736 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:53:32,736 INFO L435 NwaCegarLoop]: 1635 mSDtfsCounter, 8087 mSDsluCounter, 2429 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8087 SdHoareTripleChecker+Valid, 4064 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 05:53:32,736 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8087 Valid, 4064 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 05:53:32,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47839 states. [2025-01-09 05:53:33,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47839 to 23027. [2025-01-09 05:53:33,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23027 states, 23025 states have (on average 1.4343973941368078) internal successors, (33027), 23026 states have internal predecessors, (33027), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:53:33,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23027 states to 23027 states and 33027 transitions. [2025-01-09 05:53:33,311 INFO L78 Accepts]: Start accepts. Automaton has 23027 states and 33027 transitions. Word has length 90 [2025-01-09 05:53:33,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:53:33,312 INFO L471 AbstractCegarLoop]: Abstraction has 23027 states and 33027 transitions. [2025-01-09 05:53:33,312 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:53:33,312 INFO L276 IsEmpty]: Start isEmpty. Operand 23027 states and 33027 transitions. [2025-01-09 05:53:33,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-01-09 05:53:33,315 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:53:33,315 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:53:33,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 05:53:33,316 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:53:33,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:53:33,316 INFO L85 PathProgramCache]: Analyzing trace with hash -749127294, now seen corresponding path program 1 times [2025-01-09 05:53:33,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:53:33,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368719842] [2025-01-09 05:53:33,316 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:53:33,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:53:33,326 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-01-09 05:53:33,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-01-09 05:53:33,343 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:53:33,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:53:33,470 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:53:33,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:53:33,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368719842] [2025-01-09 05:53:33,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368719842] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:53:33,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:53:33,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 05:53:33,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711512800] [2025-01-09 05:53:33,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:53:33,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 05:53:33,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:53:33,474 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 05:53:33,474 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 05:53:33,474 INFO L87 Difference]: Start difference. First operand 23027 states and 33027 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:53:34,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:53:34,245 INFO L93 Difference]: Finished difference Result 61217 states and 87882 transitions. [2025-01-09 05:53:34,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 05:53:34,245 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:53:34,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:53:34,320 INFO L225 Difference]: With dead ends: 61217 [2025-01-09 05:53:34,320 INFO L226 Difference]: Without dead ends: 54527 [2025-01-09 05:53:34,462 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:53:34,463 INFO L435 NwaCegarLoop]: 1633 mSDtfsCounter, 8107 mSDsluCounter, 2403 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8107 SdHoareTripleChecker+Valid, 4036 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 05:53:34,463 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8107 Valid, 4036 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 05:53:34,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54527 states. [2025-01-09 05:53:35,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54527 to 29715. [2025-01-09 05:53:35,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29715 states, 29713 states have (on average 1.4313936660720896) internal successors, (42531), 29714 states have internal predecessors, (42531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:53:35,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29715 states to 29715 states and 42531 transitions. [2025-01-09 05:53:35,152 INFO L78 Accepts]: Start accepts. Automaton has 29715 states and 42531 transitions. Word has length 90 [2025-01-09 05:53:35,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:53:35,152 INFO L471 AbstractCegarLoop]: Abstraction has 29715 states and 42531 transitions. [2025-01-09 05:53:35,153 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:53:35,153 INFO L276 IsEmpty]: Start isEmpty. Operand 29715 states and 42531 transitions. [2025-01-09 05:53:35,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-01-09 05:53:35,157 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:53:35,158 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:53:35,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 05:53:35,158 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:53:35,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:53:35,159 INFO L85 PathProgramCache]: Analyzing trace with hash 489134722, now seen corresponding path program 1 times [2025-01-09 05:53:35,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:53:35,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133072453] [2025-01-09 05:53:35,160 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:53:35,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:53:35,173 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-01-09 05:53:35,187 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-01-09 05:53:35,188 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:53:35,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:53:35,340 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:53:35,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:53:35,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133072453] [2025-01-09 05:53:35,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133072453] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:53:35,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:53:35,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 05:53:35,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508188239] [2025-01-09 05:53:35,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:53:35,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 05:53:35,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:53:35,342 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 05:53:35,342 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 05:53:35,343 INFO L87 Difference]: Start difference. First operand 29715 states and 42531 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:53:36,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:53:36,778 INFO L93 Difference]: Finished difference Result 67905 states and 97386 transitions. [2025-01-09 05:53:36,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 05:53:36,778 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:53:36,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:53:36,857 INFO L225 Difference]: With dead ends: 67905 [2025-01-09 05:53:36,857 INFO L226 Difference]: Without dead ends: 61215 [2025-01-09 05:53:36,871 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:53:36,871 INFO L435 NwaCegarLoop]: 1631 mSDtfsCounter, 8199 mSDsluCounter, 2351 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8199 SdHoareTripleChecker+Valid, 3982 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 05:53:36,872 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8199 Valid, 3982 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 05:53:36,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61215 states. [2025-01-09 05:53:37,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61215 to 36403. [2025-01-09 05:53:37,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36403 states, 36401 states have (on average 1.4294936952281532) internal successors, (52035), 36402 states have internal predecessors, (52035), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:53:37,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36403 states to 36403 states and 52035 transitions. [2025-01-09 05:53:37,923 INFO L78 Accepts]: Start accepts. Automaton has 36403 states and 52035 transitions. Word has length 90 [2025-01-09 05:53:37,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:53:37,923 INFO L471 AbstractCegarLoop]: Abstraction has 36403 states and 52035 transitions. [2025-01-09 05:53:37,924 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:53:37,924 INFO L276 IsEmpty]: Start isEmpty. Operand 36403 states and 52035 transitions. [2025-01-09 05:53:37,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-01-09 05:53:37,927 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:53:37,927 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:53:37,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 05:53:37,928 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:53:37,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:53:37,928 INFO L85 PathProgramCache]: Analyzing trace with hash 54598786, now seen corresponding path program 1 times [2025-01-09 05:53:37,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:53:37,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564797040] [2025-01-09 05:53:37,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:53:37,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:53:37,936 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-01-09 05:53:37,943 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-01-09 05:53:37,944 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:53:37,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:53:38,060 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:53:38,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:53:38,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564797040] [2025-01-09 05:53:38,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564797040] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:53:38,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:53:38,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 05:53:38,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969687983] [2025-01-09 05:53:38,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:53:38,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 05:53:38,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:53:38,063 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 05:53:38,063 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 05:53:38,063 INFO L87 Difference]: Start difference. First operand 36403 states and 52035 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:53:39,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:53:39,212 INFO L93 Difference]: Finished difference Result 74593 states and 106890 transitions. [2025-01-09 05:53:39,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 05:53:39,212 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:53:39,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:53:39,311 INFO L225 Difference]: With dead ends: 74593 [2025-01-09 05:53:39,311 INFO L226 Difference]: Without dead ends: 67903 [2025-01-09 05:53:39,330 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:53:39,330 INFO L435 NwaCegarLoop]: 1631 mSDtfsCounter, 8135 mSDsluCounter, 2428 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8135 SdHoareTripleChecker+Valid, 4059 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 05:53:39,330 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8135 Valid, 4059 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 05:53:39,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67903 states. [2025-01-09 05:53:40,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67903 to 43091. [2025-01-09 05:53:40,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43091 states, 43089 states have (on average 1.42818352711829) internal successors, (61539), 43090 states have internal predecessors, (61539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:53:40,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43091 states to 43091 states and 61539 transitions. [2025-01-09 05:53:40,869 INFO L78 Accepts]: Start accepts. Automaton has 43091 states and 61539 transitions. Word has length 90 [2025-01-09 05:53:40,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:53:40,869 INFO L471 AbstractCegarLoop]: Abstraction has 43091 states and 61539 transitions. [2025-01-09 05:53:40,870 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:53:40,870 INFO L276 IsEmpty]: Start isEmpty. Operand 43091 states and 61539 transitions. [2025-01-09 05:53:40,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-01-09 05:53:40,874 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:53:40,874 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:53:40,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 05:53:40,875 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:53:40,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:53:40,875 INFO L85 PathProgramCache]: Analyzing trace with hash -1726334078, now seen corresponding path program 1 times [2025-01-09 05:53:40,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:53:40,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996195137] [2025-01-09 05:53:40,875 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:53:40,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:53:40,886 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-01-09 05:53:40,895 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-01-09 05:53:40,895 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:53:40,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:53:41,038 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:53:41,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:53:41,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996195137] [2025-01-09 05:53:41,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996195137] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:53:41,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:53:41,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 05:53:41,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36296625] [2025-01-09 05:53:41,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:53:41,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 05:53:41,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:53:41,041 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 05:53:41,041 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 05:53:41,041 INFO L87 Difference]: Start difference. First operand 43091 states and 61539 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:53:42,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:53:42,621 INFO L93 Difference]: Finished difference Result 81281 states and 116394 transitions. [2025-01-09 05:53:42,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 05:53:42,621 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:53:42,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:53:42,718 INFO L225 Difference]: With dead ends: 81281 [2025-01-09 05:53:42,718 INFO L226 Difference]: Without dead ends: 74591 [2025-01-09 05:53:42,741 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:53:42,744 INFO L435 NwaCegarLoop]: 1630 mSDtfsCounter, 8042 mSDsluCounter, 2499 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8042 SdHoareTripleChecker+Valid, 4129 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 05:53:42,744 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8042 Valid, 4129 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 05:53:42,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74591 states. [2025-01-09 05:53:44,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74591 to 49779. [2025-01-09 05:53:44,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49779 states, 49777 states have (on average 1.4272254253972718) internal successors, (71043), 49778 states have internal predecessors, (71043), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:53:44,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49779 states to 49779 states and 71043 transitions. [2025-01-09 05:53:44,362 INFO L78 Accepts]: Start accepts. Automaton has 49779 states and 71043 transitions. Word has length 90 [2025-01-09 05:53:44,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:53:44,363 INFO L471 AbstractCegarLoop]: Abstraction has 49779 states and 71043 transitions. [2025-01-09 05:53:44,363 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:53:44,365 INFO L276 IsEmpty]: Start isEmpty. Operand 49779 states and 71043 transitions. [2025-01-09 05:53:44,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-01-09 05:53:44,371 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:53:44,371 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:53:44,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 05:53:44,371 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:53:44,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:53:44,372 INFO L85 PathProgramCache]: Analyzing trace with hash 446172403, now seen corresponding path program 1 times [2025-01-09 05:53:44,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:53:44,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354971832] [2025-01-09 05:53:44,372 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:53:44,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:53:44,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-01-09 05:53:44,409 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-01-09 05:53:44,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:53:44,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:53:44,622 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:53:44,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:53:44,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354971832] [2025-01-09 05:53:44,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354971832] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:53:44,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:53:44,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:53:44,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136742757] [2025-01-09 05:53:44,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:53:44,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:53:44,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:53:44,623 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:53:44,623 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:53:44,623 INFO L87 Difference]: Start difference. First operand 49779 states and 71043 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:53:45,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:53:45,557 INFO L93 Difference]: Finished difference Result 98007 states and 139621 transitions. [2025-01-09 05:53:45,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:53:45,557 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2025-01-09 05:53:45,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:53:45,617 INFO L225 Difference]: With dead ends: 98007 [2025-01-09 05:53:45,617 INFO L226 Difference]: Without dead ends: 49781 [2025-01-09 05:53:45,636 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:53:45,636 INFO L435 NwaCegarLoop]: 1604 mSDtfsCounter, 53 mSDsluCounter, 1550 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 3154 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:53:45,637 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 3154 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:53:45,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49781 states. [2025-01-09 05:53:46,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49781 to 49779. [2025-01-09 05:53:46,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49779 states, 49777 states have (on average 1.4134037808626474) internal successors, (70355), 49778 states have internal predecessors, (70355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:53:47,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49779 states to 49779 states and 70355 transitions. [2025-01-09 05:53:47,024 INFO L78 Accepts]: Start accepts. Automaton has 49779 states and 70355 transitions. Word has length 91 [2025-01-09 05:53:47,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:53:47,024 INFO L471 AbstractCegarLoop]: Abstraction has 49779 states and 70355 transitions. [2025-01-09 05:53:47,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:53:47,024 INFO L276 IsEmpty]: Start isEmpty. Operand 49779 states and 70355 transitions. [2025-01-09 05:53:47,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-01-09 05:53:47,027 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:53:47,027 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:53:47,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 05:53:47,027 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:53:47,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:53:47,028 INFO L85 PathProgramCache]: Analyzing trace with hash 131060762, now seen corresponding path program 1 times [2025-01-09 05:53:47,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:53:47,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477786836] [2025-01-09 05:53:47,028 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:53:47,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:53:47,036 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-01-09 05:53:47,044 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-01-09 05:53:47,045 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:53:47,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:53:47,094 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:53:47,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:53:47,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477786836] [2025-01-09 05:53:47,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477786836] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:53:47,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:53:47,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:53:47,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60092399] [2025-01-09 05:53:47,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:53:47,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:53:47,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:53:47,097 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:53:47,097 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:53:47,097 INFO L87 Difference]: Start difference. First operand 49779 states and 70355 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:53:47,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:53:47,606 INFO L93 Difference]: Finished difference Result 67564 states and 95579 transitions. [2025-01-09 05:53:47,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:53:47,606 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:53:47,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:53:47,635 INFO L225 Difference]: With dead ends: 67564 [2025-01-09 05:53:47,635 INFO L226 Difference]: Without dead ends: 19338 [2025-01-09 05:53:47,662 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:53:47,663 INFO L435 NwaCegarLoop]: 1602 mSDtfsCounter, 47 mSDsluCounter, 1549 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 3151 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:53:47,663 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 3151 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:53:47,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19338 states. [2025-01-09 05:53:48,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19338 to 19330. [2025-01-09 05:53:48,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19330 states, 19328 states have (on average 1.419805463576159) internal successors, (27442), 19329 states have internal predecessors, (27442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:53:48,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19330 states to 19330 states and 27442 transitions. [2025-01-09 05:53:48,252 INFO L78 Accepts]: Start accepts. Automaton has 19330 states and 27442 transitions. Word has length 92 [2025-01-09 05:53:48,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:53:48,252 INFO L471 AbstractCegarLoop]: Abstraction has 19330 states and 27442 transitions. [2025-01-09 05:53:48,252 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:53:48,252 INFO L276 IsEmpty]: Start isEmpty. Operand 19330 states and 27442 transitions. [2025-01-09 05:53:48,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-01-09 05:53:48,254 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:53:48,254 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] [2025-01-09 05:53:48,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 05:53:48,254 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:53:48,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:53:48,255 INFO L85 PathProgramCache]: Analyzing trace with hash 172821189, now seen corresponding path program 1 times [2025-01-09 05:53:48,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:53:48,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098402969] [2025-01-09 05:53:48,256 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:53:48,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:53:48,266 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-01-09 05:53:48,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-01-09 05:53:48,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:53:48,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:53:48,353 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:53:48,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:53:48,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098402969] [2025-01-09 05:53:48,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098402969] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:53:48,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:53:48,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:53:48,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383880638] [2025-01-09 05:53:48,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:53:48,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:53:48,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:53:48,354 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:53:48,354 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:53:48,354 INFO L87 Difference]: Start difference. First operand 19330 states and 27442 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:53:48,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:53:48,606 INFO L93 Difference]: Finished difference Result 28214 states and 39924 transitions. [2025-01-09 05:53:48,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:53:48,610 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:53:48,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:53:48,625 INFO L225 Difference]: With dead ends: 28214 [2025-01-09 05:53:48,625 INFO L226 Difference]: Without dead ends: 10452 [2025-01-09 05:53:48,639 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:53:48,641 INFO L435 NwaCegarLoop]: 1596 mSDtfsCounter, 49 mSDsluCounter, 1534 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 3130 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:53:48,641 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 3130 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:53:48,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10452 states. [2025-01-09 05:53:48,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10452 to 10450. [2025-01-09 05:53:48,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10450 states, 10448 states have (on average 1.4205589586523737) internal successors, (14842), 10449 states have internal predecessors, (14842), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:53:48,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10450 states to 10450 states and 14842 transitions. [2025-01-09 05:53:48,960 INFO L78 Accepts]: Start accepts. Automaton has 10450 states and 14842 transitions. Word has length 93 [2025-01-09 05:53:48,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:53:48,961 INFO L471 AbstractCegarLoop]: Abstraction has 10450 states and 14842 transitions. [2025-01-09 05:53:48,961 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:53:48,961 INFO L276 IsEmpty]: Start isEmpty. Operand 10450 states and 14842 transitions. [2025-01-09 05:53:48,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-01-09 05:53:48,962 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:53:48,962 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] [2025-01-09 05:53:48,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 05:53:48,963 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:53:48,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:53:48,964 INFO L85 PathProgramCache]: Analyzing trace with hash -150071529, now seen corresponding path program 1 times [2025-01-09 05:53:48,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:53:48,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62206940] [2025-01-09 05:53:48,964 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:53:48,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:53:48,972 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-01-09 05:53:48,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-01-09 05:53:48,982 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:53:48,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:53:49,028 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:53:49,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:53:49,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62206940] [2025-01-09 05:53:49,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62206940] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:53:49,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:53:49,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:53:49,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313291083] [2025-01-09 05:53:49,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:53:49,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:53:49,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:53:49,029 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:53:49,029 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:53:49,029 INFO L87 Difference]: Start difference. First operand 10450 states and 14842 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:53:49,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:53:49,121 INFO L93 Difference]: Finished difference Result 14894 states and 21024 transitions. [2025-01-09 05:53:49,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:53:49,122 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:53:49,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:53:49,130 INFO L225 Difference]: With dead ends: 14894 [2025-01-09 05:53:49,130 INFO L226 Difference]: Without dead ends: 6012 [2025-01-09 05:53:49,136 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:53:49,137 INFO L435 NwaCegarLoop]: 1589 mSDtfsCounter, 46 mSDsluCounter, 1526 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 3115 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:53:49,137 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 3115 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:53:49,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6012 states. [2025-01-09 05:53:49,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6012 to 6010. [2025-01-09 05:53:49,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6010 states, 6008 states have (on average 1.4317576564580559) internal successors, (8602), 6009 states have internal predecessors, (8602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:53:49,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6010 states to 6010 states and 8602 transitions. [2025-01-09 05:53:49,242 INFO L78 Accepts]: Start accepts. Automaton has 6010 states and 8602 transitions. Word has length 95 [2025-01-09 05:53:49,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:53:49,242 INFO L471 AbstractCegarLoop]: Abstraction has 6010 states and 8602 transitions. [2025-01-09 05:53:49,242 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:53:49,242 INFO L276 IsEmpty]: Start isEmpty. Operand 6010 states and 8602 transitions. [2025-01-09 05:53:49,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-01-09 05:53:49,243 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:53:49,243 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] [2025-01-09 05:53:49,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-09 05:53:49,243 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:53:49,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:53:49,244 INFO L85 PathProgramCache]: Analyzing trace with hash 1004818921, now seen corresponding path program 1 times [2025-01-09 05:53:49,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:53:49,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413684599] [2025-01-09 05:53:49,244 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:53:49,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:53:49,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-01-09 05:53:49,263 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-01-09 05:53:49,263 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:53:49,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:53:49,308 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:53:49,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:53:49,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413684599] [2025-01-09 05:53:49,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413684599] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:53:49,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:53:49,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:53:49,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379903862] [2025-01-09 05:53:49,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:53:49,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:53:49,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:53:49,310 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:53:49,310 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:53:49,310 INFO L87 Difference]: Start difference. First operand 6010 states and 8602 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:53:49,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:53:49,362 INFO L93 Difference]: Finished difference Result 8234 states and 11664 transitions. [2025-01-09 05:53:49,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:53:49,363 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:53:49,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:53:49,368 INFO L225 Difference]: With dead ends: 8234 [2025-01-09 05:53:49,368 INFO L226 Difference]: Without dead ends: 3792 [2025-01-09 05:53:49,371 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:53:49,372 INFO L435 NwaCegarLoop]: 1582 mSDtfsCounter, 43 mSDsluCounter, 1518 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 3100 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:53:49,372 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 3100 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:53:49,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3792 states. [2025-01-09 05:53:49,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3792 to 3790. [2025-01-09 05:53:49,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3790 states, 3788 states have (on average 1.4551214361140443) internal successors, (5512), 3789 states have internal predecessors, (5512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:53:49,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3790 states to 3790 states and 5512 transitions. [2025-01-09 05:53:49,434 INFO L78 Accepts]: Start accepts. Automaton has 3790 states and 5512 transitions. Word has length 97 [2025-01-09 05:53:49,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:53:49,435 INFO L471 AbstractCegarLoop]: Abstraction has 3790 states and 5512 transitions. [2025-01-09 05:53:49,435 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:53:49,435 INFO L276 IsEmpty]: Start isEmpty. Operand 3790 states and 5512 transitions. [2025-01-09 05:53:49,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-01-09 05:53:49,436 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:53:49,436 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] [2025-01-09 05:53:49,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-01-09 05:53:49,437 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:53:49,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:53:49,437 INFO L85 PathProgramCache]: Analyzing trace with hash 1807801147, now seen corresponding path program 1 times [2025-01-09 05:53:49,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:53:49,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684750673] [2025-01-09 05:53:49,437 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:53:49,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:53:49,448 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-01-09 05:53:49,456 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-01-09 05:53:49,456 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:53:49,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:53:49,502 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:53:49,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:53:49,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684750673] [2025-01-09 05:53:49,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684750673] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:53:49,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:53:49,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:53:49,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684309100] [2025-01-09 05:53:49,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:53:49,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:53:49,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:53:49,503 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:53:49,503 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:53:49,503 INFO L87 Difference]: Start difference. First operand 3790 states and 5512 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:53:49,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:53:49,537 INFO L93 Difference]: Finished difference Result 4904 states and 7029 transitions. [2025-01-09 05:53:49,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:53:49,537 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:53:49,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:53:49,541 INFO L225 Difference]: With dead ends: 4904 [2025-01-09 05:53:49,541 INFO L226 Difference]: Without dead ends: 2682 [2025-01-09 05:53:49,543 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:53:49,544 INFO L435 NwaCegarLoop]: 1575 mSDtfsCounter, 40 mSDsluCounter, 1510 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 3085 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:53:49,544 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 3085 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:53:49,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2682 states. [2025-01-09 05:53:49,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2682 to 2680. [2025-01-09 05:53:49,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2680 states, 2678 states have (on average 1.4869305451829724) internal successors, (3982), 2679 states have internal predecessors, (3982), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:53:49,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2680 states to 2680 states and 3982 transitions. [2025-01-09 05:53:49,583 INFO L78 Accepts]: Start accepts. Automaton has 2680 states and 3982 transitions. Word has length 99 [2025-01-09 05:53:49,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:53:49,584 INFO L471 AbstractCegarLoop]: Abstraction has 2680 states and 3982 transitions. [2025-01-09 05:53:49,584 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:53:49,584 INFO L276 IsEmpty]: Start isEmpty. Operand 2680 states and 3982 transitions. [2025-01-09 05:53:49,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-01-09 05:53:49,584 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:53:49,584 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] [2025-01-09 05:53:49,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-01-09 05:53:49,584 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:53:49,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:53:49,585 INFO L85 PathProgramCache]: Analyzing trace with hash -1552100595, now seen corresponding path program 1 times [2025-01-09 05:53:49,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:53:49,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667859565] [2025-01-09 05:53:49,585 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:53:49,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:53:49,593 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-01-09 05:53:49,612 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-01-09 05:53:49,612 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:53:49,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:53:50,270 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:53:50,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:53:50,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667859565] [2025-01-09 05:53:50,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667859565] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 05:53:50,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [45659003] [2025-01-09 05:53:50,271 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:53:50,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:53:50,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:53:50,273 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:53:50,274 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:53:50,344 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-01-09 05:53:50,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-01-09 05:53:50,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:53:50,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:53:50,392 INFO L256 TraceCheckSpWp]: Trace formula consists of 495 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-01-09 05:53:50,397 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:53:50,669 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:53:50,669 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 05:53:51,144 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:53:51,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [45659003] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 05:53:51,144 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 05:53:51,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7, 6] total 22 [2025-01-09 05:53:51,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542565359] [2025-01-09 05:53:51,145 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 05:53:51,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-01-09 05:53:51,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:53:51,145 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-01-09 05:53:51,145 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=395, Unknown=0, NotChecked=0, Total=462 [2025-01-09 05:53:51,146 INFO L87 Difference]: Start difference. First operand 2680 states and 3982 transitions. Second operand has 22 states, 22 states have (on average 13.181818181818182) internal successors, (290), 22 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:53:56,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:53:56,951 INFO L93 Difference]: Finished difference Result 13209 states and 18001 transitions. [2025-01-09 05:53:56,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2025-01-09 05:53:56,951 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 13.181818181818182) internal successors, (290), 22 states have internal predecessors, (290), 0 states have call successors, (0), 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:53:56,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:53:56,964 INFO L225 Difference]: With dead ends: 13209 [2025-01-09 05:53:56,965 INFO L226 Difference]: Without dead ends: 11999 [2025-01-09 05:53:56,972 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 193 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4223 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=1877, Invalid=9679, Unknown=0, NotChecked=0, Total=11556 [2025-01-09 05:53:56,972 INFO L435 NwaCegarLoop]: 1551 mSDtfsCounter, 22161 mSDsluCounter, 8215 mSDsCounter, 0 mSdLazyCounter, 1797 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22161 SdHoareTripleChecker+Valid, 9766 SdHoareTripleChecker+Invalid, 1917 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 1797 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-01-09 05:53:56,972 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22161 Valid, 9766 Invalid, 1917 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 1797 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-01-09 05:53:56,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11999 states. [2025-01-09 05:53:57,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11999 to 11027. [2025-01-09 05:53:57,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11027 states, 11025 states have (on average 1.3603628117913833) internal successors, (14998), 11026 states have internal predecessors, (14998), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:53:57,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11027 states to 11027 states and 14998 transitions. [2025-01-09 05:53:57,213 INFO L78 Accepts]: Start accepts. Automaton has 11027 states and 14998 transitions. Word has length 101 [2025-01-09 05:53:57,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:53:57,213 INFO L471 AbstractCegarLoop]: Abstraction has 11027 states and 14998 transitions. [2025-01-09 05:53:57,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 13.181818181818182) internal successors, (290), 22 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:53:57,213 INFO L276 IsEmpty]: Start isEmpty. Operand 11027 states and 14998 transitions. [2025-01-09 05:53:57,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-01-09 05:53:57,214 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:53:57,215 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] [2025-01-09 05:53:57,223 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:53:57,415 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,SelfDestructingSolverStorable25 [2025-01-09 05:53:57,416 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:53:57,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:53:57,416 INFO L85 PathProgramCache]: Analyzing trace with hash 1049559474, now seen corresponding path program 1 times [2025-01-09 05:53:57,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:53:57,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048284727] [2025-01-09 05:53:57,417 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:53:57,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:53:57,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-01-09 05:53:57,449 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-01-09 05:53:57,450 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:53:57,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:53:58,198 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:53:58,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:53:58,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048284727] [2025-01-09 05:53:58,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048284727] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 05:53:58,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2064714087] [2025-01-09 05:53:58,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:53:58,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:53:58,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:53:58,203 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:53:58,204 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:53:58,274 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-01-09 05:53:58,325 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-01-09 05:53:58,325 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:53:58,325 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:53:58,331 INFO L256 TraceCheckSpWp]: Trace formula consists of 500 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-09 05:53:58,335 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:53:58,794 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:53:58,795 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 05:53:59,672 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:53:59,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2064714087] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 05:53:59,673 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 05:53:59,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 27 [2025-01-09 05:53:59,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061419310] [2025-01-09 05:53:59,673 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 05:53:59,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-01-09 05:53:59,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:53:59,674 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-01-09 05:53:59,674 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=668, Unknown=0, NotChecked=0, Total=756 [2025-01-09 05:53:59,675 INFO L87 Difference]: Start difference. First operand 11027 states and 14998 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:54:03,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:54:03,418 INFO L93 Difference]: Finished difference Result 48727 states and 64556 transitions. [2025-01-09 05:54:03,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2025-01-09 05:54:03,419 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 102 [2025-01-09 05:54:03,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:54:03,454 INFO L225 Difference]: With dead ends: 48727 [2025-01-09 05:54:03,454 INFO L226 Difference]: Without dead ends: 39333 [2025-01-09 05:54:03,461 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1197 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=986, Invalid=4126, Unknown=0, NotChecked=0, Total=5112 [2025-01-09 05:54:03,462 INFO L435 NwaCegarLoop]: 1516 mSDtfsCounter, 22619 mSDsluCounter, 6742 mSDsCounter, 0 mSdLazyCounter, 1145 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22619 SdHoareTripleChecker+Valid, 8258 SdHoareTripleChecker+Invalid, 1181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 1145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 05:54:03,462 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22619 Valid, 8258 Invalid, 1181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 1145 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 05:54:03,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39333 states. [2025-01-09 05:54:04,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39333 to 38497. [2025-01-09 05:54:04,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38497 states, 38495 states have (on average 1.3031562540589687) internal successors, (50165), 38496 states have internal predecessors, (50165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:54:04,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38497 states to 38497 states and 50165 transitions. [2025-01-09 05:54:04,301 INFO L78 Accepts]: Start accepts. Automaton has 38497 states and 50165 transitions. Word has length 102 [2025-01-09 05:54:04,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:54:04,302 INFO L471 AbstractCegarLoop]: Abstraction has 38497 states and 50165 transitions. [2025-01-09 05:54:04,302 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:54:04,305 INFO L276 IsEmpty]: Start isEmpty. Operand 38497 states and 50165 transitions. [2025-01-09 05:54:04,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-01-09 05:54:04,307 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:54:04,307 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] [2025-01-09 05:54:04,315 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:54:04,508 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,SelfDestructingSolverStorable26 [2025-01-09 05:54:04,508 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:54:04,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:54:04,509 INFO L85 PathProgramCache]: Analyzing trace with hash -440309326, now seen corresponding path program 1 times [2025-01-09 05:54:04,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:54:04,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676661468] [2025-01-09 05:54:04,509 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:54:04,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:54:04,524 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-01-09 05:54:04,539 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-01-09 05:54:04,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:54:04,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:54:04,781 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:54:04,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:54:04,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676661468] [2025-01-09 05:54:04,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676661468] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 05:54:04,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [197774846] [2025-01-09 05:54:04,781 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:54:04,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:54:04,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:54:04,784 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:54:04,785 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:54:04,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-01-09 05:54:04,926 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-01-09 05:54:04,926 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:54:04,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:54:04,928 INFO L256 TraceCheckSpWp]: Trace formula consists of 500 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-09 05:54:04,934 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:54:05,293 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:54:05,293 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 05:54:05,995 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:54:05,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [197774846] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 05:54:05,996 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 05:54:05,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 24 [2025-01-09 05:54:05,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136648549] [2025-01-09 05:54:05,996 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 05:54:05,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-01-09 05:54:05,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:54:05,997 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-01-09 05:54:05,997 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=521, Unknown=0, NotChecked=0, Total=600 [2025-01-09 05:54:05,997 INFO L87 Difference]: Start difference. First operand 38497 states and 50165 transitions. Second operand has 25 states, 25 states have (on average 11.12) internal successors, (278), 24 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:54:08,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:54:08,149 INFO L93 Difference]: Finished difference Result 92629 states and 120407 transitions. [2025-01-09 05:54:08,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-01-09 05:54:08,154 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 11.12) internal successors, (278), 24 states have internal predecessors, (278), 0 states have call successors, (0), 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 102 [2025-01-09 05:54:08,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:54:08,226 INFO L225 Difference]: With dead ends: 92629 [2025-01-09 05:54:08,226 INFO L226 Difference]: Without dead ends: 56585 [2025-01-09 05:54:08,263 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 378 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=499, Invalid=1757, Unknown=0, NotChecked=0, Total=2256 [2025-01-09 05:54:08,264 INFO L435 NwaCegarLoop]: 1513 mSDtfsCounter, 19467 mSDsluCounter, 8004 mSDsCounter, 0 mSdLazyCounter, 825 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19467 SdHoareTripleChecker+Valid, 9517 SdHoareTripleChecker+Invalid, 853 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 825 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 05:54:08,264 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19467 Valid, 9517 Invalid, 853 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 825 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 05:54:08,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56585 states. [2025-01-09 05:54:09,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56585 to 55346. [2025-01-09 05:54:09,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55346 states, 55344 states have (on average 1.2851980341139058) internal successors, (71128), 55345 states have internal predecessors, (71128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:54:09,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55346 states to 55346 states and 71128 transitions. [2025-01-09 05:54:09,887 INFO L78 Accepts]: Start accepts. Automaton has 55346 states and 71128 transitions. Word has length 102 [2025-01-09 05:54:09,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:54:09,888 INFO L471 AbstractCegarLoop]: Abstraction has 55346 states and 71128 transitions. [2025-01-09 05:54:09,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 11.12) internal successors, (278), 24 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:54:09,888 INFO L276 IsEmpty]: Start isEmpty. Operand 55346 states and 71128 transitions. [2025-01-09 05:54:09,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-01-09 05:54:09,890 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:54:09,890 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:54:09,897 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:54:10,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:54:10,094 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:54:10,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:54:10,094 INFO L85 PathProgramCache]: Analyzing trace with hash -1190464974, now seen corresponding path program 1 times [2025-01-09 05:54:10,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:54:10,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675990591] [2025-01-09 05:54:10,094 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:54:10,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:54:10,102 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-01-09 05:54:10,120 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-01-09 05:54:10,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:54:10,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:54:10,359 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:54:10,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:54:10,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675990591] [2025-01-09 05:54:10,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675990591] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 05:54:10,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1910916677] [2025-01-09 05:54:10,360 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:54:10,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:54:10,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:54:10,371 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:54:10,375 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:54:10,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-01-09 05:54:10,492 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-01-09 05:54:10,493 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:54:10,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:54:10,495 INFO L256 TraceCheckSpWp]: Trace formula consists of 504 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-09 05:54:10,497 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:54:10,827 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:54:10,828 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 05:54:11,633 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:54:11,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1910916677] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 05:54:11,634 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 05:54:11,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2025-01-09 05:54:11,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358042583] [2025-01-09 05:54:11,634 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 05:54:11,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-01-09 05:54:11,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:54:11,635 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-01-09 05:54:11,635 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=343, Unknown=0, NotChecked=0, Total=420 [2025-01-09 05:54:11,636 INFO L87 Difference]: Start difference. First operand 55346 states and 71128 transitions. Second operand has 21 states, 21 states have (on average 10.476190476190476) internal successors, (220), 20 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:54:13,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:54:13,329 INFO L93 Difference]: Finished difference Result 114703 states and 147515 transitions. [2025-01-09 05:54:13,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 05:54:13,329 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 10.476190476190476) internal successors, (220), 20 states have internal predecessors, (220), 0 states have call successors, (0), 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:54:13,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:54:13,423 INFO L225 Difference]: With dead ends: 114703 [2025-01-09 05:54:13,423 INFO L226 Difference]: Without dead ends: 62188 [2025-01-09 05:54:13,472 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=203, Invalid=609, Unknown=0, NotChecked=0, Total=812 [2025-01-09 05:54:13,472 INFO L435 NwaCegarLoop]: 1523 mSDtfsCounter, 10575 mSDsluCounter, 4976 mSDsCounter, 0 mSdLazyCounter, 525 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10575 SdHoareTripleChecker+Valid, 6499 SdHoareTripleChecker+Invalid, 535 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 525 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 05:54:13,472 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10575 Valid, 6499 Invalid, 535 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 525 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 05:54:13,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62188 states. [2025-01-09 05:54:15,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62188 to 62184. [2025-01-09 05:54:15,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62184 states, 62182 states have (on average 1.288733073879901) internal successors, (80136), 62183 states have internal predecessors, (80136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:54:15,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62184 states to 62184 states and 80136 transitions. [2025-01-09 05:54:15,471 INFO L78 Accepts]: Start accepts. Automaton has 62184 states and 80136 transitions. Word has length 104 [2025-01-09 05:54:15,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:54:15,471 INFO L471 AbstractCegarLoop]: Abstraction has 62184 states and 80136 transitions. [2025-01-09 05:54:15,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 10.476190476190476) internal successors, (220), 20 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:54:15,471 INFO L276 IsEmpty]: Start isEmpty. Operand 62184 states and 80136 transitions. [2025-01-09 05:54:15,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-01-09 05:54:15,473 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:54:15,473 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:54:15,480 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-09 05:54:15,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-01-09 05:54:15,674 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:54:15,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:54:15,674 INFO L85 PathProgramCache]: Analyzing trace with hash 829471682, now seen corresponding path program 1 times [2025-01-09 05:54:15,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:54:15,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941709662] [2025-01-09 05:54:15,674 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:54:15,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:54:15,682 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-01-09 05:54:15,703 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-01-09 05:54:15,703 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:54:15,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:54:15,934 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:54:15,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:54:15,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941709662] [2025-01-09 05:54:15,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941709662] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 05:54:15,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [775636302] [2025-01-09 05:54:15,935 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:54:15,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:54:15,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:54:15,937 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:54:15,941 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:54:16,012 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-01-09 05:54:16,057 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-01-09 05:54:16,057 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:54:16,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:54:16,059 INFO L256 TraceCheckSpWp]: Trace formula consists of 504 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-09 05:54:16,062 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:54:16,480 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:54:16,480 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 05:54:17,267 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:54:17,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [775636302] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 05:54:17,268 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 05:54:17,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 22 [2025-01-09 05:54:17,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074518287] [2025-01-09 05:54:17,268 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 05:54:17,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-01-09 05:54:17,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:54:17,269 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-01-09 05:54:17,269 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=407, Unknown=0, NotChecked=0, Total=506 [2025-01-09 05:54:17,269 INFO L87 Difference]: Start difference. First operand 62184 states and 80136 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:54:19,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:54:19,204 INFO L93 Difference]: Finished difference Result 120563 states and 155256 transitions. [2025-01-09 05:54:19,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 05:54:19,205 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:54:19,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:54:19,274 INFO L225 Difference]: With dead ends: 120563 [2025-01-09 05:54:19,274 INFO L226 Difference]: Without dead ends: 64144 [2025-01-09 05:54:19,291 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=269, Invalid=787, Unknown=0, NotChecked=0, Total=1056 [2025-01-09 05:54:19,292 INFO L435 NwaCegarLoop]: 1529 mSDtfsCounter, 15455 mSDsluCounter, 4669 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15455 SdHoareTripleChecker+Valid, 6198 SdHoareTripleChecker+Invalid, 338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 05:54:19,292 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15455 Valid, 6198 Invalid, 338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 325 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 05:54:19,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64144 states. [2025-01-09 05:54:20,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64144 to 58255. [2025-01-09 05:54:20,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58255 states, 58253 states have (on average 1.2741146378727275) internal successors, (74221), 58254 states have internal predecessors, (74221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:54:20,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58255 states to 58255 states and 74221 transitions. [2025-01-09 05:54:20,858 INFO L78 Accepts]: Start accepts. Automaton has 58255 states and 74221 transitions. Word has length 104 [2025-01-09 05:54:20,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:54:20,858 INFO L471 AbstractCegarLoop]: Abstraction has 58255 states and 74221 transitions. [2025-01-09 05:54:20,858 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:54:20,858 INFO L276 IsEmpty]: Start isEmpty. Operand 58255 states and 74221 transitions. [2025-01-09 05:54:20,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-01-09 05:54:20,860 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:54:20,860 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:54:20,869 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-09 05:54:21,061 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:54:21,061 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:54:21,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:54:21,062 INFO L85 PathProgramCache]: Analyzing trace with hash 929231135, now seen corresponding path program 1 times [2025-01-09 05:54:21,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:54:21,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366798789] [2025-01-09 05:54:21,062 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:54:21,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:54:21,071 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-01-09 05:54:21,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-01-09 05:54:21,083 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:54:21,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:54:21,656 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:54:21,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:54:21,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366798789] [2025-01-09 05:54:21,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366798789] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 05:54:21,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [292711194] [2025-01-09 05:54:21,657 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:54:21,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:54:21,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:54:21,660 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 05:54:21,668 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-09 05:54:21,740 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-01-09 05:54:21,792 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-01-09 05:54:21,792 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:54:21,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:54:21,795 INFO L256 TraceCheckSpWp]: Trace formula consists of 506 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-01-09 05:54:21,797 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:54:23,887 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:54:23,887 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 05:54:26,231 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:54:26,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [292711194] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 05:54:26,231 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 05:54:26,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 18, 15] total 39 [2025-01-09 05:54:26,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957191513] [2025-01-09 05:54:26,232 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 05:54:26,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-01-09 05:54:26,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:54:26,237 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-01-09 05:54:26,237 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=204, Invalid=1278, Unknown=0, NotChecked=0, Total=1482 [2025-01-09 05:54:26,238 INFO L87 Difference]: Start difference. First operand 58255 states and 74221 transitions. Second operand has 39 states, 39 states have (on average 7.205128205128205) internal successors, (281), 39 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:54:37,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:54:37,117 INFO L93 Difference]: Finished difference Result 232241 states and 289947 transitions. [2025-01-09 05:54:37,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2025-01-09 05:54:37,117 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 7.205128205128205) internal successors, (281), 39 states have internal predecessors, (281), 0 states have call successors, (0), 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 105 [2025-01-09 05:54:37,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:54:37,476 INFO L225 Difference]: With dead ends: 232241 [2025-01-09 05:54:37,477 INFO L226 Difference]: Without dead ends: 215761 [2025-01-09 05:54:37,538 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 184 SyntacticMatches, 1 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3732 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=2605, Invalid=8951, Unknown=0, NotChecked=0, Total=11556 [2025-01-09 05:54:37,539 INFO L435 NwaCegarLoop]: 1521 mSDtfsCounter, 26059 mSDsluCounter, 15645 mSDsCounter, 0 mSdLazyCounter, 1578 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26059 SdHoareTripleChecker+Valid, 17166 SdHoareTripleChecker+Invalid, 1669 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 1578 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 05:54:37,542 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26059 Valid, 17166 Invalid, 1669 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 1578 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-09 05:54:37,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215761 states. [2025-01-09 05:54:41,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215761 to 96549. [2025-01-09 05:54:41,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96549 states, 96547 states have (on average 1.2614892228655474) internal successors, (121793), 96548 states have internal predecessors, (121793), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:54:41,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96549 states to 96549 states and 121793 transitions. [2025-01-09 05:54:41,521 INFO L78 Accepts]: Start accepts. Automaton has 96549 states and 121793 transitions. Word has length 105 [2025-01-09 05:54:41,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:54:41,521 INFO L471 AbstractCegarLoop]: Abstraction has 96549 states and 121793 transitions. [2025-01-09 05:54:41,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 7.205128205128205) internal successors, (281), 39 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:54:41,521 INFO L276 IsEmpty]: Start isEmpty. Operand 96549 states and 121793 transitions. [2025-01-09 05:54:41,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-01-09 05:54:41,523 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:54:41,524 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:54:41,530 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0